| blob | 9864b1824bb531bc018f797db2306f57ccdbcf8d |
1 ;;; org-list.el --- Plain lists for Org -*- lexical-binding: t; -*-
2 ;;
3 ;; Copyright (C) 2004-2019 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: https://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 <https://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:
111 (declare-function org-element-map "org-element" (data types fun &optional info first-match no-recursion with-affiliated))
149 \f
150 ;;; Configuration variables
153 "Options concerning plain lists in Org mode."
158 "When t, make TAB cycle visibility on plain list items.
159 Cycling plain lists works only when the cursor is on a plain list
160 item. When the cursor is on an outline heading, plain lists are
161 treated as text. This is the most stable way of handling this,
162 which is why it is the default.
164 When this is the symbol `integrate', then integrate plain list
165 items when cycling, as if they were children of outline headings.
167 This setting can lead to strange effects when switching visibility
170 plain list item with an implied large level number, all true
171 children and grand children of the outline heading will be
172 exposed in a children' view."
181 "Default bullet type installed when demoting an item.
182 This is an association list, for each bullet type, this alist will point
183 to the bullet that should be used when this item is demoted.
184 For example,
186 (setq org-list-demote-modify-bullet
189 will make
191 + Movies
192 + Silence of the Lambs
193 + My Cousin Vinny
194 + Books
195 + The Hunt for Red October
196 + The Road to Omaha
198 into
200 + Movies
201 - Silence of the Lambs
202 - My Cousin Vinny
203 + Books
204 - The Hunt for Red October
205 - The Road to Omaha"
223 "The character that makes a line with leading number an ordered list item.
226 This variable needs to be set before org.el is loaded. If you
227 need to make a change while Emacs is running, use the customize
228 interface or run the following code after updating it:
239 "Non-nil means single character alphabetical bullets are allowed.
241 Both uppercase and lowercase are handled. Lists with more than
242 26 items will fallback to standard numbering. Alphabetical
245 This variable needs to be set before org.el is loaded. If you
246 need to make a change while Emacs is running, use the customize
247 interface or run the following code after updating it:
257 "A regular expression matching bullets that should have 2 spaces after them.
258 When nil, no bullet will have two spaces after them. When
259 a string, it will be used as a regular expression. When the
260 bullet type of a list is changed, the new bullet type will be
261 matched against this regexp. If it matches, there will be two
262 spaces instead of one after the bullet in each item of the list."
270 "Non-nil means apply set of rules when acting on lists.
272 By default, automatic actions are taken when using
282 You can disable individually these rules by setting them to nil.
283 Valid rules are:
285 checkbox when non-nil, checkbox statistics is updated each time
286 you either insert a new checkbox or toggle a checkbox.
287 indent when non-nil, indenting or outdenting list top-item
288 with its subtree will move the whole list and
289 outdenting a list whose bullet is * to column 0 will
294 :key-type
298 :value-type
302 "Non-nil means commands implying motion in lists should be cyclic.
304 In that case, the item following the last item is the first one,
305 and the item preceding the first item is the last one.
307 This affects the behavior of
317 "Hook that is run whenever Org thinks checkbox statistics should be updated.
318 This hook runs even if checkbox rule in
319 `org-list-automatic-rules' does not apply, so it can be used to
320 implement alternative ways of collecting statistics
324 "Non-nil means checkbox statistics counts only the state of direct children.
325 When nil, all boxes below the cookie are counted.
326 This can be set to nil on a per-node basis using a COOKIE_DATA property
332 "Additional indentation for sub-items in a list.
333 By setting this to a small number, usually 1 or 2, one can more
334 clearly distinguish sub-items in a list."
340 "Names of blocks where lists are not allowed.
343 \f
344 ;;; Predicates and regexps
354 "Matches a list item and puts everything into groups:
355 group 1: bullet
356 group 2: counter
357 group 3: checkbox
361 "Return the correct regular expression for plain lists."
372 "Regexp matching the beginning of a plain list item."
376 "Is point at a list item with REGEXP after bullet?"
385 ;; Ignore counter if any
390 "Is point in a context where lists are allowed?"
394 "Return item beginning position when in a plain list, nil otherwise."
403 ;; Indentation isn't meaningful when point starts at an empty
404 ;; line or an inline task.
407 10000
413 ;; Detect if cursor in amidst `org-list-end-re'. First, count
414 ;; number HL of hard lines it takes, then call `org-in-regexp'
415 ;; to compute its boundaries END-BOUNDS. When point is
416 ;; in-between, move cursor before regexp beginning.
427 ;; Look for an item, less indented that reference line.
432 ;; This is exactly what we want.
435 ;; At upper bound of search or looking at the end of a
436 ;; previous list: search is over.
439 ;; Skip blocks, drawers, inline-tasks, blank lines
449 ;; Text at column 0 cannot belong to a list: stop.
451 ;; Normal text less indented than reference line, take
452 ;; it as new reference.
459 "Is point in a line starting a hand-formatted item?"
465 "Is point at the bullet of a plain list item?"
471 "Is point at a line starting a plain list item with a timer?"
476 "Is point at a description list item?"
480 "Is point at a line starting a plain-list item with a checklet?"
484 "Is point at a line starting a plain-list item with a counter?"
490 \f
491 ;;; Structures and helper functions
494 "Determine context, and its boundaries, around point.
496 Context will be a cell like (MIN MAX CONTEXT) where MIN and MAX
497 are boundaries and CONTEXT is a symbol among `drawer', `block',
498 `invalid', `inlinetask' and nil.
500 Contexts `block' and `invalid' refer to `org-list-forbidden-blocks'."
506 ;; Get positions of surrounding headings. This is the
507 ;; default context.
512 ;; Is point inside a drawer?
522 lim-down))
525 ;; Is point strictly in a block, and of which type?
536 lim-down))
542 ;; Is point in an inlinetask?
555 ;; Return context boundaries and type.
559 "Return structure of list at point.
561 A list structure is an alist where key is point at item, and
562 values are:
563 1. indentation,
564 2. bullet with trailing whitespace,
565 3. bullet counter, if any,
566 4. checkbox, if any,
567 5. description tag, if any,
568 6. position at item end.
570 Thus the following list, where numbers in parens are
571 point-at-bol:
573 - [X] first item (1)
574 1. sub-item 1 (18)
575 5. [@5] sub-item 2 (34)
576 some other text belonging to first item (55)
577 - last item (97)
578 + tag :: description (109)
579 (131)
581 will get the following structure:
589 Assume point is at an item."
601 itm-lst itm-lst-2 end-lst end-lst-2 struct
604 ;; Return association at point.
609 ind
610 bullet
613 ;; Description tag.
618 ;; Ensure list ends at the first blank line.
622 ;; 1. Read list from starting item to its beginning, and save
623 ;; top item position and indentation in BEG-CELL. Also store
624 ;; ending position of items in END-LST.
631 ;; At upward limit: if we ended at an item, store it,
632 ;; else dismiss useless data recorded above BEG-CELL.
633 ;; Jump to part 2.
640 ;; Looking at a list ending regexp. Dismiss useless
641 ;; data recorded above BEG-CELL. Jump to part 2.
646 ;; Point is at an item. Add data to ITM-LST. It may
647 ;; also end a previous item: save it in END-LST. If
648 ;; ind is less or equal than BEG-CELL and there is no
649 ;; end at this ind or lesser, this item becomes the new
650 ;; BEG-CELL.
656 ;; Skip blocks, drawers, inline tasks, blank lines.
667 ;; From there, point is not at an item. Interpret
668 ;; line's indentation:
669 ;; - text at column 0 is necessarily out of any list.
670 ;; Dismiss data recorded above BEG-CELL. Jump to
671 ;; part 2.
672 ;; - any other case may be an ending position for an
673 ;; hypothetical item above. Store it and proceed.
682 ;; 2. Read list from starting point to its end, that is until we
683 ;; get out of context, or that a non-item line is less or
684 ;; equally indented than BEG-CELL's cdr. Also, store ending
685 ;; position of items in END-LST-2.
691 ;; At downward limit: this is de facto the end of the
692 ;; list. Save point as an ending position, and jump to
693 ;; part 3.
696 ;; Looking at a list ending regexp. Save point as an
697 ;; ending position and jump to part 3.
701 ;; Point is at an item. Add data to ITM-LST-2. It may
702 ;; also end a previous item, so save it in END-LST-2.
706 ;; Skip inline tasks and blank lines along the way
711 ;; Ind is lesser or equal than BEG-CELL's. The list is
712 ;; over: store point as an ending position and jump to
713 ;; part 3.
717 ;; Else, if ind is lesser or equal than previous item's,
718 ;; this is an ending position: store it. In any case,
719 ;; skip block or drawer at point, and move to next line.
731 ;; 3. Associate each item to its end position.
733 ;; 4. Return STRUCT
734 struct)))
737 "Associate proper ending point to items in STRUCT.
739 END-LIST is a pseudo-alist where car is indentation and cdr is
740 ending position.
742 This function modifies STRUCT."
748 ;; Remove end candidates behind current item.
751 ;; Add end position to item assoc.
757 struct)))
760 "Return alist between item and previous item in STRUCT."
762 struct)))
766 struct)))
769 "Return alist between item and parent in STRUCT."
781 ;; A sub-list is over. Find the associated
782 ;; origin in IND-TO-ORI. If it cannot be
783 ;; found (ill-formed list), set its parent as
784 ;; the first item less indented. If there is
785 ;; none, make it a top-level item.
793 ind-to-ori)
796 ;; A sub-list starts. Every item at IND will
797 ;; have previous item as its parent.
802 ;; Another item in the same sub-list: it shares
803 ;; the same parent as the previous item.
808 "Delete metadata from the heading at point.
809 Metadata are tags, planning information and properties drawers."
819 \f
820 ;;; Accessors
823 "Return the Nth value of KEY in STRUCT."
827 "Set the Nth value of KEY in STRUCT to NEW.
832 "Return indentation of ITEM in STRUCT."
836 "Set indentation of ITEM in STRUCT to IND.
841 "Return bullet of ITEM in STRUCT."
845 "Set bullet of ITEM in STRUCT to BULLET.
850 "Return counter of ITEM in STRUCT."
854 "Return checkbox of ITEM in STRUCT or nil."
858 "Set checkbox of ITEM in STRUCT to CHECKBOX.
863 "Return end position of ITEM in STRUCT."
867 "Return end position of ITEM in STRUCT."
871 "Return point at end of ITEM in STRUCT, before any blank line.
872 Point returned is at end of line."
879 "Return parent of ITEM or nil.
880 STRUCT is the list structure. PARENTS is the alist of parents,
881 as returned by `org-list-parents-alist'."
886 "Non-nil if ITEM has a child.
888 STRUCT is the list structure.
890 Value returned is the position of the first child of ITEM."
895 child-maybe)))
898 "Return next item in same sub-list as ITEM, or nil.
899 STRUCT is the list structure. PREVS is the alist of previous
900 items, as returned by `org-list-prevs-alist'."
904 "Return previous item in same sub-list as ITEM, or nil.
905 STRUCT is the list structure. PREVS is the alist of previous
906 items, as returned by `org-list-prevs-alist'."
910 "List all items having ITEM as a common ancestor, or nil.
911 STRUCT is the list structure."
914 subtree)
919 sub-struct))
923 "List all items in the same sub-list as ITEM.
924 STRUCT is the list structure. PREVS is the alist of previous
925 items, as returned by `org-list-prevs-alist'."
928 before-item after-item)
936 "List all children of ITEM, or nil.
937 STRUCT is the list structure. PARENTS is the alist of parents,
938 as returned by `org-list-parents-alist'."
946 "Return point at beginning of list.
947 STRUCT is the list structure."
951 "Return point at bottom of list.
952 STRUCT is the list structure."
957 "Return point at beginning of sub-list ITEM belongs.
958 STRUCT is the list structure. PREVS is the alist of previous
959 items, as returned by `org-list-prevs-alist'."
963 first-item))
968 "Return point at last item of sub-list ITEM belongs.
969 STRUCT is the list structure. PREVS is the alist of previous
970 items, as returned by `org-list-prevs-alist'."
974 last-item))
977 "Return point at end of sub-list ITEM belongs.
978 STRUCT is the list structure. PREVS is the alist of previous
979 items, as returned by `org-list-prevs-alist'."
983 "Return the type of the list containing ITEM, as a symbol.
985 STRUCT is the list structure. PREVS is the alist of previous
986 items, as returned by `org-list-prevs-alist'.
988 Possible types are `descriptive', `ordered' and `unordered'. The
989 type is determined by the first item of the list."
997 "Return ITEM's sequence number.
999 STRUCT is the list structure. PREVS is the alist of previous
1000 items, as returned by `org-list-prevs-alist'. PARENTS is the
1001 alist of ancestors, as returned by `org-list-parents-alist'.
1003 Return value is a list of integers. Counters have an impact on
1004 that value."
1008 ;; Return relative sequence number of ITEM in the sub-list
1009 ;; it belongs. STRUCT is the list structure. PREVS is
1010 ;; the alist of previous items.
1019 seq))
1023 ;; Cons each parent relative number into return value (OUT).
1028 ;; Return value.
1029 out)))
1032 \f
1033 ;;; Searching
1036 "Search a string in valid contexts for lists.
1037 Arguments SEARCH, RE, BOUND and NOERR are similar to those used
1038 in `re-search-forward'."
1042 ;; 1. No match: return to origin or bound, depending on NOERR.
1045 nil)))
1046 ;; 2. Match in valid context: return point. Else, continue
1047 ;; searching.
1051 "Like `re-search-backward' but stop only where lists are recognized.
1052 Arguments REGEXP, BOUND and NOERROR are similar to those used in
1053 `re-search-backward'."
1058 "Like `re-search-forward' but stop only where lists are recognized.
1059 Arguments REGEXP, BOUND and NOERROR are similar to those used in
1060 `re-search-forward'."
1065 \f
1066 ;;; Methods on structures
1069 "Return BULLET with the correct number of whitespaces.
1070 It determines the number of whitespaces to append by looking at
1071 `org-list-two-spaces-after-bullet-regexp'."
1075 org-list-two-spaces-after-bullet-regexp bullet))
1076 " "
1080 bullet))))
1083 "Swap item starting at BEG-A with item starting at BEG-B in STRUCT.
1085 Blank lines at the end of items are left in place. Item
1086 visibility is preserved. Return the new structure after the
1087 changes.
1089 Assume BEG-A is lesser than BEG-B and that BEG-A and BEG-B belong
1090 to the same sub-list.
1092 This function modifies STRUCT."
1105 ;; Store overlays responsible for visibility status. We
1106 ;; also need to store their boundaries as they will be
1107 ;; removed from buffer.
1122 ;; 1. Move effectively items in buffer.
1126 ;; 2. Now modify struct. No need to re-read the list, the
1127 ;; transformation is just a shift of positions. Some special
1128 ;; attention is required for items ending at END-A and END-B
1129 ;; as empty spaces are not moved there. In others words,
1130 ;; item BEG-A will end with whitespaces that were at the end
1131 ;; of BEG-B and the same applies to BEG-B.
1154 ;; Restore visibility status, by moving overlays to their new
1155 ;; position.
1165 ;; Return structure.
1166 struct)))
1169 "Return number of blank lines that should separate items in list.
1171 POS is the position of point where `org-list-insert-item' was called.
1173 STRUCT is the list structure. PREVS is the alist of previous
1174 items, as returned by `org-list-prevs-alist'.
1176 Assume point is at item's beginning. If the item is alone, apply
1177 some heuristics to guess the result."
1182 usr-blank
1186 ;; Count blank lines above beginning of line.
1193 ;; Trivial cases where there should be none.
1195 ;; When `org-blank-before-new-entry' says so, it is 1.
1197 ;; `plain-list-item' is 'auto. Count blank lines separating
1198 ;; neighbors' items in list.
1201 ;; Is there a next item?
1204 ;; Is there a previous item?
1207 ;; User inserted blank lines, trust him.
1212 usr-blank)
1213 ;; Are there blank lines inside the list so far?
1216 ;; Do not use `org-list-search-forward' so blank lines
1217 ;; in blocks can be counted in.
1221 ;; Default choice: no blank line.
1225 "Insert a new list item at POS and return the new structure.
1226 If POS is before first character after bullet of the item, the
1227 new item will be created before the current one.
1229 STRUCT is the list structure. PREVS is the alist of previous
1230 items, as returned by `org-list-prevs-alist'.
1232 Insert a checkbox if CHECKBOX is non-nil, and string AFTER-BULLET
1233 after the bullet. Cursor will be after this text once the
1234 function ends.
1236 This function modifies STRUCT."
1238 ;; 1. Get information about list: ITEM containing POS, position of
1239 ;; point with regards to item start (BEFOREP), blank lines
1240 ;; number separating items (BLANK-NB), if we're allowed to
1241 ;; (SPLIT-LINE-P).
1249 inner-item))))
1255 (<= pos
1258 ;; Ignore tag in a non-descriptive list.
1267 pos struct prevs))
1268 ;; 2. Build the new item to be created. Concatenate same
1269 ;; bullet as item, checkbox, text AFTER-BULLET if
1270 ;; provided, and text cut from point to end of item
1271 ;; (TEXT-CUT) to form item's BODY. TEXT-CUT depends on
1272 ;; BEFOREP and SPLIT-LINE-P. The difference of size
1273 ;; between what was cut and what was inserted in buffer
1274 ;; is stored in SIZE-OFFSET.
1278 ind))
1285 ;; If POS is greater than ITEM-END, then point is
1286 ;; in some white lines after the end of the list.
1287 ;; Those must be removed, or they will be left,
1288 ;; stacking up after the list.
1298 text-cut))))
1302 ;; 4. Insert effectively item into buffer.
1306 ;; 5. Add new item to STRUCT.
1310 ;; Before inserted item, positions don't change but
1311 ;; an item ending after insertion has its end shifted
1312 ;; by SIZE-OFFSET.
1315 ;; Trivial cases where current item isn't split in
1316 ;; two. Just shift every item after new one by
1317 ;; ITEM-SIZE.
1321 ;; Item is split in two: elements before POS are just
1322 ;; shifted by ITEM-SIZE. In the case item would end
1323 ;; after split POS, ending is only shifted by
1324 ;; SIZE-OFFSET.
1330 ;; Elements after POS are moved into new item.
1331 ;; Length of ITEM-SEP has to be removed as ITEM-SEP
1332 ;; doesn't appear in buffer yet.
1338 (+ end size-offset
1340 ;; Elements at ITEM-END or after are only shifted by
1341 ;; SIZE-OFFSET.
1344 struct)
1347 ;; 6. If not BEFOREP, new item must appear after ITEM, so
1348 ;; exchange ITEM with the next item in list. Position cursor
1349 ;; after bullet, counter, checkbox, and label.
1355 struct)))
1358 "Remove ITEM from the list and return the new structure.
1360 STRUCT is the list structure."
1363 ;; If ITEM ends with the list, delete blank lines
1364 ;; before it.
1369 item)))
1370 ;; Remove item from buffer.
1372 ;; Remove item from structure and shift others items accordingly.
1373 ;; Don't forget to shift also ending position when appropriate.
1391 struct)))))
1394 "Send ITEM to destination DEST.
1396 STRUCT is the list structure.
1398 DEST can have various values.
1400 If DEST is a buffer position, the function will assume it points
1401 to another item in the same list as ITEM, and will move the
1402 latter just before the former.
1404 If DEST is `begin' (respectively `end'), ITEM will be moved at
1405 the beginning (respectively end) of the list it belongs to.
1408 be moved at the Nth position in the list.
1410 If DEST is `kill', ITEM will be deleted and its body will be
1411 added to the kill-ring.
1413 If DEST is `delete', ITEM will be deleted.
1415 Visibility of item is preserved.
1417 This function returns, destructively, the new list structure."
1420 ;; Grab full item body minus its bullet.
1429 item-end)))
1430 ;; Change DEST into a buffer position. A trick is needed
1431 ;; when ITEM is meant to be sent at the end of the list.
1432 ;; Indeed, by setting locally `org-M-RET-may-split-line' to
1433 ;; nil and insertion point (INS-POINT) to the first line's
1434 ;; end of the last item, we ensure the new item will be
1435 ;; inserted after the last item, and not after any of its
1436 ;; hypothetical sub-items.
1452 ;; Send ITEM at the end of the list.
1460 ;; Store inner overlays (to preserve visibility).
1472 ;; 1. Structure returned by `org-list-insert-item' may not be
1473 ;; accurate, as it cannot see sub-items included in BODY.
1474 ;; Thus, first compute the real structure so far.
1482 ;; 1.1. Remove the item just created in structure.
1484 ;; 1.2. Copy ITEM and any of its sub-items at NEW-ITEM.
1487 struct
1495 new-end
1497 moved-items))
1499 ;; 2. Restore inner overlays.
1504 ;; 3. Eventually delete extra copy of the item and clean marker.
1510 "Outdent items between positions START and END.
1512 STRUCT is the list structure. PARENTS is the alist of items'
1513 parents, as returned by `org-list-parents-alist'.
1515 START is included, END excluded."
1521 ;; Item not yet in zone: keep association.
1523 ;; Item out of zone: follow associations in ACC.
1527 ;; Item has no parent: error
1530 ;; Parent is outdented: keep association.
1534 ;; Parent isn't outdented: reparent to grand-parent.
1536 parent struct parents)))
1542 "Indent items between positions START and END.
1544 STRUCT is the list structure. PARENTS is the alist of parents
1545 and PREVS is the alist of previous items, returned by,
1546 respectively, `org-list-parents-alist' and
1547 `org-list-prevs-alist'.
1549 START is included and END excluded.
1551 STRUCT may be modified if `org-list-demote-modify-bullet' matches
1552 bullets between START and END."
1559 ;; Normalize ordered bullets.
1569 org-list-demote-modify-bullet))))
1576 ;; Item not yet in zone: keep association.
1579 ;; Item out of zone: follow associations in ACC.
1583 ;; Item is in zone...
1585 ;; Check if bullet needs to be changed.
1588 ;; First item indented but not parent: error
1591 ;; First item and parent indented: keep same
1592 ;; parent.
1594 ;; Previous item not indented: reparent to it.
1596 ;; Previous item indented: reparent like it.
1603 \f
1604 ;;; Repairing structures
1607 "Non-nil if list starting at FIRST can have alphabetical bullets.
1609 STRUCT is list structure. PREVS is the alist of previous items,
1610 as returned by `org-list-prevs-alist'."
1614 ;; Pretend that bullets are uppercase and check if alphabet
1615 ;; is sufficient, taking counters into account.
1618 ;; Virtually determine current bullet
1620 ;; Counters are not case-sensitive.
1623 ;; Test if bullet would be over z or Z.
1627 ;; All items checked. All good.
1628 t))))
1631 "Increment BULLET if applicable."
1634 ;; Num bullet: increment it.
1638 nil nil bullet))
1639 ;; Alpha bullet: increment it.
1643 nil nil bullet))
1644 ;; Unordered bullet: leave it.
1648 "Verify and correct bullets in STRUCT.
1649 PREVS is the alist of previous items, as returned by
1650 `org-list-prevs-alist'.
1652 This function modifies STRUCT."
1656 ;; Set bullet of ITEM in STRUCT, depending on the type of
1657 ;; first item of the list, the previous bullet and counter
1658 ;; if any.
1667 item struct
1670 ;; Alpha counter in alpha list: use counter.
1674 ;; Use cond to be sure `string-match' is used in
1675 ;; both cases.
1681 ;; Num counter in a num list: use counter.
1686 ;; No counter: increase, if needed, previous bullet.
1689 ;; Alpha counter at first item: use counter.
1698 ;; Num counter at first item: use counter.
1703 ;; First bullet is alpha uppercase: use "A".
1706 ;; First bullet is alpha lowercase: use "a".
1709 ;; First bullet is num: use "1".
1712 ;; Not an ordered list: keep bullet.
1717 "Verify and correct indentation in STRUCT.
1719 PARENTS is the alist of parents, as returned by
1720 `org-list-parents-alist'.
1722 If numeric optional argument BULLET-SIZE is set, assume all
1723 bullets in list have this length to determine new indentation.
1725 This function modifies STRUCT."
1732 ;; Indent like parent + length of parent's bullet +
1733 ;; sub-list offset.
1739 org-list-indent-offset))
1740 ;; If no parent, indent like top-point.
1745 "Verify and correct checkboxes in STRUCT.
1747 PARENTS is the alist of parents and PREVS is the alist of
1748 previous items, as returned by, respectively,
1749 `org-list-parents-alist' and `org-list-prevs-alist'.
1751 If ORDERED is non-nil, a checkbox can only be checked when every
1752 checkbox before it is checked too. If there was an attempt to
1753 break this rule, the function will return the blocking item. In
1754 all others cases, the return value will be nil.
1756 This function modifies STRUCT."
1766 item struct
1772 ;; Parent has no boxed child: leave box as-is.
1774 parent-list)
1775 ;; 1. List all parents with a checkbox.
1782 all-items)
1783 ;; 2. Sort those parents by decreasing indentation.
1788 ;; 3. For each parent, get all children's checkboxes to determine
1789 ;; and set its checkbox accordingly.
1791 ;; 4. If ORDERED is set, see if we need to uncheck some boxes.
1796 ;; There are boxes checked after an unchecked one: fix that.
1803 ;; Verify once again the structure, without ORDERED.
1805 ;; Return blocking item.
1809 "Verify and correct each item end position in STRUCT.
1811 This function modifies STRUCT."
1818 ;; To determine real ind of an ending position that is
1819 ;; not at an item, we have to find the item it belongs
1820 ;; to: it is the last item (ITEM-UP), whose ending is
1821 ;; further than the position we're interested in.
1824 ;; Else part is for the bottom point.
1826 end-pos)
1827 end-list)))
1830 struct)
1835 "Apply set difference between STRUCT and OLD-STRUCT to the buffer.
1837 OLD-STRUCT is the structure before any modifications, and STRUCT
1838 the structure to be applied. The function will only modify parts
1839 of the list which have changed.
1841 Initial position of cursor is restored after the changes."
1848 ;; Shift the indentation between END and BEG by DELTA.
1849 ;; Start from the line before END.
1858 ;; Skip inline tasks.
1861 ;; Shift only non-empty lines.
1867 ;; Replace ITEM first line elements with new elements from
1868 ;; STRUCT, if appropriate.
1878 ;; a. Replace bullet
1881 ;; b. Replace checkbox.
1892 ;; c. Indent item to appropriate column.
1897 ;; 1. First get list of items and position endings. We maintain
1898 ;; two alists: ITM-SHIFT, determining indentation shift needed
1899 ;; at item, and END-LIST, a pseudo-alist where key is ending
1900 ;; position and value point.
1913 ;; To determine real ind of an ending position that
1914 ;; is not at an item, we have to find the item it
1915 ;; belongs to: it is the last item (ITEM-UP), whose
1916 ;; ending is further than the position we're
1917 ;; interested in.
1921 ;; 2. Slice the items into parts that should be shifted by the
1922 ;; same amount of indentation. Each slice follow the pattern
1923 ;; (END BEG DELTA). Slices are returned in reverse order.
1926 #'<)
1934 ;; If we're not at an item, there's a child of the
1935 ;; item point belongs to above. Make sure the less
1936 ;; indented line in this slice has the same column
1937 ;; as that child.
1944 ;; Ignore empty lines. Also ignore blocks and
1945 ;; drawers contents.
1953 down t)))
1956 down t)))))
1960 ;; 3. Shift each slice in buffer, provided delta isn't 0, from
1961 ;; end to beginning. Take a special action when beginning is
1962 ;; at item bullet.
1969 ;; 4. Go back to initial position and clean marker.
1974 "Correct bullets, checkboxes and indentation in list at point.
1976 STRUCT is the list structure. PARENTS is the alist of parents,
1977 as returned by `org-list-parents-alist'.
1979 When non-nil, optional argument OLD-STRUCT is the reference
1980 structure of the list. It should be provided whenever STRUCT
1981 doesn't correspond anymore to the real list in buffer."
1982 ;; Order of functions matters here: checkboxes and endings need
1983 ;; correct indentation to be set, and indentation needs correct
1984 ;; bullets.
1985 ;;
1986 ;; 0. Save a copy of structure before modifications
1988 ;; 1. Set a temporary, but coherent with PARENTS, indentation in
1989 ;; order to get items endings and bullets properly
1991 ;; 2. Fix each item end to get correct prevs alist.
1993 ;; 3. Get bullets right.
1996 ;; 4. Now get real indentation.
1998 ;; 5. Eventually fix checkboxes.
2000 ;; 6. Apply structure modifications to buffer.
2002 ;; 7. Return the updated structure
2003 struct)
2006 \f
2007 ;;; Misc Tools
2010 "Call FUNCTION on each item of the list at point.
2011 FUNCTION must be called with at least one argument: INIT-VALUE,
2012 that will contain the value returned by the function at the
2013 previous item, plus ARGS extra arguments.
2015 FUNCTION is applied on items in reverse order.
2017 As an example, \(org-apply-on-list \(lambda \(result) \(1+ result)) 0)
2018 will return the number of items in the current list.
2020 Sublists of the list are skipped. Cursor is always at the
2021 beginning of the item."
2033 value))
2036 "Set visibility of ITEM in STRUCT to VIEW.
2038 Possible values are: `folded', `children' or `subtree'. See
2039 `org-cycle' for more information."
2043 ;; Hide from eol
2047 ;; First show everything.
2049 ;; Then fold every child.
2054 children)))
2056 ;; Show everything
2061 "Return column at which body of ITEM should start."
2069 2
2073 \f
2074 ;;; Interactive functions
2079 "Go to the beginning of the current item.
2080 Throw an error when not in a list."
2086 "Go to the beginning item of the current list or sublist.
2087 Throw an error when not in a list."
2098 "Go to the end of the current list or sublist.
2099 Throw an error when not in a list."
2110 "Go to the end of the current item.
2111 Throw an error when not in a list."
2121 "Move to the beginning of the previous item.
2122 Throw an error when not in a list. Also throw an error when at
2123 first item, unless `org-list-use-circular-motion' is non-nil."
2139 "Move to the beginning of the next item.
2140 Throw an error when not in a list. Also throw an error when at
2141 last item, unless `org-list-use-circular-motion' is non-nil."
2157 "Move the item at point down, i.e. swap with following item.
2158 Sub-items (items with larger indentation) are considered part of
2159 the item, so this really moves item trees."
2178 "Move the item at point up, i.e. swap with previous item.
2179 Sub-items (items with larger indentation) are considered part of
2180 the item, so this really moves item trees."
2197 "Insert a new item at the current level.
2198 If cursor is before first character after bullet of the item, the
2199 new item will be created before the current one.
2201 If CHECKBOX is non-nil, add a checkbox next to the bullet.
2203 Return t when things worked, nil when we are not in an item, or
2204 item is invisible."
2208 ;; If cursor isn't is a list or if list is invisible, return nil.
2216 ;; Timer list: delegate to `org-timer-item'.
2221 ;; If we're in a description list, ask for the new term.
2235 t)))))
2238 "Fix indentation, bullets and checkboxes in the list at point."
2246 "Cycle through the different itemize/enumerate bullets.
2247 This cycle the entire list level through the sequence:
2249 `-' -> `+' -> `*' -> `1.' -> `1)'
2251 If WHICH is a valid string, use that as the new bullet. If WHICH
2252 is an integer, 0 means `-', 1 means `+' etc. If WHICH is
2253 `previous', cycle backwards."
2273 ;; Compute list of possible bullets, depending on context.
2276 ;; *-bullets are not allowed at column 0.
2278 ;; Description items cannot be numbered.
2301 ;; Use a short variation of `org-list-write-struct' as there's
2302 ;; no need to go through all the steps.
2310 "Toggle the checkbox in the current line.
2312 With prefix argument TOGGLE-PRESENCE, add or remove checkboxes.
2315 When there is an active region, toggle status or presence of the
2316 first checkbox there, and make every item inside have the same
2317 status or presence, respectively.
2319 If point is on a headline, apply this to all checkbox items in
2320 the text below the heading, taking as reference the first item in
2321 subtree, ignoring planning line and any drawer following it."
2325 block-item
2326 lim-up
2327 lim-down
2330 ;; In a region, start at first item in region.
2340 ;; On a heading, start at first item after drawers and
2341 ;; time-stamps (scheduled, etc.).
2348 ;; Just one item: set SINGLEP flag.
2354 ;; Determine the checkbox going to be applied to all items
2355 ;; within bounds.
2366 ;; When an item is found within bounds, grab the full list at
2367 ;; point structure, then: (1) set check-box of all its items
2368 ;; within bounds to REF-CHECKBOX, (2) fix check-boxes of the
2369 ;; whole list, (3) move point after the list.
2383 e struct
2384 ;; If there is no box at item, leave as-is
2385 ;; unless function was called with C-u prefix.
2388 ref-checkbox
2389 cur-box))))
2390 items-to-toggle)
2392 struct parents prevs orderedp))
2393 ;; Report some problems due to ORDERED status of subtree.
2394 ;; If only one box was being checked, throw an error, else,
2395 ;; only signal problems.
2399 "Checkbox blocked because of unchecked box at line %d"
2403 "Checkboxes were removed due to unchecked box at line %d"
2412 "Reset all checkboxes in an entry subtree."
2429 "Update the checkbox statistics in the current section.
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."
2455 ;; Return number of checked boxes and boxes of all types
2456 ;; in all structures in STRUCTS. If RECURSIVEP is
2457 ;; non-nil, also count boxes in sub-lists. If ITEM is
2458 ;; nil, count across the whole structure, else count only
2459 ;; across subtree whose ancestor is ITEM.
2474 items))))
2477 cookies-list cache)
2478 ;; Move to start.
2482 ;; Build an alist for each cookie found. The key is the position
2483 ;; at beginning of cookie and values ending position, format of
2484 ;; cookie, number of checked boxes to report and total number of
2485 ;; boxes.
2495 context
2497 quote-block special-block verse-block)))
2513 structs)
2518 structs)
2519 ;; Skip whole list since we have its
2520 ;; structure anyway.
2525 end))))))
2526 ;; Cache count for cookies applying to the same
2527 ;; area. Then return it.
2534 structs
2535 recursivep)))
2537 count))))))
2538 cookies-list))))
2539 ;; Apply alist to buffer.
2555 "Select the face for checkbox statistics.
2556 The face will be `org-done' when all relevant boxes are checked.
2557 Otherwise it will be `org-todo'."
2560 'org-checkbox-statistics-done
2564 'org-checkbox-statistics-done
2568 "Update checkbox statistics unless turned off by user.
2569 With an optional argument ALL, update them in the whole buffer."
2577 "Indent a local list item including its children.
2578 When number ARG is a negative, item will be outdented, otherwise
2579 it will be indented.
2581 If a region is active, all items inside will be moved.
2583 If NO-SUBTREE is non-nil, only indent the item itself, not its
2584 children.
2586 STRUCT is the list structure.
2588 Return t if successful."
2596 ;; Are we going to move the whole list?
2604 t))))
2605 ;; Determine begin and end points of zone to indent. If moving
2606 ;; more than one item, save them for subsequent moves.
2622 ;; Special case: moving top-item with indent rule.
2630 ;; Change bullet if necessary.
2636 ;; Shift every item by OFFSET and fix bullets. Then
2637 ;; apply changes to buffer.
2641 struct)
2644 ;; Forbidden move:
2646 ;; If only one item is moved, it mustn't have a child.
2650 ;; If a subtree or region is moved, the last item
2651 ;; of the subtree mustn't have a child.
2656 struct)))))
2659 ;; Normal shifting
2667 t)
2670 "Outdent a local list item, but not its children.
2671 If a region is active, all items inside will be moved."
2687 "Indent a local list item, but not its children.
2688 If a region is active, all items inside will be moved."
2704 "Outdent a local list item including its children.
2705 If a region is active, all items inside will be moved."
2721 "Indent a local list item including its children.
2722 If a region is active, all items inside will be moved."
2740 "Cycle levels of indentation of an empty item.
2741 The first run indents the item, if applicable. Subsequent runs
2742 outdent it at meaningful levels in the list. When done, item is
2743 put back at its original position with its original bullet.
2745 Return t at each successful move."
2751 ;; Accept empty items or if cycle has already started.
2762 ;; When in the middle of the cycle, try to outdent first. If
2763 ;; it fails, and point is still at initial position, indent.
2764 ;; Else, re-create it at its original position.
2773 ;; Break cycle
2775 ;; If a cycle is starting, remember indentation and bullet,
2776 ;; then try to indent. If it fails, try to outdent.
2782 t))))
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,
2795 if the current locale allows for it.
2797 The command prompts for the sorting type unless it has been given
2798 to the function through the SORTING-TYPE argument, which needs to
2799 be a character, \(?n ?N ?a ?A ?t ?T ?f ?F ?x ?X). Here is the
2800 detailed meaning of each character:
2802 n Numerically, by converting the beginning of the item to a number.
2803 a Alphabetically. Only the first line of item is checked.
2804 t By date/time, either the first active time stamp in the entry, if
2805 any, or by the first inactive one. In a timer list, sort the timers.
2808 Capital letters will reverse the sort order.
2810 If the SORTING-TYPE is ?f or ?F, then GETKEY-FUNC specifies
2811 a function to be called with point at the beginning of the
2812 record. It must return a value that is compatible with COMPARE-FUNC,
2813 the function used to compare entries.
2815 Sorting is done against the visible part of the headlines, it
2816 ignores hidden links.
2818 A non-nil value for INTERACTIVE? is used to signal that this
2819 function is being called interactively."
2878 ;; If it is a timer list, convert timer to seconds
2895 value))
2899 next-record
2900 end-record
2901 value-to-sort
2902 nil
2903 sort-func)
2904 ;; Read and fix list again, as `sort-subr' probably destroyed
2905 ;; its structure.
2911 "Convert headings or normal lines to items, items to normal lines.
2912 If there is no active region, only the current line is considered.
2914 If the first non blank line in the region is a headline, convert
2915 all headlines to items, shifting text accordingly.
2917 If it is an item, convert all items to normal lines.
2919 If it is normal text, change region into a list of items.
2920 With a prefix argument ARG, change the region in a single item."
2924 ;; Shift text in current section to IND, from point to END.
2925 ;; The function leaves point to END line.
2927 ;; First determine the minimum indentation (MIN-I) of
2928 ;; the text.
2934 ;; Skip blank lines and inline tasks.
2937 ;; We can't find less than 0 indentation.
2941 ;; Then indent each line so that a line indented to
2942 ;; MIN-I becomes indented to IND. Ignore blank lines
2943 ;; and inline tasks in the process.
2952 ;; Return beginning of first non-blank line, starting from
2953 ;; line at POS.
2958 beg end)
2959 ;; Determine boundaries of changes.
2965 ;; Depending on the starting line, choose an action on the text
2966 ;; between BEG and END.
2971 ;; Case 1. Start at an item: de-itemize. Note that it only
2972 ;; happens when a region is active: `org-ctrl-c-minus'
2973 ;; would call `org-cycle-list-bullet' otherwise.
2980 ;; Case 2. Start at an heading: convert to items.
2982 ;; Remove metadata
2987 ;; Indentation of the first heading. It should be
2988 ;; relative to the indentation of its parent, if any.
2994 ;; Level of first heading. Further headings will be
2995 ;; compared to it to determine hierarchy in the list.
3001 ;; If current headline is less indented than the first
3002 ;; one, set it as reference, in order to preserve
3003 ;; subtrees.
3005 ;; Remove metadata
3008 ;; Remove stars and TODO keyword.
3014 ;; Turn TODO keyword into a check box.
3020 struct
3022 "[X]"
3026 old)))
3027 ;; Ensure all text down to END (or SECTION-END) belongs
3028 ;; to the newly created item.
3035 ;; Case 3. Normal line with ARG: make the first line of region
3036 ;; an item, and shift indentation of others lines to
3037 ;; set them as item's body.
3045 ;; Ensure that lines less indented than first one
3046 ;; still get included in item body.
3052 ;; Case 4. Normal line without ARG: turn each non-item line
3053 ;; into an item.
3062 \f
3063 ;;; Send and receive lists
3066 "Parse the list at point and maybe DELETE it.
3068 Return a list whose car is a symbol of list type, among
3069 `ordered', `unordered' and `descriptive'. Then, each item is
3070 a list of strings and other sub-lists.
3072 For example, the following list:
3074 1. first item
3075 + sub-item one
3076 + [X] sub-item two
3077 more text in first item
3078 2. [@3] last item
3080 is parsed as
3082 (ordered
3084 (unordered
3090 Point is left at list's end."
3098 ;; Remove indentation and final newline from TEXT.
3102 text))))
3105 ;; Return a list whose car is list type and cdr a list
3106 ;; of items' body.
3111 ;; Return a list containing counter of item, if any,
3112 ;; text and any sublist inside it.
3121 trim
3131 ;; Remove whole sub-list from children.
3133 ;; There is a chunk of text belonging to the item
3134 ;; if last child doesn't end where next child
3135 ;; starts or where item ends.
3140 trim
3142 body)))))
3144 ;; Store output, take care of cursor position and deletion of
3145 ;; list, then return output.
3154 "Convert the plain list at point into a subtree."
3162 "Convert a LIST parsed through `org-list-to-lisp' to a custom format.
3164 LIST is a list as returned by `org-list-to-lisp', which see.
3165 PARAMS is a property list of parameters used to tweak the output
3166 format.
3168 Valid parameters are:
3170 :backend, :raw
3172 Export back-end used as a basis to transcode elements of the
3173 list, when no specific parameter applies to it. It is also
3174 used to translate its contents. You can prevent this by
3175 setting :raw property to a non-nil value.
3177 :splice
3179 When non-nil, only export the contents of the top most plain
3180 list, effectively ignoring its opening and closing lines.
3182 :ustart, :uend
3184 Strings to start and end an unordered list. They can also be
3185 set to a function returning a string or nil, which will be
3186 called with the depth of the list, counting from 1.
3188 :ostart, :oend
3190 Strings to start and end an ordered list. They can also be set
3191 to a function returning a string or nil, which will be called
3192 with the depth of the list, counting from 1.
3194 :dstart, :dend
3196 Strings to start and end a descriptive list. They can also be
3197 set to a function returning a string or nil, which will be
3198 called with the depth of the list, counting from 1.
3200 :dtstart, :dtend, :ddstart, :ddend
3202 Strings to start and end a descriptive term.
3204 :istart, :iend
3206 Strings to start or end a list item, and to start a list item
3207 with a counter. They can also be set to a function returning
3208 a string or nil, which will be called with two arguments: the
3209 type of list and the depth of the item, counting from 1.
3211 :icount
3213 Strings to start a list item with a counter. It can also be
3214 set to a function returning a string or nil, which will be
3215 called with three arguments: the type of list, the depth of the
3216 item, counting from 1, and the counter. Its value, when
3217 non-nil, has precedence over `:istart'.
3219 :isep
3221 String used to separate items. It can also be set to
3222 a function returning a string or nil, which will be called with
3223 two arguments: the type of list and the depth of the item,
3224 counting from 1. It always start on a new line.
3226 :ifmt
3228 Function to be applied to the contents of every item. It is
3229 called with two arguments: the type of list and the contents.
3231 :cbon, :cboff, :cbtrans
3233 String to insert, respectively, an un-checked check-box,
3234 a checked check-box and a check-box in transitional state."
3240 :transcoders
3244 data info)
3245 ;; Write LIST back into Org syntax and parse it.
3275 ;; When`:raw' property has a non-nil value, turn all objects back
3276 ;; into Org syntax.
3282 ;; We use a low-level mechanism to export DATA so as to skip all
3283 ;; usual pre-processing and post-processing, i.e., hooks, filters,
3284 ;; Babel code evaluation, include keywords and macro expansion,
3285 ;; and filters.
3287 ;; Remove final newline.
3291 "Return the level of ELEMENT within current plain list.
3292 ELEMENT is either an item or a plain list."
3297 "Return the number of trailing newlines in STRING."
3304 "Evaluate VALUE according to its type.
3305 VALUE is either nil, a string or a function. In the latter case,
3306 it is called with arguments ARGS."
3313 "Return a transcoder for `plain-list' elements.
3314 PARAMS is a plist used to tweak the behavior of the transcoder."
3332 depth)))
3339 depth))))
3340 ;; Make sure trailing newlines in END appear in the output by
3341 ;; setting `:post-blank' property to their number.
3345 ;; Build output.
3348 contents
3350 end)))))
3353 "Return a transcoder for `item' elements.
3354 PARAMS is a plist used to tweak the behavior of the transcoder."
3380 ;; When a closing line or a separator is provided, make sure
3381 ;; its trailing newlines are taken into account when building
3382 ;; output. This is done by setting `:post-blank' property to
3383 ;; the number of such lines in the last line to be added.
3387 item
3388 :post-blank
3390 ;; Build output.
3408 tag backend info)
3410 dtend))
3416 contents))
3419 ;; Remove final newline.
3422 closing
3423 separator)))))
3426 "Convert LIST into a LaTeX list.
3427 LIST is a parsed plain list, as returned by `org-list-to-lisp'.
3428 PARAMS is a property list with overruling parameters for
3429 `org-list-to-generic'. Return converted list as a string."
3434 "Convert LIST into a HTML list.
3435 LIST is a parsed plain list, as returned by `org-list-to-lisp'.
3436 PARAMS is a property list with overruling parameters for
3437 `org-list-to-generic'. Return converted list as a string."
3442 "Convert LIST into a Texinfo list.
3443 LIST is a parsed plain list, as returned by `org-list-to-lisp'.
3444 PARAMS is a property list with overruling parameters for
3445 `org-list-to-generic'. Return converted list as a string."
3450 "Convert LIST into an Org plain list.
3451 LIST is as returned by `org-list-parse-list'. PARAMS is a property list
3452 with overruling parameters for `org-list-to-generic'."
3459 :icount make-item
3469 "Convert LIST into an Org subtree.
3470 LIST is as returned by `org-list-to-lisp'. PARAMS is a property
3471 list with overruling parameters for `org-list-to-generic'."
3480 ;; Return the string for the heading, depending on DEPTH
3481 ;; of current sub-list.
3485 oddeven-level)
3486 ?*)
3489 list
3492 :istart make-stars
3493 :icount make-stars
3497 params))))
3501 ;;; org-list.el ends here