├── README.org ├── README_CN.org ├── ch01.el ├── ch02.el ├── ch03.el ├── ch04.el ├── ch05.el ├── ch06.el ├── ch07.el ├── ch08.el ├── ch09.el ├── ch10.el ├── ch11.el ├── ch12.el ├── ch13.el ├── ch15.el └── gpl-3.0.txt /README.org: -------------------------------------------------------------------------------- 1 | #+TITLE: An Introduction to Programming in Emacs Lisp -- Solutions 2 | #+AUTHOR: Ren Wenshan 3 | 4 | `An Introduction to Programming in Emacs Lisp' (elisp intro) is a manual that 5 | comes with Emacs for programming beginners. This is my review of Elisp Intro: 6 | http://wenshanren.org/?p=217 7 | 8 | In Emacs, press =M-x info=, then search for "Emacs Lisp Intro", now you should 9 | be able to read it by simply clicking the result that is found by Emacs. The 10 | benefits of reading this manual in Emacs are: 11 | 12 | - Operations such navigation, searching, adding bookmarks and so on are very 13 | convenient. 14 | - You can run the examples in the book when you read it, which is super handy. 15 | 16 | 17 | This repository is a collection of my solutions to the exercises in the `elisp 18 | intro', including: 19 | 20 | | Chapter | Chapter Title | Corresponding File | 21 | |---------+---------------------------------------------+--------------------| 22 | | 1 | List Processing | ch01.el | 23 | | 2 | Practicing Evaluation | ch02.el | 24 | | 3 | How To Write Function Definitions | ch03.el | 25 | | 4 | A Few Buffer-Related Functions | ch04.el | 26 | | 5 | A Few More Complex Functions | ch05.el | 27 | | 6 | Narrowing and Widening | ch06.el | 28 | | 7 | `car', `cdr', `cons': Fundamental Functions | ch07.el | 29 | | 8 | Cutting and Storing Text | ch08.el | 30 | | 9 | How List are Implemented | ch09.el | 31 | | 10 | Yanking Text Back | ch10.el | 32 | | 11 | Looping | ch11.el | 33 | | 12 | Regular Expression Searches | ch12.el | 34 | | 13 | Counting: Repetition and Regexps | ch13.el | 35 | | 15 | Readying a Graph | ch15.el | 36 | 37 | 38 | *Note*: 39 | - Chapter 14 and chapter 16 do not have exercises. 40 | - The exercises in chapter 17 are not programming tasks, you can finish them by 41 | following the questions. 42 | 43 | 44 | I am just a beginner of elisp, and my poor English skills might caused some 45 | misunderstanding of the exercises. Please feel free to point out any mistakes 46 | you might find. 47 | 48 | Happy Hacking! 49 | 50 | * Contributors 51 | - Aaron S. Hawley <[[https://github.com/ashawley]]> 52 | -------------------------------------------------------------------------------- /README_CN.org: -------------------------------------------------------------------------------- 1 | #+TITLE: 《An Introduction to Programming in Emacs Lisp》——习题答案 2 | #+AUTHOR: 任文山 3 | 4 | 《An Introduction to Programming in Emacs Lisp》（以下简称elisp intro）,是Emacs自 5 | 带的elisp入门手册。我对此书的具体评价，请见： http://wenshanren.org/?p=213 6 | 7 | 在Emacs中，输入 =M-x info= ，然后搜索“Emacs Lisp Intro”，点进去，即可开始阅读该书。 8 | 在Emacs中阅读的好处： 9 | - 跳转、搜索、添加书签等操作很方便。 10 | - 可以随时运行书中的示例程序。 11 | 12 | 13 | 本repository收集了我在读此书的过程中写的练习题答案，包括： 14 | 15 | - 第1章: List Processing -- ch01.el 16 | - 第2章: Practicing Evaluation -- ch02.el 17 | - 第3章: How To Write Function Definitions -- ch03.el 18 | - 第4章: A Few Buffer-Related Functions -- ch04.el 19 | - 第5章: A Few More Complex Functions -- ch05.el 20 | - 第6章: Narrowing and Widening -- ch06.el 21 | - 第7章: `car', `cdr', `cons': Fundamental Functions -- ch07.el 22 | - 第8章: Cutting and Storing Text -- ch08.el 23 | - 第9章: How List are Implemented -- ch09.el 24 | - 第10章: Yanking Text Back -- ch10.el 25 | - 第11章: Looping -- ch11.el 26 | - 第12章: Regular Expression Searches -- ch12.el 27 | - 第13章: Counting: Repetition and Regexps -- ch13.el 28 | - 第15章: Readying a Graph -- ch15.el 29 | 30 | *注*: 31 | - elisp intro的14、16两章是没有习题的 32 | - 第17章的习题不是编程题，只需跟着题目进行操作即可 33 | 34 | 35 | 本人菜鸟一只，elisp更是初学，加上英语不好，程序中很可能出现各种问题，如果发现，还 36 | 望指正，不胜感激。 37 | 38 | Happy Hacking! 39 | 40 | * 贡献者 41 | - Aaron S. Hawley <[[https://github.com/ashawley]]> 42 | -------------------------------------------------------------------------------- /ch01.el: -------------------------------------------------------------------------------- 1 | ;;; ch01.el --- Solutions to the exercises in chapter 1 of the `An Introduction 2 | ;;; to Programming in Emacs Lisp' 3 | 4 | ;; Copyright (C) 2013 Ren Wenshan 5 | 6 | ;; Author: Ren Wenshan 7 | ;; URL: https://github.com/RenWenshan/emacs-lisp-intro-solutions 8 | 9 | ;; This program is free software; you can redistribute it and/or modify 10 | ;; it under the terms of the GNU General Public License as published by 11 | ;; the Free Software Foundation, either version 3 of the License, or 12 | ;; (at your option) any later version. 13 | 14 | ;; This program is distributed in the hope that it will be useful, 15 | ;; but WITHOUT ANY WARRANTY; without even the implied warranty of 16 | ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 17 | ;; GNU General Public License for more details. 18 | 19 | ;; You should have received a copy of the GNU General Public License 20 | ;; along with this program. If not, see . 21 | 22 | 23 | ;; Chapter 1: List Processing 24 | ;; ========================== 25 | 26 | ;; Exercise 1 27 | ;; ---------- 28 | ;; 29 | ;; Question: 30 | ;; Generate an error message by evaluating an appropriate symbol that is not 31 | ;; within parentheses. 32 | ;; 33 | ;; Solution: Mark the following expression, press `M-x eval-region', it gives an 34 | ;; error message: "Symbol's value as variable is void: +" 35 | + 36 | 37 | 38 | ;; Exercise 2 39 | ;; ---------- 40 | ;; 41 | ;; Question: 42 | ;; Generate an error message by evaluating an appropriate symbol that is between 43 | ;; parentheses. 44 | ;; 45 | ;; Solution: Mark the following expression, press `M-x eval-region', it gives an 46 | ;; error message: "Invalid function: foo" 47 | (foo) 48 | 49 | 50 | ;; Exercise 3 51 | ;; ---------- 52 | ;; 53 | ;; Question: Create a counter that increments by two rather than one. 54 | ;; 55 | ;; Solution: 56 | (setq counter 0) 57 | (setq counter (+ counter 2)) 58 | 59 | 60 | ;; Exercise 4 61 | ;; ---------- 62 | ;; 63 | ;; Question: 64 | ;; Write an expression that prints a message in the echo area when evaluated. 65 | ;; 66 | ;; Solution: 67 | (message "Hello Wenshan") 68 | -------------------------------------------------------------------------------- /ch02.el: -------------------------------------------------------------------------------- 1 | ;;; ch02.el --- Solutions to the exercises in chapter 2 of the `An Introduction 2 | ;;; to Programming in Emacs Lisp' 3 | 4 | ;; Copyright (C) 2013 Ren Wenshan 5 | 6 | ;; Author: Ren Wenshan 7 | ;; URL: https://github.com/RenWenshan/emacs-lisp-intro-solutions 8 | 9 | ;; This program is free software; you can redistribute it and/or modify 10 | ;; it under the terms of the GNU General Public License as published by 11 | ;; the Free Software Foundation, either version 3 of the License, or 12 | ;; (at your option) any later version. 13 | 14 | ;; This program is distributed in the hope that it will be useful, 15 | ;; but WITHOUT ANY WARRANTY; without even the implied warranty of 16 | ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 17 | ;; GNU General Public License for more details. 18 | 19 | ;; You should have received a copy of the GNU General Public License 20 | ;; along with this program. If not, see . 21 | 22 | 23 | ;; Chapter 2: Practicing Evaluation 24 | ;; ================================ 25 | 26 | ;; Exercise 1 27 | ;; ---------- 28 | ;; 29 | ;; Question: 30 | ;; Find a file with which you are working and move towards its middle. Find its 31 | ;; buffer name, file name, length, and your position in the file. 32 | ;; 33 | ;; Solution: Move towards to the middle of this buffer, and `eval' the following 34 | ;; expressions one by one 35 | (buffer-name) 36 | (buffer-file-name) 37 | (buffer-size) 38 | (point) 39 | -------------------------------------------------------------------------------- /ch03.el: -------------------------------------------------------------------------------- 1 | ;;; ch03.el --- Solutions to the exercises in chapter 03 of the `An Introduction 2 | ;;; to Programming in Emacs Lisp' 3 | 4 | ;; Copyright (C) 2013 Ren Wenshan 5 | 6 | ;; Author: Ren Wenshan 7 | ;; URL: https://github.com/RenWenshan/emacs-lisp-intro-solutions 8 | 9 | ;; This program is free software; you can redistribute it and/or modify 10 | ;; it under the terms of the GNU General Public License as published by 11 | ;; the Free Software Foundation, either version 3 of the License, or 12 | ;; (at your option) any later version. 13 | 14 | ;; This program is distributed in the hope that it will be useful, 15 | ;; but WITHOUT ANY WARRANTY; without even the implied warranty of 16 | ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 17 | ;; GNU General Public License for more details. 18 | 19 | ;; You should have received a copy of the GNU General Public License 20 | ;; along with this program. If not, see . 21 | 22 | 23 | ;; Chapter 3: Practicing Evaluation 24 | ;; ================================ 25 | 26 | ;; Exercise 1 27 | ;; ---------- 28 | ;; 29 | ;; Question: 30 | ;; Write a non-interactive function that doubles the value of its argument, a 31 | ;; number. Make that function interactive. 32 | ;; 33 | ;; Solution: 34 | (defun wenshan-double-function (value) 35 | "Double VALUE." 36 | (* 2 value)) 37 | 38 | (defun wenshan-double-command (value) 39 | "Double VALUE." 40 | (interactive "p") 41 | (message "The result is %d" (* 2 value))) 42 | 43 | 44 | ;; Exercise 2 45 | ;; ---------- 46 | ;; 47 | ;; Question: 48 | ;; Write a function that tests whether the current value of `fill-column' is 49 | ;; greater than the argument passed to the function, and if so, prints an 50 | ;; appropriate message. 51 | ;; 52 | ;; Solution: 53 | (defun wenshan-greater-than-fill-column-p (number) 54 | "Test if the current value of `fill-column' is greater than NUMBER." 55 | (interactive "p") 56 | (if (> number fill-column) 57 | (message "%d is greater than `fill-column'" number) 58 | (message "%d is less than `fill-column'" number))) 59 | -------------------------------------------------------------------------------- /ch04.el: -------------------------------------------------------------------------------- 1 | ;;; ch04.el --- Solutions to the exercises in chapter 04 of the `An Introduction 2 | ;;; to Programming in Emacs Lisp' 3 | 4 | ;; Copyright (C) 2013 Ren Wenshan 5 | 6 | ;; Author: Ren Wenshan 7 | ;; URL: https://github.com/RenWenshan/emacs-lisp-intro-solutions 8 | 9 | ;; This program is free software; you can redistribute it and/or modify 10 | ;; it under the terms of the GNU General Public License as published by 11 | ;; the Free Software Foundation, either version 3 of the License, or 12 | ;; (at your option) any later version. 13 | 14 | ;; This program is distributed in the hope that it will be useful, 15 | ;; but WITHOUT ANY WARRANTY; without even the implied warranty of 16 | ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 17 | ;; GNU General Public License for more details. 18 | 19 | ;; You should have received a copy of the GNU General Public License 20 | ;; along with this program. If not, see . 21 | 22 | 23 | ;; Chapter 4: A Few Buffer-Related Functions 24 | ;; ========================================= 25 | 26 | ;; Exercise 1 27 | ;; ---------- 28 | ;; 29 | ;; Question: 30 | ;; Write your own `simplified-end-of-buffer' function definition; then test it 31 | ;; to see whether it works. 32 | ;; 33 | ;; Solution: 34 | (defun wenshan-simplified-end-of-buffer () 35 | "Move point to the end of current buffer; 36 | leave mark at previous position." 37 | (interactive) 38 | (push-mark) 39 | (goto-char (point-max))) 40 | 41 | 42 | ;; Exercise 2 43 | ;; ---------- 44 | ;; 45 | ;; Question: 46 | ;; Use `if' and `get-buffer' to write a function that prints a message telling 47 | ;; you whether a buffer exists. 48 | ;; 49 | ;; Solution: 50 | (defun wenshan-buffer-exists-p (buffer) 51 | "Check if BUFFER exists." 52 | (interactive 53 | (list (read-buffer "Buffer name: " (other-buffer 54 | (current-buffer) t)))) 55 | (if (get-buffer buffer) 56 | (message "Buffer `%s' exists" buffer) 57 | (message "Buffer `%s' does not exist" buffer))) 58 | 59 | 60 | ;; Exercise 3 61 | ;; ---------- 62 | ;; 63 | ;; Question: 64 | ;; Using `find-tag', find the source for the `copy-to-buffer' function. 65 | ;; 66 | ;; Solution: press "M-. copy-to-buffer RET", then choose the appropriate TAGS file 67 | -------------------------------------------------------------------------------- /ch05.el: -------------------------------------------------------------------------------- 1 | ;;; ch05.el --- Solutions to the exercises in chapter 05 of the `An Introduction 2 | ;;; to Programming in Emacs Lisp' 3 | 4 | ;; Copyright (C) 2013 Ren Wenshan 5 | 6 | ;; Author: Ren Wenshan 7 | ;; URL: https://github.com/RenWenshan/emacs-lisp-intro-solutions 8 | 9 | ;; This program is free software; you can redistribute it and/or modify 10 | ;; it under the terms of the GNU General Public License as published by 11 | ;; the Free Software Foundation, either version 3 of the License, or 12 | ;; (at your option) any later version. 13 | 14 | ;; This program is distributed in the hope that it will be useful, 15 | ;; but WITHOUT ANY WARRANTY; without even the implied warranty of 16 | ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 17 | ;; GNU General Public License for more details. 18 | 19 | ;; You should have received a copy of the GNU General Public License 20 | ;; along with this program. If not, see . 21 | 22 | 23 | ;; Chapter 5: A Few More Complex Functions 24 | ;; ======================================= 25 | 26 | ;; Exercise 1 27 | ;; ---------- 28 | ;; 29 | ;; Question: 30 | ;; Write an interactive function with an optional argument that tests whether 31 | ;; its argument, a number, is greater than or equal to, or else, less than the 32 | ;; value of `fill-column', and tells you which, in a message. However, if you 33 | ;; do not pass an argument to the function, use 56 as a default value. 34 | ;; 35 | ;; Solution: press "C-u NUM M-x wenshan-compare-with-fill-column" 36 | (defun wenshan-compare-with-fill-column (&optional num) 37 | "Compare prefix arg NUM with `fill-column'." 38 | (interactive "P") 39 | (setq num (if num (prefix-numeric-value num) 56)) 40 | (if (>= num fill-column) 41 | (message "%d is greater than or eqaul to `fill-column'" num) 42 | (message "%d is less than `fill-column'" num))) 43 | -------------------------------------------------------------------------------- /ch06.el: -------------------------------------------------------------------------------- 1 | ;;; ch06.el --- Solutions to the exercises in chapter 06 of the `An Introduction 2 | ;;; to Programming in Emacs Lisp' 3 | 4 | ;; Copyright (C) 2013 Ren Wenshan 5 | 6 | ;; Author: Ren Wenshan 7 | ;; URL: https://github.com/RenWenshan/emacs-lisp-intro-solutions 8 | 9 | ;; This program is free software; you can redistribute it and/or modify 10 | ;; it under the terms of the GNU General Public License as published by 11 | ;; the Free Software Foundation, either version 3 of the License, or 12 | ;; (at your option) any later version. 13 | 14 | ;; This program is distributed in the hope that it will be useful, 15 | ;; but WITHOUT ANY WARRANTY; without even the implied warranty of 16 | ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 17 | ;; GNU General Public License for more details. 18 | 19 | ;; You should have received a copy of the GNU General Public License 20 | ;; along with this program. If not, see . 21 | 22 | 23 | ;; Chapter 6: Narrowing and Widening 24 | ;; ================================= 25 | 26 | ;; Exercise 1 27 | ;; ---------- 28 | ;; 29 | ;; Question: 30 | ;; Write a function that will display the first 60 characters of the 31 | ;; current buffer, even if you have narrowed the buffer to its latter half 32 | ;; so that the first line is inaccessible. Restore point, mark, and 33 | ;; narrowing. For this exercise, you need to use a whole potpourri of 34 | ;; functions, including `save-restriction', `widen', `goto-char', 35 | ;; `point-min', `message', and `buffer-substring'. 36 | 37 | ;; (`buffer-substring' is a previously unmentioned function you will 38 | ;; have to investigate yourself; or perhaps you will have to use 39 | ;; `buffer-substring-no-properties' or `filter-buffer-substring' ..., yet 40 | ;; other functions. Text properties are a feature otherwise not discussed 41 | ;; here. *Note Text Properties: (elisp)Text Properties.) 42 | 43 | ;; Additionally, do you really need `goto-char' or `point-min'? Or can 44 | ;; you write the function without them? 45 | ;; 46 | ;; Solution: 47 | (defun wenshan-display-first-60-chars () 48 | "Display the first 60 characters of the current buffer." 49 | (interactive) 50 | (save-restriction 51 | (widen) 52 | (message (buffer-substring-no-properties 1 60)))) 53 | -------------------------------------------------------------------------------- /ch07.el: -------------------------------------------------------------------------------- 1 | ;;; ch07.el --- Solutions to the exercises in chapter 07 of the `An Introduction 2 | ;;; to Programming in Emacs Lisp' 3 | 4 | ;; Copyright (C) 2013 Ren Wenshan 5 | 6 | ;; Author: Ren Wenshan 7 | ;; URL: https://github.com/RenWenshan/emacs-lisp-intro-solutions 8 | 9 | ;; This program is free software; you can redistribute it and/or modify 10 | ;; it under the terms of the GNU General Public License as published by 11 | ;; the Free Software Foundation, either version 3 of the License, or 12 | ;; (at your option) any later version. 13 | 14 | ;; This program is distributed in the hope that it will be useful, 15 | ;; but WITHOUT ANY WARRANTY; without even the implied warranty of 16 | ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 17 | ;; GNU General Public License for more details. 18 | 19 | ;; You should have received a copy of the GNU General Public License 20 | ;; along with this program. If not, see . 21 | 22 | 23 | ;; Chapter 7: `car', `cdr', `cons': Fundamental Functions 24 | ;; ================================= 25 | 26 | ;; Exercise 1 27 | ;; ---------- 28 | ;; 29 | ;; Question: 30 | ;; Construct a list of four birds by evaluating several expressions with `cons'. 31 | ;; Find out what happens when you `cons' a list onto itself. Replace the first 32 | ;; element of the list of four birds with a fish. Replace the rest of that list 33 | ;; with a list of other fish. 34 | ;; 35 | ;; Solution: 36 | 37 | ;; construct a list of four birds (in Chinese Pinyin :p) 38 | (setq wenshan-birds (cons 'huamei 39 | (cons 'bailing 40 | '(shanque yingwu)))) 41 | 42 | ;; `cons' a list onto itself 43 | (cons wenshan-birds wenshan-birds) 44 | 45 | ;; replace the first element of the list 46 | (setcar wenshan-birds 'liyu) 47 | 48 | ;; Evaluate the list to see the list of birds has changed: 49 | wenshan-birds 50 | 51 | ;; replace the rest of the list with a list of other fish 52 | (setcdr wenshan-birds '(lianyu heiyu jiyu)) 53 | 54 | ;; Evaluate the list to see the list of birds has changed: 55 | wenshan-birds 56 | -------------------------------------------------------------------------------- /ch08.el: -------------------------------------------------------------------------------- 1 | ;;; ch08.el --- Solutions to the exercises in chapter 08 of the `An Introduction 2 | ;;; to Programming in Emacs Lisp' 3 | 4 | ;; Copyright (C) 2013 Ren Wenshan 5 | 6 | ;; Author: Ren Wenshan 7 | ;; URL: https://github.com/RenWenshan/emacs-lisp-intro-solutions 8 | 9 | ;; This program is free software; you can redistribute it and/or modify 10 | ;; it under the terms of the GNU General Public License as published by 11 | ;; the Free Software Foundation, either version 3 of the License, or 12 | ;; (at your option) any later version. 13 | 14 | ;; This program is distributed in the hope that it will be useful, 15 | ;; but WITHOUT ANY WARRANTY; without even the implied warranty of 16 | ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 17 | ;; GNU General Public License for more details. 18 | 19 | ;; You should have received a copy of the GNU General Public License 20 | ;; along with this program. If not, see . 21 | 22 | 23 | ;; Chapter 8: Cutting and Storing Text 24 | ;; =================================== 25 | 26 | ;; Exercise 1 27 | ;; ---------- 28 | ;; 29 | ;; Question: 30 | ;; Write an interactive function that searches for a string. If the search 31 | ;; finds the string, leave point after it and display a message that says 32 | ;; "Found!". (Do not use `search-forward' for the name of this function; if you 33 | ;; do, you will overwrite the existing version of `search-forward' that comes 34 | ;; with Emacs. Use a name such as `test-search' instead.) 35 | ;; 36 | ;; Solution: 37 | (defun wenshan-test-search (string) 38 | "Search current buffer for STRING and display `Found!' if succeed." 39 | (interactive 40 | ;; read in `string-to-search' 41 | (list (read-string "Search: "))) 42 | (goto-char (point-min)) 43 | (when (search-forward string) 44 | (message "Found!"))) 45 | -------------------------------------------------------------------------------- /ch09.el: -------------------------------------------------------------------------------- 1 | ;;; ch09.el --- Solutions to the exercises in chapter 09 of the `An Introduction 2 | ;;; to Programming in Emacs Lisp' 3 | 4 | ;; Copyright (C) 2013 Ren Wenshan 5 | 6 | ;; Author: Ren Wenshan 7 | ;; URL: https://github.com/RenWenshan/emacs-lisp-intro-solutions 8 | 9 | ;; This program is free software; you can redistribute it and/or modify 10 | ;; it under the terms of the GNU General Public License as published by 11 | ;; the Free Software Foundation, either version 3 of the License, or 12 | ;; (at your option) any later version. 13 | 14 | ;; This program is distributed in the hope that it will be useful, 15 | ;; but WITHOUT ANY WARRANTY; without even the implied warranty of 16 | ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 17 | ;; GNU General Public License for more details. 18 | 19 | ;; You should have received a copy of the GNU General Public License 20 | ;; along with this program. If not, see . 21 | 22 | 23 | ;; Chapter 9: How List are Implemented 24 | ;; =================================== 25 | 26 | ;; Exercise 1 27 | ;; ---------- 28 | ;; 29 | ;; Question: 30 | ;; Set `flowers' to `violet' and `buttercup'. Cons two more flowers on to this 31 | ;; list and set this new list to `more-flowers'. Set the CAR of `flowers' to a 32 | ;; fish. What does the `more-flowers' list now contain? 33 | ;; 34 | ;; Solution: 35 | 36 | ;; set `flowers' to `violet' and `buttercup' 37 | (setq flowers '("violet" "buttercup")) 38 | 39 | ;; evaluate the list to see the list of flowers: 40 | flowers 41 | 42 | ;; cons two more flowers on to this list 43 | (setq more-flowers (cons "JuHua" (cons "KuiHua" flowers))) 44 | 45 | ;; evaluate the list to see the new list of flowers: 46 | more-flowers 47 | 48 | ;; set the car of `flowers' to a fish 49 | (setcar flowers "LiYu") 50 | 51 | ;; show the value of `more-flowers' 52 | more-flowers 53 | -------------------------------------------------------------------------------- /ch10.el: -------------------------------------------------------------------------------- 1 | ;;; ch10.el --- Solutions to the exercises in chapter 10 of the `An Introduction 2 | ;;; to Programming in Emacs Lisp' 3 | 4 | ;; Copyright (C) 2013 Ren Wenshan 5 | 6 | ;; Author: Ren Wenshan 7 | ;; URL: https://github.com/RenWenshan/emacs-lisp-intro-solutions 8 | 9 | ;; This program is free software; you can redistribute it and/or modify 10 | ;; it under the terms of the GNU General Public License as published by 11 | ;; the Free Software Foundation, either version 3 of the License, or 12 | ;; (at your option) any later version. 13 | 14 | ;; This program is distributed in the hope that it will be useful, 15 | ;; but WITHOUT ANY WARRANTY; without even the implied warranty of 16 | ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 17 | ;; GNU General Public License for more details. 18 | 19 | ;; You should have received a copy of the GNU General Public License 20 | ;; along with this program. If not, see . 21 | 22 | 23 | ;; Chapter 10: Yanking Text Back 24 | ;; ============================= 25 | 26 | ;; Exercise 1 27 | ;; ---------- 28 | ;; 29 | ;; Question: 30 | ;; Using `C-h v' (`describe-variable'), look at the value of your kill ring. 31 | ;; Add several items to your kill ring; look at its value again. Using `M-y' 32 | ;; (`yank-pop)', move all the way around the kill ring. How many items were in 33 | ;; your kill ring? Find the value of `kill-ring-max'. Was your kill ring full, 34 | ;; or could you have kept more blocks of text within it? 35 | ;; 36 | ;; Solution: 37 | 38 | ;; find the value of `kill-ring-max' 39 | kill-ring-max 40 | 41 | ;; test whether the kill ring is full or not 42 | (= kill-ring-max (length kill-ring)) 43 | 44 | ;; could you keep more blocks of text in the kill ring 45 | (- kill-ring-max (length kill-ring)) 46 | 47 | 48 | ;; Exercise 2 49 | ;; ---------- 50 | ;; 51 | ;; Question: 52 | ;; Using `nthcdr' and `car', construct a series of expressions to return the 53 | ;; first, second, third, and fourth elements of a list. 54 | ;; 55 | ;; Solution: 56 | 57 | ;; construct a list 58 | (setq wenshan-test-list '("Hello" "World" "Emacs" "Rocks")) 59 | 60 | ;; return the first element 61 | (car wenshan-test-list) 62 | 63 | ;; return the second element 64 | (car (nthcdr 1 wenshan-test-list)) 65 | 66 | ;; return the third element 67 | (car (nthcdr 2 wenshan-test-list)) 68 | 69 | ;; return the fourth element 70 | (car (nthcdr 3 wenshan-test-list)) 71 | -------------------------------------------------------------------------------- /ch11.el: -------------------------------------------------------------------------------- 1 | ;;; ch11.el --- Solutions to the exercises in chapter 11 of the `An Introduction 2 | ;;; to Programming in Emacs Lisp' 3 | 4 | ;; Copyright (C) 2013 Ren Wenshan 5 | 6 | ;; Author: Ren Wenshan 7 | ;; URL: https://github.com/RenWenshan/emacs-lisp-intro-solutions 8 | 9 | ;; This program is free software; you can redistribute it and/or modify 10 | ;; it under the terms of the GNU General Public License as published by 11 | ;; the Free Software Foundation, either version 3 of the License, or 12 | ;; (at your option) any later version. 13 | 14 | ;; This program is distributed in the hope that it will be useful, 15 | ;; but WITHOUT ANY WARRANTY; without even the implied warranty of 16 | ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 17 | ;; GNU General Public License for more details. 18 | 19 | ;; You should have received a copy of the GNU General Public License 20 | ;; along with this program. If not, see . 21 | 22 | 23 | ;; Chapter 11: Looping 24 | ;; =================== 25 | 26 | ;; Exercise 1 27 | ;; ---------- 28 | ;; 29 | ;; Question: 30 | ;; Write a function similar to `triangle' in which each row has a value which is 31 | ;; the square of the row number. Use a `while' loop. 32 | ;; 33 | ;; Solution: 34 | (defun wenshan-triangle (number-of-rows) 35 | "Add the square of the number of pebbles in each row of a triangle. 36 | The first row has one pebble, the second row two pebbles, 37 | the third row three pebbles, and so on. 38 | The argument is NUMBER-OF-ROWS." 39 | (let ((total 0) 40 | (row-number 1)) 41 | (while (<= row-number number-of-rows) 42 | (setq total (+ total (* row-number row-number))) 43 | (setq row-number (1+ row-number))) 44 | total)) 45 | 46 | (wenshan-triangle 4) 47 | 48 | (wenshan-triangle 7) 49 | 50 | ;; Exercise 2 51 | ;; ---------- 52 | ;; 53 | ;; Question: 54 | ;; Write a function similar to `triangle' that multiplies instead of adds the 55 | ;; values. 56 | ;; 57 | ;; Solution: 58 | (defun wenshan-triangle-mul (number-of-rows) 59 | "Multiply the number of pebbles in each row of a triangle. 60 | The first row has one pebble, the second row two pebbles, 61 | the third row three pebbles, and so on. 62 | The argument is NUMBER-OF-ROWS." 63 | (let ((total 1) 64 | (row-number 1)) 65 | (while (<= row-number number-of-rows) 66 | (setq total (* total row-number)) 67 | (setq row-number (1+ row-number))) 68 | total)) 69 | 70 | (wenshan-triangle-mul 4) 71 | 72 | (wenshan-triangle-mul 7) 73 | 74 | ;; Exercise 3 75 | ;; ---------- 76 | ;; 77 | ;; Question: 78 | ;; Rewrite these two functions recursively. Rewrite these functions using 79 | ;; `cond'. 80 | ;; 81 | ;; Solution: 82 | 83 | ;; recursive version of exercise 1 84 | (defun wenshan-triangle-init (number-of-rows) 85 | "Add the square of the number of pebbles in each row of a triangle. 86 | The first row has one pebble, the second row two pebbles, 87 | the third row three pebbles, and so on. 88 | The argument is NUMBER-OF-ROWS." 89 | (wenshan-triangle-helper 0 1 number-of-rows)) 90 | 91 | (defun wenshan-triangle-helper (sum counter number-of-rows) 92 | (cond ((> counter number-of-rows) sum) 93 | ((<= counter number-of-rows) 94 | (wenshan-triangle-helper (+ sum (* counter counter)) 95 | (1+ counter) 96 | number-of-rows)))) 97 | 98 | ;; recursive version of exercise 2 99 | (defun wenshan-triangle-mul-init (number-of-rows) 100 | "Multiply the number of pebbles in each row of a triangle. 101 | The first row has one pebble, the second row two pebbles, 102 | the third row three pebbles, and so on. 103 | The argument is NUMBER-OF-ROWS." 104 | (wenshan-triangle-mul-helper 1 1 number-of-rows)) 105 | 106 | (defun wenshan-triangle-mul-helper (product counter number-of-rows) 107 | (cond ((> counter number-of-rows) product) 108 | ((<= counter number-of-rows) 109 | (wenshan-triangle-mul-helper (* product counter) 110 | (1+ counter) 111 | number-of-rows)))) 112 | 113 | 114 | ;; Exercise 4 115 | ;; ---------- 116 | 117 | ;; Question: 118 | ;; Write a function for Texinfo mode that creates an index entry at the 119 | ;; beginning of a paragraph for every `@dfn{bar}' within the paragraph. (In a 120 | ;; Texinfo file, `@dfn{poo}' marks a definition. This book is written in Texinfo.) 121 | 122 | (defun wenshan-create-index-for-dfn () 123 | "Create an index entry at the beginning of the paragraph for every `@dfn'." 124 | (interactive) 125 | (save-excursion 126 | (mark-paragraph) 127 | (save-restriction 128 | (narrow-to-region (point) (mark)) 129 | (let (dfns) 130 | (while (search-forward "@dfn" nil t) 131 | (when (search-forward "{" nil t) 132 | (let ((start (point))) 133 | (when (search-forward "}" nil t) 134 | (forward-char -1) 135 | (let ((end (point))) 136 | (setq dfns (cons (buffer-substring start end) 137 | dfns))))))) 138 | (forward-paragraph -1) 139 | (dolist (dfn dfns) 140 | (insert (concat "@cindex " dfn "\n"))))))) 141 | -------------------------------------------------------------------------------- /ch12.el: -------------------------------------------------------------------------------- 1 | ;;; ch12.el --- Solutions to the exercises in chapter 12 of the `An Introduction 2 | ;;; to Programming in Emacs Lisp' 3 | 4 | ;; Copyright (C) 2013 Ren Wenshan 5 | 6 | ;; Author: Ren Wenshan 7 | ;; URL: https://github.com/RenWenshan/emacs-lisp-intro-solutions 8 | 9 | ;; This program is free software; you can redistribute it and/or modify 10 | ;; it under the terms of the GNU General Public License as published by 11 | ;; the Free Software Foundation, either version 3 of the License, or 12 | ;; (at your option) any later version. 13 | 14 | ;; This program is distributed in the hope that it will be useful, 15 | ;; but WITHOUT ANY WARRANTY; without even the implied warranty of 16 | ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 17 | ;; GNU General Public License for more details. 18 | 19 | ;; You should have received a copy of the GNU General Public License 20 | ;; along with this program. If not, see . 21 | 22 | 23 | ;; Chapter 12: Regular Expression Searches 24 | ;; ======================================= 25 | 26 | ;; Exercise 1 27 | ;; ---------- 28 | ;; 29 | ;; Question: 30 | ;; Write a function to search for a regular expression that matches two or more 31 | ;; blank lines in sequence. 32 | ;; 33 | ;; Solution: 34 | (defun wenshan-search-for-blank-lines (arg) 35 | "Search for two or more blank lines in sequence." 36 | (interactive "p") 37 | (or arg (setq arg 1)) 38 | (search-forward-regexp "^\n\n+" nil nil arg)) 39 | 40 | 41 | ;; Exercise 2 42 | ;; ---------- 43 | ;; 44 | ;; Write a function to search for duplicated words, such as `the the'. 45 | ;; 46 | ;; Solution: 47 | (defun wenshan-search-for-duplicated-words (arg) 48 | "Search for duplicated words." 49 | (interactive "p") 50 | (or arg (setq arg 1)) 51 | (push-mark) 52 | ;; This regexp is not perfect 53 | ;; but is fairly good over all: 54 | (if (re-search-forward 55 | "\\b\\([^@ \n\t]+\\)[ \n\t]+\\1\\b" nil 'move) 56 | (message "Found duplicated word.") 57 | (message "End of buffer"))) 58 | -------------------------------------------------------------------------------- /ch13.el: -------------------------------------------------------------------------------- 1 | ;;; ch13.el --- Solutions to the exercises in chapter 13 of the `An Introduction 2 | ;;; to Programming in Emacs Lisp' 3 | 4 | ;; Copyright (C) 2013 Ren Wenshan 5 | 6 | ;; Author: Ren Wenshan 7 | ;; URL: https://github.com/RenWenshan/emacs-lisp-intro-solutions 8 | 9 | ;; This program is free software; you can redistribute it and/or modify 10 | ;; it under the terms of the GNU General Public License as published by 11 | ;; the Free Software Foundation, either version 3 of the License, or 12 | ;; (at your option) any later version. 13 | 14 | ;; This program is distributed in the hope that it will be useful, 15 | ;; but WITHOUT ANY WARRANTY; without even the implied warranty of 16 | ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 17 | ;; GNU General Public License for more details. 18 | 19 | ;; You should have received a copy of the GNU General Public License 20 | ;; along with this program. If not, see . 21 | 22 | 23 | ;; Chapter 13: Counting: Repetition and Regexps 24 | ;; ============================================ 25 | 26 | ;; Exercise 1 27 | ;; ---------- 28 | ;; 29 | ;; Question: 30 | ;; Using a `while' loop, write a function to count the number of punctuation 31 | ;; marks in a region--period, comma, semicolon, colon, exclamation mark, and 32 | ;; question mark. Do the same using recursion. 33 | ;; 34 | ;; Solution: 35 | 36 | ;; `while' loop version 37 | (defun wenshan-count-punctuation-marks-in-region (beginning end) 38 | "Print the number of punctuation marks in the region using while." 39 | (interactive "r") 40 | (message "Counting punctuation marks in region...") 41 | ;; 1. Set up appropriate conditions. 42 | (save-excursion 43 | (let ((count 0)) 44 | (goto-char beginning) 45 | 46 | ;; 2. Run the while loop. 47 | (while (and (< (point) end) 48 | (re-search-forward "[.,;:!?]" end t)) 49 | (setq count (1+ count))) 50 | 51 | ;; 3. Send a message to the user. 52 | (cond ((zerop count) 53 | (message 54 | "The region does NOT have any punctuation mark.")) 55 | ((= 1 count) 56 | (message 57 | "The region has 1 punctuation mark.")) 58 | (t 59 | (message 60 | "The region has %d punctuation marks." count)))))) 61 | 62 | 63 | ;; recursion version 64 | (defun wenshan-count-punctuation-marks-in-region-helper (region-end) 65 | "Number of punctuation marks between point and REGION-END." 66 | 67 | ;; 1. do-again-test 68 | (if (and (< (point) region-end) 69 | (re-search-forward "[.,;:!?]" region-end t)) 70 | 71 | ;; 2. then-part: the recursive call 72 | (1+ (wenshan-count-punctuation-marks-in-region-helper region-end)) 73 | 74 | ;; 3. else-part 75 | 0)) 76 | 77 | (defun wenshan-count-punctuation-marks-in-region-init (beginning end) 78 | "Print number of punctuation marks in the region using recursion." 79 | (interactive "r") 80 | (message "Counting punctuation marks in region ... ") 81 | (save-excursion 82 | (goto-char beginning) 83 | (let ((count (wenshan-count-punctuation-marks-in-region-helper end))) 84 | (cond ((zerop count) 85 | (message 86 | "The region does NOT have any punctuation mark.")) 87 | ((= 1 count) 88 | (message "The region has 1 punctuation mark.")) 89 | (t 90 | (message 91 | "The region has %d punctuation marks." count)))))) 92 | -------------------------------------------------------------------------------- /ch15.el: -------------------------------------------------------------------------------- 1 | ;;; ch15.el --- Solutions to the exercises in chapter 15 of the `An Introduction 2 | ;;; to Programming in Emacs Lisp' 3 | 4 | ;; Copyright (C) 2013 Ren Wenshan 5 | 6 | ;; Author: Ren Wenshan 7 | ;; URL: https://github.com/RenWenshan/emacs-lisp-intro-solutions 8 | 9 | ;; This program is free software; you can redistribute it and/or modify 10 | ;; it under the terms of the GNU General Public License as published by 11 | ;; the Free Software Foundation, either version 3 of the License, or 12 | ;; (at your option) any later version. 13 | 14 | ;; This program is distributed in the hope that it will be useful, 15 | ;; but WITHOUT ANY WARRANTY; without even the implied warranty of 16 | ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 17 | ;; GNU General Public License for more details. 18 | 19 | ;; You should have received a copy of the GNU General Public License 20 | ;; along with this program. If not, see . 21 | 22 | 23 | ;; Chapter 15: Readying a Graph 24 | ;; ============================ 25 | 26 | ;; Exercise 1 27 | ;; ---------- 28 | ;; 29 | ;; Question: 30 | ;; Write a line graph version of the graph printing functions. 31 | ;; 32 | ;; Solution: 33 | 34 | (defvar wenshan-graph-symbol "*" 35 | "String used as symbol in graph, usually an asterisk.") 36 | 37 | (defvar wenshan-graph-blank " " 38 | "String used as blank in graph, usually a blank 39 | space. wenshan-graph-blank must be the same number of columns wide as 40 | wenshan-graph-symbol") 41 | 42 | (defun wenshan-column-of-graph (max-graph-height actual-height &optional line) 43 | "Return MAX-GRAPH-HEIGHT strings; ACTUAL-HEIGHT are graph-symbols. 44 | The graph-symbols are contiguous entries at the end 45 | of the list. 46 | The list will be inserted as one column of a graph. 47 | The strings are either wenshan-graph-blank or wenshan-graph-symbol. 48 | 49 | The optional argument `line' will be used to determine whether to 50 | draw bar graph or line graph. (By default, bar graph)" 51 | 52 | (let ((insert-list nil) 53 | (number-of-top-blanks 54 | (- max-graph-height actual-height))) 55 | 56 | (if line 57 | ;; line graph 58 | (progn 59 | ;; Fill in `wenshan-graph-blanks'. 60 | (while (> actual-height 1) 61 | (setq insert-list (cons wenshan-graph-blank insert-list)) 62 | (setq actual-height (1- actual-height))) 63 | ;; Fill in `wenshan-graph-symbol' 64 | (setq insert-list (cons wenshan-graph-symbol insert-list))) 65 | 66 | ;; bar graph 67 | ;;Fill in `wenshan-graph-symbols'. 68 | (while (> actual-height 0) 69 | (setq insert-list (cons wenshan-graph-symbol insert-list)) 70 | (setq actual-height (1- actual-height)))) 71 | 72 | ;; Fill in `wenshan-graph-blanks'. 73 | (while (> number-of-top-blanks 0) 74 | (setq insert-list (cons wenshan-graph-blank insert-list)) 75 | (setq number-of-top-blanks 76 | (1- number-of-top-blanks))) 77 | 78 | ;; Return whole list. 79 | insert-list)) 80 | 81 | 82 | (defun wenshan-graph-body-print (numbers-list &optional line) 83 | "Print a bar graph or line graph of the NUMBERS-LIST. 84 | The numbers-list consists of the Y-axis values. 85 | 86 | `line': if true, print line graph; if nil, print bar graph" 87 | 88 | (let ((height (apply 'max numbers-list)) 89 | (symbol-width (length wenshan-graph-blank)) 90 | from-position) 91 | 92 | (while numbers-list 93 | (setq from-position (point)) 94 | (insert-rectangle 95 | (wenshan-column-of-graph height (car numbers-list) line)) 96 | (goto-char from-position) 97 | (forward-char symbol-width) 98 | ;; Draw graph column by column. 99 | ;; (set-for 0) perform redisplay immediately 100 | (sit-for 0) 101 | (setq numbers-list (cdr numbers-list))) 102 | ;; Place point for X axis labels. 103 | (forward-line height) 104 | (insert "\n") 105 | )) 106 | 107 | 108 | ;; Recursive Version 109 | (defun recursive-graph-body-print (numbers-list &optional line) 110 | "Print a bar graph or line graph of the NUMBERS-LIST. 111 | The numbers-list consists of the Y-axis values. 112 | 113 | `line': if true, print line graph; if nil, print bar graph" 114 | (let ((height (apply 'max numbers-list)) 115 | (symbol-width (length wenshan-graph-blank)) 116 | from-position) 117 | (recursive-graph-body-print-internal 118 | numbers-list 119 | height 120 | symbol-width 121 | line))) 122 | 123 | 124 | (defun recursive-graph-body-print-internal 125 | (numbers-list height symbol-width &optional line) 126 | "Print a bar graph. 127 | Used within recursive-graph-body-print function. 128 | 129 | The optional argument `line' will be used to determine whether to 130 | draw bar graph or line graph. (By default, bar graph)" 131 | 132 | (when numbers-list 133 | (setq from-position (point)) 134 | (insert-rectangle 135 | (wenshan-column-of-graph height (car numbers-list) line)) 136 | (goto-char from-position) 137 | (forward-char symbol-width) 138 | (sit-for 0) ; Draw graph column by column. 139 | (recursive-graph-body-print-internal 140 | (cdr numbers-list) height symbol-width line))) 141 | 142 | (wenshan-graph-body-print '(1 2 3 4 6 4 3 5 7 6 5 2 3) t) 143 | -------------------------------------------------------------------------------- /gpl-3.0.txt: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | --------------------------------------------------------------------------------