| blob | 1525c2c5a0ba4684c29ed77406c8e080f05d5868 |
1 ;;; org-list.el --- Plain lists for Org-mode
2 ;;
3 ;; Copyright (C) 2004-2015 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.
216 This variable needs to be set before org.el is loaded. If you
217 need to make a change while Emacs is running, use the customize
218 interface or run the following code after updating it:
231 "Non-nil means single character alphabetical bullets are allowed.
233 Both uppercase and lowercase are handled. Lists with more than
234 26 items will fallback to standard numbering. Alphabetical
237 This variable needs to be set before org.el is loaded. If you
238 need to make a change while Emacs is running, use the customize
239 interface or run the following code after updating it:
249 "A regular expression matching bullets that should have 2 spaces after them.
250 When nil, no bullet will have two spaces after them. When
251 a string, it will be used as a regular expression. When the
252 bullet type of a list is changed, the new bullet type will be
253 matched against this regexp. If it matches, there will be two
254 spaces instead of one after the bullet in each item of the list."
263 "Non-nil means an empty line ends all plain list levels.
264 Otherwise, two of them will be necessary."
270 "Non-nil means apply set of rules when acting on lists.
271 By default, automatic actions are taken when using
276 rules by setting them to nil. Valid rules are:
278 checkbox when non-nil, checkbox statistics is updated each time
279 you either insert a new checkbox or toggle a checkbox.
280 indent when non-nil, indenting or outdenting list top-item
281 with its subtree will move the whole list and
282 outdenting a list whose bullet is * to column 0 will
287 :key-type
291 :value-type
295 "Non-nil means commands implying motion in lists should be cyclic.
297 In that case, the item following the last item is the first one,
298 and the item preceding the first item is the last one.
308 "Hook that is run whenever Org thinks checkbox statistics should be updated.
309 This hook runs even if checkbox rule in
310 `org-list-automatic-rules' does not apply, so it can be used to
311 implement alternative ways of collecting statistics
317 "Non-nil means checkbox statistics counts only the state of direct children.
318 When nil, all boxes below the cookie are counted.
319 This can be set to nil on a per-node basis using a COOKIE_DATA property
327 "Maximum indentation for the second line of a description list.
328 When the indentation would be larger than this, it will become
329 5 characters instead."
334 "Additional indentation for sub-items in a list.
335 By setting this to a small number, usually 1 or 2, one can more
336 clearly distinguish sub-items in a list."
343 % END RECEIVE ORGLST %n
345 #+ORGLST: SEND %n org-list-to-latex
346 -
349 @c END RECEIVE ORGLST %n
350 @ignore
351 #+ORGLST: SEND %n org-list-to-texinfo
352 -
355 <!-- END RECEIVE ORGLST %n -->
356 <!--
357 #+ORGLST: SEND %n org-list-to-html
358 -
360 "Templates for radio lists in different major modes.
361 All occurrences of %n in a template will be replaced with the name of the
362 list, obtained by prompting the user."
370 "Names of blocks where lists are not allowed.
374 "Context types where lists will be interpreted during export.
376 Valid types are `drawer', `inlinetask' and `block'. More
377 specifically, type `block' is determined by the variable
381 \f
382 ;;; Predicates and regexps
386 "Regex corresponding to the end of a list.
394 "Matches a list item and puts everything into groups:
395 group 1: bullet
396 group 2: counter
397 group 3: checkbox
401 "Return the correct regular expression for plain lists."
412 "Regexp matching the beginning of a plain list item."
416 "Is point at a list item with REGEXP after bullet?"
425 ;; Ignore counter if any
430 "Is point in a context where lists are allowed?"
434 "Return item beginning position when in a plain list, nil otherwise."
443 ;; Indentation isn't meaningful when point starts at an empty
444 ;; line or an inline task.
447 10000
453 ;; Detect if cursor in amidst `org-list-end-re'. First, count
454 ;; number HL of hard lines it takes, then call `org-in-regexp'
455 ;; to compute its boundaries END-BOUNDS. When point is
456 ;; in-between, move cursor before regexp beginning.
467 ;; Look for an item, less indented that reference line.
472 ;; This is exactly what we want.
475 ;; At upper bound of search or looking at the end of a
476 ;; previous list: search is over.
479 ;; Skip blocks, drawers, inline-tasks, blank lines
489 ;; Text at column 0 cannot belong to a list: stop.
491 ;; Normal text less indented than reference line, take
492 ;; it as new reference.
499 "Is point in a line starting a hand-formatted item?"
505 "Is point at the bullet of a plain list item?"
511 "Is point at a line starting a plain list item with a timer?"
516 "Is point at a description list item?"
520 "Is point at a line starting a plain-list item with a checklet?"
524 "Is point at a line starting a plain-list item with a counter?"
530 \f
531 ;;; Structures and helper functions
534 "Determine context, and its boundaries, around point.
536 Context will be a cell like (MIN MAX CONTEXT) where MIN and MAX
537 are boundaries and CONTEXT is a symbol among `drawer', `block',
538 `invalid', `inlinetask' and nil.
540 Contexts `block' and `invalid' refer to `org-list-forbidden-blocks'."
546 ;; Get positions of surrounding headings. This is the
547 ;; default context.
552 ;; Is point inside a drawer?
562 lim-down))
565 ;; Is point strictly in a block, and of which type?
576 lim-down))
582 ;; Is point in an inlinetask?
595 ;; Return context boundaries and type.
599 "Return structure of list at point.
601 A list structure is an alist where key is point at item, and
602 values are:
603 1. indentation,
604 2. bullet with trailing whitespace,
605 3. bullet counter, if any,
606 4. checkbox, if any,
607 5. description tag, if any,
608 6. position at item end.
610 Thus the following list, where numbers in parens are
611 point-at-bol:
613 - [X] first item (1)
614 1. sub-item 1 (18)
615 5. [@5] sub-item 2 (34)
616 some other text belonging to first item (55)
617 - last item (97)
618 + tag :: description (109)
619 (131)
621 will get the following structure:
629 Assume point is at an item."
641 ind itm-lst itm-lst-2 end-lst end-lst-2 struct
644 ;; Return association at point.
649 ind
650 bullet
653 ;; Description tag.
658 ;; Ensure list ends at the first blank line.
662 ;; 1. Read list from starting item to its beginning, and save
663 ;; top item position and indentation in BEG-CELL. Also store
664 ;; ending position of items in END-LST.
671 ;; At upward limit: if we ended at an item, store it,
672 ;; else dismiss useless data recorded above BEG-CELL.
673 ;; Jump to part 2.
680 ;; Looking at a list ending regexp. Dismiss useless
681 ;; data recorded above BEG-CELL. Jump to part 2.
686 ;; Point is at an item. Add data to ITM-LST. It may
687 ;; also end a previous item: save it in END-LST. If
688 ;; ind is less or equal than BEG-CELL and there is no
689 ;; end at this ind or lesser, this item becomes the new
690 ;; BEG-CELL.
696 ;; Skip blocks, drawers, inline tasks, blank lines.
707 ;; From there, point is not at an item. Interpret
708 ;; line's indentation:
709 ;; - text at column 0 is necessarily out of any list.
710 ;; Dismiss data recorded above BEG-CELL. Jump to
711 ;; part 2.
712 ;; - any other case may be an ending position for an
713 ;; hypothetical item above. Store it and proceed.
722 ;; 2. Read list from starting point to its end, that is until we
723 ;; get out of context, or that a non-item line is less or
724 ;; equally indented than BEG-CELL's cdr. Also, store ending
725 ;; position of items in END-LST-2.
731 ;; At downward limit: this is de facto the end of the
732 ;; list. Save point as an ending position, and jump to
733 ;; part 3.
736 ;; Looking at a list ending regexp. Save point as an
737 ;; ending position and jump to part 3.
741 ;; Point is at an item. Add data to ITM-LST-2. It may
742 ;; also end a previous item, so save it in END-LST-2.
746 ;; Skip inline tasks and blank lines along the way
751 ;; Ind is lesser or equal than BEG-CELL's. The list is
752 ;; over: store point as an ending position and jump to
753 ;; part 3.
757 ;; Else, if ind is lesser or equal than previous item's,
758 ;; this is an ending position: store it. In any case,
759 ;; skip block or drawer at point, and move to next line.
771 ;; 3. Associate each item to its end position.
773 ;; 4. Return STRUCT
774 struct)))
777 "Associate proper ending point to items in STRUCT.
779 END-LIST is a pseudo-alist where car is indentation and cdr is
780 ending position.
782 This function modifies STRUCT."
788 ;; Remove end candidates behind current item.
791 ;; Add end position to item assoc.
797 struct)))
800 "Return alist between item and previous item in STRUCT."
802 struct)))
806 struct)))
809 "Return alist between item and parent in STRUCT."
821 ;; A sub-list is over. Find the associated
822 ;; origin in IND-TO-ORI. If it cannot be
823 ;; found (ill-formed list), set its parent as
824 ;; the first item less indented. If there is
825 ;; none, make it a top-level item.
833 ind-to-ori)
836 ;; A sub-list starts. Every item at IND will
837 ;; have previous item as its parent.
842 ;; Another item in the same sub-list: it shares
843 ;; the same parent as the previous item.
848 \f
849 ;;; Accessors
852 "Return the Nth value of KEY in STRUCT."
856 "Set the Nth value of KEY in STRUCT to NEW.
861 "Return indentation of ITEM in STRUCT."
865 "Set indentation of ITEM in STRUCT to IND.
870 "Return bullet of ITEM in STRUCT."
874 "Set bullet of ITEM in STRUCT to BULLET.
879 "Return counter of ITEM in STRUCT."
883 "Return checkbox of ITEM in STRUCT or nil."
887 "Set checkbox of ITEM in STRUCT to CHECKBOX.
892 "Return end position of ITEM in STRUCT."
896 "Return end position of ITEM in STRUCT."
900 "Return point at end of ITEM in STRUCT, before any blank line.
901 Point returned is at end of line."
908 "Return parent of ITEM or nil.
909 STRUCT is the list structure. PARENTS is the alist of parents,
910 as returned by `org-list-parents-alist'."
915 "Non-nil if ITEM has a child.
917 STRUCT is the list structure.
919 Value returned is the position of the first child of ITEM."
924 child-maybe)))
927 "Return next item in same sub-list as ITEM, or nil.
928 STRUCT is the list structure. PREVS is the alist of previous
929 items, as returned by `org-list-prevs-alist'."
933 "Return previous item in same sub-list as ITEM, or nil.
934 STRUCT is the list structure. PREVS is the alist of previous
935 items, as returned by `org-list-prevs-alist'."
939 "List all items having ITEM as a common ancestor, or nil.
940 STRUCT is the list structure."
943 subtree)
948 sub-struct))
952 "List all items in the same sub-list as ITEM.
953 STRUCT is the list structure. PREVS is the alist of previous
954 items, as returned by `org-list-prevs-alist'."
957 before-item after-item)
965 "List all children of ITEM, or nil.
966 STRUCT is the list structure. PARENTS is the alist of parents,
967 as returned by `org-list-parents-alist'."
975 "Return point at beginning of list.
976 STRUCT is the list structure."
980 "Return point at bottom of list.
981 STRUCT is the list structure."
986 "Return point at beginning of sub-list ITEM belongs.
987 STRUCT is the list structure. PREVS is the alist of previous
988 items, as returned by `org-list-prevs-alist'."
992 first-item))
997 "Return point at last item of sub-list ITEM belongs.
998 STRUCT is the list structure. PREVS is the alist of previous
999 items, as returned by `org-list-prevs-alist'."
1003 last-item))
1006 "Return point at end of sub-list ITEM belongs.
1007 STRUCT is the list structure. PREVS is the alist of previous
1008 items, as returned by `org-list-prevs-alist'."
1012 "Return the type of the list containing ITEM, as a symbol.
1014 STRUCT is the list structure. PREVS is the alist of previous
1015 items, as returned by `org-list-prevs-alist'.
1017 Possible types are `descriptive', `ordered' and `unordered'. The
1018 type is determined by the first item of the list."
1026 "Return ITEM's sequence number.
1028 STRUCT is the list structure. PREVS is the alist of previous
1029 items, as returned by `org-list-prevs-alist'. PARENTS is the
1030 alist of ancestors, as returned by `org-list-parents-alist'.
1032 Return value is a list of integers. Counters have an impact on
1033 that value."
1037 ;; Return relative sequence number of ITEM in the sub-list
1038 ;; it belongs. STRUCT is the list structure. PREVS is
1039 ;; the alist of previous items.
1048 seq))
1052 ;; Cons each parent relative number into return value (OUT).
1057 ;; Return value.
1058 out)))
1061 \f
1062 ;;; Searching
1065 "Search a string in valid contexts for lists.
1066 Arguments SEARCH, RE, BOUND and NOERR are similar to those used
1067 in `re-search-forward'."
1071 ;; 1. No match: return to origin or bound, depending on NOERR.
1074 nil)))
1075 ;; 2. Match in valid context: return point. Else, continue
1076 ;; searching.
1080 "Like `re-search-backward' but stop only where lists are recognized.
1081 Arguments REGEXP, BOUND and NOERROR are similar to those used in
1082 `re-search-backward'."
1087 "Like `re-search-forward' but stop only where lists are recognized.
1088 Arguments REGEXP, BOUND and NOERROR are similar to those used in
1089 `re-search-forward'."
1094 \f
1095 ;;; Methods on structures
1098 "Return BULLET with the correct number of whitespaces.
1099 It determines the number of whitespaces to append by looking at
1100 `org-list-two-spaces-after-bullet-regexp'."
1104 org-list-two-spaces-after-bullet-regexp bullet))
1105 " "
1109 bullet))))
1112 "Swap item starting at BEG-A with item starting at BEG-B in STRUCT.
1114 Blank lines at the end of items are left in place. Item
1115 visibility is preserved. Return the new structure after the
1116 changes.
1118 Assume BEG-A is lesser than BEG-B and that BEG-A and BEG-B belong
1119 to the same sub-list.
1121 This function modifies STRUCT."
1134 ;; Store overlays responsible for visibility status. We
1135 ;; also need to store their boundaries as they will be
1136 ;; removed from buffer.
1151 ;; 1. Move effectively items in buffer.
1155 ;; 2. Now modify struct. No need to re-read the list, the
1156 ;; transformation is just a shift of positions. Some special
1157 ;; attention is required for items ending at END-A and END-B
1158 ;; as empty spaces are not moved there. In others words,
1159 ;; item BEG-A will end with whitespaces that were at the end
1160 ;; of BEG-B and the same applies to BEG-B.
1183 ;; Restore visibility status, by moving overlays to their new
1184 ;; position.
1194 ;; Return structure.
1195 struct)))
1198 "Return number of blank lines that should separate items in list.
1200 POS is the position of point where `org-list-insert-item' was called.
1202 STRUCT is the list structure. PREVS is the alist of previous
1203 items, as returned by `org-list-prevs-alist'.
1205 Assume point is at item's beginning. If the item is alone, apply
1206 some heuristics to guess the result."
1211 usr-blank
1215 ;; Count blank lines above beginning of line.
1222 ;; Trivial cases where there should be none.
1224 ;; When `org-blank-before-new-entry' says so, it is 1.
1226 ;; `plain-list-item' is 'auto. Count blank lines separating
1227 ;; neighbors' items in list.
1230 ;; Is there a next item?
1233 ;; Is there a previous item?
1236 ;; User inserted blank lines, trust him.
1241 usr-blank)
1242 ;; Are there blank lines inside the list so far?
1245 ;; Do not use `org-list-search-forward' so blank lines
1246 ;; in blocks can be counted in.
1250 ;; Default choice: no blank line.
1254 "Insert a new list item at POS and return the new structure.
1255 If POS is before first character after bullet of the item, the
1256 new item will be created before the current one.
1258 STRUCT is the list structure. PREVS is the alist of previous
1259 items, as returned by `org-list-prevs-alist'.
1261 Insert a checkbox if CHECKBOX is non-nil, and string AFTER-BULLET
1262 after the bullet. Cursor will be after this text once the
1263 function ends.
1265 This function modifies STRUCT."
1267 ;; 1. Get information about list: position of point with regards
1268 ;; to item start (BEFOREP), blank lines number separating items
1269 ;; (BLANK-NB), if we're allowed to (SPLIT-LINE-P).
1276 ;; Do not count tag in a non-descriptive list.
1284 pos struct prevs))
1285 ;; 2. Build the new item to be created. Concatenate same
1286 ;; bullet as item, checkbox, text AFTER-BULLET if
1287 ;; provided, and text cut from point to end of item
1288 ;; (TEXT-CUT) to form item's BODY. TEXT-CUT depends on
1289 ;; BEFOREP and SPLIT-LINE-P. The difference of size
1290 ;; between what was cut and what was inserted in buffer
1291 ;; is stored in SIZE-OFFSET.
1295 ind))
1302 ;; If POS is greater than ITEM-END, then point is
1303 ;; in some white lines after the end of the list.
1304 ;; Those must be removed, or they will be left,
1305 ;; stacking up after the list.
1315 text-cut))))
1319 ;; 4. Insert effectively item into buffer.
1323 ;; 5. Add new item to STRUCT.
1327 ;; Before inserted item, positions don't change but
1328 ;; an item ending after insertion has its end shifted
1329 ;; by SIZE-OFFSET.
1332 ;; Trivial cases where current item isn't split in
1333 ;; two. Just shift every item after new one by
1334 ;; ITEM-SIZE.
1338 ;; Item is split in two: elements before POS are just
1339 ;; shifted by ITEM-SIZE. In the case item would end
1340 ;; after split POS, ending is only shifted by
1341 ;; SIZE-OFFSET.
1347 ;; Elements after POS are moved into new item.
1348 ;; Length of ITEM-SEP has to be removed as ITEM-SEP
1349 ;; doesn't appear in buffer yet.
1355 (+ end size-offset
1357 ;; Elements at ITEM-END or after are only shifted by
1358 ;; SIZE-OFFSET.
1361 struct)
1364 ;; 6. If not BEFOREP, new item must appear after ITEM, so
1365 ;; exchange ITEM with the next item in list. Position cursor
1366 ;; after bullet, counter, checkbox, and label.
1372 struct)))
1375 "Remove ITEM from the list and return the new structure.
1377 STRUCT is the list structure."
1380 ;; If ITEM ends with the list, delete blank lines
1381 ;; before it.
1386 item)))
1387 ;; Remove item from buffer.
1389 ;; Remove item from structure and shift others items accordingly.
1390 ;; Don't forget to shift also ending position when appropriate.
1408 struct)))))
1411 "Send ITEM to destination DEST.
1413 STRUCT is the list structure.
1415 DEST can have various values.
1417 If DEST is a buffer position, the function will assume it points
1418 to another item in the same list as ITEM, and will move the
1419 latter just before the former.
1421 If DEST is `begin' (respectively `end'), ITEM will be moved at
1422 the beginning (respectively end) of the list it belongs to.
1425 be moved at the Nth position in the list.
1427 If DEST is `kill', ITEM will be deleted and its body will be
1428 added to the kill-ring.
1430 If DEST is `delete', ITEM will be deleted.
1432 Visibility of item is preserved.
1434 This function returns, destructively, the new list structure."
1437 ;; Grab full item body minus its bullet.
1446 item-end)))
1447 ;; Change DEST into a buffer position. A trick is needed
1448 ;; when ITEM is meant to be sent at the end of the list.
1449 ;; Indeed, by setting locally `org-M-RET-may-split-line' to
1450 ;; nil and insertion point (INS-POINT) to the first line's
1451 ;; end of the last item, we ensure the new item will be
1452 ;; inserted after the last item, and not after any of its
1453 ;; hypothetical sub-items.
1469 ;; Send ITEM at the end of the list.
1477 ;; Store inner overlays (to preserve visibility).
1489 ;; 1. Structure returned by `org-list-insert-item' may not be
1490 ;; accurate, as it cannot see sub-items included in BODY.
1491 ;; Thus, first compute the real structure so far.
1499 ;; 1.1. Remove the item just created in structure.
1501 ;; 1.2. Copy ITEM and any of its sub-items at NEW-ITEM.
1504 struct
1512 new-end
1514 moved-items))
1516 ;; 2. Restore inner overlays.
1521 ;; 3. Eventually delete extra copy of the item and clean marker.
1527 "Outdent items between positions START and END.
1529 STRUCT is the list structure. PARENTS is the alist of items'
1530 parents, as returned by `org-list-parents-alist'.
1532 START is included, END excluded."
1538 ;; Item not yet in zone: keep association.
1540 ;; Item out of zone: follow associations in ACC.
1544 ;; Item has no parent: error
1547 ;; Parent is outdented: keep association.
1551 ;; Parent isn't outdented: reparent to grand-parent.
1553 parent struct parents)))
1559 "Indent items between positions START and END.
1561 STRUCT is the list structure. PARENTS is the alist of parents
1562 and PREVS is the alist of previous items, returned by,
1563 respectively, `org-list-parents-alist' and
1564 `org-list-prevs-alist'.
1566 START is included and END excluded.
1568 STRUCT may be modified if `org-list-demote-modify-bullet' matches
1569 bullets between START and END."
1577 ;; Normalize ordered bullets.
1587 org-list-demote-modify-bullet))))
1594 ;; Item not yet in zone: keep association.
1597 ;; Item out of zone: follow associations in ACC.
1601 ;; Item is in zone...
1603 ;; Check if bullet needs to be changed.
1606 ;; First item indented but not parent: error
1609 ;; First item and parent indented: keep same
1610 ;; parent.
1612 ;; Previous item not indented: reparent to it.
1614 ;; Previous item indented: reparent like it.
1621 \f
1622 ;;; Repairing structures
1625 "Non-nil if list starting at FIRST can have alphabetical bullets.
1627 STRUCT is list structure. PREVS is the alist of previous items,
1628 as returned by `org-list-prevs-alist'."
1632 ;; Pretend that bullets are uppercase and check if alphabet
1633 ;; is sufficient, taking counters into account.
1637 ;; Virtually determine current bullet
1639 ;; Counters are not case-sensitive.
1642 ;; Test if bullet would be over z or Z.
1646 ;; All items checked. All good.
1647 t))))
1650 "Increment BULLET if applicable."
1653 ;; Num bullet: increment it.
1657 nil nil bullet))
1658 ;; Alpha bullet: increment it.
1662 nil nil bullet))
1663 ;; Unordered bullet: leave it.
1667 "Verify and correct bullets in STRUCT.
1668 PREVS is the alist of previous items, as returned by
1669 `org-list-prevs-alist'.
1671 This function modifies STRUCT."
1675 ;; Set bullet of ITEM in STRUCT, depending on the type of
1676 ;; first item of the list, the previous bullet and counter
1677 ;; if any.
1686 item struct
1689 ;; Alpha counter in alpha list: use counter.
1693 ;; Use cond to be sure `string-match' is used in
1694 ;; both cases.
1700 ;; Num counter in a num list: use counter.
1705 ;; No counter: increase, if needed, previous bullet.
1708 ;; Alpha counter at first item: use counter.
1717 ;; Num counter at first item: use counter.
1722 ;; First bullet is alpha uppercase: use "A".
1725 ;; First bullet is alpha lowercase: use "a".
1728 ;; First bullet is num: use "1".
1731 ;; Not an ordered list: keep bullet.
1736 "Verify and correct indentation in STRUCT.
1738 PARENTS is the alist of parents, as returned by
1739 `org-list-parents-alist'.
1741 If numeric optional argument BULLET-SIZE is set, assume all
1742 bullets in list have this length to determine new indentation.
1744 This function modifies STRUCT."
1751 ;; Indent like parent + length of parent's bullet +
1752 ;; sub-list offset.
1758 org-list-indent-offset))
1759 ;; If no parent, indent like top-point.
1764 "Verify and correct checkboxes in STRUCT.
1766 PARENTS is the alist of parents and PREVS is the alist of
1767 previous items, as returned by, respectively,
1768 `org-list-parents-alist' and `org-list-prevs-alist'.
1770 If ORDERED is non-nil, a checkbox can only be checked when every
1771 checkbox before it is checked too. If there was an attempt to
1772 break this rule, the function will return the blocking item. In
1773 all others cases, the return value will be nil.
1775 This function modifies STRUCT."
1785 item struct
1791 ;; Parent has no boxed child: leave box as-is.
1793 parent-list)
1794 ;; 1. List all parents with a checkbox.
1801 all-items)
1802 ;; 2. Sort those parents by decreasing indentation.
1807 ;; 3. For each parent, get all children's checkboxes to determine
1808 ;; and set its checkbox accordingly.
1810 ;; 4. If ORDERED is set, see if we need to uncheck some boxes.
1815 ;; There are boxes checked after an unchecked one: fix that.
1822 ;; Verify once again the structure, without ORDERED.
1824 ;; Return blocking item.
1828 "Verify and correct each item end position in STRUCT.
1830 This function modifies STRUCT."
1837 ;; To determine real ind of an ending position that is
1838 ;; not at an item, we have to find the item it belongs
1839 ;; to: it is the last item (ITEM-UP), whose ending is
1840 ;; further than the position we're interested in.
1843 ;; Else part is for the bottom point.
1845 end-pos)
1846 end-list)))
1849 struct)
1854 "Apply set difference between STRUCT and OLD-STRUCT to the buffer.
1856 OLD-STRUCT is the structure before any modifications, and STRUCT
1857 the structure to be applied. The function will only modify parts
1858 of the list which have changed.
1860 Initial position of cursor is restored after the changes."
1867 ;; Shift the indentation between END and BEG by DELTA.
1868 ;; Start from the line before END.
1877 ;; Skip inline tasks.
1880 ;; Shift only non-empty lines.
1886 ;; Replace ITEM first line elements with new elements from
1887 ;; STRUCT, if appropriate.
1897 ;; a. Replace bullet
1900 ;; b. Replace checkbox.
1911 ;; c. Indent item to appropriate column.
1916 ;; 1. First get list of items and position endings. We maintain
1917 ;; two alists: ITM-SHIFT, determining indentation shift needed
1918 ;; at item, and END-LIST, a pseudo-alist where key is ending
1919 ;; position and value point.
1932 ;; To determine real ind of an ending position that
1933 ;; is not at an item, we have to find the item it
1934 ;; belongs to: it is the last item (ITEM-UP), whose
1935 ;; ending is further than the position we're
1936 ;; interested in.
1940 ;; 2. Slice the items into parts that should be shifted by the
1941 ;; same amount of indentation. Each slice follow the pattern
1942 ;; (END BEG DELTA). Slices are returned in reverse order.
1945 #'<)
1953 ;; If we're not at an item, there's a child of the
1954 ;; item point belongs to above. Make sure the less
1955 ;; indented line in this slice has the same column
1956 ;; as that child.
1963 ;; Ignore empty lines. Also ignore blocks and
1964 ;; drawers contents.
1972 down t)))
1975 down t)))))
1979 ;; 3. Shift each slice in buffer, provided delta isn't 0, from
1980 ;; end to beginning. Take a special action when beginning is
1981 ;; at item bullet.
1988 ;; 4. Go back to initial position and clean marker.
1993 "Correct bullets, checkboxes and indentation in list at point.
1995 STRUCT is the list structure. PARENTS is the alist of parents,
1996 as returned by `org-list-parents-alist'.
1998 When non-nil, optional argument OLD-STRUCT is the reference
1999 structure of the list. It should be provided whenever STRUCT
2000 doesn't correspond anymore to the real list in buffer."
2001 ;; Order of functions matters here: checkboxes and endings need
2002 ;; correct indentation to be set, and indentation needs correct
2003 ;; bullets.
2004 ;;
2005 ;; 0. Save a copy of structure before modifications
2007 ;; 1. Set a temporary, but coherent with PARENTS, indentation in
2008 ;; order to get items endings and bullets properly
2010 ;; 2. Fix each item end to get correct prevs alist.
2012 ;; 3. Get bullets right.
2015 ;; 4. Now get real indentation.
2017 ;; 5. Eventually fix checkboxes.
2019 ;; 6. Apply structure modifications to buffer.
2023 \f
2024 ;;; Misc Tools
2027 "Call FUNCTION on each item of the list at point.
2028 FUNCTION must be called with at least one argument: INIT-VALUE,
2029 that will contain the value returned by the function at the
2030 previous item, plus ARGS extra arguments.
2032 FUNCTION is applied on items in reverse order.
2034 As an example, \(org-apply-on-list \(lambda \(result\) \(1+ result\)\) 0\)
2035 will return the number of items in the current list.
2037 Sublists of the list are skipped. Cursor is always at the
2038 beginning of the item."
2050 value))
2053 "Set visibility of ITEM in STRUCT to VIEW.
2055 Possible values are: `folded', `children' or `subtree'. See
2056 `org-cycle' for more information."
2060 ;; Hide from eol
2062 item-end t)))
2064 ;; First show everything.
2066 ;; Then fold every child.
2071 children)))
2073 ;; Show everything
2078 "Return column at which body of ITEM should start."
2090 2
2094 \f
2095 ;;; Interactive functions
2100 "Go to the beginning of the current item.
2101 Throw an error when not in a list."
2107 "Go to the beginning item of the current list or sublist.
2108 Throw an error when not in a list."
2119 "Go to the end of the current list or sublist.
2120 Throw an error when not in a list."
2131 "Go to the end of the current item.
2132 Throw an error when not in a list."
2142 "Move to the beginning of the previous item.
2143 Throw an error when not in a list. Also throw an error when at
2144 first item, unless `org-list-use-circular-motion' is non-nil."
2160 "Move to the beginning of the next item.
2161 Throw an error when not in a list. Also throw an error when at
2162 last item, unless `org-list-use-circular-motion' is non-nil."
2178 "Move the item at point down, i.e. swap with following item.
2179 Sub-items (items with larger indentation) are considered part of
2180 the item, so this really moves item trees."
2199 "Move the item at point up, i.e. swap with previous item.
2200 Sub-items (items with larger indentation) are considered part of
2201 the item, so this really moves item trees."
2218 "Insert a new item at the current level.
2219 If cursor is before first character after bullet of the item, the
2220 new item will be created before the current one.
2222 If CHECKBOX is non-nil, add a checkbox next to the bullet.
2224 Return t when things worked, nil when we are not in an item, or
2225 item is invisible."
2228 ;; If cursor isn't is a list or if list is invisible, return nil.
2236 ;; Timer list: delegate to `org-timer-item'.
2241 ;; If we're in a description list, ask for the new term.
2255 t)))))
2258 "Fix indentation, bullets and checkboxes in the list at point."
2266 "Cycle through the different itemize/enumerate bullets.
2267 This cycle the entire list level through the sequence:
2269 `-' -> `+' -> `*' -> `1.' -> `1)'
2271 If WHICH is a valid string, use that as the new bullet. If WHICH
2272 is an integer, 0 means `-', 1 means `+' etc. If WHICH is
2273 `previous', cycle backwards."
2293 ;; Compute list of possible bullets, depending on context.
2296 ;; *-bullets are not allowed at column 0.
2298 ;; Description items cannot be numbered.
2321 ;; Use a short variation of `org-list-write-struct' as there's
2322 ;; no need to go through all the steps.
2330 "Toggle the checkbox in the current line.
2331 With prefix arg TOGGLE-PRESENCE, add or remove checkboxes. With
2332 double prefix, set checkbox to [-].
2334 When there is an active region, toggle status or presence of the
2335 first checkbox there, and make every item inside have the same
2336 status or presence, respectively.
2338 If the cursor is in a headline, apply this to all checkbox items
2339 in the text below the heading, taking as reference the first item
2340 in subtree, ignoring drawers."
2344 block-item
2345 lim-up
2346 lim-down
2354 ;; In a region, start at first item in region.
2364 ;; On an heading, start at first item after drawers and
2365 ;; time-stamps (scheduled, etc.).
2377 ;; Just one item: set SINGLEP flag.
2383 ;; Determine the checkbox going to be applied to all items
2384 ;; within bounds.
2395 ;; When an item is found within bounds, grab the full list at
2396 ;; point structure, then: (1) set check-box of all its items
2397 ;; within bounds to REF-CHECKBOX, (2) fix check-boxes of the
2398 ;; whole list, (3) move point after the list.
2412 e struct
2413 ;; If there is no box at item, leave as-is
2414 ;; unless function was called with C-u prefix.
2417 ref-checkbox
2418 cur-box))))
2419 items-to-toggle)
2421 struct parents prevs orderedp))
2422 ;; Report some problems due to ORDERED status of subtree.
2423 ;; If only one box was being checked, throw an error, else,
2424 ;; only signal problems.
2428 "Checkbox blocked because of unchecked box at line %d"
2432 "Checkboxes were removed due to unchecked box at line %d"
2441 "Reset all checkboxes in an entry subtree."
2458 "Update the checkbox statistics in the current section.
2459 This will find all statistic cookies like [57%] and [6/12] and
2460 update them with the current numbers.
2462 With optional prefix argument ALL, do this for the whole buffer."
2466 (box-re "^[ \t]*\\([-+*]\\|\\([0-9]+\\|[A-Za-z]\\)[.)]\\)[ \t]+\\(?:\\[@\\(?:start:\\)?\\([0-9]+\\|[A-Za-z]\\)\\][ \t]*\\)?\\(\\[[- X]\\]\\)")
2478 ;; Return number of checked boxes and boxes of all types
2479 ;; in all structures in STRUCTS. If RECURSIVEP is
2480 ;; non-nil, also count boxes in sub-lists. If ITEM is
2481 ;; nil, count across the whole structure, else count only
2482 ;; across subtree whose ancestor is ITEM.
2499 items))))
2502 structs)
2505 cookies-list structs-bak box-num)
2507 ;; 1. Build an alist for each cookie found within BOUNDS. The
2508 ;; key will be position at beginning of cookie and values
2509 ;; ending position, format of cookie, and a cell whose car is
2510 ;; number of checked boxes to report, and cdr total number of
2511 ;; boxes.
2521 ;; Cookie is at an heading, but specifically for todo,
2522 ;; not for checkboxes: skip it.
2528 ;; Cookie is at an heading, but all lists before next
2529 ;; heading already have been read. Use data collected
2530 ;; in STRUCTS-BAK. This should only happen when
2531 ;; heading has more than one cookie on it.
2534 backup-end))
2536 ;; Cookie is at a fresh heading. Grab structure of
2537 ;; every list containing a checkbox between point and
2538 ;; next headline, and save them in STRUCTS-BAK.
2542 structs-bak nil)
2549 ;; Cookie is at an item, and we already have list
2550 ;; structure stored in STRUCTS-BAK.
2553 ;; Only lists in no special context are stored.
2556 ;; Cookie is at an item, but we need to compute list
2557 ;; structure.
2563 ;; Else, cookie found is at a wrong place. Skip it.
2565 cookies-list))))
2566 ;; 2. Apply alist to buffer, in reverse order so positions stay
2567 ;; unchanged after cookie modifications.
2582 cookies-list))))
2585 "Select the face for checkbox statistics.
2586 The face will be `org-done' when all relevant boxes are checked.
2587 Otherwise it will be `org-todo'."
2590 'org-checkbox-statistics-done
2594 'org-checkbox-statistics-done
2598 "Update checkbox statistics unless turned off by user.
2599 With an optional argument ALL, update them in the whole buffer."
2607 "Indent a local list item including its children.
2608 When number ARG is a negative, item will be outdented, otherwise
2609 it will be indented.
2611 If a region is active, all items inside will be moved.
2613 If NO-SUBTREE is non-nil, only indent the item itself, not its
2614 children.
2616 STRUCT is the list structure.
2618 Return t if successful."
2626 ;; Are we going to move the whole list?
2634 t))))
2635 ;; Determine begin and end points of zone to indent. If moving
2636 ;; more than one item, save them for subsequent moves.
2652 ;; Special case: moving top-item with indent rule.
2660 ;; Change bullet if necessary.
2666 ;; Shift every item by OFFSET and fix bullets. Then
2667 ;; apply changes to buffer.
2671 struct)
2674 ;; Forbidden move:
2676 ;; If only one item is moved, it mustn't have a child.
2680 ;; If a subtree or region is moved, the last item
2681 ;; of the subtree mustn't have a child.
2686 struct)))))
2689 ;; Normal shifting
2697 t)
2700 "Outdent a local list item, but not its children.
2701 If a region is active, all items inside will be moved."
2717 "Indent a local list item, but not its children.
2718 If a region is active, all items inside will be moved."
2734 "Outdent a local list item including its children.
2735 If a region is active, all items inside will be moved."
2751 "Indent a local list item including its children.
2752 If a region is active, all items inside will be moved."
2769 "Cycle levels of indentation of an empty item.
2770 The first run indents the item, if applicable. Subsequent runs
2771 outdent it at meaningful levels in the list. When done, item is
2772 put back at its original position with its original bullet.
2774 Return t at each successful move."
2780 ;; Accept empty items or if cycle has already started.
2791 ;; When in the middle of the cycle, try to outdent first. If
2792 ;; it fails, and point is still at initial position, indent.
2793 ;; Else, re-create it at its original position.
2802 ;; Break cycle
2804 ;; If a cycle is starting, remember indentation and bullet,
2805 ;; then try to indent. If it fails, try to outdent.
2811 t))))
2814 "Sort list items.
2815 The cursor may be at any item of the list that should be sorted.
2816 Sublists are not sorted. Checkboxes, if any, are ignored.
2818 Sorting can be alphabetically, numerically, by date/time as given
2819 by a time stamp, by a property or by priority.
2821 Comparing entries ignores case by default. However, with an
2822 optional argument WITH-CASE, the sorting considers case as well.
2824 The command prompts for the sorting type unless it has been given
2825 to the function through the SORTING-TYPE argument, which needs to
2826 be a character, \(?n ?N ?a ?A ?t ?T ?f ?F ?x ?X). Here is the
2827 detailed meaning of each character:
2829 n Numerically, by converting the beginning of the item to a number.
2830 a Alphabetically. Only the first line of item is checked.
2831 t By date/time, either the first active time stamp in the entry, if
2832 any, or by the first inactive one. In a timer list, sort the timers.
2835 Capital letters will reverse the sort order.
2837 If the SORTING-TYPE is ?f or ?F, then GETKEY-FUNC specifies
2838 a function to be called with point at the beginning of the
2839 record. It must return either a string or a number that should
2840 serve as the sorting key for that record. It will then use
2841 COMPARE-FUNC to compare entries.
2843 Sorting is done against the visible part of the headlines, it
2844 ignores hidden links."
2895 ;; If it is a timer list, convert timer to seconds
2912 value))
2916 next-record
2917 end-record
2918 value-to-sort
2919 nil
2920 sort-func)
2921 ;; Read and fix list again, as `sort-subr' probably destroyed
2922 ;; its structure.
2928 \f
2929 ;;; Send and receive lists
2932 "Parse the list at point and maybe DELETE it.
2934 Return a list whose car is a symbol of list type, among
2935 `ordered', `unordered' and `descriptive'. Then, each item is
2936 a list whose car is counter, and cdr are strings and other
2937 sub-lists. Inside strings, check-boxes are replaced by
2940 For example, the following list:
2942 1. first item
2943 + sub-item one
2944 + [X] sub-item two
2945 more text in first item
2946 2. [@3] last item
2948 will be parsed as:
2950 \(ordered
2952 \(unordered
2958 Point is left at list end."
2964 out
2965 parse-item ; for byte-compiler
2968 ;; Return text between BEG and END, trimmed, with
2969 ;; checkboxes replaced.
2980 text)))))
2983 ;; Return a list whose car is list type and cdr a list of
2984 ;; items' body.
2990 ;; Return a list containing counter of item, if any, text
2991 ;; and any sublist inside it.
2997 ;; Get counter number. For alphabetic counter, get
2998 ;; its position in the alphabet.
3009 ;; If item has a child, store text between bullet and
3010 ;; next child, then recursively parse all sublists. At
3011 ;; the end of each sublist, check for the presence of
3012 ;; text belonging to the original item.
3022 ;; Remove children from the list just parsed.
3024 ;; There is a chunk of text belonging to the
3025 ;; item if last child doesn't end where next
3026 ;; child starts or where item ends.
3030 body))))
3033 ;; Store output, take care of cursor position and deletion of
3034 ;; list, then return output.
3041 out))
3044 "Convert the plain list at point into a subtree."
3052 "Insert a radio list template appropriate for this major mode."
3056 name pos)
3067 "Send a transformed version of this list to the receiver position.
3068 With argument MAYBE, fail quietly if no transformation is defined
3069 for this list."
3091 beg txt)
3095 ;; Find the insertion place
3100 name
3114 "Trim line breaks in a list ITEM."
3118 "Convert a LIST parsed through `org-list-parse-list' to other formats.
3119 Valid parameters PARAMS are:
3121 :ustart String to start an unordered list
3122 :uend String to end an unordered list
3124 :ostart String to start an ordered list
3125 :oend String to end an ordered list
3127 :dstart String to start a descriptive list
3128 :dend String to end a descriptive list
3129 :dtstart String to start a descriptive term
3130 :dtend String to end a descriptive term
3131 :ddstart String to start a description
3132 :ddend String to end a description
3134 :splice When set to t, return only list body lines, don't wrap
3135 them into :[u/o]start and :[u/o]end. Default is nil.
3137 :istart String to start a list item.
3138 :icount String to start an item with a counter.
3139 :iend String to end a list item
3140 :isep String to separate items
3141 :lsep String to separate sublists
3142 :csep String to separate text from a sub-list
3144 :cboff String to insert for an unchecked check-box
3145 :cbon String to insert for a checked check-box
3146 :cbtrans String to insert for a check-box in transitional state
3148 :nobr Non-nil means remove line breaks in lists items.
3150 Alternatively, each parameter can also be a form returning
3151 a string. These sexp can use keywords `counter' and `depth',
3152 representing respectively counter associated to the current
3153 item, and depth of the current sub-list, starting at 0.
3154 Obviously, `counter' is only available for parameters applying to
3155 items."
3179 export-sublist ; for byte-compiler
3182 ;; Export an item ITEM of type TYPE, at DEPTH. First
3183 ;; string in item is treated in a special way as it can
3184 ;; bring extra information that needs to be processed.
3190 ;; Stick DTSTART to ISTART by
3191 ;; left-trimming the latter.
3195 istart))
3202 ;; Replace checkbox if any is found.
3210 ;; Replace line breaks if required
3212 ;; Insert descriptive term if TYPE is `descriptive'.
3221 first)))
3232 ;; Export sublist SUB at DEPTH.
3250 "Convert LIST into a LaTeX list.
3251 LIST is as string representing the list to transform, as Org
3252 syntax. Return converted list as a string."
3257 "Convert LIST into a HTML list.
3258 LIST is as string representing the list to transform, as Org
3259 syntax. Return converted list as a string."
3264 "Convert LIST into a Texinfo list.
3265 LIST is as string representing the list to transform, as Org
3266 syntax. Return converted list as a string."
3271 "Convert LIST into an Org subtree.
3272 LIST is as returned by `org-list-parse-list'. PARAMS is a property list
3273 with overruling parameters for `org-list-to-generic'."
3283 ;; Return the string for the heading, depending on depth D
3284 ;; of current sub-list.
3289 oddeven-level)
3290 ?*)
3293 list
3295 '(:splice t
3302 params))))
3306 ;;; org-list.el ends here