--- /dev/null
+This is ../info/eintr, produced by makeinfo version 4.8 from
+emacs-lisp-intro.texi.
+
+INFO-DIR-SECTION Emacs
+START-INFO-DIR-ENTRY
+* Emacs Lisp Intro: (eintr).
+ A simple introduction to Emacs Lisp programming.
+END-INFO-DIR-ENTRY
+
+This is an `Introduction to Programming in Emacs Lisp', for people who
+are not programmers.
+
+Edition 3.00, 2006 Oct 31
+
+Copyright (C) 1990, 1991, 1992, 1993, 1994, 1995, 1997, 2001, 2002,
+2003, 2004, 2005, 2006 Free Software Foundation, Inc.
+
+Published by the:
+
+ GNU Press, Website: http://www.gnupress.org
+ a division of the General: press@gnu.org
+ Free Software Foundation, Inc. Orders: sales@gnu.org
+ 51 Franklin Street, Fifth Floor Tel: +1 (617) 542-5942
+ Boston, MA 02110-1301 USA Fax: +1 (617) 542-2652
+
+
+ISBN 1-882114-43-4
+
+Permission is granted to copy, distribute and/or modify this document
+under the terms of the GNU Free Documentation License, Version 1.2 or
+any later version published by the Free Software Foundation; there
+being no Invariant Section, with the Front-Cover Texts being "A GNU
+Manual", and with the Back-Cover Texts as in (a) below. A copy of the
+license is included in the section entitled "GNU Free Documentation
+License".
+
+(a) The FSF's Back-Cover Text is: "You have freedom to copy and modify
+this GNU Manual, like GNU software. Copies published by the Free
+Software Foundation raise funds for GNU development."
+
+\1f
+Indirect:
+eintr-1: 1466
+eintr-2: 301398
+eintr-3: 599839
+\1f
+Tag Table:
+(Indirect)
+Node: Top\7f1466
+Node: Preface\7f20357
+Node: Why\7f21456
+Node: On Reading this Text\7f22097
+Node: Who You Are\7f24261
+Node: Lisp History\7f26960
+Node: Note for Novices\7f27711
+Node: Thank You\7f30170
+Node: List Processing\7f30651
+Ref: List Processing-Footnote-1\7f31544
+Node: Lisp Lists\7f31747
+Node: Numbers Lists\7f32457
+Node: Lisp Atoms\7f33484
+Node: Whitespace in Lists\7f37146
+Node: Typing Lists\7f38387
+Node: Run a Program\7f39467
+Node: Making Errors\7f41879
+Node: Names & Definitions\7f46793
+Node: Lisp Interpreter\7f48627
+Node: Complications\7f49680
+Node: Byte Compiling\7f51224
+Node: Evaluation\7f52267
+Node: Evaluating Inner Lists\7f53923
+Node: Variables\7f56384
+Node: fill-column Example\7f57737
+Node: Void Function\7f59216
+Node: Void Variable\7f60323
+Node: Arguments\7f62102
+Ref: Arguments-Footnote-1\7f63343
+Node: Data types\7f64155
+Node: Args as Variable or List\7f66119
+Node: Variable Number of Arguments\7f67639
+Node: Wrong Type of Argument\7f68444
+Ref: Wrong Type of Argument-Footnote-1\7f71821
+Node: message\7f71888
+Ref: message-Footnote-1\7f75681
+Node: set & setq\7f75855
+Node: Using set\7f76437
+Node: Using setq\7f78676
+Node: Counting\7f80793
+Node: Summary\7f82734
+Node: Error Message Exercises\7f84507
+Node: Practicing Evaluation\7f85004
+Node: How to Evaluate\7f85835
+Node: Buffer Names\7f87334
+Node: Getting Buffers\7f92927
+Ref: Getting Buffers-Footnote-1\7f95399
+Node: Switching Buffers\7f95617
+Ref: Switching Buffers-Footnote-1\7f98872
+Ref: Switching Buffers-Footnote-2\7f99144
+Node: Buffer Size & Locations\7f99801
+Node: Evaluation Exercise\7f101786
+Node: Writing Defuns\7f102057
+Node: Primitive Functions\7f102904
+Node: defun\7f104073
+Node: Install\7f110517
+Node: Effect of installation\7f111781
+Node: Change a defun\7f112574
+Node: Interactive\7f114241
+Node: Interactive multiply-by-seven\7f115238
+Node: multiply-by-seven in detail\7f117046
+Node: Interactive Options\7f119663
+Node: Permanent Installation\7f122714
+Node: let\7f124794
+Node: Prevent confusion\7f126061
+Node: Parts of let Expression\7f127925
+Node: Sample let Expression\7f129444
+Ref: Sample let Expression-Footnote-1\7f131174
+Node: Uninitialized let Variables\7f131422
+Node: if\7f132952
+Node: if in more detail\7f133746
+Node: type-of-animal in detail\7f136454
+Node: else\7f138874
+Node: Truth & Falsehood\7f141655
+Node: nil explained\7f142503
+Node: save-excursion\7f144503
+Node: Point and mark\7f145191
+Node: Template for save-excursion\7f148148
+Node: Review\7f149380
+Node: defun Exercises\7f157017
+Node: Buffer Walk Through\7f157432
+Node: Finding More\7f158216
+Node: simplified-beginning-of-buffer\7f162076
+Node: mark-whole-buffer\7f166416
+Node: mark-whole-buffer overview\7f167170
+Node: Body of mark-whole-buffer\7f168529
+Node: append-to-buffer\7f171530
+Node: append-to-buffer overview\7f172073
+Node: append interactive\7f174728
+Node: append-to-buffer body\7f177079
+Node: append save-excursion\7f179119
+Node: Buffer Related Review\7f183885
+Node: Buffer Exercises\7f185814
+Node: More Complex\7f186247
+Node: copy-to-buffer\7f186948
+Node: insert-buffer\7f189523
+Node: insert-buffer code\7f190521
+Node: insert-buffer interactive\7f191520
+Node: Read-only buffer\7f191925
+Node: b for interactive\7f192537
+Node: insert-buffer body\7f193632
+Node: if & or\7f194774
+Node: Insert or\7f197745
+Node: Insert let\7f199944
+Node: New insert-buffer\7f203572
+Node: beginning-of-buffer\7f204723
+Node: Optional Arguments\7f206209
+Node: beginning-of-buffer opt arg\7f209444
+Node: Disentangle beginning-of-buffer\7f210277
+Node: Large buffer case\7f211521
+Node: Small buffer case\7f213952
+Node: beginning-of-buffer complete\7f215565
+Node: Second Buffer Related Review\7f218428
+Node: optional Exercise\7f220052
+Node: Narrowing & Widening\7f220512
+Node: Narrowing advantages\7f220970
+Node: save-restriction\7f222848
+Node: what-line\7f224731
+Node: narrow Exercise\7f228733
+Node: car cdr & cons\7f229692
+Node: Strange Names\7f230352
+Node: car & cdr\7f231351
+Node: cons\7f235534
+Node: Build a list\7f236385
+Ref: Build a list-Footnote-1\7f237873
+Node: length\7f238050
+Node: nthcdr\7f239528
+Node: nth\7f242320
+Node: setcar\7f243639
+Node: setcdr\7f245840
+Node: cons Exercise\7f247296
+Node: Cutting & Storing Text\7f247656
+Node: Storing Text\7f248625
+Node: zap-to-char\7f250637
+Node: Complete zap-to-char\7f251498
+Node: zap-to-char interactive\7f253398
+Node: zap-to-char body\7f254870
+Node: search-forward\7f256454
+Node: progn\7f259394
+Node: Summing up zap-to-char\7f261039
+Node: kill-region\7f262116
+Node: Complete kill-region\7f262975
+Node: condition-case\7f267091
+Node: Lisp macro\7f269565
+Node: copy-region-as-kill\7f271616
+Node: Complete copy-region-as-kill\7f272402
+Node: copy-region-as-kill body\7f275153
+Node: last-command & this-command\7f276120
+Node: kill-append function\7f278369
+Node: kill-new function\7f282338
+Node: Digression into C\7f292559
+Ref: Digression into C-Footnote-1\7f297912
+Node: defvar\7f298084
+Node: See variable current value\7f299536
+Node: defvar and asterisk\7f301398
+Node: cons & search-fwd Review\7f303167
+Node: search Exercises\7f305681
+Node: List Implementation\7f306403
+Node: Lists diagrammed\7f307414
+Node: Symbols as Chest\7f313381
+Node: List Exercise\7f315367
+Node: Yanking\7f315694
+Node: Kill Ring Overview\7f316893
+Node: kill-ring-yank-pointer\7f318540
+Node: yank nthcdr Exercises\7f320889
+Node: Loops & Recursion\7f321588
+Ref: Loops & Recursion-Footnote-1\7f322548
+Node: while\7f323047
+Node: Looping with while\7f324135
+Node: Loop Example\7f325891
+Node: print-elements-of-list\7f329179
+Node: Incrementing Loop\7f331625
+Node: Incrementing Example\7f333144
+Node: Inc Example parts\7f335510
+Node: Inc Example altogether\7f339355
+Node: Decrementing Loop\7f342770
+Node: Decrementing Example\7f344042
+Node: Dec Example parts\7f345518
+Node: Dec Example altogether\7f347469
+Node: dolist dotimes\7f349652
+Node: dolist\7f350374
+Node: dotimes\7f353419
+Node: Recursion\7f354939
+Node: Building Robots\7f355824
+Node: Recursive Definition Parts\7f357531
+Node: Recursion with list\7f359911
+Node: Recursive triangle function\7f363439
+Node: Recursive Example arg of 1 or 2\7f364707
+Node: Recursive Example arg of 3 or 4\7f366911
+Node: Recursion with cond\7f369839
+Node: Recursive Patterns\7f372114
+Node: Every\7f372511
+Node: Accumulate\7f374945
+Node: Keep\7f376178
+Node: No Deferment\7f378031
+Node: No deferment solution\7f380655
+Ref: No deferment solution-Footnote-1\7f384521
+Ref: No deferment solution-Footnote-2\7f384622
+Node: Looping exercise\7f385114
+Node: Regexp Search\7f386289
+Node: sentence-end\7f387975
+Node: re-search-forward\7f391624
+Node: forward-sentence\7f394067
+Node: Complete forward-sentence\7f394714
+Node: fwd-sentence while loops\7f398090
+Node: fwd-sentence re-search\7f401556
+Node: forward-paragraph\7f403626
+Node: forward-paragraph in brief\7f405190
+Node: fwd-para let\7f406631
+Node: fwd-para while\7f411779
+Node: etags\7f419953
+Node: Regexp Review\7f424222
+Node: re-search Exercises\7f426544
+Node: Counting Words\7f427295
+Node: Why Count Words\7f427829
+Node: count-words-region\7f428769
+Node: Design count-words-region\7f429877
+Node: Whitespace Bug\7f436288
+Node: recursive-count-words\7f445562
+Node: Counting Exercise\7f457365
+Node: Words in a defun\7f457724
+Node: Divide and Conquer\7f458855
+Node: Words and Symbols\7f460077
+Node: Syntax\7f462011
+Node: count-words-in-defun\7f465581
+Node: Several defuns\7f471588
+Node: Find a File\7f473904
+Node: lengths-list-file\7f476387
+Node: Several files\7f481531
+Node: lengths-list-many-files\7f482131
+Node: append\7f484818
+Node: Several files recursively\7f485410
+Node: Prepare the data\7f488158
+Node: Sorting\7f489830
+Node: Files List\7f491425
+Node: Counting function definitions\7f498654
+Node: Readying a Graph\7f507682
+Node: Columns of a graph\7f508782
+Node: graph-body-print\7f522065
+Node: recursive-graph-body-print\7f526661
+Node: Printed Axes\7f529299
+Node: Line Graph Exercise\7f530009
+Node: Emacs Initialization\7f530186
+Node: Default Configuration\7f530964
+Ref: Default Configuration-Footnote-1\7f532912
+Node: Site-wide Init\7f533209
+Node: defcustom\7f535143
+Node: Beginning a .emacs File\7f540594
+Node: Text and Auto-fill\7f542908
+Node: Mail Aliases\7f546701
+Node: Indent Tabs Mode\7f547577
+Node: Keybindings\7f548492
+Node: Keymaps\7f551884
+Node: Loading Files\7f554042
+Node: Autoload\7f556866
+Node: Simple Extension\7f559663
+Ref: Simple Extension-Footnote-1\7f562905
+Node: X11 Colors\7f563164
+Ref: X11 Colors-Footnote-1\7f564980
+Node: Miscellaneous\7f565131
+Node: Mode Line\7f569231
+Node: Debugging\7f574650
+Node: debug\7f575215
+Node: debug-on-entry\7f578211
+Node: debug-on-quit\7f581277
+Node: edebug\7f582238
+Node: Debugging Exercises\7f586234
+Node: Conclusion\7f587892
+Node: the-the\7f593043
+Node: Kill Ring\7f595759
+Node: current-kill\7f597676
+Node: Understanding current-kill\7f599839
+Node: Digression concerning error\7f603283
+Node: Determining the Element\7f604451
+Node: yank\7f607874
+Node: yank-pop\7f610783
+Node: ring file\7f613179
+Node: Full Graph\7f613520
+Node: Labelled Example\7f614097
+Node: print-graph Varlist\7f616071
+Node: print-Y-axis\7f617718
+Node: Height of label\7f618891
+Node: Compute a Remainder\7f620850
+Node: Y Axis Element\7f624580
+Node: Y-axis-column\7f628121
+Node: print-Y-axis Penultimate\7f629698
+Node: print-X-axis\7f631541
+Node: Similarities differences\7f632652
+Node: X Axis Tic Marks\7f633452
+Node: Print Whole Graph\7f640290
+Node: The final version\7f641028
+Node: Test print-graph\7f645251
+Node: Graphing words in defuns\7f646829
+Node: lambda\7f649376
+Node: mapcar\7f651012
+Node: Another Bug\7f652966
+Node: Final printed graph\7f658408
+Node: Free Software and Free Manuals\7f659320
+Node: GNU Free Documentation License\7f665566
+Node: Index\7f687989
+Node: About the Author\7f722743
+\1f
+End Tag Table
projects / emacs.git / commitdiff