| blob | 3cb9b325ece52bbd0a0ff14f38fdf813cac09057 |
1 ;;; org-list.el --- Plain lists for Org-mode
2 ;;
3 ;; Copyright (C) 2004-2013 Free Software Foundation, Inc.
4 ;;
5 ;; Author: Carsten Dominik <carsten at orgmode dot org>
6 ;; Bastien Guerry <bzg@gnu.org>
7 ;; Keywords: outlines, hypermedia, calendar, wp
8 ;; Homepage: http://orgmode.org
9 ;;
10 ;; This file is part of GNU Emacs.
11 ;;
12 ;; GNU Emacs is free software: you can redistribute it and/or modify
13 ;; it under the terms of the GNU General Public License as published by
14 ;; the Free Software Foundation, either version 3 of the License, or
15 ;; (at your option) any later version.
17 ;; GNU Emacs is distributed in the hope that it will be useful,
18 ;; but WITHOUT ANY WARRANTY; without even the implied warranty of
19 ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 ;; GNU General Public License for more details.
22 ;; You should have received a copy of the GNU General Public License
23 ;; along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
24 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
25 ;;
26 ;;; Commentary:
28 ;; This file contains the code dealing with plain lists in Org-mode.
30 ;; The core concept behind lists is their structure. A structure is
31 ;; a snapshot of the list, in the shape of a data tree (see
32 ;; `org-list-struct').
34 ;; Once the list structure is stored, it is possible to make changes
35 ;; on it that will be mirrored to the real list or to get information
36 ;; about the list, using accessors and methods provided in the
37 ;; library. Most of them require the use of one or two helper
38 ;; functions, namely `org-list-parents-alist' and
39 ;; `org-list-prevs-alist'.
41 ;; Structure is eventually applied to the buffer with
42 ;; `org-list-write-struct'. This function repairs (bullets,
43 ;; indentation, checkboxes) the list in the process. It should be
44 ;; called near the end of any function working on structures.
46 ;; Thus, a function applying to lists should usually follow this
47 ;; template:
49 ;; 1. Verify point is in a list and grab item beginning (with the same
50 ;; function `org-in-item-p'). If the function requires the cursor
51 ;; to be at item's bullet, `org-at-item-p' is more selective. It
52 ;; is also possible to move point to the closest item with
53 ;; `org-list-search-backward', or `org-list-search-forward',
54 ;; applied to the function `org-item-beginning-re'.
56 ;; 2. Get list structure with `org-list-struct'.
58 ;; 3. Compute one, or both, helper functions,
59 ;; (`org-list-parents-alist', `org-list-prevs-alist') depending on
60 ;; needed accessors.
62 ;; 4. Proceed with the modifications, using methods and accessors.
64 ;; 5. Verify and apply structure to buffer, using
65 ;; `org-list-write-struct'.
67 ;; 6. If changes made to the list might have modified check-boxes,
68 ;; call `org-update-checkbox-count-maybe'.
70 ;; Computing a structure can be a costly operation on huge lists (a
71 ;; few thousand lines long). Thus, code should follow the rule:
72 ;; "collect once, use many". As a corollary, it is usually a bad idea
73 ;; to use directly an interactive function inside the code, as those,
74 ;; being independent entities, read the whole list structure another
75 ;; time.
77 ;;; Code:
138 \f
139 ;;; Configuration variables
142 "Options concerning plain lists in Org-mode."
147 "When t, make TAB cycle visibility on plain list items.
148 Cycling plain lists works only when the cursor is on a plain list
149 item. When the cursor is on an outline heading, plain lists are
150 treated as text. This is the most stable way of handling this,
151 which is why it is the default.
153 When this is the symbol `integrate', then integrate plain list
154 items when cycling, as if they were children of outline headings.
156 This setting can lead to strange effects when switching visibility
159 plain list item with an implied large level number, all true
160 children and grand children of the outline heading will be
161 exposed in a children' view."
170 "Default bullet type installed when demoting an item.
171 This is an association list, for each bullet type, this alist will point
172 to the bullet that should be used when this item is demoted.
173 For example,
175 (setq org-list-demote-modify-bullet
178 will make
180 + Movies
181 + Silence of the Lambs
182 + My Cousin Vinny
183 + Books
184 + The Hunt for Red October
185 + The Road to Omaha
187 into
189 + Movies
190 - Silence of the Lambs
191 - My Cousin Vinny
192 + Books
193 - The Hunt for Red October
194 - The Road to Omaha"
212 "The character that makes a line with leading number an ordered list item.
213 Valid values are ?. and ?\). To get both terminators, use t."
222 "Non-nil means single character alphabetical bullets are allowed.
224 Both uppercase and lowercase are handled. Lists with more than
225 26 items will fallback to standard numbering. Alphabetical
228 This variable needs to be set before org.el is loaded. If you
229 need to make a change while Emacs is running, use the customize
230 interface or run the following code after updating it:
241 "A regular expression matching bullets that should have 2 spaces after them.
242 When nil, no bullet will have two spaces after them. When
243 a string, it will be used as a regular expression. When the
244 bullet type of a list is changed, the new bullet type will be
245 matched against this regexp. If it matches, there will be two
246 spaces instead of one after the bullet in each item of the list."
255 "Non-nil means an empty line ends all plain list levels.
256 Otherwise, two of them will be necessary."
262 "Non-nil means apply set of rules when acting on lists.
263 By default, automatic actions are taken when using
268 rules by setting them to nil. Valid rules are:
270 checkbox when non-nil, checkbox statistics is updated each time
271 you either insert a new checkbox or toggle a checkbox.
272 indent when non-nil, indenting or outdenting list top-item
273 with its subtree will move the whole list and
274 outdenting a list whose bullet is * to column 0 will
279 :key-type
283 :value-type
287 "Non-nil means commands implying motion in lists should be cyclic.
289 In that case, the item following the last item is the first one,
290 and the item preceding the first item is the last one.
300 "Hook that is run whenever Org thinks checkbox statistics should be updated.
301 This hook runs even if checkbox rule in
302 `org-list-automatic-rules' does not apply, so it can be used to
303 implement alternative ways of collecting statistics
309 "Non-nil means checkbox statistics counts only the state of direct children.
310 When nil, all boxes below the cookie are counted.
311 This can be set to nil on a per-node basis using a COOKIE_DATA property
319 "Maximum indentation for the second line of a description list.
320 When the indentation would be larger than this, it will become
321 5 characters instead."
326 "Additional indentation for sub-items in a list.
327 By setting this to a small number, usually 1 or 2, one can more
328 clearly distinguish sub-items in a list."
335 % END RECEIVE ORGLST %n
337 #+ORGLST: SEND %n org-list-to-latex
338 -
341 @c END RECEIVE ORGLST %n
342 @ignore
343 #+ORGLST: SEND %n org-list-to-texinfo
344 -
347 <!-- END RECEIVE ORGLST %n -->
348 <!--
349 #+ORGLST: SEND %n org-list-to-html
350 -
352 "Templates for radio lists in different major modes.
353 All occurrences of %n in a template will be replaced with the name of the
354 list, obtained by prompting the user."
362 "Names of blocks where lists are not allowed.
366 "Context types where lists will be interpreted during export.
368 Valid types are `drawer', `inlinetask' and `block'. More
369 specifically, type `block' is determined by the variable
373 \f
374 ;;; Predicates and regexps
378 "Regex corresponding to the end of a list.
386 "Matches a list item and puts everything into groups:
387 group 1: bullet
388 group 2: counter
389 group 3: checkbox
393 "Return the correct regular expression for plain lists."
404 "Regexp matching the beginning of a plain list item."
408 "Is point at a list item with REGEXP after bullet?"
417 ;; Ignore counter if any
422 "Is point in a context where lists are allowed?"
426 "Return item beginning position when in a plain list, nil otherwise."
435 ;; Indentation isn't meaningful when point starts at an empty
436 ;; line or an inline task.
439 10000
445 ;; Detect if cursor in amidst `org-list-end-re'. First, count
446 ;; number HL of hard lines it takes, then call `org-in-regexp'
447 ;; to compute its boundaries END-BOUNDS. When point is
448 ;; in-between, move cursor before regexp beginning.
459 ;; Look for an item, less indented that reference line.
464 ;; This is exactly what we want.
467 ;; At upper bound of search or looking at the end of a
468 ;; previous list: search is over.
471 ;; Skip blocks, drawers, inline-tasks, blank lines
481 ;; Text at column 0 cannot belong to a list: stop.
483 ;; Normal text less indented than reference line, take
484 ;; it as new reference.
491 "Is point in a line starting a hand-formatted item?"
497 "Is point at the bullet of a plain list item?"
503 "Is point at a line starting a plain list item with a timer?"
508 "Is point at a description list item?"
512 "Is point at a line starting a plain-list item with a checklet?"
516 "Is point at a line starting a plain-list item with a counter?"
522 \f
523 ;;; Structures and helper functions
526 "Determine context, and its boundaries, around point.
528 Context will be a cell like (MIN MAX CONTEXT) where MIN and MAX
529 are boundaries and CONTEXT is a symbol among `drawer', `block',
530 `invalid', `inlinetask' and nil.
532 Contexts `block' and `invalid' refer to `org-list-forbidden-blocks'."
538 ;; Get positions of surrounding headings. This is the
539 ;; default context.
544 ;; Is point inside a drawer?
554 lim-down))
557 ;; Is point strictly in a block, and of which type?
568 lim-down))
574 ;; Is point in an inlinetask?
587 ;; Return context boundaries and type.
591 "Return structure of list at point.
593 A list structure is an alist where key is point at item, and
594 values are:
595 1. indentation,
596 2. bullet with trailing whitespace,
597 3. bullet counter, if any,
598 4. checkbox, if any,
599 5. description tag, if any,
600 6. position at item end.
602 Thus the following list, where numbers in parens are
603 point-at-bol:
605 - [X] first item (1)
606 1. sub-item 1 (18)
607 5. [@5] sub-item 2 (34)
608 some other text belonging to first item (55)
609 - last item (97)
610 + tag :: description (109)
611 (131)
613 will get the following structure:
621 Assume point is at an item."
633 ind itm-lst itm-lst-2 end-lst end-lst-2 struct
636 ;; Return association at point.
641 ind
642 bullet
645 ;; Description tag.
650 ;; Ensure list ends at the first blank line.
654 ;; 1. Read list from starting item to its beginning, and save
655 ;; top item position and indentation in BEG-CELL. Also store
656 ;; ending position of items in END-LST.
663 ;; At upward limit: if we ended at an item, store it,
664 ;; else dismiss useless data recorded above BEG-CELL.
665 ;; Jump to part 2.
672 ;; Looking at a list ending regexp. Dismiss useless
673 ;; data recorded above BEG-CELL. Jump to part 2.
678 ;; Point is at an item. Add data to ITM-LST. It may
679 ;; also end a previous item: save it in END-LST. If
680 ;; ind is less or equal than BEG-CELL and there is no
681 ;; end at this ind or lesser, this item becomes the new
682 ;; BEG-CELL.
688 ;; Skip blocks, drawers, inline tasks, blank lines.
699 ;; From there, point is not at an item. Interpret
700 ;; line's indentation:
701 ;; - text at column 0 is necessarily out of any list.
702 ;; Dismiss data recorded above BEG-CELL. Jump to
703 ;; part 2.
704 ;; - any other case may be an ending position for an
705 ;; hypothetical item above. Store it and proceed.
714 ;; 2. Read list from starting point to its end, that is until we
715 ;; get out of context, or that a non-item line is less or
716 ;; equally indented than BEG-CELL's cdr. Also, store ending
717 ;; position of items in END-LST-2.
723 ;; At downward limit: this is de facto the end of the
724 ;; list. Save point as an ending position, and jump to
725 ;; part 3.
728 ;; Looking at a list ending regexp. Save point as an
729 ;; ending position and jump to part 3.
733 ;; Point is at an item. Add data to ITM-LST-2. It may
734 ;; also end a previous item, so save it in END-LST-2.
738 ;; Skip inline tasks and blank lines along the way
743 ;; Ind is lesser or equal than BEG-CELL's. The list is
744 ;; over: store point as an ending position and jump to
745 ;; part 3.
749 ;; Else, if ind is lesser or equal than previous item's,
750 ;; this is an ending position: store it. In any case,
751 ;; skip block or drawer at point, and move to next line.
763 ;; 3. Associate each item to its end position.
765 ;; 4. Return STRUCT
766 struct)))
769 "Associate proper ending point to items in STRUCT.
771 END-LIST is a pseudo-alist where car is indentation and cdr is
772 ending position.
774 This function modifies STRUCT."
780 ;; Remove end candidates behind current item.
783 ;; Add end position to item assoc.
789 struct)))
792 "Return alist between item and previous item in STRUCT."
794 struct)))
798 struct)))
801 "Return alist between item and parent in STRUCT."
813 ;; A sub-list is over. Find the associated
814 ;; origin in IND-TO-ORI. If it cannot be
815 ;; found (ill-formed list), set its parent as
816 ;; the first item less indented. If there is
817 ;; none, make it a top-level item.
825 ind-to-ori)
828 ;; A sub-list starts. Every item at IND will
829 ;; have previous item as its parent.
834 ;; Another item in the same sub-list: it shares
835 ;; the same parent as the previous item.
840 \f
841 ;;; Accessors
844 "Return the Nth value of KEY in STRUCT."
848 "Set the Nth value of KEY in STRUCT to NEW.
853 "Return indentation of ITEM in STRUCT."
857 "Set indentation of ITEM in STRUCT to IND.
862 "Return bullet of ITEM in STRUCT."
866 "Set bullet of ITEM in STRUCT to BULLET.
871 "Return counter of ITEM in STRUCT."
875 "Return checkbox of ITEM in STRUCT or nil."
879 "Set checkbox of ITEM in STRUCT to CHECKBOX.
884 "Return end position of ITEM in STRUCT."
888 "Return end position of ITEM in STRUCT."
892 "Return point at end of ITEM in STRUCT, before any blank line.
893 Point returned is at end of line."
900 "Return parent of ITEM or nil.
901 STRUCT is the list structure. PARENTS is the alist of parents,
902 as returned by `org-list-parents-alist'."
907 "Non-nil if ITEM has a child.
909 STRUCT is the list structure.
911 Value returned is the position of the first child of ITEM."
916 child-maybe)))
919 "Return next item in same sub-list as ITEM, or nil.
920 STRUCT is the list structure. PREVS is the alist of previous
921 items, as returned by `org-list-prevs-alist'."
925 "Return previous item in same sub-list as ITEM, or nil.
926 STRUCT is the list structure. PREVS is the alist of previous
927 items, as returned by `org-list-prevs-alist'."
931 "List all items having ITEM as a common ancestor, or nil.
932 STRUCT is the list structure."
935 subtree)
940 sub-struct))
944 "List all items in the same sub-list as ITEM.
945 STRUCT is the list structure. PREVS is the alist of previous
946 items, as returned by `org-list-prevs-alist'."
949 before-item after-item)
957 "List all children of ITEM, or nil.
958 STRUCT is the list structure. PARENTS is the alist of parents,
959 as returned by `org-list-parents-alist'."
967 "Return point at beginning of list.
968 STRUCT is the list structure."
972 "Return point at bottom of list.
973 STRUCT is the list structure."
978 "Return point at beginning of sub-list ITEM belongs.
979 STRUCT is the list structure. PREVS is the alist of previous
980 items, as returned by `org-list-prevs-alist'."
984 first-item))
989 "Return point at last item of sub-list ITEM belongs.
990 STRUCT is the list structure. PREVS is the alist of previous
991 items, as returned by `org-list-prevs-alist'."
995 last-item))
998 "Return point at end of sub-list ITEM belongs.
999 STRUCT is the list structure. PREVS is the alist of previous
1000 items, as returned by `org-list-prevs-alist'."
1004 "Return the type of the list containing ITEM, as a symbol.
1006 STRUCT is the list structure. PREVS is the alist of previous
1007 items, as returned by `org-list-prevs-alist'.
1009 Possible types are `descriptive', `ordered' and `unordered'. The
1010 type is determined by the first item of the list."
1018 "Return ITEM's sequence number.
1020 STRUCT is the list structure. PREVS is the alist of previous
1021 items, as returned by `org-list-prevs-alist'. PARENTS is the
1022 alist of ancestors, as returned by `org-list-parents-alist'.
1024 Return value is a list of integers. Counters have an impact on
1025 that value."
1029 ;; Return relative sequence number of ITEM in the sub-list
1030 ;; it belongs. STRUCT is the list structure. PREVS is
1031 ;; the alist of previous items.
1040 seq))
1044 ;; Cons each parent relative number into return value (OUT).
1049 ;; Return value.
1050 out)))
1053 \f
1054 ;;; Searching
1057 "Search a string in valid contexts for lists.
1058 Arguments SEARCH, RE, BOUND and NOERR are similar to those used
1059 in `re-search-forward'."
1063 ;; 1. No match: return to origin or bound, depending on NOERR.
1066 nil)))
1067 ;; 2. Match in valid context: return point. Else, continue
1068 ;; searching.
1072 "Like `re-search-backward' but stop only where lists are recognized.
1073 Arguments REGEXP, BOUND and NOERROR are similar to those used in
1074 `re-search-backward'."
1079 "Like `re-search-forward' but stop only where lists are recognized.
1080 Arguments REGEXP, BOUND and NOERROR are similar to those used in
1081 `re-search-forward'."
1086 \f
1087 ;;; Methods on structures
1090 "Return BULLET with the correct number of whitespaces.
1091 It determines the number of whitespaces to append by looking at
1092 `org-list-two-spaces-after-bullet-regexp'."
1096 org-list-two-spaces-after-bullet-regexp bullet))
1097 " "
1101 bullet))))
1104 "Swap item starting at BEG-A with item starting at BEG-B in STRUCT.
1106 Blank lines at the end of items are left in place. Item
1107 visibility is preserved. Return the new structure after the
1108 changes.
1110 Assume BEG-A is lesser than BEG-B and that BEG-A and BEG-B belong
1111 to the same sub-list.
1113 This function modifies STRUCT."
1126 ;; Store overlays responsible for visibility status. We
1127 ;; also need to store their boundaries as they will be
1128 ;; removed from buffer.
1136 ;; 1. Move effectively items in buffer.
1140 ;; 2. Now modify struct. No need to re-read the list, the
1141 ;; transformation is just a shift of positions. Some special
1142 ;; attention is required for items ending at END-A and END-B
1143 ;; as empty spaces are not moved there. In others words,
1144 ;; item BEG-A will end with whitespaces that were at the end
1145 ;; of BEG-B and the same applies to BEG-B.
1167 struct)
1169 ;; Restore visibility status, by moving overlays to their new
1170 ;; position.
1182 ;; Return structure.
1183 struct)))
1186 "Return number of blank lines that should separate items in list.
1188 POS is the position of point where `org-list-insert-item' was called.
1190 STRUCT is the list structure. PREVS is the alist of previous
1191 items, as returned by `org-list-prevs-alist'.
1193 Assume point is at item's beginning. If the item is alone, apply
1194 some heuristics to guess the result."
1199 usr-blank
1203 ;; Count blank lines above beginning of line.
1210 ;; Trivial cases where there should be none.
1212 ;; When `org-blank-before-new-entry' says so, it is 1.
1214 ;; `plain-list-item' is 'auto. Count blank lines separating
1215 ;; neighbours items in list.
1218 ;; Is there a next item?
1221 ;; Is there a previous item?
1224 ;; User inserted blank lines, trust him.
1229 usr-blank)
1230 ;; Are there blank lines inside the list so far?
1233 ;; Do not use `org-list-search-forward' so blank lines
1234 ;; in blocks can be counted in.
1238 ;; Default choice: no blank line.
1242 "Insert a new list item at POS and return the new structure.
1243 If POS is before first character after bullet of the item, the
1244 new item will be created before the current one.
1246 STRUCT is the list structure. PREVS is the the alist of previous
1247 items, as returned by `org-list-prevs-alist'.
1249 Insert a checkbox if CHECKBOX is non-nil, and string AFTER-BULLET
1250 after the bullet. Cursor will be after this text once the
1251 function ends.
1253 This function modifies STRUCT."
1255 ;; 1. Get information about list: position of point with regards
1256 ;; to item start (BEFOREP), blank lines number separating items
1257 ;; (BLANK-NB), if we're allowed to (SPLIT-LINE-P).
1264 ;; Do not count tag in a non-descriptive list.
1272 pos struct prevs))
1273 ;; 2. Build the new item to be created. Concatenate same
1274 ;; bullet as item, checkbox, text AFTER-BULLET if
1275 ;; provided, and text cut from point to end of item
1276 ;; (TEXT-CUT) to form item's BODY. TEXT-CUT depends on
1277 ;; BEFOREP and SPLIT-LINE-P. The difference of size
1278 ;; between what was cut and what was inserted in buffer
1279 ;; is stored in SIZE-OFFSET.
1283 ind))
1290 ;; If POS is greater than ITEM-END, then point is
1291 ;; in some white lines after the end of the list.
1292 ;; Those must be removed, or they will be left,
1293 ;; stacking up after the list.
1303 text-cut))))
1307 ;; 4. Insert effectively item into buffer.
1311 ;; 5. Add new item to STRUCT.
1315 ;; Before inserted item, positions don't change but
1316 ;; an item ending after insertion has its end shifted
1317 ;; by SIZE-OFFSET.
1320 ;; Trivial cases where current item isn't split in
1321 ;; two. Just shift every item after new one by
1322 ;; ITEM-SIZE.
1326 ;; Item is split in two: elements before POS are just
1327 ;; shifted by ITEM-SIZE. In the case item would end
1328 ;; after split POS, ending is only shifted by
1329 ;; SIZE-OFFSET.
1335 ;; Elements after POS are moved into new item.
1336 ;; Length of ITEM-SEP has to be removed as ITEM-SEP
1337 ;; doesn't appear in buffer yet.
1343 (+ end size-offset
1345 ;; Elements at ITEM-END or after are only shifted by
1346 ;; SIZE-OFFSET.
1349 struct)
1352 ;; 6. If not BEFOREP, new item must appear after ITEM, so
1353 ;; exchange ITEM with the next item in list. Position cursor
1354 ;; after bullet, counter, checkbox, and label.
1360 struct)))
1363 "Remove ITEM from the list and return the new structure.
1365 STRUCT is the list structure."
1368 ;; If ITEM ends with the list, delete blank lines
1369 ;; before it.
1374 item)))
1375 ;; Remove item from buffer.
1377 ;; Remove item from structure and shift others items accordingly.
1378 ;; Don't forget to shift also ending position when appropriate.
1396 struct)))))
1399 "Send ITEM to destination DEST.
1401 STRUCT is the list structure.
1403 DEST can have various values.
1405 If DEST is a buffer position, the function will assume it points
1406 to another item in the same list as ITEM, and will move the
1407 latter just before the former.
1409 If DEST is `begin' (respectively `end'), ITEM will be moved at
1410 the beginning (respectively end) of the list it belongs to.
1413 be moved at the Nth position in the list.
1415 If DEST is `kill', ITEM will be deleted and its body will be
1416 added to the kill-ring.
1418 If DEST is `delete', ITEM will be deleted.
1420 Visibility of item is preserved.
1422 This function returns, destructively, the new list structure."
1425 ;; Grab full item body minus its bullet.
1434 item-end)))
1435 ;; Change DEST into a buffer position. A trick is needed
1436 ;; when ITEM is meant to be sent at the end of the list.
1437 ;; Indeed, by setting locally `org-M-RET-may-split-line' to
1438 ;; nil and insertion point (INS-POINT) to the first line's
1439 ;; end of the last item, we ensure the new item will be
1440 ;; inserted after the last item, and not after any of its
1441 ;; hypothetical sub-items.
1457 ;; Send ITEM at the end of the list.
1465 ;; Store visibility.
1475 ;; 1. Structure returned by `org-list-insert-item' may not be
1476 ;; accurate, as it cannot see sub-items included in BODY.
1477 ;; Thus, first compute the real structure so far.
1485 ;; 1.1. Remove the item just created in structure.
1487 ;; 1.2. Copy ITEM and any of its sub-items at NEW-ITEM.
1490 struct
1498 new-end
1500 moved-items))
1502 ;; 2. Restore visibility.
1507 visibility)
1508 ;; 3. Eventually delete extra copy of the item and clean marker.
1514 "Outdent items between positions START and END.
1516 STRUCT is the list structure. PARENTS is the alist of items'
1517 parents, as returned by `org-list-parents-alist'.
1519 START is included, END excluded."
1525 ;; Item not yet in zone: keep association.
1527 ;; Item out of zone: follow associations in ACC.
1531 ;; Item has no parent: error
1534 ;; Parent is outdented: keep association.
1538 ;; Parent isn't outdented: reparent to grand-parent.
1540 parent struct parents)))
1546 "Indent items between positions START and END.
1548 STRUCT is the list structure. PARENTS is the alist of parents
1549 and PREVS is the alist of previous items, returned by,
1550 respectively, `org-list-parents-alist' and
1551 `org-list-prevs-alist'.
1553 START is included and END excluded.
1555 STRUCT may be modified if `org-list-demote-modify-bullet' matches
1556 bullets between START and END."
1564 ;; Normalize ordered bullets.
1574 org-list-demote-modify-bullet))))
1581 ;; Item not yet in zone: keep association.
1584 ;; Item out of zone: follow associations in ACC.
1588 ;; Item is in zone...
1590 ;; Check if bullet needs to be changed.
1593 ;; First item indented but not parent: error
1596 ;; First item and parent indented: keep same
1597 ;; parent.
1599 ;; Previous item not indented: reparent to it.
1601 ;; Previous item indented: reparent like it.
1608 \f
1609 ;;; Repairing structures
1612 "Non-nil if list starting at FIRST can have alphabetical bullets.
1614 STRUCT is list structure. PREVS is the alist of previous items,
1615 as returned by `org-list-prevs-alist'."
1619 ;; Pretend that bullets are uppercase and check if alphabet
1620 ;; is sufficient, taking counters into account.
1624 ;; Virtually determine current bullet
1626 ;; Counters are not case-sensitive.
1629 ;; Test if bullet would be over z or Z.
1633 ;; All items checked. All good.
1634 t))))
1637 "Increment BULLET if applicable."
1640 ;; Num bullet: increment it.
1644 nil nil bullet))
1645 ;; Alpha bullet: increment it.
1649 nil nil bullet))
1650 ;; Unordered bullet: leave it.
1654 "Verify and correct bullets in STRUCT.
1655 PREVS is the alist of previous items, as returned by
1656 `org-list-prevs-alist'.
1658 This function modifies STRUCT."
1662 ;; Set bullet of ITEM in STRUCT, depending on the type of
1663 ;; first item of the list, the previous bullet and counter
1664 ;; if any.
1673 item struct
1676 ;; Alpha counter in alpha list: use counter.
1680 ;; Use cond to be sure `string-match' is used in
1681 ;; both cases.
1687 ;; Num counter in a num list: use counter.
1692 ;; No counter: increase, if needed, previous bullet.
1695 ;; Alpha counter at first item: use counter.
1704 ;; Num counter at first item: use counter.
1709 ;; First bullet is alpha uppercase: use "A".
1712 ;; First bullet is alpha lowercase: use "a".
1715 ;; First bullet is num: use "1".
1718 ;; Not an ordered list: keep bullet.
1723 "Verify and correct indentation in STRUCT.
1725 PARENTS is the alist of parents, as returned by
1726 `org-list-parents-alist'.
1728 If numeric optional argument BULLET-SIZE is set, assume all
1729 bullets in list have this length to determine new indentation.
1731 This function modifies STRUCT."
1738 ;; Indent like parent + length of parent's bullet +
1739 ;; sub-list offset.
1745 org-list-indent-offset))
1746 ;; If no parent, indent like top-point.
1751 "Verify and correct checkboxes in STRUCT.
1753 PARENTS is the alist of parents and PREVS is the alist of
1754 previous items, as returned by, respectively,
1755 `org-list-parents-alist' and `org-list-prevs-alist'.
1757 If ORDERED is non-nil, a checkbox can only be checked when every
1758 checkbox before it is checked too. If there was an attempt to
1759 break this rule, the function will return the blocking item. In
1760 all others cases, the return value will be nil.
1762 This function modifies STRUCT."
1772 item struct
1778 ;; Parent has no boxed child: leave box as-is.
1780 parent-list)
1781 ;; 1. List all parents with a checkbox.
1788 all-items)
1789 ;; 2. Sort those parents by decreasing indentation.
1794 ;; 3. For each parent, get all children's checkboxes to determine
1795 ;; and set its checkbox accordingly.
1797 ;; 4. If ORDERED is set, see if we need to uncheck some boxes.
1802 ;; There are boxes checked after an unchecked one: fix that.
1809 ;; Verify once again the structure, without ORDERED.
1811 ;; Return blocking item.
1815 "Verify and correct each item end position in STRUCT.
1817 This function modifies STRUCT."
1824 ;; To determine real ind of an ending position that is
1825 ;; not at an item, we have to find the item it belongs
1826 ;; to: it is the last item (ITEM-UP), whose ending is
1827 ;; further than the position we're interested in.
1830 ;; Else part is for the bottom point.
1832 end-pos)
1833 end-list)))
1836 struct)
1841 "Apply set difference between STRUCT and OLD-STRUCT to the buffer.
1843 OLD-STRUCT is the structure before any modifications, and STRUCT
1844 the structure to be applied. The function will only modify parts
1845 of the list which have changed.
1847 Initial position of cursor is restored after the changes."
1854 ;; Shift the indentation between END and BEG by DELTA. If
1855 ;; MAX-IND is non-nil, ensure that no line will be indented
1856 ;; more than that number. Start from the line before END.
1865 ;; Skip inline tasks.
1868 ;; Shift only non-empty lines.
1876 ;; Replace ITEM first line elements with new elements from
1877 ;; STRUCT, if appropriate.
1887 ;; a. Replace bullet
1890 ;; b. Replace checkbox.
1901 ;; c. Indent item to appropriate column.
1906 ;; 1. First get list of items and position endings. We maintain
1907 ;; two alists: ITM-SHIFT, determining indentation shift needed
1908 ;; at item, and END-LIST, a pseudo-alist where key is ending
1909 ;; position and value point.
1922 ;; To determine real ind of an ending position that
1923 ;; is not at an item, we have to find the item it
1924 ;; belongs to: it is the last item (ITEM-UP), whose
1925 ;; ending is further than the position we're
1926 ;; interested in.
1930 ;; 2. Slice the items into parts that should be shifted by the
1931 ;; same amount of indentation. Each slice follow the pattern
1932 ;; (END BEG DELTA MAX-IND-OR-NIL). Slices are returned in
1933 ;; reverse order.
1936 '<))
1943 ;; If we're not at an item, there's a child of the item
1944 ;; point belongs to above. Make sure this slice isn't
1945 ;; moved within that child by specifying a maximum
1946 ;; indentation.
1950 org-list-indent-offset))))
1952 ;; 3. Shift each slice in buffer, provided delta isn't 0, from
1953 ;; end to beginning. Take a special action when beginning is
1954 ;; at item bullet.
1962 ;; 4. Go back to initial position and clean marker.
1967 "Correct bullets, checkboxes and indentation in list at point.
1969 STRUCT is the list structure. PARENTS is the alist of parents,
1970 as returned by `org-list-parents-alist'.
1972 When non-nil, optional argument OLD-STRUCT is the reference
1973 structure of the list. It should be provided whenever STRUCT
1974 doesn't correspond anymore to the real list in buffer."
1975 ;; Order of functions matters here: checkboxes and endings need
1976 ;; correct indentation to be set, and indentation needs correct
1977 ;; bullets.
1978 ;;
1979 ;; 0. Save a copy of structure before modifications
1981 ;; 1. Set a temporary, but coherent with PARENTS, indentation in
1982 ;; order to get items endings and bullets properly
1984 ;; 2. Fix each item end to get correct prevs alist.
1986 ;; 3. Get bullets right.
1989 ;; 4. Now get real indentation.
1991 ;; 5. Eventually fix checkboxes.
1993 ;; 6. Apply structure modifications to buffer.
1997 \f
1998 ;;; Misc Tools
2001 "Call FUNCTION on each item of the list at point.
2002 FUNCTION must be called with at least one argument: INIT-VALUE,
2003 that will contain the value returned by the function at the
2004 previous item, plus ARGS extra arguments.
2006 FUNCTION is applied on items in reverse order.
2008 As an example, \(org-apply-on-list \(lambda \(result\) \(1+ result\)\) 0\)
2009 will return the number of items in the current list.
2011 Sublists of the list are skipped. Cursor is always at the
2012 beginning of the item."
2024 value))
2027 "Set visibility of ITEM in STRUCT to VIEW.
2029 Possible values are: `folded', `children' or `subtree'. See
2030 `org-cycle' for more information."
2034 ;; Hide from eol
2036 item-end t)))
2038 ;; First show everything.
2040 ;; Then fold every child.
2045 children)))
2047 ;; Show everything
2052 "Return column at which body of ITEM should start."
2062 tcol))
2065 \f
2066 ;;; Interactive functions
2071 "Go to the beginning of the current item.
2072 Throw an error when not in a list."
2078 "Go to the beginning item of the current list or sublist.
2079 Throw an error when not in a list."
2090 "Go to the end of the current list or sublist.
2091 Throw an error when not in a list."
2102 "Go to the end of the current item.
2103 Throw an error when not in a list."
2113 "Move to the beginning of the previous item.
2114 Throw an error when not in a list. Also throw an error when at
2115 first item, unless `org-list-use-circular-motion' is non-nil."
2131 "Move to the beginning of the next item.
2132 Throw an error when not in a list. Also throw an error when at
2133 last item, unless `org-list-use-circular-motion' is non-nil."
2149 "Move the item at point down, i.e. swap with following item.
2150 Sub-items (items with larger indentation) are considered part of
2151 the item, so this really moves item trees."
2170 "Move the item at point up, i.e. swap with previous item.
2171 Sub-items (items with larger indentation) are considered part of
2172 the item, so this really moves item trees."
2189 "Insert a new item at the current level.
2190 If cursor is before first character after bullet of the item, the
2191 new item will be created before the current one.
2193 If CHECKBOX is non-nil, add a checkbox next to the bullet.
2195 Return t when things worked, nil when we are not in an item, or
2196 item is invisible."
2199 ;; If cursor isn't is a list or if list is invisible, return nil.
2207 ;; Timer list: delegate to `org-timer-item'.
2212 ;; If we're in a description list, ask for the new term.
2226 t)))))
2229 "Fix indentation, bullets and checkboxes is the list at point."
2237 "Cycle through the different itemize/enumerate bullets.
2238 This cycle the entire list level through the sequence:
2240 `-' -> `+' -> `*' -> `1.' -> `1)'
2242 If WHICH is a valid string, use that as the new bullet. If WHICH
2243 is an integer, 0 means `-', 1 means `+' etc. If WHICH is
2244 `previous', cycle backwards."
2264 ;; Compute list of possible bullets, depending on context.
2267 ;; *-bullets are not allowed at column 0.
2269 ;; Description items cannot be numbered.
2292 ;; Use a short variation of `org-list-write-struct' as there's
2293 ;; no need to go through all the steps.
2301 "Toggle the checkbox in the current line.
2302 With prefix arg TOGGLE-PRESENCE, add or remove checkboxes. With
2303 double prefix, set checkbox to [-].
2305 When there is an active region, toggle status or presence of the
2306 first checkbox there, and make every item inside have the same
2307 status or presence, respectively.
2309 If the cursor is in a headline, apply this to all checkbox items
2310 in the text below the heading, taking as reference the first item
2311 in subtree, ignoring drawers."
2315 block-item
2316 lim-up
2317 lim-down
2325 ;; In a region, start at first item in region.
2335 ;; On an heading, start at first item after drawers and
2336 ;; time-stamps (scheduled, etc.).
2348 ;; Just one item: set SINGLEP flag.
2354 ;; Determine the checkbox going to be applied to all items
2355 ;; within bounds.
2366 ;; When an item is found within bounds, grab the full list at
2367 ;; point structure, then: (1) set check-box of all its items
2368 ;; within bounds to REF-CHECKBOX, (2) fix check-boxes of the
2369 ;; whole list, (3) move point after the list.
2383 e struct
2384 ;; If there is no box at item, leave as-is
2385 ;; unless function was called with C-u prefix.
2388 ref-checkbox
2389 cur-box))))
2390 items-to-toggle)
2392 struct parents prevs orderedp))
2393 ;; Report some problems due to ORDERED status of subtree.
2394 ;; If only one box was being checked, throw an error, else,
2395 ;; only signal problems.
2399 "Checkbox blocked because of unchecked box at line %d"
2403 "Checkboxes were removed due to unchecked box at line %d"
2412 "Reset all checkboxes in an entry subtree."
2429 "Update the checkbox statistics in the current section.
2430 This will find all statistic cookies like [57%] and [6/12] and
2431 update them with the current numbers.
2433 With optional prefix argument ALL, do this for the whole buffer."
2437 (box-re "^[ \t]*\\([-+*]\\|\\([0-9]+\\|[A-Za-z]\\)[.)]\\)[ \t]+\\(?:\\[@\\(?:start:\\)?\\([0-9]+\\|[A-Za-z]\\)\\][ \t]*\\)?\\(\\[[- X]\\]\\)")
2449 ;; Return number of checked boxes and boxes of all types
2450 ;; in all structures in STRUCTS. If RECURSIVEP is
2451 ;; non-nil, also count boxes in sub-lists. If ITEM is
2452 ;; nil, count across the whole structure, else count only
2453 ;; across subtree whose ancestor is ITEM.
2470 items))))
2473 structs)
2476 cookies-list structs-bak box-num)
2478 ;; 1. Build an alist for each cookie found within BOUNDS. The
2479 ;; key will be position at beginning of cookie and values
2480 ;; ending position, format of cookie, and a cell whose car is
2481 ;; number of checked boxes to report, and cdr total number of
2482 ;; boxes.
2492 ;; Cookie is at an heading, but specifically for todo,
2493 ;; not for checkboxes: skip it.
2499 ;; Cookie is at an heading, but all lists before next
2500 ;; heading already have been read. Use data collected
2501 ;; in STRUCTS-BAK. This should only happen when
2502 ;; heading has more than one cookie on it.
2505 backup-end))
2507 ;; Cookie is at a fresh heading. Grab structure of
2508 ;; every list containing a checkbox between point and
2509 ;; next headline, and save them in STRUCTS-BAK.
2513 structs-bak nil)
2520 ;; Cookie is at an item, and we already have list
2521 ;; structure stored in STRUCTS-BAK.
2524 ;; Only lists in no special context are stored.
2527 ;; Cookie is at an item, but we need to compute list
2528 ;; structure.
2534 ;; Else, cookie found is at a wrong place. Skip it.
2536 cookies-list))))
2537 ;; 2. Apply alist to buffer, in reverse order so positions stay
2538 ;; unchanged after cookie modifications.
2553 cookies-list))))
2556 "Select the face for checkbox statistics.
2557 The face will be `org-done' when all relevant boxes are checked.
2558 Otherwise it will be `org-todo'."
2561 'org-checkbox-statistics-done
2565 'org-checkbox-statistics-done
2569 "Update checkbox statistics unless turned off by user.
2570 With an optional argument ALL, update them in the whole buffer."
2578 "Indent a local list item including its children.
2579 When number ARG is a negative, item will be outdented, otherwise
2580 it will be indented.
2582 If a region is active, all items inside will be moved.
2584 If NO-SUBTREE is non-nil, only indent the item itself, not its
2585 children.
2587 STRUCT is the list structure.
2589 Return t if successful."
2597 ;; Are we going to move the whole list?
2605 t))))
2606 ;; Determine begin and end points of zone to indent. If moving
2607 ;; more than one item, save them for subsequent moves.
2623 ;; Special case: moving top-item with indent rule.
2631 ;; Change bullet if necessary.
2637 ;; Shift every item by OFFSET and fix bullets. Then
2638 ;; apply changes to buffer.
2642 struct)
2645 ;; Forbidden move:
2647 ;; If only one item is moved, it mustn't have a child.
2651 ;; If a subtree or region is moved, the last item
2652 ;; of the subtree mustn't have a child.
2657 struct)))))
2660 ;; Normal shifting
2668 t)
2671 "Outdent a local list item, but not its children.
2672 If a region is active, all items inside will be moved."
2688 "Indent a local list item, but not its children.
2689 If a region is active, all items inside will be moved."
2705 "Outdent a local list item including its children.
2706 If a region is active, all items inside will be moved."
2722 "Indent a local list item including its children.
2723 If a region is active, all items inside will be moved."
2740 "Cycle levels of indentation of an empty item.
2741 The first run indents the item, if applicable. Subsequent runs
2742 outdent it at meaningful levels in the list. When done, item is
2743 put back at its original position with its original bullet.
2745 Return t at each successful move."
2751 ;; Accept empty items or if cycle has already started.
2762 ;; When in the middle of the cycle, try to outdent first. If
2763 ;; it fails, and point is still at initial position, indent.
2764 ;; Else, re-create it at its original position.
2773 ;; Break cycle
2775 ;; If a cycle is starting, remember indentation and bullet,
2776 ;; then try to indent. If it fails, try to outdent.
2782 t))))
2785 "Sort list items.
2786 The cursor may be at any item of the list that should be sorted.
2787 Sublists are not sorted. Checkboxes, if any, are ignored.
2789 Sorting can be alphabetically, numerically, by date/time as given
2790 by a time stamp, by a property or by priority.
2792 Comparing entries ignores case by default. However, with an
2793 optional argument WITH-CASE, the sorting considers case as well.
2795 The command prompts for the sorting type unless it has been given
2796 to the function through the SORTING-TYPE argument, which needs to
2797 be a character, \(?n ?N ?a ?A ?t ?T ?f ?F ?x ?X). Here is the
2798 detailed meaning of each character:
2800 n Numerically, by converting the beginning of the item to a number.
2801 a Alphabetically. Only the first line of item is checked.
2802 t By date/time, either the first active time stamp in the entry, if
2803 any, or by the first inactive one. In a timer list, sort the timers.
2806 Capital letters will reverse the sort order.
2808 If the SORTING-TYPE is ?f or ?F, then GETKEY-FUNC specifies
2809 a function to be called with point at the beginning of the
2810 record. It must return either a string or a number that should
2811 serve as the sorting key for that record. It will then use
2812 COMPARE-FUNC to compare entries.
2814 Sorting is done against the visible part of the headlines, it
2815 ignores hidden links."
2866 ;; If it is a timer list, convert timer to seconds
2883 value))
2887 next-record
2888 end-record
2889 value-to-sort
2890 nil
2891 sort-func)
2892 ;; Read and fix list again, as `sort-subr' probably destroyed
2893 ;; its structure.
2899 \f
2900 ;;; Send and receive lists
2903 "Parse the list at point and maybe DELETE it.
2905 Return a list whose car is a symbol of list type, among
2906 `ordered', `unordered' and `descriptive'. Then, each item is
2907 a list whose car is counter, and cdr are strings and other
2908 sub-lists. Inside strings, check-boxes are replaced by
2911 For example, the following list:
2913 1. first item
2914 + sub-item one
2915 + [X] sub-item two
2916 more text in first item
2917 2. [@3] last item
2919 will be parsed as:
2921 \(ordered
2923 \(unordered
2929 Point is left at list end."
2935 out
2936 parse-item ; for byte-compiler
2939 ;; Return text between BEG and END, trimmed, with
2940 ;; checkboxes replaced.
2951 text)))))
2954 ;; Return a list whose car is list type and cdr a list of
2955 ;; items' body.
2961 ;; Return a list containing counter of item, if any, text
2962 ;; and any sublist inside it.
2968 ;; Get counter number. For alphabetic counter, get
2969 ;; its position in the alphabet.
2980 ;; If item has a child, store text between bullet and
2981 ;; next child, then recursively parse all sublists. At
2982 ;; the end of each sublist, check for the presence of
2983 ;; text belonging to the original item.
2993 ;; Remove children from the list just parsed.
2995 ;; There is a chunk of text belonging to the
2996 ;; item if last child doesn't end where next
2997 ;; child starts or where item ends.
3001 body))))
3004 ;; Store output, take care of cursor position and deletion of
3005 ;; list, then return output.
3012 out))
3015 "Convert the plain list at point into a subtree."
3023 "Insert a radio list template appropriate for this major mode."
3027 name pos)
3038 "Send a transformed version of this list to the receiver position.
3039 With argument MAYBE, fail quietly if no transformation is defined
3040 for this list."
3062 beg txt)
3066 ;; Find the insertion place
3071 name
3085 "Trim line breaks in a list ITEM."
3089 "Convert a LIST parsed through `org-list-parse-list' to other formats.
3090 Valid parameters PARAMS are:
3092 :ustart String to start an unordered list
3093 :uend String to end an unordered list
3095 :ostart String to start an ordered list
3096 :oend String to end an ordered list
3098 :dstart String to start a descriptive list
3099 :dend String to end a descriptive list
3100 :dtstart String to start a descriptive term
3101 :dtend String to end a descriptive term
3102 :ddstart String to start a description
3103 :ddend String to end a description
3105 :splice When set to t, return only list body lines, don't wrap
3106 them into :[u/o]start and :[u/o]end. Default is nil.
3108 :istart String to start a list item.
3109 :icount String to start an item with a counter.
3110 :iend String to end a list item
3111 :isep String to separate items
3112 :lsep String to separate sublists
3113 :csep String to separate text from a sub-list
3115 :cboff String to insert for an unchecked check-box
3116 :cbon String to insert for a checked check-box
3117 :cbtrans String to insert for a check-box in transitional state
3119 :nobr Non-nil means remove line breaks in lists items.
3121 Alternatively, each parameter can also be a form returning
3122 a string. These sexp can use keywords `counter' and `depth',
3123 representing respectively counter associated to the current
3124 item, and depth of the current sub-list, starting at 0.
3125 Obviously, `counter' is only available for parameters applying to
3126 items."
3150 export-sublist ; for byte-compiler
3153 ;; Export an item ITEM of type TYPE, at DEPTH. First
3154 ;; string in item is treated in a special way as it can
3155 ;; bring extra information that needs to be processed.
3161 ;; Stick DTSTART to ISTART by
3162 ;; left-trimming the latter.
3166 istart))
3173 ;; Replace checkbox if any is found.
3181 ;; Replace line breaks if required
3183 ;; Insert descriptive term if TYPE is `descriptive'.
3192 first)))
3203 ;; Export sublist SUB at DEPTH.
3221 "Convert LIST into a LaTeX list.
3222 LIST is as string representing the list to transform, as Org
3223 syntax. Return converted list as a string."
3228 "Convert LIST into a HTML list.
3229 LIST is as string representing the list to transform, as Org
3230 syntax. Return converted list as a string."
3235 "Convert LIST into a Texinfo list.
3236 LIST is as string representing the list to transform, as Org
3237 syntax. Return converted list as a string."
3242 "Convert LIST into an Org subtree.
3243 LIST is as returned by `org-list-parse-list'. PARAMS is a property list
3244 with overruling parameters for `org-list-to-generic'."
3254 ;; Return the string for the heading, depending on depth D
3255 ;; of current sub-list.
3260 oddeven-level)
3261 ?*)
3264 list
3266 '(:splice t
3273 params))))
3277 ;;; org-list.el ends here