| blob | 3e307bed01a4a84828139370ebc9ea6391c6f273 |
1 ;;; org-list.el --- Plain lists for Org-mode
2 ;;
3 ;; Copyright (C) 2004-2014 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:
139 \f
140 ;;; Configuration variables
143 "Options concerning plain lists in Org-mode."
148 "When t, make TAB cycle visibility on plain list items.
149 Cycling plain lists works only when the cursor is on a plain list
150 item. When the cursor is on an outline heading, plain lists are
151 treated as text. This is the most stable way of handling this,
152 which is why it is the default.
154 When this is the symbol `integrate', then integrate plain list
155 items when cycling, as if they were children of outline headings.
157 This setting can lead to strange effects when switching visibility
160 plain list item with an implied large level number, all true
161 children and grand children of the outline heading will be
162 exposed in a children' view."
171 "Default bullet type installed when demoting an item.
172 This is an association list, for each bullet type, this alist will point
173 to the bullet that should be used when this item is demoted.
174 For example,
176 (setq org-list-demote-modify-bullet
179 will make
181 + Movies
182 + Silence of the Lambs
183 + My Cousin Vinny
184 + Books
185 + The Hunt for Red October
186 + The Road to Omaha
188 into
190 + Movies
191 - Silence of the Lambs
192 - My Cousin Vinny
193 + Books
194 - The Hunt for Red October
195 - The Road to Omaha"
213 "The character that makes a line with leading number an ordered list item.
214 Valid values are ?. and ?\). To get both terminators, use t."
223 "Non-nil means single character alphabetical bullets are allowed.
225 Both uppercase and lowercase are handled. Lists with more than
226 26 items will fallback to standard numbering. Alphabetical
229 This variable needs to be set before org.el is loaded. If you
230 need to make a change while Emacs is running, use the customize
231 interface or run the following code after updating it:
242 "A regular expression matching bullets that should have 2 spaces after them.
243 When nil, no bullet will have two spaces after them. When
244 a string, it will be used as a regular expression. When the
245 bullet type of a list is changed, the new bullet type will be
246 matched against this regexp. If it matches, there will be two
247 spaces instead of one after the bullet in each item of the list."
256 "Non-nil means an empty line ends all plain list levels.
257 Otherwise, two of them will be necessary."
263 "Non-nil means apply set of rules when acting on lists.
264 By default, automatic actions are taken when using
269 rules by setting them to nil. Valid rules are:
271 checkbox when non-nil, checkbox statistics is updated each time
272 you either insert a new checkbox or toggle a checkbox.
273 indent when non-nil, indenting or outdenting list top-item
274 with its subtree will move the whole list and
275 outdenting a list whose bullet is * to column 0 will
280 :key-type
284 :value-type
288 "Non-nil means commands implying motion in lists should be cyclic.
290 In that case, the item following the last item is the first one,
291 and the item preceding the first item is the last one.
301 "Hook that is run whenever Org thinks checkbox statistics should be updated.
302 This hook runs even if checkbox rule in
303 `org-list-automatic-rules' does not apply, so it can be used to
304 implement alternative ways of collecting statistics
310 "Non-nil means checkbox statistics counts only the state of direct children.
311 When nil, all boxes below the cookie are counted.
312 This can be set to nil on a per-node basis using a COOKIE_DATA property
320 "Maximum indentation for the second line of a description list.
321 When the indentation would be larger than this, it will become
322 5 characters instead."
327 "Additional indentation for sub-items in a list.
328 By setting this to a small number, usually 1 or 2, one can more
329 clearly distinguish sub-items in a list."
336 % END RECEIVE ORGLST %n
338 #+ORGLST: SEND %n org-list-to-latex
339 -
342 @c END RECEIVE ORGLST %n
343 @ignore
344 #+ORGLST: SEND %n org-list-to-texinfo
345 -
348 <!-- END RECEIVE ORGLST %n -->
349 <!--
350 #+ORGLST: SEND %n org-list-to-html
351 -
353 "Templates for radio lists in different major modes.
354 All occurrences of %n in a template will be replaced with the name of the
355 list, obtained by prompting the user."
363 "Names of blocks where lists are not allowed.
367 "Context types where lists will be interpreted during export.
369 Valid types are `drawer', `inlinetask' and `block'. More
370 specifically, type `block' is determined by the variable
374 \f
375 ;;; Predicates and regexps
379 "Regex corresponding to the end of a list.
387 "Matches a list item and puts everything into groups:
388 group 1: bullet
389 group 2: counter
390 group 3: checkbox
394 "Return the correct regular expression for plain lists."
405 "Regexp matching the beginning of a plain list item."
409 "Is point at a list item with REGEXP after bullet?"
418 ;; Ignore counter if any
423 "Is point in a context where lists are allowed?"
427 "Return item beginning position when in a plain list, nil otherwise."
436 ;; Indentation isn't meaningful when point starts at an empty
437 ;; line or an inline task.
440 10000
446 ;; Detect if cursor in amidst `org-list-end-re'. First, count
447 ;; number HL of hard lines it takes, then call `org-in-regexp'
448 ;; to compute its boundaries END-BOUNDS. When point is
449 ;; in-between, move cursor before regexp beginning.
460 ;; Look for an item, less indented that reference line.
465 ;; This is exactly what we want.
468 ;; At upper bound of search or looking at the end of a
469 ;; previous list: search is over.
472 ;; Skip blocks, drawers, inline-tasks, blank lines
482 ;; Text at column 0 cannot belong to a list: stop.
484 ;; Normal text less indented than reference line, take
485 ;; it as new reference.
492 "Is point in a line starting a hand-formatted item?"
498 "Is point at the bullet of a plain list item?"
504 "Is point at a line starting a plain list item with a timer?"
509 "Is point at a description list item?"
513 "Is point at a line starting a plain-list item with a checklet?"
517 "Is point at a line starting a plain-list item with a counter?"
523 \f
524 ;;; Structures and helper functions
527 "Determine context, and its boundaries, around point.
529 Context will be a cell like (MIN MAX CONTEXT) where MIN and MAX
530 are boundaries and CONTEXT is a symbol among `drawer', `block',
531 `invalid', `inlinetask' and nil.
533 Contexts `block' and `invalid' refer to `org-list-forbidden-blocks'."
539 ;; Get positions of surrounding headings. This is the
540 ;; default context.
545 ;; Is point inside a drawer?
555 lim-down))
558 ;; Is point strictly in a block, and of which type?
569 lim-down))
575 ;; Is point in an inlinetask?
588 ;; Return context boundaries and type.
592 "Return structure of list at point.
594 A list structure is an alist where key is point at item, and
595 values are:
596 1. indentation,
597 2. bullet with trailing whitespace,
598 3. bullet counter, if any,
599 4. checkbox, if any,
600 5. description tag, if any,
601 6. position at item end.
603 Thus the following list, where numbers in parens are
604 point-at-bol:
606 - [X] first item (1)
607 1. sub-item 1 (18)
608 5. [@5] sub-item 2 (34)
609 some other text belonging to first item (55)
610 - last item (97)
611 + tag :: description (109)
612 (131)
614 will get the following structure:
622 Assume point is at an item."
634 ind itm-lst itm-lst-2 end-lst end-lst-2 struct
637 ;; Return association at point.
642 ind
643 bullet
646 ;; Description tag.
651 ;; Ensure list ends at the first blank line.
655 ;; 1. Read list from starting item to its beginning, and save
656 ;; top item position and indentation in BEG-CELL. Also store
657 ;; ending position of items in END-LST.
664 ;; At upward limit: if we ended at an item, store it,
665 ;; else dismiss useless data recorded above BEG-CELL.
666 ;; Jump to part 2.
673 ;; Looking at a list ending regexp. Dismiss useless
674 ;; data recorded above BEG-CELL. Jump to part 2.
679 ;; Point is at an item. Add data to ITM-LST. It may
680 ;; also end a previous item: save it in END-LST. If
681 ;; ind is less or equal than BEG-CELL and there is no
682 ;; end at this ind or lesser, this item becomes the new
683 ;; BEG-CELL.
689 ;; Skip blocks, drawers, inline tasks, blank lines.
700 ;; From there, point is not at an item. Interpret
701 ;; line's indentation:
702 ;; - text at column 0 is necessarily out of any list.
703 ;; Dismiss data recorded above BEG-CELL. Jump to
704 ;; part 2.
705 ;; - any other case may be an ending position for an
706 ;; hypothetical item above. Store it and proceed.
715 ;; 2. Read list from starting point to its end, that is until we
716 ;; get out of context, or that a non-item line is less or
717 ;; equally indented than BEG-CELL's cdr. Also, store ending
718 ;; position of items in END-LST-2.
724 ;; At downward limit: this is de facto the end of the
725 ;; list. Save point as an ending position, and jump to
726 ;; part 3.
729 ;; Looking at a list ending regexp. Save point as an
730 ;; ending position and jump to part 3.
734 ;; Point is at an item. Add data to ITM-LST-2. It may
735 ;; also end a previous item, so save it in END-LST-2.
739 ;; Skip inline tasks and blank lines along the way
744 ;; Ind is lesser or equal than BEG-CELL's. The list is
745 ;; over: store point as an ending position and jump to
746 ;; part 3.
750 ;; Else, if ind is lesser or equal than previous item's,
751 ;; this is an ending position: store it. In any case,
752 ;; skip block or drawer at point, and move to next line.
764 ;; 3. Associate each item to its end position.
766 ;; 4. Return STRUCT
767 struct)))
770 "Associate proper ending point to items in STRUCT.
772 END-LIST is a pseudo-alist where car is indentation and cdr is
773 ending position.
775 This function modifies STRUCT."
781 ;; Remove end candidates behind current item.
784 ;; Add end position to item assoc.
790 struct)))
793 "Return alist between item and previous item in STRUCT."
795 struct)))
799 struct)))
802 "Return alist between item and parent in STRUCT."
814 ;; A sub-list is over. Find the associated
815 ;; origin in IND-TO-ORI. If it cannot be
816 ;; found (ill-formed list), set its parent as
817 ;; the first item less indented. If there is
818 ;; none, make it a top-level item.
826 ind-to-ori)
829 ;; A sub-list starts. Every item at IND will
830 ;; have previous item as its parent.
835 ;; Another item in the same sub-list: it shares
836 ;; the same parent as the previous item.
841 \f
842 ;;; Accessors
845 "Return the Nth value of KEY in STRUCT."
849 "Set the Nth value of KEY in STRUCT to NEW.
854 "Return indentation of ITEM in STRUCT."
858 "Set indentation of ITEM in STRUCT to IND.
863 "Return bullet of ITEM in STRUCT."
867 "Set bullet of ITEM in STRUCT to BULLET.
872 "Return counter of ITEM in STRUCT."
876 "Return checkbox of ITEM in STRUCT or nil."
880 "Set checkbox of ITEM in STRUCT to CHECKBOX.
885 "Return end position of ITEM in STRUCT."
889 "Return end position of ITEM in STRUCT."
893 "Return point at end of ITEM in STRUCT, before any blank line.
894 Point returned is at end of line."
901 "Return parent of ITEM or nil.
902 STRUCT is the list structure. PARENTS is the alist of parents,
903 as returned by `org-list-parents-alist'."
908 "Non-nil if ITEM has a child.
910 STRUCT is the list structure.
912 Value returned is the position of the first child of ITEM."
917 child-maybe)))
920 "Return next item in same sub-list as ITEM, or nil.
921 STRUCT is the list structure. PREVS is the alist of previous
922 items, as returned by `org-list-prevs-alist'."
926 "Return previous item in same sub-list as ITEM, or nil.
927 STRUCT is the list structure. PREVS is the alist of previous
928 items, as returned by `org-list-prevs-alist'."
932 "List all items having ITEM as a common ancestor, or nil.
933 STRUCT is the list structure."
936 subtree)
941 sub-struct))
945 "List all items in the same sub-list as ITEM.
946 STRUCT is the list structure. PREVS is the alist of previous
947 items, as returned by `org-list-prevs-alist'."
950 before-item after-item)
958 "List all children of ITEM, or nil.
959 STRUCT is the list structure. PARENTS is the alist of parents,
960 as returned by `org-list-parents-alist'."
968 "Return point at beginning of list.
969 STRUCT is the list structure."
973 "Return point at bottom of list.
974 STRUCT is the list structure."
979 "Return point at beginning of sub-list ITEM belongs.
980 STRUCT is the list structure. PREVS is the alist of previous
981 items, as returned by `org-list-prevs-alist'."
985 first-item))
990 "Return point at last item of sub-list ITEM belongs.
991 STRUCT is the list structure. PREVS is the alist of previous
992 items, as returned by `org-list-prevs-alist'."
996 last-item))
999 "Return point at end of sub-list ITEM belongs.
1000 STRUCT is the list structure. PREVS is the alist of previous
1001 items, as returned by `org-list-prevs-alist'."
1005 "Return the type of the list containing ITEM, as a symbol.
1007 STRUCT is the list structure. PREVS is the alist of previous
1008 items, as returned by `org-list-prevs-alist'.
1010 Possible types are `descriptive', `ordered' and `unordered'. The
1011 type is determined by the first item of the list."
1019 "Return ITEM's sequence number.
1021 STRUCT is the list structure. PREVS is the alist of previous
1022 items, as returned by `org-list-prevs-alist'. PARENTS is the
1023 alist of ancestors, as returned by `org-list-parents-alist'.
1025 Return value is a list of integers. Counters have an impact on
1026 that value."
1030 ;; Return relative sequence number of ITEM in the sub-list
1031 ;; it belongs. STRUCT is the list structure. PREVS is
1032 ;; the alist of previous items.
1041 seq))
1045 ;; Cons each parent relative number into return value (OUT).
1050 ;; Return value.
1051 out)))
1054 \f
1055 ;;; Searching
1058 "Search a string in valid contexts for lists.
1059 Arguments SEARCH, RE, BOUND and NOERR are similar to those used
1060 in `re-search-forward'."
1064 ;; 1. No match: return to origin or bound, depending on NOERR.
1067 nil)))
1068 ;; 2. Match in valid context: return point. Else, continue
1069 ;; searching.
1073 "Like `re-search-backward' but stop only where lists are recognized.
1074 Arguments REGEXP, BOUND and NOERROR are similar to those used in
1075 `re-search-backward'."
1080 "Like `re-search-forward' but stop only where lists are recognized.
1081 Arguments REGEXP, BOUND and NOERROR are similar to those used in
1082 `re-search-forward'."
1087 \f
1088 ;;; Methods on structures
1091 "Return BULLET with the correct number of whitespaces.
1092 It determines the number of whitespaces to append by looking at
1093 `org-list-two-spaces-after-bullet-regexp'."
1097 org-list-two-spaces-after-bullet-regexp bullet))
1098 " "
1102 bullet))))
1105 "Swap item starting at BEG-A with item starting at BEG-B in STRUCT.
1107 Blank lines at the end of items are left in place. Item
1108 visibility is preserved. Return the new structure after the
1109 changes.
1111 Assume BEG-A is lesser than BEG-B and that BEG-A and BEG-B belong
1112 to the same sub-list.
1114 This function modifies STRUCT."
1127 ;; Store overlays responsible for visibility status. We
1128 ;; also need to store their boundaries as they will be
1129 ;; removed from buffer.
1137 ;; 1. Move effectively items in buffer.
1141 ;; 2. Now modify struct. No need to re-read the list, the
1142 ;; transformation is just a shift of positions. Some special
1143 ;; attention is required for items ending at END-A and END-B
1144 ;; as empty spaces are not moved there. In others words,
1145 ;; item BEG-A will end with whitespaces that were at the end
1146 ;; of BEG-B and the same applies to BEG-B.
1168 struct)
1170 ;; Restore visibility status, by moving overlays to their new
1171 ;; position.
1183 ;; Return structure.
1184 struct)))
1187 "Return number of blank lines that should separate items in list.
1189 POS is the position of point where `org-list-insert-item' was called.
1191 STRUCT is the list structure. PREVS is the alist of previous
1192 items, as returned by `org-list-prevs-alist'.
1194 Assume point is at item's beginning. If the item is alone, apply
1195 some heuristics to guess the result."
1200 usr-blank
1204 ;; Count blank lines above beginning of line.
1211 ;; Trivial cases where there should be none.
1213 ;; When `org-blank-before-new-entry' says so, it is 1.
1215 ;; `plain-list-item' is 'auto. Count blank lines separating
1216 ;; neighbors' items in list.
1219 ;; Is there a next item?
1222 ;; Is there a previous item?
1225 ;; User inserted blank lines, trust him.
1230 usr-blank)
1231 ;; Are there blank lines inside the list so far?
1234 ;; Do not use `org-list-search-forward' so blank lines
1235 ;; in blocks can be counted in.
1239 ;; Default choice: no blank line.
1243 "Insert a new list item at POS and return the new structure.
1244 If POS is before first character after bullet of the item, the
1245 new item will be created before the current one.
1247 STRUCT is the list structure. PREVS is the the alist of previous
1248 items, as returned by `org-list-prevs-alist'.
1250 Insert a checkbox if CHECKBOX is non-nil, and string AFTER-BULLET
1251 after the bullet. Cursor will be after this text once the
1252 function ends.
1254 This function modifies STRUCT."
1256 ;; 1. Get information about list: position of point with regards
1257 ;; to item start (BEFOREP), blank lines number separating items
1258 ;; (BLANK-NB), if we're allowed to (SPLIT-LINE-P).
1265 ;; Do not count tag in a non-descriptive list.
1273 pos struct prevs))
1274 ;; 2. Build the new item to be created. Concatenate same
1275 ;; bullet as item, checkbox, text AFTER-BULLET if
1276 ;; provided, and text cut from point to end of item
1277 ;; (TEXT-CUT) to form item's BODY. TEXT-CUT depends on
1278 ;; BEFOREP and SPLIT-LINE-P. The difference of size
1279 ;; between what was cut and what was inserted in buffer
1280 ;; is stored in SIZE-OFFSET.
1284 ind))
1291 ;; If POS is greater than ITEM-END, then point is
1292 ;; in some white lines after the end of the list.
1293 ;; Those must be removed, or they will be left,
1294 ;; stacking up after the list.
1304 text-cut))))
1308 ;; 4. Insert effectively item into buffer.
1312 ;; 5. Add new item to STRUCT.
1316 ;; Before inserted item, positions don't change but
1317 ;; an item ending after insertion has its end shifted
1318 ;; by SIZE-OFFSET.
1321 ;; Trivial cases where current item isn't split in
1322 ;; two. Just shift every item after new one by
1323 ;; ITEM-SIZE.
1327 ;; Item is split in two: elements before POS are just
1328 ;; shifted by ITEM-SIZE. In the case item would end
1329 ;; after split POS, ending is only shifted by
1330 ;; SIZE-OFFSET.
1336 ;; Elements after POS are moved into new item.
1337 ;; Length of ITEM-SEP has to be removed as ITEM-SEP
1338 ;; doesn't appear in buffer yet.
1344 (+ end size-offset
1346 ;; Elements at ITEM-END or after are only shifted by
1347 ;; SIZE-OFFSET.
1350 struct)
1353 ;; 6. If not BEFOREP, new item must appear after ITEM, so
1354 ;; exchange ITEM with the next item in list. Position cursor
1355 ;; after bullet, counter, checkbox, and label.
1361 struct)))
1364 "Remove ITEM from the list and return the new structure.
1366 STRUCT is the list structure."
1369 ;; If ITEM ends with the list, delete blank lines
1370 ;; before it.
1375 item)))
1376 ;; Remove item from buffer.
1378 ;; Remove item from structure and shift others items accordingly.
1379 ;; Don't forget to shift also ending position when appropriate.
1397 struct)))))
1400 "Send ITEM to destination DEST.
1402 STRUCT is the list structure.
1404 DEST can have various values.
1406 If DEST is a buffer position, the function will assume it points
1407 to another item in the same list as ITEM, and will move the
1408 latter just before the former.
1410 If DEST is `begin' (respectively `end'), ITEM will be moved at
1411 the beginning (respectively end) of the list it belongs to.
1414 be moved at the Nth position in the list.
1416 If DEST is `kill', ITEM will be deleted and its body will be
1417 added to the kill-ring.
1419 If DEST is `delete', ITEM will be deleted.
1421 Visibility of item is preserved.
1423 This function returns, destructively, the new list structure."
1426 ;; Grab full item body minus its bullet.
1435 item-end)))
1436 ;; Change DEST into a buffer position. A trick is needed
1437 ;; when ITEM is meant to be sent at the end of the list.
1438 ;; Indeed, by setting locally `org-M-RET-may-split-line' to
1439 ;; nil and insertion point (INS-POINT) to the first line's
1440 ;; end of the last item, we ensure the new item will be
1441 ;; inserted after the last item, and not after any of its
1442 ;; hypothetical sub-items.
1458 ;; Send ITEM at the end of the list.
1466 ;; Store visibility.
1476 ;; 1. Structure returned by `org-list-insert-item' may not be
1477 ;; accurate, as it cannot see sub-items included in BODY.
1478 ;; Thus, first compute the real structure so far.
1486 ;; 1.1. Remove the item just created in structure.
1488 ;; 1.2. Copy ITEM and any of its sub-items at NEW-ITEM.
1491 struct
1499 new-end
1501 moved-items))
1503 ;; 2. Restore visibility.
1508 visibility)
1509 ;; 3. Eventually delete extra copy of the item and clean marker.
1515 "Outdent items between positions START and END.
1517 STRUCT is the list structure. PARENTS is the alist of items'
1518 parents, as returned by `org-list-parents-alist'.
1520 START is included, END excluded."
1526 ;; Item not yet in zone: keep association.
1528 ;; Item out of zone: follow associations in ACC.
1532 ;; Item has no parent: error
1535 ;; Parent is outdented: keep association.
1539 ;; Parent isn't outdented: reparent to grand-parent.
1541 parent struct parents)))
1547 "Indent items between positions START and END.
1549 STRUCT is the list structure. PARENTS is the alist of parents
1550 and PREVS is the alist of previous items, returned by,
1551 respectively, `org-list-parents-alist' and
1552 `org-list-prevs-alist'.
1554 START is included and END excluded.
1556 STRUCT may be modified if `org-list-demote-modify-bullet' matches
1557 bullets between START and END."
1565 ;; Normalize ordered bullets.
1575 org-list-demote-modify-bullet))))
1582 ;; Item not yet in zone: keep association.
1585 ;; Item out of zone: follow associations in ACC.
1589 ;; Item is in zone...
1591 ;; Check if bullet needs to be changed.
1594 ;; First item indented but not parent: error
1597 ;; First item and parent indented: keep same
1598 ;; parent.
1600 ;; Previous item not indented: reparent to it.
1602 ;; Previous item indented: reparent like it.
1609 \f
1610 ;;; Repairing structures
1613 "Non-nil if list starting at FIRST can have alphabetical bullets.
1615 STRUCT is list structure. PREVS is the alist of previous items,
1616 as returned by `org-list-prevs-alist'."
1620 ;; Pretend that bullets are uppercase and check if alphabet
1621 ;; is sufficient, taking counters into account.
1625 ;; Virtually determine current bullet
1627 ;; Counters are not case-sensitive.
1630 ;; Test if bullet would be over z or Z.
1634 ;; All items checked. All good.
1635 t))))
1638 "Increment BULLET if applicable."
1641 ;; Num bullet: increment it.
1645 nil nil bullet))
1646 ;; Alpha bullet: increment it.
1650 nil nil bullet))
1651 ;; Unordered bullet: leave it.
1655 "Verify and correct bullets in STRUCT.
1656 PREVS is the alist of previous items, as returned by
1657 `org-list-prevs-alist'.
1659 This function modifies STRUCT."
1663 ;; Set bullet of ITEM in STRUCT, depending on the type of
1664 ;; first item of the list, the previous bullet and counter
1665 ;; if any.
1674 item struct
1677 ;; Alpha counter in alpha list: use counter.
1681 ;; Use cond to be sure `string-match' is used in
1682 ;; both cases.
1688 ;; Num counter in a num list: use counter.
1693 ;; No counter: increase, if needed, previous bullet.
1696 ;; Alpha counter at first item: use counter.
1705 ;; Num counter at first item: use counter.
1710 ;; First bullet is alpha uppercase: use "A".
1713 ;; First bullet is alpha lowercase: use "a".
1716 ;; First bullet is num: use "1".
1719 ;; Not an ordered list: keep bullet.
1724 "Verify and correct indentation in STRUCT.
1726 PARENTS is the alist of parents, as returned by
1727 `org-list-parents-alist'.
1729 If numeric optional argument BULLET-SIZE is set, assume all
1730 bullets in list have this length to determine new indentation.
1732 This function modifies STRUCT."
1739 ;; Indent like parent + length of parent's bullet +
1740 ;; sub-list offset.
1746 org-list-indent-offset))
1747 ;; If no parent, indent like top-point.
1752 "Verify and correct checkboxes in STRUCT.
1754 PARENTS is the alist of parents and PREVS is the alist of
1755 previous items, as returned by, respectively,
1756 `org-list-parents-alist' and `org-list-prevs-alist'.
1758 If ORDERED is non-nil, a checkbox can only be checked when every
1759 checkbox before it is checked too. If there was an attempt to
1760 break this rule, the function will return the blocking item. In
1761 all others cases, the return value will be nil.
1763 This function modifies STRUCT."
1773 item struct
1779 ;; Parent has no boxed child: leave box as-is.
1781 parent-list)
1782 ;; 1. List all parents with a checkbox.
1789 all-items)
1790 ;; 2. Sort those parents by decreasing indentation.
1795 ;; 3. For each parent, get all children's checkboxes to determine
1796 ;; and set its checkbox accordingly.
1798 ;; 4. If ORDERED is set, see if we need to uncheck some boxes.
1803 ;; There are boxes checked after an unchecked one: fix that.
1810 ;; Verify once again the structure, without ORDERED.
1812 ;; Return blocking item.
1816 "Verify and correct each item end position in STRUCT.
1818 This function modifies STRUCT."
1825 ;; To determine real ind of an ending position that is
1826 ;; not at an item, we have to find the item it belongs
1827 ;; to: it is the last item (ITEM-UP), whose ending is
1828 ;; further than the position we're interested in.
1831 ;; Else part is for the bottom point.
1833 end-pos)
1834 end-list)))
1837 struct)
1842 "Apply set difference between STRUCT and OLD-STRUCT to the buffer.
1844 OLD-STRUCT is the structure before any modifications, and STRUCT
1845 the structure to be applied. The function will only modify parts
1846 of the list which have changed.
1848 Initial position of cursor is restored after the changes."
1855 ;; Shift the indentation between END and BEG by DELTA. If
1856 ;; MAX-IND is non-nil, ensure that no line will be indented
1857 ;; more than that number. Start from the line before END.
1866 ;; Skip inline tasks.
1869 ;; Shift only non-empty lines.
1877 ;; Replace ITEM first line elements with new elements from
1878 ;; STRUCT, if appropriate.
1888 ;; a. Replace bullet
1891 ;; b. Replace checkbox.
1902 ;; c. Indent item to appropriate column.
1907 ;; 1. First get list of items and position endings. We maintain
1908 ;; two alists: ITM-SHIFT, determining indentation shift needed
1909 ;; at item, and END-LIST, a pseudo-alist where key is ending
1910 ;; position and value point.
1923 ;; To determine real ind of an ending position that
1924 ;; is not at an item, we have to find the item it
1925 ;; belongs to: it is the last item (ITEM-UP), whose
1926 ;; ending is further than the position we're
1927 ;; interested in.
1931 ;; 2. Slice the items into parts that should be shifted by the
1932 ;; same amount of indentation. Each slice follow the pattern
1933 ;; (END BEG DELTA MAX-IND-OR-NIL). Slices are returned in
1934 ;; reverse order.
1937 '<))
1944 ;; If we're not at an item, there's a child of the item
1945 ;; point belongs to above. Make sure this slice isn't
1946 ;; moved within that child by specifying a maximum
1947 ;; indentation.
1951 org-list-indent-offset))))
1953 ;; 3. Shift each slice in buffer, provided delta isn't 0, from
1954 ;; end to beginning. Take a special action when beginning is
1955 ;; at item bullet.
1963 ;; 4. Go back to initial position and clean marker.
1968 "Correct bullets, checkboxes and indentation in list at point.
1970 STRUCT is the list structure. PARENTS is the alist of parents,
1971 as returned by `org-list-parents-alist'.
1973 When non-nil, optional argument OLD-STRUCT is the reference
1974 structure of the list. It should be provided whenever STRUCT
1975 doesn't correspond anymore to the real list in buffer."
1976 ;; Order of functions matters here: checkboxes and endings need
1977 ;; correct indentation to be set, and indentation needs correct
1978 ;; bullets.
1979 ;;
1980 ;; 0. Save a copy of structure before modifications
1982 ;; 1. Set a temporary, but coherent with PARENTS, indentation in
1983 ;; order to get items endings and bullets properly
1985 ;; 2. Fix each item end to get correct prevs alist.
1987 ;; 3. Get bullets right.
1990 ;; 4. Now get real indentation.
1992 ;; 5. Eventually fix checkboxes.
1994 ;; 6. Apply structure modifications to buffer.
1998 \f
1999 ;;; Misc Tools
2002 "Call FUNCTION on each item of the list at point.
2003 FUNCTION must be called with at least one argument: INIT-VALUE,
2004 that will contain the value returned by the function at the
2005 previous item, plus ARGS extra arguments.
2007 FUNCTION is applied on items in reverse order.
2009 As an example, \(org-apply-on-list \(lambda \(result\) \(1+ result\)\) 0\)
2010 will return the number of items in the current list.
2012 Sublists of the list are skipped. Cursor is always at the
2013 beginning of the item."
2025 value))
2028 "Set visibility of ITEM in STRUCT to VIEW.
2030 Possible values are: `folded', `children' or `subtree'. See
2031 `org-cycle' for more information."
2035 ;; Hide from eol
2037 item-end t)))
2039 ;; First show everything.
2041 ;; Then fold every child.
2046 children)))
2048 ;; Show everything
2053 "Return column at which body of ITEM should start."
2063 tcol))
2066 \f
2067 ;;; Interactive functions
2072 "Go to the beginning of the current item.
2073 Throw an error when not in a list."
2079 "Go to the beginning item of the current list or sublist.
2080 Throw an error when not in a list."
2091 "Go to the end of the current list or sublist.
2092 Throw an error when not in a list."
2103 "Go to the end of the current item.
2104 Throw an error when not in a list."
2114 "Move to the beginning of the previous item.
2115 Throw an error when not in a list. Also throw an error when at
2116 first item, unless `org-list-use-circular-motion' is non-nil."
2132 "Move to the beginning of the next item.
2133 Throw an error when not in a list. Also throw an error when at
2134 last item, unless `org-list-use-circular-motion' is non-nil."
2150 "Move the item at point down, i.e. swap with following item.
2151 Sub-items (items with larger indentation) are considered part of
2152 the item, so this really moves item trees."
2171 "Move the item at point up, i.e. swap with previous item.
2172 Sub-items (items with larger indentation) are considered part of
2173 the item, so this really moves item trees."
2190 "Insert a new item at the current level.
2191 If cursor is before first character after bullet of the item, the
2192 new item will be created before the current one.
2194 If CHECKBOX is non-nil, add a checkbox next to the bullet.
2196 Return t when things worked, nil when we are not in an item, or
2197 item is invisible."
2200 ;; If cursor isn't is a list or if list is invisible, return nil.
2208 ;; Timer list: delegate to `org-timer-item'.
2213 ;; If we're in a description list, ask for the new term.
2227 t)))))
2230 "Fix indentation, bullets and checkboxes in the list at point."
2238 "Cycle through the different itemize/enumerate bullets.
2239 This cycle the entire list level through the sequence:
2241 `-' -> `+' -> `*' -> `1.' -> `1)'
2243 If WHICH is a valid string, use that as the new bullet. If WHICH
2244 is an integer, 0 means `-', 1 means `+' etc. If WHICH is
2245 `previous', cycle backwards."
2265 ;; Compute list of possible bullets, depending on context.
2268 ;; *-bullets are not allowed at column 0.
2270 ;; Description items cannot be numbered.
2293 ;; Use a short variation of `org-list-write-struct' as there's
2294 ;; no need to go through all the steps.
2302 "Toggle the checkbox in the current line.
2303 With prefix arg TOGGLE-PRESENCE, add or remove checkboxes. With
2304 double prefix, set checkbox to [-].
2306 When there is an active region, toggle status or presence of the
2307 first checkbox there, and make every item inside have the same
2308 status or presence, respectively.
2310 If the cursor is in a headline, apply this to all checkbox items
2311 in the text below the heading, taking as reference the first item
2312 in subtree, ignoring drawers."
2316 block-item
2317 lim-up
2318 lim-down
2326 ;; In a region, start at first item in region.
2336 ;; On an heading, start at first item after drawers and
2337 ;; time-stamps (scheduled, etc.).
2349 ;; Just one item: set SINGLEP flag.
2355 ;; Determine the checkbox going to be applied to all items
2356 ;; within bounds.
2367 ;; When an item is found within bounds, grab the full list at
2368 ;; point structure, then: (1) set check-box of all its items
2369 ;; within bounds to REF-CHECKBOX, (2) fix check-boxes of the
2370 ;; whole list, (3) move point after the list.
2384 e struct
2385 ;; If there is no box at item, leave as-is
2386 ;; unless function was called with C-u prefix.
2389 ref-checkbox
2390 cur-box))))
2391 items-to-toggle)
2393 struct parents prevs orderedp))
2394 ;; Report some problems due to ORDERED status of subtree.
2395 ;; If only one box was being checked, throw an error, else,
2396 ;; only signal problems.
2400 "Checkbox blocked because of unchecked box at line %d"
2404 "Checkboxes were removed due to unchecked box at line %d"
2413 "Reset all checkboxes in an entry subtree."
2430 "Update the checkbox statistics in the current section.
2431 This will find all statistic cookies like [57%] and [6/12] and
2432 update them with the current numbers.
2434 With optional prefix argument ALL, do this for the whole buffer."
2438 (box-re "^[ \t]*\\([-+*]\\|\\([0-9]+\\|[A-Za-z]\\)[.)]\\)[ \t]+\\(?:\\[@\\(?:start:\\)?\\([0-9]+\\|[A-Za-z]\\)\\][ \t]*\\)?\\(\\[[- X]\\]\\)")
2450 ;; Return number of checked boxes and boxes of all types
2451 ;; in all structures in STRUCTS. If RECURSIVEP is
2452 ;; non-nil, also count boxes in sub-lists. If ITEM is
2453 ;; nil, count across the whole structure, else count only
2454 ;; across subtree whose ancestor is ITEM.
2471 items))))
2474 structs)
2477 cookies-list structs-bak box-num)
2479 ;; 1. Build an alist for each cookie found within BOUNDS. The
2480 ;; key will be position at beginning of cookie and values
2481 ;; ending position, format of cookie, and a cell whose car is
2482 ;; number of checked boxes to report, and cdr total number of
2483 ;; boxes.
2493 ;; Cookie is at an heading, but specifically for todo,
2494 ;; not for checkboxes: skip it.
2500 ;; Cookie is at an heading, but all lists before next
2501 ;; heading already have been read. Use data collected
2502 ;; in STRUCTS-BAK. This should only happen when
2503 ;; heading has more than one cookie on it.
2506 backup-end))
2508 ;; Cookie is at a fresh heading. Grab structure of
2509 ;; every list containing a checkbox between point and
2510 ;; next headline, and save them in STRUCTS-BAK.
2514 structs-bak nil)
2521 ;; Cookie is at an item, and we already have list
2522 ;; structure stored in STRUCTS-BAK.
2525 ;; Only lists in no special context are stored.
2528 ;; Cookie is at an item, but we need to compute list
2529 ;; structure.
2535 ;; Else, cookie found is at a wrong place. Skip it.
2537 cookies-list))))
2538 ;; 2. Apply alist to buffer, in reverse order so positions stay
2539 ;; unchanged after cookie modifications.
2554 cookies-list))))
2557 "Select the face for checkbox statistics.
2558 The face will be `org-done' when all relevant boxes are checked.
2559 Otherwise it will be `org-todo'."
2562 'org-checkbox-statistics-done
2566 'org-checkbox-statistics-done
2570 "Update checkbox statistics unless turned off by user.
2571 With an optional argument ALL, update them in the whole buffer."
2579 "Indent a local list item including its children.
2580 When number ARG is a negative, item will be outdented, otherwise
2581 it will be indented.
2583 If a region is active, all items inside will be moved.
2585 If NO-SUBTREE is non-nil, only indent the item itself, not its
2586 children.
2588 STRUCT is the list structure.
2590 Return t if successful."
2598 ;; Are we going to move the whole list?
2606 t))))
2607 ;; Determine begin and end points of zone to indent. If moving
2608 ;; more than one item, save them for subsequent moves.
2624 ;; Special case: moving top-item with indent rule.
2632 ;; Change bullet if necessary.
2638 ;; Shift every item by OFFSET and fix bullets. Then
2639 ;; apply changes to buffer.
2643 struct)
2646 ;; Forbidden move:
2648 ;; If only one item is moved, it mustn't have a child.
2652 ;; If a subtree or region is moved, the last item
2653 ;; of the subtree mustn't have a child.
2658 struct)))))
2661 ;; Normal shifting
2669 t)
2672 "Outdent a local list item, but not its children.
2673 If a region is active, all items inside will be moved."
2689 "Indent a local list item, but not its children.
2690 If a region is active, all items inside will be moved."
2706 "Outdent a local list item including its children.
2707 If a region is active, all items inside will be moved."
2723 "Indent a local list item including its children.
2724 If a region is active, all items inside will be moved."
2741 "Cycle levels of indentation of an empty item.
2742 The first run indents the item, if applicable. Subsequent runs
2743 outdent it at meaningful levels in the list. When done, item is
2744 put back at its original position with its original bullet.
2746 Return t at each successful move."
2752 ;; Accept empty items or if cycle has already started.
2763 ;; When in the middle of the cycle, try to outdent first. If
2764 ;; it fails, and point is still at initial position, indent.
2765 ;; Else, re-create it at its original position.
2774 ;; Break cycle
2776 ;; If a cycle is starting, remember indentation and bullet,
2777 ;; then try to indent. If it fails, try to outdent.
2783 t))))
2786 "Sort list items.
2787 The cursor may be at any item of the list that should be sorted.
2788 Sublists are not sorted. Checkboxes, if any, are ignored.
2790 Sorting can be alphabetically, numerically, by date/time as given
2791 by a time stamp, by a property or by priority.
2793 Comparing entries ignores case by default. However, with an
2794 optional argument WITH-CASE, the sorting considers case as well.
2796 The command prompts for the sorting type unless it has been given
2797 to the function through the SORTING-TYPE argument, which needs to
2798 be a character, \(?n ?N ?a ?A ?t ?T ?f ?F ?x ?X). Here is the
2799 detailed meaning of each character:
2801 n Numerically, by converting the beginning of the item to a number.
2802 a Alphabetically. Only the first line of item is checked.
2803 t By date/time, either the first active time stamp in the entry, if
2804 any, or by the first inactive one. In a timer list, sort the timers.
2807 Capital letters will reverse the sort order.
2809 If the SORTING-TYPE is ?f or ?F, then GETKEY-FUNC specifies
2810 a function to be called with point at the beginning of the
2811 record. It must return either a string or a number that should
2812 serve as the sorting key for that record. It will then use
2813 COMPARE-FUNC to compare entries.
2815 Sorting is done against the visible part of the headlines, it
2816 ignores hidden links."
2867 ;; If it is a timer list, convert timer to seconds
2884 value))
2888 next-record
2889 end-record
2890 value-to-sort
2891 nil
2892 sort-func)
2893 ;; Read and fix list again, as `sort-subr' probably destroyed
2894 ;; its structure.
2900 \f
2901 ;;; Send and receive lists
2904 "Parse the list at point and maybe DELETE it.
2906 Return a list whose car is a symbol of list type, among
2907 `ordered', `unordered' and `descriptive'. Then, each item is
2908 a list whose car is counter, and cdr are strings and other
2909 sub-lists. Inside strings, check-boxes are replaced by
2912 For example, the following list:
2914 1. first item
2915 + sub-item one
2916 + [X] sub-item two
2917 more text in first item
2918 2. [@3] last item
2920 will be parsed as:
2922 \(ordered
2924 \(unordered
2930 Point is left at list end."
2936 out
2937 parse-item ; for byte-compiler
2940 ;; Return text between BEG and END, trimmed, with
2941 ;; checkboxes replaced.
2952 text)))))
2955 ;; Return a list whose car is list type and cdr a list of
2956 ;; items' body.
2962 ;; Return a list containing counter of item, if any, text
2963 ;; and any sublist inside it.
2969 ;; Get counter number. For alphabetic counter, get
2970 ;; its position in the alphabet.
2981 ;; If item has a child, store text between bullet and
2982 ;; next child, then recursively parse all sublists. At
2983 ;; the end of each sublist, check for the presence of
2984 ;; text belonging to the original item.
2994 ;; Remove children from the list just parsed.
2996 ;; There is a chunk of text belonging to the
2997 ;; item if last child doesn't end where next
2998 ;; child starts or where item ends.
3002 body))))
3005 ;; Store output, take care of cursor position and deletion of
3006 ;; list, then return output.
3013 out))
3016 "Convert the plain list at point into a subtree."
3024 "Insert a radio list template appropriate for this major mode."
3028 name pos)
3039 "Send a transformed version of this list to the receiver position.
3040 With argument MAYBE, fail quietly if no transformation is defined
3041 for this list."
3063 beg txt)
3067 ;; Find the insertion place
3072 name
3086 "Trim line breaks in a list ITEM."
3090 "Convert a LIST parsed through `org-list-parse-list' to other formats.
3091 Valid parameters PARAMS are:
3093 :ustart String to start an unordered list
3094 :uend String to end an unordered list
3096 :ostart String to start an ordered list
3097 :oend String to end an ordered list
3099 :dstart String to start a descriptive list
3100 :dend String to end a descriptive list
3101 :dtstart String to start a descriptive term
3102 :dtend String to end a descriptive term
3103 :ddstart String to start a description
3104 :ddend String to end a description
3106 :splice When set to t, return only list body lines, don't wrap
3107 them into :[u/o]start and :[u/o]end. Default is nil.
3109 :istart String to start a list item.
3110 :icount String to start an item with a counter.
3111 :iend String to end a list item
3112 :isep String to separate items
3113 :lsep String to separate sublists
3114 :csep String to separate text from a sub-list
3116 :cboff String to insert for an unchecked check-box
3117 :cbon String to insert for a checked check-box
3118 :cbtrans String to insert for a check-box in transitional state
3120 :nobr Non-nil means remove line breaks in lists items.
3122 Alternatively, each parameter can also be a form returning
3123 a string. These sexp can use keywords `counter' and `depth',
3124 representing respectively counter associated to the current
3125 item, and depth of the current sub-list, starting at 0.
3126 Obviously, `counter' is only available for parameters applying to
3127 items."
3151 export-sublist ; for byte-compiler
3154 ;; Export an item ITEM of type TYPE, at DEPTH. First
3155 ;; string in item is treated in a special way as it can
3156 ;; bring extra information that needs to be processed.
3162 ;; Stick DTSTART to ISTART by
3163 ;; left-trimming the latter.
3167 istart))
3174 ;; Replace checkbox if any is found.
3182 ;; Replace line breaks if required
3184 ;; Insert descriptive term if TYPE is `descriptive'.
3193 first)))
3204 ;; Export sublist SUB at DEPTH.
3222 "Convert LIST into a LaTeX list.
3223 LIST is as string representing the list to transform, as Org
3224 syntax. Return converted list as a string."
3229 "Convert LIST into a HTML list.
3230 LIST is as string representing the list to transform, as Org
3231 syntax. Return converted list as a string."
3236 "Convert LIST into a Texinfo list.
3237 LIST is as string representing the list to transform, as Org
3238 syntax. Return converted list as a string."
3243 "Convert LIST into an Org subtree.
3244 LIST is as returned by `org-list-parse-list'. PARAMS is a property list
3245 with overruling parameters for `org-list-to-generic'."
3255 ;; Return the string for the heading, depending on depth D
3256 ;; of current sub-list.
3261 oddeven-level)
3262 ?*)
3265 list
3267 '(:splice t
3274 params))))
3278 ;;; org-list.el ends here