1 ;;; org-list.el --- Plain lists for Org-mode
3 ;; Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 ;; Free Software Foundation, Inc.
6 ;; Author: Carsten Dominik <carsten at orgmode dot org>
7 ;; Bastien Guerry <bzg AT altern DOT org>
8 ;; Keywords: outlines, hypermedia, calendar, wp
9 ;; Homepage: http://orgmode.org
12 ;; This file is part of GNU Emacs.
14 ;; GNU Emacs is free software: you can redistribute it and/or modify
15 ;; it under the terms of the GNU General Public License as published by
16 ;; the Free Software Foundation, either version 3 of the License, or
17 ;; (at your option) any later version.
19 ;; GNU Emacs is distributed in the hope that it will be useful,
20 ;; but WITHOUT ANY WARRANTY; without even the implied warranty of
21 ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 ;; GNU General Public License for more details.
24 ;; You should have received a copy of the GNU General Public License
25 ;; along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>.
26 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
30 ;; This file contains the code dealing with plain lists in Org-mode.
32 ;; The fundamental idea behind lists work is to use structures.
33 ;; A structure is a snapshot of the list, in the shape of data tree
34 ;; (see `org-list-struct').
36 ;; Once the list structure is stored, it is possible to make changes
37 ;; directly on it or get useful information about the list, with the
38 ;; two helper functions, namely `org-list-parents-alist' and
39 ;; `org-list-prevs-alist', and using accessors or methods.
41 ;; Structure is eventually applied to the buffer with
42 ;; `org-list-write-struct'. This function repairs (bullets,
43 ;; indentation, checkboxes) the structure before applying it. It
44 ;; should be called near the end of any function working on
47 ;; Thus, a function applying to lists should usually follow this
50 ;; 1. Verify point is in a list and grab item beginning (with the same
51 ;; function `org-in-item-p'). If the function requires the cursor
52 ;; to be at item's bullet, `org-at-item-p' is more selective. If
53 ;; the cursor is amidst the buffer, it is possible to find the
54 ;; closest item with `org-list-search-backward', or
55 ;; `org-list-search-forward', applied to `org-item-beginning-re'.
57 ;; 2. Get list structure with `org-list-struct'.
59 ;; 3. Compute one, or both, helper functions,
60 ;; (`org-list-parents-alist', `org-list-prevs-alist') depending on
63 ;; 4. Proceed with the modifications, using methods and accessors.
65 ;; 5. Verify and apply structure to buffer, using
66 ;; `org-list-write-struct'. Possibly use
67 ;; `org-update-checkbox-count-maybe' if checkboxes might have been
70 ;; Computing a list structure can be a costly operation on huge lists
71 ;; (a few thousand lines long). Thus, code should follow the rule :
72 ;; "collect once, use many". As a corollary, it is usally a bad idea
73 ;; to use directly an interactive function inside the code, as those,
74 ;; being independant entities, read the whole list structure another
84 (defvar org-M-RET-may-split-line
)
85 (defvar org-auto-align-tags
)
86 (defvar org-blank-before-new-entry
)
87 (defvar org-clock-string
)
88 (defvar org-closed-string
)
89 (defvar org-deadline-string
)
90 (defvar org-description-max-indent
)
92 (defvar org-odd-levels-only
)
93 (defvar org-scheduled-string
)
94 (defvar org-ts-regexp
)
95 (defvar org-ts-regexp-both
)
97 (declare-function org-at-heading-p
"org" (&optional ignored
))
98 (declare-function org-before-first-heading-p
"org" ())
99 (declare-function org-back-over-empty-lines
"org" ())
100 (declare-function org-back-to-heading
"org" (&optional invisible-ok
))
101 (declare-function org-combine-plists
"org" (&rest plists
))
102 (declare-function org-count
"org" (cl-item cl-seq
))
103 (declare-function org-current-level
"org" ())
104 (declare-function org-entry-get
"org"
105 (pom property
&optional inherit literal-nil
))
106 (declare-function org-fix-tags-on-the-fly
"org" ())
107 (declare-function org-get-indentation
"org" (&optional line
))
108 (declare-function org-icompleting-read
"org" (&rest args
))
109 (declare-function org-in-block-p
"org" (names))
110 (declare-function org-in-regexp
"org" (re &optional nlines visually
))
111 (declare-function org-inlinetask-goto-beginning
"org-inlinetask" ())
112 (declare-function org-inlinetask-goto-end
"org-inlinetask" ())
113 (declare-function org-inlinetask-in-task-p
"org-inlinetask" ())
114 (declare-function org-inlinetask-outline-regexp
"org-inlinetask" ())
115 (declare-function org-level-increment
"org" ())
116 (declare-function org-narrow-to-subtree
"org" ())
117 (declare-function org-on-heading-p
"org" (&optional invisible-ok
))
118 (declare-function org-previous-line-empty-p
"org" ())
119 (declare-function org-remove-if
"org" (predicate seq
))
120 (declare-function org-reduced-level
"org" (L))
121 (declare-function org-show-subtree
"org" ())
122 (declare-function org-time-string-to-seconds
"org" (s))
123 (declare-function org-timer-hms-to-secs
"org-timer" (hms))
124 (declare-function org-timer-item
"org-timer" (&optional arg
))
125 (declare-function org-trim
"org" (s))
126 (declare-function org-uniquify
"org" (list))
127 (declare-function outline-invisible-p
"outline" (&optional pos
))
128 (declare-function outline-flag-region
"outline" (from to flag
))
129 (declare-function outline-next-heading
"outline" ())
130 (declare-function outline-previous-heading
"outline" ())
132 ;;; Configuration variables
134 (defgroup org-plain-lists nil
135 "Options concerning plain lists in Org-mode."
136 :tag
"Org Plain lists"
137 :group
'org-structure
)
139 (defcustom org-cycle-include-plain-lists t
140 "When t, make TAB cycle visibility on plain list items.
141 Cycling plain lists works only when the cursor is on a plain list
142 item. When the cursor is on an outline heading, plain lists are
143 treated as text. This is the most stable way of handling this,
144 which is why it is the default.
146 When this is the symbol `integrate', then during cycling, plain
147 list items will *temporarily* be interpreted as outline headlines
148 with a level given by 1000+i where i is the indentation of the
149 bullet. This setting can lead to strange effects when switching
150 visibility to `children', because the first \"child\" in a
151 subtree decides what children should be listed. If that first
152 \"child\" is a plain list item with an implied large level
153 number, all true children and grand children of the outline
154 heading will be exposed in a children' view."
155 :group
'org-plain-lists
157 (const :tag
"Never" nil
)
158 (const :tag
"With cursor in plain list (recommended)" t
)
159 (const :tag
"As children of outline headings" integrate
)))
161 (defcustom org-list-demote-modify-bullet nil
162 "Default bullet type installed when demoting an item.
163 This is an association list, for each bullet type, this alist will point
164 to the bullet that should be used when this item is demoted.
167 (setq org-list-demote-modify-bullet
168 '((\"+\" . \"-\") (\"-\" . \"+\") (\"*\" . \"+\")))
173 + Silence of the Lambs
176 + The Hunt for Red October
182 - Silence of the Lambs
185 - The Hunt for Red October
187 :group
'org-plain-lists
190 (choice :tag
"If the current bullet is "
196 (choice :tag
"demotion will change it to"
203 (defcustom org-plain-list-ordered-item-terminator t
204 "The character that makes a line with leading number an ordered list item.
205 Valid values are ?. and ?\). To get both terminators, use t. While
206 ?. may look nicer, it creates the danger that a line with leading
207 number may be incorrectly interpreted as an item. ?\) therefore is
209 :group
'org-plain-lists
210 :type
'(choice (const :tag
"dot like in \"2.\"" ?.
)
211 (const :tag
"paren like in \"2)\"" ?\
))
212 (const :tab
"both" t
)))
214 (defcustom org-alphabetical-lists nil
215 "Non-nil means single character alphabetical bullets are allowed.
216 Both uppercase and lowercase are handled. Lists with more than
217 26 items will fallback to standard numbering. Alphabetical
218 counters like \"[@c]\" will be recognized."
219 :group
'org-plain-lists
222 (defcustom org-list-two-spaces-after-bullet-regexp nil
223 "A regular expression matching bullets that should have 2 spaces after them.
224 When nil, no bullet will have two spaces after them. When
225 a string, it will be used as a regular expression. When the
226 bullet type of a list is changed, the new bullet type will be
227 matched against this regexp. If it matches, there will be two
228 spaces instead of one after the bullet in each item of the list."
229 :group
'org-plain-lists
231 (const :tag
"never" nil
)
234 (defcustom org-list-ending-method
'both
235 "Determine where plain lists should end.
236 Valid values are: `regexp', `indent' or `both'.
238 When set to `regexp', Org will look into two variables,
239 `org-empty-line-terminates-plain-lists' and the more general
240 `org-list-end-regexp', to determine what will end lists.
242 When set to `indent', a list will end whenever a line following
243 an item, but not starting one, is less or equally indented than
244 the first item of the list.
246 When set to `both', each of the preceding methods is applied to
247 determine lists endings. This is the default method."
248 :group
'org-plain-lists
250 (const :tag
"With a regexp defining ending" regexp
)
251 (const :tag
"With indentation of regular (no bullet) text" indent
)
252 (const :tag
"With both methods" both
)))
254 (defcustom org-empty-line-terminates-plain-lists nil
255 "Non-nil means an empty line ends all plain list levels.
256 This variable only makes sense if `org-list-ending-method' is set
257 to `regexp' or `both'. This is then equivalent to set
258 `org-list-end-regexp' to \"^[ \\t]*$\"."
259 :group
'org-plain-lists
262 (defcustom org-list-end-regexp
"^[ \t]*\n[ \t]*\n"
263 "Regexp matching the end of all plain list levels.
264 It must start with \"^\" and end with \"\\n\". It defaults to 2
265 blank lines. `org-empty-line-terminates-plain-lists' has
267 :group
'org-plain-lists
270 (defcustom org-list-automatic-rules
'((bullet . t
)
273 "Non-nil means apply set of rules when acting on lists.
274 By default, automatic actions are taken when using
275 \\[org-meta-return], \\[org-metaright], \\[org-metaleft],
276 \\[org-shiftmetaright], \\[org-shiftmetaleft],
277 \\[org-ctrl-c-minus], \\[org-toggle-checkbox] or
278 \\[org-insert-todo-heading]. You can disable individually these
279 rules by setting them to nil. Valid rules are:
281 bullet when non-nil, cycling bullet do not allow lists at
282 column 0 to have * as a bullet and descriptions lists
284 checkbox when non-nil, checkbox statistics is updated each time
285 you either insert a new checkbox or toggle a checkbox.
286 It also prevents from inserting a checkbox in a
288 indent when non-nil, indenting or outdenting list top-item
289 with its subtree will move the whole list and
290 outdenting a list whose bullet is * to column 0 will
291 change that bullet to \"-\"."
292 :group
'org-plain-lists
293 :type
'(alist :tag
"Sets of rules"
296 (const :tag
"Bullet" bullet
)
297 (const :tag
"Checkbox" checkbox
)
298 (const :tag
"Indent" indent
))
300 (boolean :tag
"Activate" :value t
)))
302 (defvar org-checkbox-statistics-hook nil
303 "Hook that is run whenever Org thinks checkbox statistics should be updated.
304 This hook runs even if checkbox rule in
305 `org-list-automatic-rules' does not apply, so it can be used to
306 implement alternative ways of collecting statistics
309 (defcustom org-hierarchical-checkbox-statistics t
310 "Non-nil means checkbox statistics counts only the state of direct children.
311 When nil, all boxes below the cookie are counted.
312 This can be set to nil on a per-node basis using a COOKIE_DATA property
313 with the word \"recursive\" in the value."
314 :group
'org-plain-lists
317 (defcustom org-description-max-indent
20
318 "Maximum indentation for the second line of a description list.
319 When the indentation would be larger than this, it will become
320 5 characters instead."
321 :group
'org-plain-lists
324 (defcustom org-list-radio-list-templates
325 '((latex-mode "% BEGIN RECEIVE ORGLST %n
326 % END RECEIVE ORGLST %n
328 #+ORGLST: SEND %n org-list-to-latex
331 (texinfo-mode "@c BEGIN RECEIVE ORGLST %n
332 @c END RECEIVE ORGLST %n
334 #+ORGLST: SEND %n org-list-to-texinfo
337 (html-mode "<!-- BEGIN RECEIVE ORGLST %n -->
338 <!-- END RECEIVE ORGLST %n -->
340 #+ORGLST: SEND %n org-list-to-html
343 "Templates for radio lists in different major modes.
344 All occurrences of %n in a template will be replaced with the name of the
345 list, obtained by prompting the user."
346 :group
'org-plain-lists
348 (list (symbol :tag
"Major mode")
349 (string :tag
"Format"))))
351 (defvar org-list-forbidden-blocks
'("example" "verse" "src" "latex" "html" "docbook")
352 "Names of blocks where lists are not allowed.
353 Names must be in lower case.")
355 (defvar org-list-export-context
'(block inlinetask
)
356 "Context types where lists will be interpreted during export.
358 Valid types are `drawer', `inlinetask' and `block'. More
359 specifically, type `block' is determined by the variable
360 `org-list-forbidden-blocks'.")
363 ;;; Predicates and regexps
365 (defconst org-list-end-re
(if org-empty-line-terminates-plain-lists
368 "Regex corresponding to the end of a list.
369 It depends on `org-empty-line-terminates-plain-lists'.")
371 (defconst org-list-full-item-re
372 (concat "^[ \t]*\\(\\(?:[-+*]\\|\\(?:[0-9]+\\|[A-Za-z]\\)[.)]\\)[ \t]+\\)"
373 "\\(?:\\[@\\(?:start:\\)?\\([0-9]+\\|[A-Za-z]\\)\\][ \t]*\\)?"
374 "\\(?:\\(\\[[ X-]\\]\\)[ \t]+\\)?"
375 "\\(?:\\(.*\\)[ \t]+::\\(?:[ \t]+\\|$\\)\\)?")
376 "Matches a list item and puts everything into groups:
380 group 4: description tag")
382 (defun org-item-re ()
383 "Return the correct regular expression for plain lists."
385 ((eq org-plain-list-ordered-item-terminator t
) "[.)]")
386 ((= org-plain-list-ordered-item-terminator ?\
)) ")")
387 ((= org-plain-list-ordered-item-terminator ?.
) "\\.")
389 (alpha (if org-alphabetical-lists
"\\|[A-Za-z]" "")))
390 (concat "\\([ \t]*\\([-+]\\|\\(\\([0-9]+" alpha
"\\)" term
391 "\\)\\)\\|[ \t]+\\*\\)\\([ \t]+\\|$\\)")))
393 (defsubst org-item-beginning-re
()
394 "Regexp matching the beginning of a plain list item."
395 (concat "^" (org-item-re)))
397 (defun org-list-at-regexp-after-bullet-p (regexp)
398 "Is point at a list item with REGEXP after bullet?"
401 (goto-char (match-end 0))
402 (let ((counter-re (concat "\\(?:\\[@\\(?:start:\\)?"
403 (if org-alphabetical-lists
404 "\\([0-9]+\\|[A-Za-z]\\)"
407 ;; Ignore counter if any
408 (when (looking-at counter-re
) (goto-char (match-end 0))))
409 (looking-at regexp
))))
411 (defun org-list-in-valid-context-p ()
412 "Is point in a context where lists are allowed?"
413 (not (org-in-block-p org-list-forbidden-blocks
)))
415 (defun org-in-item-p ()
416 "Return item beginning position when in a plain list, nil otherwise.
417 This checks `org-list-ending-method'."
420 (let* ((case-fold-search t
)
421 (context (org-list-context))
422 (lim-up (car context
))
423 (drawers-re (concat "^[ \t]*:\\("
424 (mapconcat 'regexp-quote org-drawers
"\\|")
426 (inlinetask-re (and (featurep 'org-inlinetask
)
427 (org-inlinetask-outline-regexp)))
428 (item-re (org-item-re))
429 ;; Indentation isn't meaningful when point starts at an empty
430 ;; line or an inline task.
431 (ind-ref (if (or (looking-at "^[ \t]*$")
432 (and inlinetask-re
(looking-at inlinetask-re
)))
434 (org-get-indentation))))
436 ((eq (nth 2 context
) 'invalid
) nil
)
437 ((looking-at item-re
) (point))
439 ;; Detect if cursor in amidst `org-list-end-re'. First, count
440 ;; number HL of hard lines it takes, then call `org-in-regexp'
441 ;; to compute its boundaries END-BOUNDS. When point is
442 ;; in-between, move cursor before regexp beginning.
443 (let ((hl 0) (i -
1) end-bounds
)
444 (when (and (not (eq org-list-ending-method
'indent
))
446 (while (setq i
(string-match
447 "[\r\n]" org-list-end-re
(1+ i
)))
449 (setq end-bounds
(org-in-regexp org-list-end-re hl
)))
450 (>= (point) (car end-bounds
))
451 (< (point) (cdr end-bounds
)))
452 (goto-char (car end-bounds
))
454 ;; Look for an item, less indented that reference line if
455 ;; `org-list-ending-method' isn't `regexp'.
458 (let ((ind (org-get-indentation)))
460 ;; This is exactly what we want.
461 ((and (looking-at item-re
)
463 (eq org-list-ending-method
'regexp
)))
464 (throw 'exit
(point)))
465 ;; At upper bound of search or looking at the end of a
466 ;; previous list: search is over.
467 ((<= (point) lim-up
) (throw 'exit nil
))
468 ((and (not (eq org-list-ending-method
'indent
))
469 (looking-at org-list-end-re
))
471 ;; Skip blocks, drawers, inline-tasks, blank lines
472 ((and (looking-at "^[ \t]*#\\+end_")
473 (re-search-backward "^[ \t]*#\\+begin_" lim-up t
)))
474 ((and (looking-at "^[ \t]*:END:")
475 (re-search-backward drawers-re lim-up t
))
477 ((and inlinetask-re
(looking-at inlinetask-re
))
478 (org-inlinetask-goto-beginning)
480 ((looking-at "^[ \t]*$") (forward-line -
1))
481 ;; Text at column 0 cannot belong to a list: stop.
482 ((zerop ind
) (throw 'exit nil
))
483 ;; Normal text less indented than reference line, take
484 ;; it as new reference.
488 (t (forward-line -
1)))))))))))
490 (defun org-at-item-p ()
491 "Is point in a line starting a hand-formatted item?"
494 (and (looking-at (org-item-re)) (org-list-in-valid-context-p))))
496 (defun org-at-item-bullet-p ()
497 "Is point at the bullet of a plain list item?"
499 (not (member (char-after) '(?\ ?
\t)))
500 (< (point) (match-end 0))))
502 (defun org-at-item-timer-p ()
503 "Is point at a line starting a plain list item with a timer?"
504 (org-list-at-regexp-after-bullet-p
505 "\\([0-9]+:[0-9]+:[0-9]+\\)[ \t]+::[ \t]+"))
507 (defun org-at-item-description-p ()
508 "Is point at a description list item?"
509 (org-list-at-regexp-after-bullet-p "\\(\\S-.+\\)[ \t]+::[ \t]+"))
511 (defun org-at-item-checkbox-p ()
512 "Is point at a line starting a plain-list item with a checklet?"
513 (org-list-at-regexp-after-bullet-p "\\(\\[[- X]\\]\\)[ \t]+"))
515 (defun org-at-item-counter-p ()
516 "Is point at a line starting a plain-list item with a counter?"
518 (looking-at org-list-full-item-re
)
522 ;;; Structures and helper functions
524 (defun org-list-context ()
525 "Determine context, and its boundaries, around point.
527 Context will be a cell like (MIN MAX CONTEXT) where MIN and MAX
528 are boundaries and CONTEXT is a symbol among `drawer', `block',
529 `invalid', `inlinetask' and nil.
531 Contexts `block' and `invalid' refer to `org-list-forbidden-blocks'."
534 (org-with-limited-levels
536 (let ((case-fold-search t
) (pos (point)) beg end context-type
537 ;; Get positions of surrounding headings. This is the
539 (lim-up (or (save-excursion (and (ignore-errors (org-back-to-heading t
))
542 (lim-down (or (save-excursion (outline-next-heading)) (point-max))))
543 ;; Is point inside a drawer?
544 (let ((end-re "^[ \t]*:END:")
545 ;; Can't use org-drawers-regexp as this function might
546 ;; be called in buffers not in Org mode.
547 (beg-re (concat "^[ \t]*:\\("
548 (mapconcat 'regexp-quote org-drawers
"\\|")
550 (when (save-excursion
551 (and (not (looking-at beg-re
))
552 (not (looking-at end-re
))
553 (setq beg
(and (re-search-backward beg-re lim-up t
)
554 (1+ (point-at-eol))))
555 (setq end
(or (and (re-search-forward end-re lim-down t
)
556 (1- (match-beginning 0)))
559 (setq lim-up beg lim-down end context-type
'drawer
)))
560 ;; Is point strictly in a block, and of which type?
561 (let ((block-re "^[ \t]*#\\+\\(begin\\|end\\)_") type
)
562 (when (save-excursion
563 (and (not (looking-at block-re
))
564 (setq beg
(and (re-search-backward block-re lim-up t
)
565 (1+ (point-at-eol))))
566 (looking-at "^[ \t]*#\\+begin_\\(\\S-+\\)")
567 (setq type
(downcase (match-string 1)))
569 (setq end
(or (and (re-search-forward block-re lim-down t
)
573 (equal (downcase (match-string 1)) "end")))
574 (setq lim-up beg lim-down end
575 context-type
(if (member type org-list-forbidden-blocks
)
577 ;; Is point in an inlinetask?
578 (when (and (featurep 'org-inlinetask
)
580 (let* ((beg-re (org-inlinetask-outline-regexp))
581 (end-re (concat beg-re
"END[ \t]*$")))
582 (and (not (looking-at "^\\*+"))
583 (setq beg
(and (re-search-backward beg-re lim-up t
)
584 (1+ (point-at-eol))))
585 (not (looking-at end-re
))
586 (setq end
(and (re-search-forward end-re lim-down t
)
587 (1- (match-beginning 0))))
589 (setq lim-up beg lim-down end context-type
'inlinetask
))
590 ;; Return context boundaries and type.
591 (list lim-up lim-down context-type
))))))
593 (defun org-list-struct ()
594 "Return structure of list at point.
596 A list structure is an alist where key is point at item, and
599 2. bullet with trailing whitespace,
600 3. bullet counter, if any,
602 5. description tag, if any,
603 6. position at item end.
605 Thus the following list, where numbers in parens are
610 5. [@5] sub-item 2 (34)
611 some other text belonging to first item (55)
613 + tag :: description (109)
616 will get the following structure:
618 \(\(1 0 \"- \" nil \"[X]\" nil 97\)
619 \(18 2 \"1. \" nil nil nil 34\)
620 \(34 2 \"5. \" \"5\" nil nil 55\)
621 \(97 0 \"- \" nil nil nil 131\)
622 \(109 2 \"+ \" nil nil \"tag\" 131\)
624 Assume point is at an item."
627 (let* ((case-fold-search t
)
628 (context (org-list-context))
629 (lim-up (car context
))
630 (lim-down (nth 1 context
))
632 (item-re (org-item-re))
633 (drawers-re (concat "^[ \t]*:\\("
634 (mapconcat 'regexp-quote org-drawers
"\\|")
636 (inlinetask-re (and (featurep 'org-inlinetask
)
637 (org-inlinetask-outline-regexp)))
638 (beg-cell (cons (point) (org-get-indentation)))
639 ind itm-lst itm-lst-2 end-lst end-lst-2 struct
642 ;; Return association at point.
644 (looking-at org-list-full-item-re
)
647 (match-string-no-properties 1) ; bullet
648 (match-string-no-properties 2) ; counter
649 (match-string-no-properties 3) ; checkbox
650 (match-string-no-properties 4))))) ; description tag
653 ;; Ensure list ends at the first blank line.
655 (skip-chars-backward " \r\t\n")
656 (min (1+ (point-at-eol)) lim-down
)))))
657 ;; 1. Read list from starting item to its beginning, and save
658 ;; top item position and indentation in BEG-CELL. Also store
659 ;; ending position of items in END-LST.
663 (let ((ind (+ (or (get-text-property (point) 'original-indentation
) 0)
664 (org-get-indentation))))
667 ;; At upward limit: if we ended at an item, store it,
668 ;; else dimiss useless data recorded above BEG-CELL.
672 (if (or (not (looking-at item-re
))
673 (get-text-property (point) 'org-example
))
674 (memq (assq (car beg-cell
) itm-lst
) itm-lst
)
675 (setq beg-cell
(cons (point) ind
))
676 (cons (funcall assoc-at-point ind
) itm-lst
)))))
677 ;; At a verbatim block, go before its beginning. Move
678 ;; from eol to ensure `previous-single-property-change'
679 ;; will return a value.
680 ((get-text-property (point) 'org-example
)
681 (goto-char (previous-single-property-change
682 (point-at-eol) 'org-example nil lim-up
))
684 ;; Looking at a list ending regexp. Dismiss useless
685 ;; data recorded above BEG-CELL. Jump to part 2.
686 ((and (not (eq org-list-ending-method
'indent
))
687 (looking-at org-list-end-re
))
690 (memq (assq (car beg-cell
) itm-lst
) itm-lst
))))
691 ;; Point is at an item. Add data to ITM-LST. It may
692 ;; also end a previous item: save it in END-LST. If
693 ;; ind is less or equal than BEG-CELL and there is no
694 ;; end at this ind or lesser, this item becomes the new
696 ((looking-at item-re
)
697 (push (funcall assoc-at-point ind
) itm-lst
)
698 (push (cons ind
(point)) end-lst
)
699 (when (or (and (eq org-list-ending-method
'regexp
)
700 (<= ind
(cdr beg-cell
)))
701 (< ind text-min-ind
))
702 (setq beg-cell
(cons (point) ind
)))
704 ;; Skip blocks, drawers, inline tasks, blank lines.
705 ((and (looking-at "^[ \t]*#\\+end_")
706 (re-search-backward "^[ \t]*#\\+begin_" lim-up t
)))
707 ((and (looking-at "^[ \t]*:END:")
708 (re-search-backward drawers-re lim-up t
))
710 ((and inlinetask-re
(looking-at inlinetask-re
))
711 (org-inlinetask-goto-beginning)
713 ((looking-at "^[ \t]*$")
715 ;; From there, point is not at an item. Unless ending
716 ;; method is `regexp', interpret line's indentation:
717 ;; - text at column 0 is necessarily out of any list.
718 ;; Dismiss data recorded above BEG-CELL. Jump to
720 ;; - any other case may be an ending position for an
721 ;; hypothetical item above. Store it and proceed.
722 ((eq org-list-ending-method
'regexp
) (forward-line -
1))
726 (memq (assq (car beg-cell
) itm-lst
) itm-lst
))))
728 (when (< ind text-min-ind
) (setq text-min-ind ind
))
729 (push (cons ind
(point)) end-lst
)
730 (forward-line -
1)))))))
731 ;; 2. Read list from starting point to its end, that is until we
732 ;; get out of context, or that a non-item line is less or
733 ;; equally indented than BEG-CELL's cdr. Also, store ending
734 ;; position of items in END-LST-2.
737 (let ((ind (+ (or (get-text-property (point) 'original-indentation
) 0)
738 (org-get-indentation))))
740 ((>= (point) lim-down
)
741 ;; At downward limit: this is de facto the end of the
742 ;; list. Save point as an ending position, and jump to
745 (push (cons 0 (funcall end-before-blank
)) end-lst-2
)))
746 ;; At a verbatim block, move to its end. Point is at bol
747 ;; and 'org-example property is set by whole lines:
748 ;; `next-single-property-change' always return a value.
749 ((get-text-property (point) 'org-example
)
751 (next-single-property-change (point) 'org-example nil lim-down
)))
752 ;; Looking at a list ending regexp. Save point as an
753 ;; ending position and jump to part 3.
754 ((and (not (eq org-list-ending-method
'indent
))
755 (looking-at org-list-end-re
))
756 (throw 'exit
(push (cons 0 (point)) end-lst-2
)))
757 ((looking-at item-re
)
758 ;; Point is at an item. Add data to ITM-LST-2. It may
759 ;; also end a previous item, so save it in END-LST-2.
760 (push (funcall assoc-at-point ind
) itm-lst-2
)
761 (push (cons ind
(point)) end-lst-2
)
763 ;; Skip inline tasks and blank lines along the way
764 ((and inlinetask-re
(looking-at inlinetask-re
))
765 (org-inlinetask-goto-end))
766 ((looking-at "^[ \t]*$")
768 ;; Ind is lesser or equal than BEG-CELL's. The list is
769 ;; over: store point as an ending position and jump to
771 ((and (not (eq org-list-ending-method
'regexp
))
772 (<= ind
(cdr beg-cell
)))
774 (push (cons 0 (funcall end-before-blank
)) end-lst-2
)))
775 ;; Else, if ind is lesser or equal than previous item's,
776 ;; this is an ending position: store it. In any case,
777 ;; skip block or drawer at point, and move to next line.
779 (when (and (not (eq org-list-ending-method
'regexp
))
780 (<= ind
(nth 1 (car itm-lst-2
))))
781 (push (cons ind
(point)) end-lst-2
))
783 ((and (looking-at "^[ \t]*#\\+begin_")
784 (re-search-forward "^[ \t]*#\\+end_" lim-down t
)))
785 ((and (looking-at drawers-re
)
786 (re-search-forward "^[ \t]*:END:" lim-down t
))))
787 (forward-line 1))))))
788 (setq struct
(append itm-lst
(cdr (nreverse itm-lst-2
)))
789 end-lst
(append end-lst
(cdr (nreverse end-lst-2
))))
790 ;; 3. Correct ill-formed lists by ensuring top item is the least
792 (let ((min-ind (nth 1 (car struct
))))
794 (let ((ind (nth 1 item
))
796 (when (< ind min-ind
)
797 (setcar (cdr item
) min-ind
)
798 ;; Trim bullet so item will be seen as different
799 ;; when compared with repaired version.
800 (setcar (nthcdr 2 item
) (org-trim bul
)))))
802 ;; 4. Associate each item to its end pos.
803 (org-list-struct-assoc-end struct end-lst
)
807 (defun org-list-struct-assoc-end (struct end-list
)
808 "Associate proper ending point to items in STRUCT.
810 END-LIST is a pseudo-alist where car is indentation and cdr is
813 This function modifies STRUCT."
814 (let ((endings end-list
))
817 (let ((pos (car elt
))
819 ;; Remove end candidates behind current item.
820 (while (or (<= (cdar endings
) pos
))
822 ;; Add end position to item assoc.
823 (let ((old-end (nthcdr 6 elt
))
824 (new-end (assoc-default ind endings
'<=)))
826 (setcar old-end new-end
)
827 (setcdr elt
(append (cdr elt
) (list new-end
)))))))
830 (defun org-list-prevs-alist (struct)
831 "Return alist between item and previous item in STRUCT."
832 (let ((item-end-alist (mapcar (lambda (e) (cons (car e
) (nth 6 e
)))
835 (let ((prev (car (rassq (car e
) item-end-alist
))))
836 (cons (car e
) prev
)))
839 (defun org-list-parents-alist (struct)
840 "Return alist between item and parent in STRUCT."
841 (let ((ind-to-ori (list (list (nth 1 (car struct
)))))
842 (prev-pos (list (caar struct
))))
844 (mapcar (lambda (item)
845 (let ((pos (car item
))
847 (prev-ind (caar ind-to-ori
)))
852 (member (assq ind ind-to-ori
) ind-to-ori
))
853 (cons pos
(cdar ind-to-ori
)))
855 (let ((origin (nth 1 prev-pos
)))
856 (push (cons ind origin
) ind-to-ori
)
858 (t (cons pos
(cdar ind-to-ori
))))))
864 (defsubst org-list-get-nth
(n key struct
)
865 "Return the Nth value of KEY in STRUCT."
866 (nth n
(assq key struct
)))
868 (defun org-list-set-nth (n key struct new
)
869 "Set the Nth value of KEY in STRUCT to NEW.
870 \nThis function modifies STRUCT."
871 (setcar (nthcdr n
(assq key struct
)) new
))
873 (defsubst org-list-get-ind
(item struct
)
874 "Return indentation of ITEM in STRUCT."
875 (org-list-get-nth 1 item struct
))
877 (defun org-list-set-ind (item struct ind
)
878 "Set indentation of ITEM in STRUCT to IND.
879 \nThis function modifies STRUCT."
880 (org-list-set-nth 1 item struct ind
))
882 (defsubst org-list-get-bullet
(item struct
)
883 "Return bullet of ITEM in STRUCT."
884 (org-list-get-nth 2 item struct
))
886 (defun org-list-set-bullet (item struct bullet
)
887 "Set bullet of ITEM in STRUCT to BULLET.
888 \nThis function modifies STRUCT."
889 (org-list-set-nth 2 item struct bullet
))
891 (defsubst org-list-get-counter
(item struct
)
892 "Return counter of ITEM in STRUCT."
893 (org-list-get-nth 3 item struct
))
895 (defsubst org-list-get-checkbox
(item struct
)
896 "Return checkbox of ITEM in STRUCT or nil."
897 (org-list-get-nth 4 item struct
))
899 (defun org-list-set-checkbox (item struct checkbox
)
900 "Set checkbox of ITEM in STRUCT to CHECKBOX.
901 \nThis function modifies STRUCT."
902 (org-list-set-nth 4 item struct checkbox
))
904 (defsubst org-list-get-tag
(item struct
)
905 "Return end position of ITEM in STRUCT."
906 (org-list-get-nth 5 item struct
))
908 (defun org-list-get-item-end (item struct
)
909 "Return end position of ITEM in STRUCT."
910 (org-list-get-nth 6 item struct
))
912 (defun org-list-get-item-end-before-blank (item struct
)
913 "Return point at end of ITEM in STRUCT, before any blank line.
914 Point returned is at end of line."
916 (goto-char (org-list-get-item-end item struct
))
917 (skip-chars-backward " \r\t\n")
920 (defun org-list-get-parent (item struct parents
)
921 "Return parent of ITEM or nil.
922 STRUCT is the list structure. PARENTS is the alist of parents,
923 as returned by `org-list-parents-alist'."
924 (let ((parents (or parents
(org-list-parents-alist struct
))))
925 (cdr (assq item parents
))))
927 (defun org-list-has-child-p (item struct
)
928 "Non-nil if ITEM has a child.
930 STRUCT is the list structure.
932 Value returned is the position of the first child of ITEM."
933 (let ((ind (org-list-get-ind item struct
))
934 (child-maybe (car (nth 1 (member (assq item struct
) struct
)))))
935 (when (and child-maybe
936 (< ind
(org-list-get-ind child-maybe struct
)))
939 (defun org-list-get-next-item (item struct prevs
)
940 "Return next item in same sub-list as ITEM, or nil.
941 STRUCT is the list structure. PREVS is the alist of previous
942 items, as returned by `org-list-prevs-alist'."
943 (car (rassq item prevs
)))
945 (defun org-list-get-prev-item (item struct prevs
)
946 "Return previous item in same sub-list as ITEM, or nil.
947 STRUCT is the list structure. PREVS is the alist of previous
948 items, as returned by `org-list-prevs-alist'."
949 (cdr (assq item prevs
)))
951 (defun org-list-get-subtree (item struct
)
952 "List all items having ITEM as a common ancestor, or nil.
953 STRUCT is the list structure."
954 (let* ((item-end (org-list-get-item-end item struct
))
955 (sub-struct (cdr (member (assq item struct
) struct
)))
960 (if (< pos item-end
) (push pos subtree
) (throw 'exit nil
))))
964 (defun org-list-get-all-items (item struct prevs
)
965 "List all items in the same sub-list as ITEM.
966 STRUCT is the list structure. PREVS is the alist of previous
967 items, as returned by `org-list-prevs-alist'."
968 (let ((prev-item item
)
970 before-item after-item
)
971 (while (setq prev-item
(org-list-get-prev-item prev-item struct prevs
))
972 (push prev-item before-item
))
973 (while (setq next-item
(org-list-get-next-item next-item struct prevs
))
974 (push next-item after-item
))
975 (append before-item
(list item
) (nreverse after-item
))))
977 (defun org-list-get-children (item struct parents
)
978 "List all children of ITEM, or nil.
979 STRUCT is the list structure. PARENTS is the alist of parents, as
980 returned by `org-list-parents-alist'."
982 (while (setq child
(car (rassq item parents
)))
983 (setq parents
(cdr (member (assq child parents
) parents
)))
987 (defun org-list-get-top-point (struct)
988 "Return point at beginning of list.
989 STRUCT is the list structure."
992 (defun org-list-get-bottom-point (struct)
993 "Return point at bottom of list.
994 STRUCT is the list structure."
996 (mapcar (lambda (e) (org-list-get-item-end (car e
) struct
)) struct
)))
998 (defun org-list-get-list-begin (item struct prevs
)
999 "Return point at beginning of sub-list ITEM belongs.
1000 STRUCT is the list structure. PREVS is the alist of previous
1001 items, as returned by `org-list-prevs-alist'."
1002 (let ((first-item item
) prev-item
)
1003 (while (setq prev-item
(org-list-get-prev-item first-item struct prevs
))
1004 (setq first-item prev-item
))
1007 (defalias 'org-list-get-first-item
'org-list-get-list-begin
)
1009 (defun org-list-get-last-item (item struct prevs
)
1010 "Return point at last item of sub-list ITEM belongs.
1011 STRUCT is the list structure. PREVS is the alist of previous
1012 items, as returned by `org-list-prevs-alist'."
1013 (let ((last-item item
) next-item
)
1014 (while (setq next-item
(org-list-get-next-item last-item struct prevs
))
1015 (setq last-item next-item
))
1018 (defun org-list-get-list-end (item struct prevs
)
1019 "Return point at end of sub-list ITEM belongs.
1020 STRUCT is the list structure. PREVS is the alist of previous
1021 items, as returned by `org-list-prevs-alist'."
1022 (org-list-get-item-end (org-list-get-last-item item struct prevs
) struct
))
1024 (defun org-list-get-list-type (item struct prevs
)
1025 "Return the type of the list containing ITEM, as a symbol.
1027 STRUCT is the list structure. PREVS is the alist of previous
1028 items, as returned by `org-list-prevs-alist'.
1030 Possible types are `descriptive', `ordered' and `unordered'. The
1031 type is determined by the first item of the list."
1032 (let ((first (org-list-get-list-begin item struct prevs
)))
1034 ((org-list-get-tag first struct
) 'descriptive
)
1035 ((string-match "[[:alnum:]]" (org-list-get-bullet first struct
)) 'ordered
)
1041 (defun org-list-search-generic (search re bound noerr
)
1042 "Search a string in valid contexts for lists.
1043 Arguments SEARCH, RE, BOUND and NOERR are similar to those used
1044 in `re-search-forward'."
1046 (let ((origin (point)))
1048 ;; 1. No match: return to origin or bound, depending on NOERR.
1049 (unless (funcall search re bound noerr
)
1050 (throw 'exit
(and (goto-char (if (memq noerr
'(t nil
)) origin bound
))
1052 ;; 2. Match in valid context: return point. Else, continue
1054 (when (org-list-in-valid-context-p) (throw 'exit
(point)))))))
1056 (defun org-list-search-backward (regexp &optional bound noerror
)
1057 "Like `re-search-backward' but stop only where lists are recognized.
1058 Arguments REGEXP, BOUND and NOERROR are similar to those used in
1059 `re-search-backward'."
1060 (org-list-search-generic #'re-search-backward
1061 regexp
(or bound
(point-min)) noerror
))
1063 (defun org-list-search-forward (regexp &optional bound noerror
)
1064 "Like `re-search-forward' but stop only where lists are recognized.
1065 Arguments REGEXP, BOUND and NOERROR are similar to those used in
1066 `re-search-forward'."
1067 (org-list-search-generic #'re-search-forward
1068 regexp
(or bound
(point-max)) noerror
))
1071 ;;; Methods on structures
1073 (defsubst org-list-bullet-string
(bullet)
1074 "Return BULLET with the correct number of whitespaces.
1075 It determines the number of whitespaces to append by looking at
1076 `org-list-two-spaces-after-bullet-regexp'."
1078 (let ((spaces (if (and org-list-two-spaces-after-bullet-regexp
1080 org-list-two-spaces-after-bullet-regexp bullet
))
1083 (string-match "\\S-+\\([ \t]*\\)" bullet
)
1084 (replace-match spaces nil nil bullet
1))))
1086 (defun org-list-separating-blank-lines-number (pos struct prevs
)
1087 "Return number of blank lines that should separate items in list.
1089 POS is the position of point where `org-list-insert-item' was called.
1091 STRUCT is the list structure. PREVS is the alist of previous
1092 items, as returned by `org-list-prevs-alist'.
1094 Assume point is at item's beginning. If the item is alone, apply
1095 some heuristics to guess the result."
1097 (let ((item (point))
1099 (cdr (assq 'plain-list-item org-blank-before-new-entry
)))
1102 ;; Trivial cases where there should be none.
1103 ((or (and (not (eq org-list-ending-method
'indent
))
1104 org-empty-line-terminates-plain-lists
)
1105 (not insert-blank-p
)) 0)
1106 ;; When `org-blank-before-new-entry' says so, it is 1.
1107 ((eq insert-blank-p t
) 1)
1108 ;; `plain-list-item' is 'auto. Count blank lines separating
1109 ;; neighbours items in list.
1110 (t (let ((next-p (org-list-get-next-item item struct prevs
)))
1112 ;; Is there a next item?
1113 (next-p (goto-char next-p
)
1114 (org-back-over-empty-lines))
1115 ;; Is there a previous item?
1116 ((org-list-get-prev-item item struct prevs
)
1117 (org-back-over-empty-lines))
1118 ;; User inserted blank lines, trust him.
1119 ((and (> pos
(org-list-get-item-end-before-blank item struct
))
1122 (skip-chars-backward " \t")
1123 (setq usr-blank
(org-back-over-empty-lines))) 0))
1125 ;; Are there blank lines inside the item?
1127 (org-list-search-forward
1128 "^[ \t]*$" (org-list-get-item-end-before-blank item struct
) t
))
1130 ;; No parent: no blank line.
1133 (defun org-list-insert-item (pos struct prevs
&optional checkbox after-bullet
)
1134 "Insert a new list item at POS and return the new structure.
1135 If POS is before first character after bullet of the item, the
1136 new item will be created before the current one.
1138 STRUCT is the list structure. PREVS is the the alist of previous
1139 items, as returned by `org-list-prevs-alist'.
1141 Insert a checkbox if CHECKBOX is non-nil, and string AFTER-BULLET
1142 after the bullet. Cursor will be after this text once the
1145 This function modifies STRUCT."
1146 (let ((case-fold-search t
))
1147 ;; 1. Get information about list: structure, usual helper
1148 ;; functions, position of point with regards to item start
1149 ;; (BEFOREP), blank lines number separating items (BLANK-NB),
1150 ;; position of split (POS) if we're allowed to (SPLIT-LINE-P).
1151 (let* ((item (progn (goto-char pos
) (goto-char (org-list-get-item-begin))))
1152 (item-end (org-list-get-item-end item struct
))
1153 (item-end-no-blank (org-list-get-item-end-before-blank item struct
))
1154 (beforep (and (looking-at org-list-full-item-re
)
1155 (<= pos
(match-end 0))))
1156 (split-line-p (org-get-alist-option org-M-RET-may-split-line
'item
))
1157 (blank-nb (org-list-separating-blank-lines-number
1159 ;; 2. Build the new item to be created. Concatenate same
1160 ;; bullet as item, checkbox, text AFTER-BULLET if
1161 ;; provided, and text cut from point to end of item
1162 ;; (TEXT-CUT) to form item's BODY. TEXT-CUT depends on
1163 ;; BEFOREP and SPLIT-LINE-P. The difference of size
1164 ;; between what was cut and what was inserted in buffer
1165 ;; is stored in SIZE-OFFSET.
1166 (ind (org-list-get-ind item struct
))
1167 (ind-size (if indent-tabs-mode
1168 (+ (/ ind tab-width
) (mod ind tab-width
))
1170 (bullet (org-list-bullet-string (org-list-get-bullet item struct
)))
1171 (box (when checkbox
"[ ]"))
1173 (and (not beforep
) split-line-p
1176 (skip-chars-backward " \r\t\n")
1178 (delete-and-extract-region pos item-end-no-blank
))))
1179 (body (concat bullet
(when box
(concat box
" ")) after-bullet
1181 (if (string-match "\\`[ \t]+" text-cut
)
1182 (replace-match "" t t text-cut
)
1185 (item-sep (make-string (1+ blank-nb
) ?
\n))
1186 (item-size (+ ind-size
(length body
) (length item-sep
)))
1187 (size-offset (- item-size
(length text-cut
))))
1188 ;; 4. Insert effectively item into buffer.
1190 (org-indent-to-column ind
)
1191 (insert body item-sep
)
1192 ;; 5. Add new item to STRUCT.
1197 ;; Before inserted item, positions don't change but
1198 ;; an item ending after insertion has its end shifted
1201 (when (> end item
) (setcar (nthcdr 6 e
) (+ end size-offset
))))
1202 ;; Trivial cases where current item isn't split in
1203 ;; two. Just shift every item after new one by
1205 ((or beforep
(not split-line-p
))
1206 (setcar e
(+ p item-size
))
1207 (setcar (nthcdr 6 e
) (+ end item-size
)))
1208 ;; Item is split in two: elements before POS are just
1209 ;; shifted by ITEM-SIZE. In the case item would end
1210 ;; after split POS, ending is only shifted by
1213 (setcar e
(+ p item-size
))
1215 (setcar (nthcdr 6 e
) (+ end item-size
))
1216 (setcar (nthcdr 6 e
) (+ end size-offset
))))
1217 ;; Elements after POS are moved into new item.
1218 ;; Length of ITEM-SEP has to be removed as ITEM-SEP
1219 ;; doesn't appear in buffer yet.
1221 (setcar e
(+ p size-offset
(- item pos
(length item-sep
))))
1222 (if (= end item-end
)
1223 (setcar (nthcdr 6 e
) (+ item item-size
))
1224 (setcar (nthcdr 6 e
)
1226 (- item pos
(length item-sep
))))))
1227 ;; Elements at ITEM-END or after are only shifted by
1229 (t (setcar e
(+ p size-offset
))
1230 (setcar (nthcdr 6 e
) (+ end size-offset
))))))
1232 (push (list item ind bullet nil box nil
(+ item item-size
)) struct
)
1233 (setq struct
(sort struct
(lambda (e1 e2
) (< (car e1
) (car e2
)))))
1234 ;; 6. If not BEFOREP, new item must appear after ITEM, so
1235 ;; exchange ITEM with the next item in list. Position cursor
1236 ;; after bullet, counter, checkbox, and label.
1239 (setq struct
(org-list-exchange-items item
(+ item item-size
) struct
))
1240 (goto-char (org-list-get-next-item
1241 item struct
(org-list-prevs-alist struct
))))
1244 (defun org-list-exchange-items (beg-A beg-B struct
)
1245 "Swap item starting at BEG-A with item starting at BEG-B in STRUCT.
1246 Blank lines at the end of items are left in place. Return the
1247 new structure after the changes.
1249 Assume BEG-A is lesser than BEG-B and that BEG-A and BEG-B belong
1250 to the same sub-list.
1252 This function modifies STRUCT."
1254 (let* ((end-A-no-blank (org-list-get-item-end-before-blank beg-A struct
))
1255 (end-B-no-blank (org-list-get-item-end-before-blank beg-B struct
))
1256 (end-A (org-list-get-item-end beg-A struct
))
1257 (end-B (org-list-get-item-end beg-B struct
))
1258 (size-A (- end-A-no-blank beg-A
))
1259 (size-B (- end-B-no-blank beg-B
))
1260 (body-A (buffer-substring beg-A end-A-no-blank
))
1261 (body-B (buffer-substring beg-B end-B-no-blank
))
1262 (between-A-no-blank-and-B (buffer-substring end-A-no-blank beg-B
))
1263 (sub-A (cons beg-A
(org-list-get-subtree beg-A struct
)))
1264 (sub-B (cons beg-B
(org-list-get-subtree beg-B struct
))))
1265 ;; 1. Move effectively items in buffer.
1267 (delete-region beg-A end-B-no-blank
)
1268 (insert (concat body-B between-A-no-blank-and-B body-A
))
1269 ;; 2. Now modify struct. No need to re-read the list, the
1270 ;; transformation is just a shift of positions. Some special
1271 ;; attention is required for items ending at END-A and END-B
1272 ;; as empty spaces are not moved there. In others words,
1273 ;; item BEG-A will end with whitespaces that were at the end
1274 ;; of BEG-B and the same applies to BEG-B.
1276 (let ((pos (car e
)))
1280 (let ((end-e (nth 6 e
)))
1281 (setcar e
(+ pos
(- end-B-no-blank end-A-no-blank
)))
1282 (setcar (nthcdr 6 e
)
1283 (+ end-e
(- end-B-no-blank end-A-no-blank
)))
1284 (when (= end-e end-A
) (setcar (nthcdr 6 e
) end-B
))))
1286 (let ((end-e (nth 6 e
)))
1287 (setcar e
(- (+ pos beg-A
) beg-B
))
1288 (setcar (nthcdr 6 e
) (+ end-e
(- beg-A beg-B
)))
1289 (when (= end-e end-B
)
1290 (setcar (nthcdr 6 e
)
1291 (+ beg-A size-B
(- end-A end-A-no-blank
))))))
1293 (let ((end-e (nth 6 e
)))
1294 (setcar e
(+ pos
(- size-B size-A
)))
1295 (setcar (nthcdr 6 e
) (+ end-e
(- size-B size-A
))))))))
1297 (sort struct
(lambda (e1 e2
) (< (car e1
) (car e2
)))))))
1299 (defun org-list-struct-outdent (start end struct parents
)
1300 "Outdent items between positions START and END.
1302 STRUCT is the list structure. PARENTS is the alist of items'
1303 parents, as returned by `org-list-parents-alist'.
1305 START is included, END excluded."
1308 (let* ((item (car cell
))
1309 (parent (cdr cell
)))
1311 ;; Item not yet in zone: keep association.
1312 ((< item start
) cell
)
1313 ;; Item out of zone: follow associations in ACC.
1315 (let ((convert (and parent
(assq parent acc
))))
1316 (if convert
(cons item
(cdr convert
)) cell
)))
1317 ;; Item has no parent: error
1319 (error "Cannot outdent top-level items"))
1320 ;; Parent is outdented: keep association.
1322 (push (cons parent item
) acc
) cell
)
1324 ;; Parent isn't outdented: reparent to grand-parent.
1325 (let ((grand-parent (org-list-get-parent
1326 parent struct parents
)))
1327 (push (cons parent item
) acc
)
1328 (cons item grand-parent
))))))))
1329 (mapcar out parents
)))
1331 (defun org-list-struct-indent (start end struct parents prevs
)
1332 "Indent items between positions START and END.
1334 STRUCT is the list structure. PARENTS is the alist of parents
1335 and PREVS is the alist of previous items, returned by,
1336 respectively, `org-list-parents-alist' and
1337 `org-list-prevs-alist'.
1339 START is included and END excluded.
1341 STRUCT may be modified if `org-list-demote-modify-bullet' matches
1342 bullets between START and END."
1344 (set-assoc (lambda (cell) (push cell acc
) cell
))
1345 (change-bullet-maybe
1348 (let* ((bul (org-trim (org-list-get-bullet item struct
)))
1349 (new-bul-p (cdr (assoc bul org-list-demote-modify-bullet
))))
1350 (when new-bul-p
(org-list-set-bullet item struct new-bul-p
))))))
1353 (let* ((item (car cell
))
1354 (parent (cdr cell
)))
1356 ;; Item not yet in zone: keep association.
1357 ((< item start
) cell
)
1359 ;; Item out of zone: follow associations in ACC.
1360 (let ((convert (assq parent acc
)))
1361 (if convert
(cons item
(cdr convert
)) cell
)))
1363 ;; Item is in zone...
1364 (let ((prev (org-list-get-prev-item item struct prevs
)))
1365 ;; Check if bullet needs to be changed.
1366 (funcall change-bullet-maybe item
)
1368 ;; First item indented but not parent: error
1369 ((and (not prev
) (< parent start
))
1370 (error "Cannot indent the first item of a list"))
1371 ;; First item and parent indented: keep same
1373 ((not prev
) (funcall set-assoc cell
))
1374 ;; Previous item not indented: reparent to it.
1375 ((< prev start
) (funcall set-assoc
(cons item prev
)))
1376 ;; Previous item indented: reparent like it.
1379 (cons item
(cdr (assq prev acc
)))))))))))))
1380 (mapcar ind parents
)))
1383 ;;; Repairing structures
1385 (defun org-list-use-alpha-bul-p (first struct prevs
)
1386 "Non-nil if list starting at FIRST can have alphabetical bullets.
1388 STRUCT is list structure. PREVS is the alist of previous items,
1389 as returned by `org-list-prevs-alist'."
1390 (and org-alphabetical-lists
1392 (let ((item first
) (ascii 64) (case-fold-search nil
))
1393 ;; Pretend that bullets are uppercase and check if alphabet
1394 ;; is sufficient, taking counters into account.
1396 (let ((bul (org-list-get-bullet item struct
))
1397 (count (org-list-get-counter item struct
)))
1398 ;; Virtually determine current bullet
1399 (if (and count
(string-match "[a-zA-Z]" count
))
1400 ;; Counters are not case-sensitive.
1401 (setq ascii
(string-to-char (upcase count
)))
1402 (setq ascii
(1+ ascii
)))
1403 ;; Test if bullet would be over z or Z.
1406 (setq item
(org-list-get-next-item item struct prevs
)))))
1407 ;; All items checked. All good.
1410 (defun org-list-inc-bullet-maybe (bullet)
1411 "Increment BULLET if applicable."
1412 (let ((case-fold-search nil
))
1414 ;; Num bullet: increment it.
1415 ((string-match "[0-9]+" bullet
)
1417 (number-to-string (1+ (string-to-number (match-string 0 bullet
))))
1419 ;; Alpha bullet: increment it.
1420 ((string-match "[A-Za-z]" bullet
)
1422 (char-to-string (1+ (string-to-char (match-string 0 bullet
))))
1424 ;; Unordered bullet: leave it.
1427 (defun org-list-struct-fix-bul (struct prevs
)
1428 "Verify and correct bullets in STRUCT.
1429 PREVS is the alist of previous items, as returned by
1430 `org-list-prevs-alist'.
1432 This function modifies STRUCT."
1433 (let ((case-fold-search nil
)
1436 ;; Set bullet of ITEM in STRUCT, depending on the type of
1437 ;; first item of the list, the previous bullet and counter
1440 (let* ((prev (org-list-get-prev-item item struct prevs
))
1441 (prev-bul (and prev
(org-list-get-bullet prev struct
)))
1442 (counter (org-list-get-counter item struct
))
1443 (bullet (org-list-get-bullet item struct
))
1444 (alphap (and (not prev
)
1445 (org-list-use-alpha-bul-p item struct prevs
))))
1446 (org-list-set-bullet
1448 (org-list-bullet-string
1450 ;; Alpha counter in alpha list: use counter.
1452 (string-match "[a-zA-Z]" counter
)
1453 (string-match "[a-zA-Z]" prev-bul
))
1454 ;; Use cond to be sure `string-match' is used in
1458 ((string-match "[a-z]" prev-bul
) (downcase counter
))
1459 ((string-match "[A-Z]" prev-bul
) (upcase counter
)))))
1460 (replace-match real-count nil nil prev-bul
)))
1461 ;; Num counter in a num list: use counter.
1463 (string-match "[0-9]+" counter
)
1464 (string-match "[0-9]+" prev-bul
))
1465 (replace-match counter nil nil prev-bul
))
1466 ;; No counter: increase, if needed, previous bullet.
1468 (org-list-inc-bullet-maybe (org-list-get-bullet prev struct
)))
1469 ;; Alpha counter at first item: use counter.
1470 ((and counter
(org-list-use-alpha-bul-p item struct prevs
)
1471 (string-match "[A-Za-z]" counter
)
1472 (string-match "[A-Za-z]" bullet
))
1475 ((string-match "[a-z]" bullet
) (downcase counter
))
1476 ((string-match "[A-Z]" bullet
) (upcase counter
)))))
1477 (replace-match real-count nil nil bullet
)))
1478 ;; Num counter at first item: use counter.
1480 (string-match "[0-9]+" counter
)
1481 (string-match "[0-9]+" bullet
))
1482 (replace-match counter nil nil bullet
))
1483 ;; First bullet is alpha uppercase: use "A".
1484 ((and alphap
(string-match "[A-Z]" bullet
))
1485 (replace-match "A" nil nil bullet
))
1486 ;; First bullet is alpha lowercase: use "a".
1487 ((and alphap
(string-match "[a-z]" bullet
))
1488 (replace-match "a" nil nil bullet
))
1489 ;; First bullet is num: use "1".
1490 ((string-match "\\([0-9]+\\|[A-Za-z]\\)" bullet
)
1491 (replace-match "1" nil nil bullet
))
1492 ;; Not an ordered list: keep bullet.
1494 (mapc fix-bul
(mapcar 'car struct
))))
1496 (defun org-list-struct-fix-ind (struct parents
&optional bullet-size
)
1497 "Verify and correct indentation in STRUCT.
1499 PARENTS is the alist of parents, as returned by
1500 `org-list-parents-alist'.
1502 If numeric optional argument BULLET-SIZE is set, assume all
1503 bullets in list have this length to determine new indentation.
1505 This function modifies STRUCT."
1506 (let* ((ancestor (org-list-get-top-point struct
))
1507 (top-ind (org-list-get-ind ancestor struct
))
1510 (let ((parent (org-list-get-parent item struct parents
)))
1512 ;; Indent like parent + length of parent's bullet.
1514 item struct
(+ (or bullet-size
1516 (org-list-get-bullet parent struct
)))
1517 (org-list-get-ind parent struct
)))
1518 ;; If no parent, indent like top-point.
1519 (org-list-set-ind item struct top-ind
))))))
1520 (mapc new-ind
(mapcar 'car
(cdr struct
)))))
1522 (defun org-list-struct-fix-box (struct parents prevs
&optional ordered
)
1523 "Verify and correct checkboxes in STRUCT.
1525 PARENTS is the alist of parents and PREVS is the alist of
1526 previous items, as returned by, respectively,
1527 `org-list-parents-alist' and `org-list-prevs-alist'.
1529 If ORDERED is non-nil, a checkbox can only be checked when every
1530 checkbox before it is checked too. If there was an attempt to
1531 break this rule, the function will return the blocking item. In
1532 all others cases, the return value will be nil.
1534 This function modifies STRUCT."
1535 (let ((all-items (mapcar 'car struct
))
1540 (mapcar (lambda (child)
1541 (org-list-get-checkbox child struct
))
1542 (org-list-get-children item struct parents
))))
1543 (org-list-set-checkbox
1546 ((and (member "[ ]" box-list
) (member "[X]" box-list
)) "[-]")
1547 ((member "[-]" box-list
) "[-]")
1548 ((member "[X]" box-list
) "[X]")
1549 ((member "[ ]" box-list
) "[ ]")
1550 ;; Parent has no boxed child: leave box as-is.
1551 (t (org-list-get-checkbox item struct
))))))))
1553 ;; 1. List all parents with a checkbox.
1556 (let* ((parent (org-list-get-parent e struct parents
))
1557 (parent-box-p (org-list-get-checkbox parent struct
)))
1558 (when (and parent-box-p
(not (memq parent parent-list
)))
1559 (push parent parent-list
))))
1561 ;; 2. Sort those parents by decreasing indentation.
1562 (setq parent-list
(sort parent-list
1564 (> (org-list-get-ind e1 struct
)
1565 (org-list-get-ind e2 struct
)))))
1566 ;; 3. For each parent, get all children's checkboxes to determine
1567 ;; and set its checkbox accordingly.
1568 (mapc set-parent-box parent-list
)
1569 ;; 4. If ORDERED is set, see if we need to uncheck some boxes.
1572 (mapcar (lambda (e) (org-list-get-checkbox e struct
)) all-items
))
1573 (after-unchecked (member "[ ]" box-list
)))
1574 ;; There are boxes checked after an unchecked one: fix that.
1575 (when (member "[X]" after-unchecked
)
1576 (let ((index (- (length struct
) (length after-unchecked
))))
1577 (mapc (lambda (e) (org-list-set-checkbox e struct
"[ ]"))
1578 (nthcdr index all-items
))
1579 ;; Verify once again the structure, without ORDERED.
1580 (org-list-struct-fix-box struct parents prevs nil
)
1581 ;; Return blocking item.
1582 (nth index all-items
)))))))
1584 (defun org-list-struct-apply-struct (struct old-struct
)
1585 "Apply set-difference between STRUCT and OLD-STRUCT to the buffer.
1587 OLD-STRUCT is the structure before any modifications, and STRUCT
1588 the structure to be applied. The function will only modify parts
1589 of the list which have changed.
1591 Initial position of cursor is restored after the changes."
1592 (let* ((pos (copy-marker (point)))
1593 (inlinetask-re (and (featurep 'org-inlinetask
)
1594 (org-inlinetask-outline-regexp)))
1595 (item-re (org-item-re))
1596 (box-rule-p (cdr (assq 'checkbox org-list-automatic-rules
)))
1599 ;; Shift the indentation between END and BEG by DELTA.
1600 ;; Start from the line before END.
1601 (lambda (end beg delta
)
1603 (skip-chars-backward " \r\t\n")
1605 (while (or (> (point) beg
)
1606 (and (= (point) beg
)
1607 (not (looking-at item-re
))))
1609 ;; Skip inline tasks.
1610 ((and inlinetask-re
(looking-at inlinetask-re
))
1611 (org-inlinetask-goto-beginning))
1612 ;; Shift only non-empty lines.
1613 ((org-looking-at-p "^[ \t]*\\S-")
1614 (let ((i (org-get-indentation)))
1615 (org-indent-line-to (+ i delta
)))))
1616 (forward-line -
1)))))
1619 ;; Replace ITEM first line elements with new elements from
1620 ;; STRUCT, if appropriate.
1623 (let* ((new-ind (org-list-get-ind item struct
))
1624 (old-ind (org-get-indentation))
1625 (new-bul (org-list-bullet-string
1626 (org-list-get-bullet item struct
)))
1627 (old-bul (org-list-get-bullet item old-struct
))
1628 (new-box (org-list-get-checkbox item struct
)))
1629 (looking-at org-list-full-item-re
)
1630 ;; a. Replace bullet
1631 (unless (equal old-bul new-bul
)
1632 (replace-match new-bul nil nil nil
1))
1633 ;; b. Replace checkbox.
1635 ((and new-box box-rule-p
1636 (save-match-data (org-at-item-description-p)))
1637 (message "Cannot add a checkbox to a description list item"))
1638 ((equal (match-string 3) new-box
))
1639 ((and (match-string 3) new-box
)
1640 (replace-match new-box nil nil nil
3))
1642 ;; (goto-char (or (match-end 2) (match-end 1)))
1643 ;; (skip-chars-backward " \t")
1644 (looking-at ".*?\\([ \t]*\\[[ X-]\\]\\)")
1645 (replace-match "" nil nil nil
1))
1646 (t (let ((counterp (match-end 2)))
1647 (goto-char (if counterp
(1+ counterp
) (match-end 1)))
1648 (insert (concat new-box
(unless counterp
" "))))))
1649 ;; c. Indent item to appropriate column.
1650 (unless (= new-ind old-ind
)
1651 (delete-region (goto-char (point-at-bol))
1652 (progn (skip-chars-forward " \t") (point)))
1653 (indent-to new-ind
)))))))
1654 ;; 1. First get list of items and position endings. We maintain
1655 ;; two alists: ITM-SHIFT, determining indentation shift needed
1656 ;; at item, and END-POS, a pseudo-alist where key is ending
1657 ;; position and value point.
1658 (let (end-list acc-end itm-shift all-ends sliced-struct
)
1660 (let* ((pos (car e
))
1661 (ind-pos (org-list-get-ind pos struct
))
1662 (ind-old (org-list-get-ind pos old-struct
))
1663 (bul-pos (org-list-get-bullet pos struct
))
1664 (bul-old (org-list-get-bullet pos old-struct
))
1665 (ind-shift (- (+ ind-pos
(length bul-pos
))
1666 (+ ind-old
(length bul-old
))))
1667 (end-pos (org-list-get-item-end pos old-struct
)))
1668 (push (cons pos ind-shift
) itm-shift
)
1669 (unless (assq end-pos old-struct
)
1670 ;; To determine real ind of an ending position that
1671 ;; is not at an item, we have to find the item it
1672 ;; belongs to: it is the last item (ITEM-UP), whose
1673 ;; ending is further than the position we're
1675 (let ((item-up (assoc-default end-pos acc-end
'>)))
1676 (push (cons end-pos item-up
) end-list
)))
1677 (push (cons end-pos pos
) acc-end
)))
1679 ;; 2. Slice the items into parts that should be shifted by the
1680 ;; same amount of indentation. The slices are returned in
1681 ;; reverse order so changes modifying buffer do not change
1682 ;; positions they refer to.
1683 (setq all-ends
(sort (append (mapcar 'car itm-shift
)
1684 (org-uniquify (mapcar 'car end-list
)))
1686 (while (cdr all-ends
)
1687 (let* ((up (pop all-ends
))
1688 (down (car all-ends
))
1689 (ind (if (assq up struct
)
1690 (cdr (assq up itm-shift
))
1691 (cdr (assq (cdr (assq up end-list
)) itm-shift
)))))
1692 (push (list down up ind
) sliced-struct
)))
1693 ;; 3. Shift each slice in buffer, provided delta isn't 0, from
1694 ;; end to beginning. Take a special action when beginning is
1697 (unless (zerop (nth 2 e
)) (apply shift-body-ind e
))
1698 (let* ((beg (nth 1 e
))
1699 (cell (assq beg struct
)))
1700 (unless (or (not cell
) (equal cell
(assq beg old-struct
)))
1701 (funcall modify-item beg
))))
1703 ;; 4. Go back to initial position.
1706 (defun org-list-write-struct (struct parents
)
1707 "Correct bullets, checkboxes and indentation in list at point.
1708 STRUCT is the list structure. PARENTS is the alist of parents,
1709 as returned by `org-list-parents-alist'."
1710 ;; Order of functions matters here: checkboxes and endings need
1711 ;; correct indentation to be set, and indentation needs correct
1714 ;; 0. Save a copy of structure before modifications
1715 (let ((old-struct (copy-tree struct
)))
1716 ;; 1. Set a temporary, but coherent with PARENTS, indentation in
1717 ;; order to get items endings and bullets properly
1718 (org-list-struct-fix-ind struct parents
2)
1719 ;; 2. Get pseudo-alist of ending positions and sort it by position.
1720 ;; Then associate them to the structure.
1721 (let (end-list acc-end
)
1723 (let* ((pos (car e
))
1724 (ind-pos (org-list-get-ind pos struct
))
1725 (end-pos (org-list-get-item-end pos struct
)))
1726 (unless (assq end-pos struct
)
1727 ;; To determine real ind of an ending position that is
1728 ;; not at an item, we have to find the item it belongs
1729 ;; to: it is the last item (ITEM-UP), whose ending is
1730 ;; further than the position we're interested in.
1731 (let ((item-up (assoc-default end-pos acc-end
'>)))
1733 ;; Else part is for the bottom point.
1734 (if item-up
(+ (org-list-get-ind item-up struct
) 2) 0)
1737 (push (cons ind-pos pos
) end-list
)
1738 (push (cons end-pos pos
) acc-end
)))
1740 (setq end-list
(sort end-list
(lambda (e1 e2
) (< (cdr e1
) (cdr e2
)))))
1741 (org-list-struct-assoc-end struct end-list
))
1742 ;; 3. Get bullets right.
1743 (let ((prevs (org-list-prevs-alist struct
)))
1744 (org-list-struct-fix-bul struct prevs
)
1745 ;; 4. Now get real indentation.
1746 (org-list-struct-fix-ind struct parents
)
1747 ;; 5. Eventually fix checkboxes.
1748 (org-list-struct-fix-box struct parents prevs
))
1749 ;; 6. Apply structure modifications to buffer.
1750 (org-list-struct-apply-struct struct old-struct
)))
1755 (defun org-apply-on-list (function init-value
&rest args
)
1756 "Call FUNCTION on each item of the list at point.
1757 FUNCTION must be called with at least one argument: INIT-VALUE,
1758 that will contain the value returned by the function at the
1759 previous item, plus ARGS extra arguments.
1761 FUNCTION is applied on items in reverse order.
1763 As an example, \(org-apply-on-list \(lambda \(result\) \(1+ result\)\) 0\)
1764 will return the number of items in the current list.
1766 Sublists of the list are skipped. Cursor is always at the
1767 beginning of the item."
1768 (let* ((struct (org-list-struct))
1769 (prevs (org-list-prevs-alist struct
))
1770 (item (copy-marker (point-at-bol)))
1771 (all (org-list-get-all-items (marker-position item
) struct prevs
))
1775 (setq value
(apply function value args
)))
1780 (defun org-list-set-item-visibility (item struct view
)
1781 "Set visibility of ITEM in STRUCT to VIEW.
1783 Possible values are: `folded', `children' or `subtree'. See
1784 `org-cycle' for more information."
1787 (let ((item-end (org-list-get-item-end-before-blank item struct
)))
1789 (outline-flag-region (save-excursion (goto-char item
) (point-at-eol))
1791 ((eq view
'children
)
1792 ;; First show everything.
1793 (org-list-set-item-visibility item struct
'subtree
)
1794 ;; Then fold every child.
1795 (let* ((parents (org-list-parents-alist struct
))
1796 (children (org-list-get-children item struct parents
)))
1798 (org-list-set-item-visibility e struct
'folded
))
1802 (let ((item-end (org-list-get-item-end item struct
)))
1803 (outline-flag-region item item-end nil
)))))
1805 (defun org-list-item-body-column (item)
1806 "Return column at which body of ITEM should start."
1807 (let (bpos bcol tpos tcol
)
1810 (looking-at "[ \t]*\\(\\S-+\\)\\(.*[ \t]+::\\)?[ \t]+")
1811 (setq bpos
(match-beginning 1) tpos
(match-end 0)
1812 bcol
(progn (goto-char bpos
) (current-column))
1813 tcol
(progn (goto-char tpos
) (current-column)))
1814 (when (> tcol
(+ bcol org-description-max-indent
))
1815 (setq tcol
(+ bcol
5))))
1819 ;;; Interactive functions
1821 (defalias 'org-list-get-item-begin
'org-in-item-p
)
1823 (defun org-beginning-of-item ()
1824 "Go to the beginning of the current item.
1825 Throw an error when not in a list."
1827 (let ((begin (org-in-item-p)))
1828 (if begin
(goto-char begin
) (error "Not in an item"))))
1830 (defun org-beginning-of-item-list ()
1831 "Go to the beginning item of the current list or sublist.
1832 Throw an error when not in a list."
1834 (let ((begin (org-in-item-p)))
1836 (error "Not in an item")
1838 (let* ((struct (org-list-struct))
1839 (prevs (org-list-prevs-alist struct
)))
1840 (goto-char (org-list-get-list-begin begin struct prevs
))))))
1842 (defun org-end-of-item-list ()
1843 "Go to the end of the current list or sublist.
1844 Throw an error when not in a list."
1846 (let ((begin (org-in-item-p)))
1848 (error "Not in an item")
1850 (let* ((struct (org-list-struct))
1851 (prevs (org-list-prevs-alist struct
)))
1852 (goto-char (org-list-get-list-end begin struct prevs
))))))
1854 (defun org-end-of-item ()
1855 "Go to the end of the current item.
1856 Throw an error when not in a list."
1858 (let ((begin (org-in-item-p)))
1860 (error "Not in an item")
1862 (let ((struct (org-list-struct)))
1863 (goto-char (org-list-get-item-end begin struct
))))))
1865 (defun org-previous-item ()
1866 "Move to the beginning of the previous item.
1867 Throw an error when not in a list, or at first item."
1869 (let ((begin (org-in-item-p)))
1871 (error "Not in an item")
1873 (let* ((struct (org-list-struct))
1874 (prevs (org-list-prevs-alist struct
))
1875 (prevp (org-list-get-prev-item begin struct prevs
)))
1876 (if prevp
(goto-char prevp
) (error "On first item"))))))
1878 (defun org-next-item ()
1879 "Move to the beginning of the next item.
1880 Throw an error when not in a plain list, or at last item."
1882 (let ((begin (org-in-item-p)))
1884 (error "Not in an item")
1886 (let* ((struct (org-list-struct))
1887 (prevs (org-list-prevs-alist struct
))
1888 (prevp (org-list-get-next-item begin struct prevs
)))
1889 (if prevp
(goto-char prevp
) (error "On last item"))))))
1891 (defun org-move-item-down ()
1892 "Move the item at point down, i.e. swap with following item.
1893 Subitems (items with larger indentation) are considered part of
1894 the item, so this really moves item trees."
1896 (unless (org-at-item-p) (error "Not at an item"))
1897 (let* ((pos (point))
1898 (col (current-column))
1899 (actual-item (point-at-bol))
1900 (struct (org-list-struct))
1901 (prevs (org-list-prevs-alist struct
))
1902 (next-item (org-list-get-next-item (point-at-bol) struct prevs
)))
1906 (error "Cannot move this item further down"))
1908 (org-list-exchange-items actual-item next-item struct
))
1909 ;; Use a short variation of `org-list-write-struct' as there's
1910 ;; no need to go through all the steps.
1911 (let ((old-struct (copy-tree struct
))
1912 (prevs (org-list-prevs-alist struct
))
1913 (parents (org-list-parents-alist struct
)))
1914 (org-list-struct-fix-bul struct prevs
)
1915 (org-list-struct-fix-ind struct parents
)
1916 (org-list-struct-apply-struct struct old-struct
)
1917 (goto-char (org-list-get-next-item (point-at-bol) struct prevs
)))
1918 (org-move-to-column col
))))
1920 (defun org-move-item-up ()
1921 "Move the item at point up, i.e. swap with previous item.
1922 Subitems (items with larger indentation) are considered part of
1923 the item, so this really moves item trees."
1925 (unless (org-at-item-p) (error "Not at an item"))
1926 (let* ((pos (point))
1927 (col (current-column))
1928 (actual-item (point-at-bol))
1929 (struct (org-list-struct))
1930 (prevs (org-list-prevs-alist struct
))
1931 (prev-item (org-list-get-prev-item (point-at-bol) struct prevs
)))
1935 (error "Cannot move this item further up"))
1937 (org-list-exchange-items prev-item actual-item struct
))
1938 ;; Use a short variation of `org-list-write-struct' as there's
1939 ;; no need to go through all the steps.
1940 (let ((old-struct (copy-tree struct
))
1941 (prevs (org-list-prevs-alist struct
))
1942 (parents (org-list-parents-alist struct
)))
1943 (org-list-struct-fix-bul struct prevs
)
1944 (org-list-struct-fix-ind struct parents
)
1945 (org-list-struct-apply-struct struct old-struct
))
1946 (org-move-to-column col
))))
1948 (defun org-insert-item (&optional checkbox
)
1949 "Insert a new item at the current level.
1950 If cursor is before first character after bullet of the item, the
1951 new item will be created before the current one.
1953 If CHECKBOX is non-nil, add a checkbox next to the bullet.
1955 Return t when things worked, nil when we are not in an item, or
1957 (let ((itemp (org-in-item-p))
1959 ;; If cursor isn't is a list or if list is invisible, return nil.
1960 (unless (or (not itemp
)
1963 (outline-invisible-p)))
1966 (org-at-item-timer-p))
1967 ;; Timer list: delegate to `org-timer-item'.
1968 (progn (org-timer-item) t
)
1970 (let* ((struct (org-list-struct))
1971 (prevs (org-list-prevs-alist struct
))
1972 ;; If we're in a description list, ask for the new term.
1973 (desc (when (org-list-get-tag itemp struct
)
1974 (concat (read-string "Term: ") " :: ")))
1975 ;; Don't insert a checkbox if checkbox rule is applied
1976 ;; and it is a description item.
1977 (checkp (and checkbox
1979 (not (cdr (assq 'checkbox
1980 org-list-automatic-rules
)))))))
1982 (org-list-insert-item pos struct prevs checkp desc
))
1983 (org-list-write-struct struct
(org-list-parents-alist struct
))
1984 (when checkp
(org-update-checkbox-count-maybe))
1985 (looking-at org-list-full-item-re
)
1986 (goto-char (match-end 0))
1989 (defun org-list-repair ()
1990 "Fix indentation, bullets and checkboxes is the list at point."
1992 (unless (org-at-item-p) (error "This is not a list"))
1993 (let* ((struct (org-list-struct))
1994 (parents (org-list-parents-alist struct
)))
1995 (org-list-write-struct struct parents
)))
1997 (defun org-cycle-list-bullet (&optional which
)
1998 "Cycle through the different itemize/enumerate bullets.
1999 This cycle the entire list level through the sequence:
2001 `-' -> `+' -> `*' -> `1.' -> `1)'
2003 If WHICH is a valid string, use that as the new bullet. If WHICH
2004 is an integer, 0 means `-', 1 means `+' etc. If WHICH is
2005 `previous', cycle backwards."
2007 (unless (org-at-item-p) (error "Not at an item"))
2010 (let* ((struct (org-list-struct))
2011 (parents (org-list-parents-alist struct
))
2012 (prevs (org-list-prevs-alist struct
))
2013 (list-beg (org-list-get-first-item (point) struct prevs
))
2014 (bullet (org-list-get-bullet list-beg struct
))
2015 (bullet-rule-p (cdr (assq 'bullet org-list-automatic-rules
)))
2016 (alpha-p (org-list-use-alpha-bul-p list-beg struct prevs
))
2017 (case-fold-search nil
)
2019 ((string-match "[a-z]\\." bullet
) "a.")
2020 ((string-match "[a-z])" bullet
) "a)")
2021 ((string-match "[A-Z]\\." bullet
) "A.")
2022 ((string-match "[A-Z])" bullet
) "A)")
2023 ((string-match "\\." bullet
) "1.")
2024 ((string-match ")" bullet
) "1)")
2025 (t (org-trim bullet
))))
2026 ;; Compute list of possible bullets, depending on context.
2029 ;; *-bullets are not allowed at column 0.
2030 (unless (and bullet-rule-p
2031 (looking-at "\\S-")) '("*"))
2032 ;; Description items cannot be numbered.
2033 (unless (or (eq org-plain-list-ordered-item-terminator ?\
))
2034 (and bullet-rule-p
(org-at-item-description-p)))
2036 (unless (or (eq org-plain-list-ordered-item-terminator ?.
)
2037 (and bullet-rule-p
(org-at-item-description-p)))
2039 (unless (or (not alpha-p
)
2040 (eq org-plain-list-ordered-item-terminator ?\
))
2041 (and bullet-rule-p
(org-at-item-description-p)))
2043 (unless (or (not alpha-p
)
2044 (eq org-plain-list-ordered-item-terminator ?.
)
2045 (and bullet-rule-p
(org-at-item-description-p)))
2047 (len (length bullet-list
))
2048 (item-index (- len
(length (member current bullet-list
))))
2049 (get-value (lambda (index) (nth (mod index len
) bullet-list
)))
2051 ((member which bullet-list
) which
)
2052 ((numberp which
) (funcall get-value which
))
2053 ((eq 'previous which
) (funcall get-value
(1- item-index
)))
2054 (t (funcall get-value
(1+ item-index
))))))
2055 ;; Use a short variation of `org-list-write-struct' as there's
2056 ;; no need to go through all the steps.
2057 (let ((old-struct (copy-tree struct
)))
2058 (org-list-set-bullet list-beg struct
(org-list-bullet-string new
))
2059 (org-list-struct-fix-bul struct prevs
)
2060 (org-list-struct-fix-ind struct parents
)
2061 (org-list-struct-apply-struct struct old-struct
)))))
2063 (defun org-toggle-checkbox (&optional toggle-presence
)
2064 "Toggle the checkbox in the current line.
2065 With prefix arg TOGGLE-PRESENCE, add or remove checkboxes. With
2066 double prefix, set checkbox to [-].
2068 When there is an active region, toggle status or presence of the
2069 first checkbox there, and make every item inside have the same
2070 status or presence, respectively.
2072 If the cursor is in a headline, apply this to all checkbox items
2073 in the text below the heading, taking as reference the first item
2074 in subtree, ignoring drawers."
2081 (drawer-re (concat "^[ \t]*:\\("
2082 (mapconcat 'regexp-quote org-drawers
"\\|")
2084 (keyword-re (concat "^[ \t]*\\<\\(" org-scheduled-string
2085 "\\|" org-deadline-string
2086 "\\|" org-closed-string
2087 "\\|" org-clock-string
"\\)"
2088 " *[[<]\\([^]>]+\\)[]>]"))
2089 (orderedp (org-entry-get nil
"ORDERED"))
2091 ;; In a region, start at first item in region.
2093 ((org-region-active-p)
2094 (let ((limit (region-end)))
2095 (goto-char (region-beginning))
2096 (if (org-list-search-forward (org-item-beginning-re) limit t
)
2097 (setq lim-up
(point-at-bol))
2098 (error "No item in region"))
2099 (setq lim-down
(copy-marker limit
))))
2101 ;; On an heading, start at first item after drawers and
2102 ;; time-stamps (scheduled, etc.).
2103 (let ((limit (save-excursion (outline-next-heading) (point))))
2105 (while (or (looking-at drawer-re
) (looking-at keyword-re
))
2106 (if (looking-at keyword-re
)
2108 (re-search-forward "^[ \t]*:END:" limit nil
)))
2109 (if (org-list-search-forward (org-item-beginning-re) limit t
)
2110 (setq lim-up
(point-at-bol))
2111 (error "No item in subtree"))
2112 (setq lim-down
(copy-marker limit
))))
2113 ;; Just one item: set SINGLEP flag.
2116 (setq lim-up
(point-at-bol)
2117 lim-down
(point-at-eol)))
2118 (t (error "Not at an item or heading, and no active region"))))
2119 ;; Determine the checkbox going to be applied to all items
2124 (let ((cbox (and (org-at-item-checkbox-p) (match-string 1))))
2126 ((equal toggle-presence
'(16)) "[-]")
2127 ((equal toggle-presence
'(4))
2128 (unless cbox
"[ ]"))
2129 ((equal "[X]" cbox
) "[ ]")
2131 ;; When an item is found within bounds, grab the full list at
2132 ;; point structure, then:
2133 ;; 1. set check-box of all its items within bounds to
2135 ;; 2. fix check-boxes of the whole list; 3. move point after the
2138 (while (and (< (point) lim-down
)
2139 (org-list-search-forward (org-item-beginning-re)
2141 (let* ((struct (org-list-struct))
2142 (struct-copy (copy-tree struct
))
2143 (parents (org-list-parents-alist struct
))
2144 (prevs (org-list-prevs-alist struct
))
2145 (bottom (copy-marker (org-list-get-bottom-point struct
)))
2146 (items-to-toggle (org-remove-if
2147 (lambda (e) (or (< e lim-up
) (> e lim-down
)))
2148 (mapcar 'car struct
))))
2149 (mapc (lambda (e) (org-list-set-checkbox
2151 ;; If there is no box at item, leave as-is
2152 ;; unless function was called with C-u prefix.
2153 (let ((cur-box (org-list-get-checkbox e struct
)))
2154 (if (or cur-box
(equal toggle-presence
'(4)))
2158 (setq block-item
(org-list-struct-fix-box
2159 struct parents prevs orderedp
))
2160 ;; Report some problems due to ORDERED status of subtree.
2161 ;; If only one box was being checked, throw an error, else,
2162 ;; only signal problems.
2164 ((and singlep block-item
(> lim-up block-item
))
2166 "Checkbox blocked because of unchecked box at line %d"
2167 (org-current-line block-item
)))
2170 "Checkboxes were removed due to unchecked box at line %d"
2171 (org-current-line block-item
))))
2173 (org-list-struct-apply-struct struct struct-copy
)))))
2174 (org-update-checkbox-count-maybe))
2176 (defun org-reset-checkbox-state-subtree ()
2177 "Reset all checkboxes in an entry subtree."
2179 (if (org-before-first-heading-p)
2180 (error "Not inside a tree")
2183 (org-narrow-to-subtree)
2185 (goto-char (point-min))
2186 (let ((end (point-max)))
2187 (while (< (point) end
)
2188 (when (org-at-item-checkbox-p)
2189 (replace-match "[ ]" t t nil
1))
2190 (beginning-of-line 2)))
2191 (org-update-checkbox-count-maybe 'all
)))))
2193 (defun org-update-checkbox-count (&optional all
)
2194 "Update the checkbox statistics in the current section.
2195 This will find all statistic cookies like [57%] and [6/12] and
2196 update them with the current numbers.
2198 With optional prefix argument ALL, do this for the whole buffer."
2201 (let ((cookie-re "\\(\\(\\[[0-9]*%\\]\\)\\|\\(\\[[0-9]*/[0-9]*\\]\\)\\)")
2202 (box-re "^[ \t]*\\([-+*]\\|\\([0-9]+\\|[A-Za-z]\\)[.)]\\)[ \t]+\\(?:\\[@\\(?:start:\\)?\\([0-9]+\\|[A-Za-z]\\)\\][ \t]*\\)?\\(\\[[- X]\\]\\)")
2204 (or (not org-hierarchical-checkbox-statistics
)
2205 (string-match "\\<recursive\\>"
2206 (or (org-entry-get nil
"COOKIE_DATA") ""))))
2208 (cons (point-min) (point-max))
2209 (cons (or (ignore-errors (org-back-to-heading t
) (point))
2211 (save-excursion (outline-next-heading) (point)))))
2214 ;; Return number of checked boxes and boxes of all types
2215 ;; in all structures in STRUCTS. If RECURSIVEP is
2216 ;; non-nil, also count boxes in sub-lists. If ITEM is
2217 ;; nil, count across the whole structure, else count only
2218 ;; across subtree whose ancestor is ITEM.
2219 (lambda (item structs recursivep
)
2220 (let ((c-on 0) (c-all 0))
2223 (let* ((pre (org-list-prevs-alist s
))
2224 (par (org-list-parents-alist s
))
2227 ((and recursivep item
) (org-list-get-subtree item s
))
2228 (recursivep (mapcar 'car s
))
2229 (item (org-list-get-children item s par
))
2230 (t (org-list-get-all-items
2231 (org-list-get-top-point s
) s pre
))))
2232 (cookies (delq nil
(mapcar
2234 (org-list-get-checkbox e s
))
2236 (setq c-all
(+ (length cookies
) c-all
)
2237 c-on
(+ (org-count "[X]" cookies
) c-on
))))
2239 (cons c-on c-all
)))))
2241 cookies-list structs-bak box-num
)
2242 (goto-char (car bounds
))
2243 ;; 1. Build an alist for each cookie found within BOUNDS. The
2244 ;; key will be position at beginning of cookie and values
2245 ;; ending position, format of cookie, and a cell whose car is
2246 ;; number of checked boxes to report, and cdr total number of
2248 (while (re-search-forward cookie-re
(cdr bounds
) t
)
2253 (match-beginning 1) ; cookie start
2254 (match-end 1) ; cookie end
2255 (match-string 2) ; percent?
2257 ;; Cookie is at an heading, but specifically for todo,
2258 ;; not for checkboxes: skip it.
2259 ((and (org-on-heading-p)
2260 (string-match "\\<todo\\>"
2262 (or (org-entry-get nil
"COOKIE_DATA") ""))))
2264 ;; Cookie is at an heading, but all lists before next
2265 ;; heading already have been read. Use data collected
2266 ;; in STRUCTS-BAK. This should only happen when
2267 ;; heading has more than one cookie on it.
2268 ((and (org-on-heading-p)
2269 (<= (save-excursion (outline-next-heading) (point))
2271 (funcall count-boxes nil structs-bak recursivep
))
2272 ;; Cookie is at a fresh heading. Grab structure of
2273 ;; every list containing a checkbox between point and
2274 ;; next headline, and save them in STRUCTS-BAK.
2276 (setq backup-end
(save-excursion
2277 (outline-next-heading) (point))
2279 (while (org-list-search-forward box-re backup-end
'move
)
2280 (let* ((struct (org-list-struct))
2281 (bottom (org-list-get-bottom-point struct
)))
2282 (push struct structs-bak
)
2283 (goto-char bottom
)))
2284 (funcall count-boxes nil structs-bak recursivep
))
2285 ;; Cookie is at an item, and we already have list
2286 ;; structure stored in STRUCTS-BAK.
2287 ((and (org-at-item-p)
2288 (< (point-at-bol) backup-end
)
2289 ;; Only lists in no special context are stored.
2290 (not (nth 2 (org-list-context))))
2291 (funcall count-boxes
(point-at-bol) structs-bak recursivep
))
2292 ;; Cookie is at an item, but we need to compute list
2295 (let ((struct (org-list-struct)))
2296 (setq backup-end
(org-list-get-bottom-point struct
)
2297 structs-bak
(list struct
)))
2298 (funcall count-boxes
(point-at-bol) structs-bak recursivep
))
2299 ;; Else, cookie found is at a wrong place. Skip it.
2300 (t (throw 'skip nil
))))
2302 ;; 2. Apply alist to buffer, in reverse order so positions stay
2303 ;; unchanged after cookie modifications.
2304 (mapc (lambda (cookie)
2305 (let* ((beg (car cookie
))
2306 (end (nth 1 cookie
))
2307 (percentp (nth 2 cookie
))
2308 (checked (car (nth 3 cookie
)))
2309 (total (cdr (nth 3 cookie
)))
2311 (format "[%d%%]" (/ (* 100 checked
)
2313 (format "[%d/%d]" checked total
))))
2316 (delete-region (point) (+ (point) (- end beg
)))
2317 (when org-auto-align-tags
(org-fix-tags-on-the-fly))))
2320 (defun org-get-checkbox-statistics-face ()
2321 "Select the face for checkbox statistics.
2322 The face will be `org-done' when all relevant boxes are checked.
2323 Otherwise it will be `org-todo'."
2325 (if (equal (match-string 1) "100%")
2326 'org-checkbox-statistics-done
2327 'org-checkbox-statistics-todo
)
2328 (if (and (> (match-end 2) (match-beginning 2))
2329 (equal (match-string 2) (match-string 3)))
2330 'org-checkbox-statistics-done
2331 'org-checkbox-statistics-todo
)))
2333 (defun org-update-checkbox-count-maybe (&optional all
)
2334 "Update checkbox statistics unless turned off by user."
2335 (when (cdr (assq 'checkbox org-list-automatic-rules
))
2336 (org-update-checkbox-count all
))
2337 (run-hooks 'org-checkbox-statistics-hook
))
2339 (defvar org-last-indent-begin-marker
(make-marker))
2340 (defvar org-last-indent-end-marker
(make-marker))
2341 (defun org-list-indent-item-generic (arg no-subtree struct
)
2342 "Indent a local list item including its children.
2343 When number ARG is a negative, item will be outdented, otherwise
2344 it will be indented.
2346 If a region is active, all items inside will be moved.
2348 If NO-SUBTREE is non-nil, only indent the item itself, not its
2351 STRUCT is the list structure.
2353 Return t if successful."
2356 (let* ((regionp (org-region-active-p))
2357 (rbeg (and regionp
(region-beginning)))
2358 (rend (and regionp
(region-end)))
2359 (top (org-list-get-top-point struct
))
2360 (parents (org-list-parents-alist struct
))
2361 (prevs (org-list-prevs-alist struct
))
2362 ;; Are we going to move the whole list?
2364 (and (= top
(point))
2365 (cdr (assq 'indent org-list-automatic-rules
))
2368 "First item of list cannot move without its subtree")
2370 ;; Determine begin and end points of zone to indent. If moving
2371 ;; more than one item, save them for subsequent moves.
2372 (unless (and (memq last-command
'(org-shiftmetaright org-shiftmetaleft
))
2373 (memq this-command
'(org-shiftmetaright org-shiftmetaleft
)))
2376 (set-marker org-last-indent-begin-marker rbeg
)
2377 (set-marker org-last-indent-end-marker rend
))
2378 (set-marker org-last-indent-begin-marker
(point))
2379 (set-marker org-last-indent-end-marker
2381 (specialp (org-list-get-bottom-point struct
))
2382 (no-subtree (1+ (point)))
2383 (t (org-list-get-item-end (point) struct
))))))
2384 (let* ((beg (marker-position org-last-indent-begin-marker
))
2385 (end (marker-position org-last-indent-end-marker
)))
2387 ;; Special case: moving top-item with indent rule.
2389 (let* ((level-skip (org-level-increment))
2390 (offset (if (< arg
0) (- level-skip
) level-skip
))
2391 (top-ind (org-list-get-ind beg struct
))
2392 (old-struct (copy-tree struct
)))
2393 (if (< (+ top-ind offset
) 0)
2394 (error "Cannot outdent beyond margin")
2395 ;; Change bullet if necessary.
2396 (when (and (= (+ top-ind offset
) 0)
2398 (org-list-get-bullet beg struct
)))
2399 (org-list-set-bullet beg struct
2400 (org-list-bullet-string "-")))
2401 ;; Shift every item by OFFSET and fix bullets. Then
2402 ;; apply changes to buffer.
2404 (let ((ind (org-list-get-ind (car e
) struct
)))
2405 (org-list-set-ind (car e
) struct
(+ ind offset
))))
2407 (org-list-struct-fix-bul struct prevs
)
2408 (org-list-struct-apply-struct struct old-struct
))))
2411 ;; If only one item is moved, it mustn't have a child.
2414 (org-list-has-child-p beg struct
))
2415 ;; If a subtree or region is moved, the last item
2416 ;; of the subtree mustn't have a child.
2417 (let ((last-item (caar
2420 (lambda (e) (>= (car e
) end
))
2422 (org-list-has-child-p last-item struct
))))
2423 (error "Cannot outdent an item without its children"))
2428 (org-list-struct-outdent beg end struct parents
)
2429 (org-list-struct-indent beg end struct parents prevs
))))
2430 (org-list-write-struct struct new-parents
))
2431 (org-update-checkbox-count-maybe))))))
2434 (defun org-outdent-item ()
2435 "Outdent a local list item, but not its children.
2436 If a region is active, all items inside will be moved."
2439 (let ((struct (org-list-struct)))
2440 (org-list-indent-item-generic -
1 t struct
))
2441 (error "Not at an item")))
2443 (defun org-indent-item ()
2444 "Indent a local list item, but not its children.
2445 If a region is active, all items inside will be moved."
2448 (let ((struct (org-list-struct)))
2449 (org-list-indent-item-generic 1 t struct
))
2450 (error "Not at an item")))
2452 (defun org-outdent-item-tree ()
2453 "Outdent a local list item including its children.
2454 If a region is active, all items inside will be moved."
2456 (let ((regionp (org-region-active-p)))
2458 ((or (org-at-item-p)
2459 (and (org-region-active-p)
2460 (goto-char (region-beginning))
2462 (let ((struct (org-list-struct)))
2463 (org-list-indent-item-generic -
1 nil struct
)))
2464 (regionp (error "Region not starting at an item"))
2465 (t (error "Not at an item")))))
2467 (defun org-indent-item-tree ()
2468 "Indent a local list item including its children.
2469 If a region is active, all items inside will be moved."
2471 (let ((regionp (org-region-active-p)))
2473 ((or (org-at-item-p)
2474 (and (org-region-active-p)
2475 (goto-char (region-beginning))
2477 (let ((struct (org-list-struct)))
2478 (org-list-indent-item-generic 1 nil struct
)))
2479 (regionp (error "Region not starting at an item"))
2480 (t (error "Not at an item")))))
2482 (defvar org-tab-ind-state
)
2483 (defun org-cycle-item-indentation ()
2484 "Cycle levels of indentation of an empty item.
2485 The first run indents the item, if applicable. Subsequents runs
2486 outdent it at meaningful levels in the list. When done, item is
2487 put back at its original position with its original bullet.
2489 Return t at each successful move."
2490 (when (org-at-item-p)
2491 (let* ((org-adapt-indentation nil
)
2492 (struct (org-list-struct))
2493 (ind (org-list-get-ind (point-at-bol) struct
))
2494 (bullet (org-trim (buffer-substring (point-at-bol) (point-at-eol)))))
2495 ;; Accept empty items or if cycle has already started.
2496 (when (or (eq last-command
'org-cycle-item-indentation
)
2497 (and (save-excursion
2499 (looking-at org-list-full-item-re
))
2500 (>= (match-end 0) (save-excursion
2501 (goto-char (org-list-get-item-end
2502 (point-at-bol) struct
))
2503 (skip-chars-backward " \r\t\n")
2505 (setq this-command
'org-cycle-item-indentation
)
2506 ;; When in the middle of the cycle, try to outdent first. If
2507 ;; it fails, and point is still at initial position, indent.
2508 ;; Else, re-create it at its original position.
2509 (if (eq last-command
'org-cycle-item-indentation
)
2511 ((ignore-errors (org-list-indent-item-generic -
1 t struct
)))
2512 ((and (= ind
(car org-tab-ind-state
))
2513 (ignore-errors (org-list-indent-item-generic 1 t struct
))))
2514 (t (delete-region (point-at-bol) (point-at-eol))
2515 (org-indent-to-column (car org-tab-ind-state
))
2516 (insert (cdr org-tab-ind-state
) " ")
2518 (setq this-command
'identity
)))
2519 ;; If a cycle is starting, remember indentation and bullet,
2520 ;; then try to indent. If it fails, try to outdent.
2521 (setq org-tab-ind-state
(cons ind bullet
))
2523 ((ignore-errors (org-list-indent-item-generic 1 t struct
)))
2524 ((ignore-errors (org-list-indent-item-generic -
1 t struct
)))
2525 (t (error "Cannot move item"))))
2528 (defun org-sort-list (&optional with-case sorting-type getkey-func compare-func
)
2530 The cursor may be at any item of the list that should be sorted.
2531 Sublists are not sorted. Checkboxes, if any, are ignored.
2533 Sorting can be alphabetically, numerically, by date/time as given
2534 by a time stamp, by a property or by priority.
2536 Comparing entries ignores case by default. However, with an
2537 optional argument WITH-CASE, the sorting considers case as well.
2539 The command prompts for the sorting type unless it has been given
2540 to the function through the SORTING-TYPE argument, which needs to
2541 be a character, \(?n ?N ?a ?A ?t ?T ?f ?F). Here is the precise
2542 meaning of each character:
2544 n Numerically, by converting the beginning of the item to a number.
2545 a Alphabetically. Only the first line of item is checked.
2546 t By date/time, either the first active time stamp in the entry, if
2547 any, or by the first inactive one. In a timer list, sort the timers.
2549 Capital letters will reverse the sort order.
2551 If the SORTING-TYPE is ?f or ?F, then GETKEY-FUNC specifies
2552 a function to be called with point at the beginning of the
2553 record. It must return either a string or a number that should
2554 serve as the sorting key for that record. It will then use
2555 COMPARE-FUNC to compare entries."
2557 (let* ((case-func (if with-case
'identity
'downcase
))
2558 (struct (org-list-struct))
2559 (prevs (org-list-prevs-alist struct
))
2560 (start (org-list-get-list-begin (point-at-bol) struct prevs
))
2561 (end (org-list-get-list-end (point-at-bol) struct prevs
))
2565 "Sort plain list: [a]lpha [n]umeric [t]ime [f]unc A/N/T/F means reversed:")
2566 (read-char-exclusive)))
2567 (getkey-func (and (= (downcase sorting-type
) ?f
)
2568 (intern (org-icompleting-read "Sort using function: "
2569 obarray
'fboundp t nil nil
)))))
2570 (message "Sorting items...")
2572 (narrow-to-region start end
)
2573 (goto-char (point-min))
2574 (let* ((dcst (downcase sorting-type
))
2575 (case-fold-search nil
)
2576 (now (current-time))
2578 ((= dcst ?a
) 'string
<)
2579 ((= dcst ?f
) compare-func
)
2582 (next-record (lambda ()
2583 (skip-chars-forward " \r\t\n")
2584 (beginning-of-line)))
2585 (end-record (lambda ()
2586 (goto-char (org-list-get-item-end-before-blank
2590 (when (looking-at "[ \t]*[-+*0-9.)]+\\([ \t]+\\[[- X]\\]\\)?[ \t]+")
2593 (string-to-number (buffer-substring (match-end 0)
2597 (buffer-substring (match-end 0) (point-at-eol))))
2600 ;; If it is a timer list, convert timer to seconds
2601 ((org-at-item-timer-p)
2602 (org-timer-hms-to-secs (match-string 1)))
2603 ((or (re-search-forward org-ts-regexp
(point-at-eol) t
)
2604 (re-search-forward org-ts-regexp-both
2606 (org-time-string-to-seconds (match-string 0)))
2607 (t (org-float-time now
))))
2610 (let ((value (funcall getkey-func
)))
2612 (funcall case-func value
)
2614 (error "Invalid key function `%s'" getkey-func
)))
2615 (t (error "Invalid sorting type `%c'" sorting-type
)))))))
2616 (sort-subr (/= dcst sorting-type
)
2622 ;; Read and fix list again, as `sort-subr' probably destroyed
2625 (run-hooks 'org-after-sorting-entries-or-items-hook
)
2626 (message "Sorting items...done")))))
2629 ;;; Send and receive lists
2631 (defun org-list-parse-list (&optional delete
)
2632 "Parse the list at point and maybe DELETE it.
2634 Return a list whose car is a symbol of list type, among
2635 `ordered', `unordered' and `descriptive'. Then, each item is
2636 a list whose car is counter, and cdr are strings and other
2637 sub-lists. Inside strings, check-boxes are replaced by
2638 \"[CBON]\", \"[CBOFF]\" and \"[CBTRANS]\".
2640 For example, the following list:
2645 more text in first item
2651 \(nil \"first item\"
2653 \(nil \"sub-item one\"\)
2654 \(nil \"[CBON] sub-item two\"\)\)
2655 \"more text in first item\"\)
2656 \(3 \"last item\"\)\)
2658 Point is left at list end."
2659 (let* ((struct (org-list-struct))
2660 (prevs (org-list-prevs-alist struct
))
2661 (parents (org-list-parents-alist struct
))
2662 (top (org-list-get-top-point struct
))
2663 (bottom (org-list-get-bottom-point struct
))
2665 parse-item
; for byte-compiler
2668 ;; Return text between BEG and END, trimmed, with
2669 ;; checkboxes replaced.
2671 (let ((text (org-trim (buffer-substring beg end
))))
2672 (if (string-match "\\`\\[\\([-X ]\\)\\]" text
)
2674 (let ((box (match-string 1 text
)))
2676 ((equal box
" ") "CBOFF")
2677 ((equal box
"-") "CBTRANS")
2683 ;; Return a list whose car is list type and cdr a list of
2686 (cons (org-list-get-list-type (car e
) struct prevs
)
2687 (mapcar parse-item e
)))))
2690 ;; Return a list containing counter of item, if any, text
2691 ;; and any sublist inside it.
2693 (let ((start (save-excursion
2695 (looking-at "[ \t]*\\S-+\\([ \t]+\\[@\\(start:\\)?\\([0-9]+\\|[a-zA-Z]\\)\\]\\)?[ \t]*")
2697 ;; Get counter number. For alphabetic counter, get
2698 ;; its position in the alphabet.
2699 (counter (let ((c (org-list-get-counter e struct
)))
2702 ((string-match "[A-Za-z]" c
)
2703 (- (string-to-char (upcase (match-string 0 c
)))
2705 ((string-match "[0-9]+" c
)
2706 (string-to-number (match-string 0 c
))))))
2707 (childp (org-list-has-child-p e struct
))
2708 (end (org-list-get-item-end e struct
)))
2709 ;; If item has a child, store text between bullet and
2710 ;; next child, then recursively parse all sublists. At
2711 ;; the end of each sublist, check for the presence of
2712 ;; text belonging to the original item.
2714 (let* ((children (org-list-get-children e struct parents
))
2715 (body (list (funcall get-text start childp
))))
2717 (let* ((first (car children
))
2718 (sub (org-list-get-all-items first struct prevs
))
2719 (last-c (car (last sub
)))
2720 (last-end (org-list-get-item-end last-c struct
)))
2721 (push (funcall parse-sublist sub
) body
)
2722 ;; Remove children from the list just parsed.
2723 (setq children
(cdr (member last-c children
)))
2724 ;; There is a chunk of text belonging to the
2725 ;; item if last child doesn't end where next
2726 ;; child starts or where item ends.
2727 (unless (= (or (car children
) end
) last-end
)
2728 (push (funcall get-text
2729 last-end
(or (car children
) end
))
2731 (cons counter
(nreverse body
)))
2732 (list counter
(funcall get-text start end
))))))))
2733 ;; Store output, take care of cursor position and deletion of
2734 ;; list, then return output.
2735 (setq out
(funcall parse-sublist
(org-list-get-all-items top struct prevs
)))
2738 (delete-region top bottom
)
2739 (when (and (not (eq org-list-ending-method
'indent
))
2740 (looking-at org-list-end-re
))
2741 (replace-match "\n")))
2744 (defun org-list-make-subtree ()
2745 "Convert the plain list at point into a subtree."
2747 (if (not (ignore-errors (goto-char (org-in-item-p))))
2748 (error "Not in a list")
2749 (let ((list (save-excursion (org-list-parse-list t
))))
2750 (insert (org-list-to-subtree list
)))))
2752 (defun org-list-insert-radio-list ()
2753 "Insert a radio list template appropriate for this major mode."
2755 (let* ((e (assq major-mode org-list-radio-list-templates
))
2758 (unless e
(error "No radio list setup defined for %s" major-mode
))
2759 (setq name
(read-string "List name: "))
2760 (while (string-match "%n" txt
)
2761 (setq txt
(replace-match name t t txt
)))
2762 (or (bolp) (insert "\n"))
2767 (defun org-list-send-list (&optional maybe
)
2768 "Send a transformed version of this list to the receiver position.
2769 With argument MAYBE, fail quietly if no transformation is defined
2773 (unless (org-at-item-p) (error "Not at a list item"))
2775 (re-search-backward "#\\+ORGLST" nil t
)
2776 (unless (looking-at "[ \t]*#\\+ORGLST[: \t][ \t]*SEND[ \t]+\\([^ \t\r\n]+\\)[ \t]+\\([^ \t\r\n]+\\)\\([ \t]+.*\\)?")
2779 (error "Don't know how to transform this list"))))
2780 (let* ((name (match-string 1))
2781 (transform (intern (match-string 2)))
2785 "\\(\\\\end{comment}\\|@end ignore\\|-->\\)" nil t
)
2786 (match-beginning 0)))
2789 (re-search-backward "#\\+ORGLST" nil t
)
2790 (re-search-forward (org-item-beginning-re) bottom-point t
)
2791 (match-beginning 0)))
2792 (list (save-restriction
2793 (narrow-to-region top-point bottom-point
)
2794 (org-list-parse-list)))
2796 (unless (fboundp transform
)
2797 (error "No such transformation function %s" transform
))
2798 (let ((txt (funcall transform list
)))
2799 ;; Find the insertion place
2801 (goto-char (point-min))
2802 (unless (re-search-forward
2803 (concat "BEGIN RECEIVE ORGLST +"
2805 "\\([ \t]\\|$\\)") nil t
)
2806 (error "Don't know where to insert translated list"))
2807 (goto-char (match-beginning 0))
2808 (beginning-of-line 2)
2810 (unless (re-search-forward (concat "END RECEIVE ORGLST +" name
) nil t
)
2811 (error "Cannot find end of insertion region"))
2812 (delete-region beg
(point-at-bol))
2815 (message "List converted and installed at receiver location"))))
2817 (defun org-list-to-generic (list params
)
2818 "Convert a LIST parsed through `org-list-parse-list' to other formats.
2819 Valid parameters PARAMS are:
2821 :ustart String to start an unordered list
2822 :uend String to end an unordered list
2824 :ostart String to start an ordered list
2825 :oend String to end an ordered list
2827 :dstart String to start a descriptive list
2828 :dend String to end a descriptive list
2829 :dtstart String to start a descriptive term
2830 :dtend String to end a descriptive term
2831 :ddstart String to start a description
2832 :ddend String to end a description
2834 :splice When set to t, return only list body lines, don't wrap
2835 them into :[u/o]start and :[u/o]end. Default is nil.
2837 :istart String to start a list item.
2838 :icount String to start an item with a counter.
2839 :iend String to end a list item
2840 :isep String to separate items
2841 :lsep String to separate sublists
2842 :csep String to separate text from a sub-list
2844 :cboff String to insert for an unchecked check-box
2845 :cbon String to insert for a checked check-box
2846 :cbtrans String to insert for a check-box in transitional state
2848 Alternatively, each parameter can also be a form returning
2849 a string. These sexp can use keywords `counter' and `depth',
2850 reprensenting respectively counter associated to the current
2851 item, and depth of the current sub-list, starting at 0.
2852 Obviously, `counter' is only available for parameters applying to
2856 (splicep (plist-get p
:splice
))
2857 (ostart (plist-get p
:ostart
))
2858 (oend (plist-get p
:oend
))
2859 (ustart (plist-get p
:ustart
))
2860 (uend (plist-get p
:uend
))
2861 (dstart (plist-get p
:dstart
))
2862 (dend (plist-get p
:dend
))
2863 (dtstart (plist-get p
:dtstart
))
2864 (dtend (plist-get p
:dtend
))
2865 (ddstart (plist-get p
:ddstart
))
2866 (ddend (plist-get p
:ddend
))
2867 (istart (plist-get p
:istart
))
2868 (icount (plist-get p
:icount
))
2869 (iend (plist-get p
:iend
))
2870 (isep (plist-get p
:isep
))
2871 (lsep (plist-get p
:lsep
))
2872 (csep (plist-get p
:csep
))
2873 (cbon (plist-get p
:cbon
))
2874 (cboff (plist-get p
:cboff
))
2875 (cbtrans (plist-get p
:cbtrans
))
2876 export-sublist
; for byte-compiler
2879 ;; Export an item ITEM of type TYPE, at DEPTH. First
2880 ;; string in item is treated in a special way as it can
2881 ;; bring extra information that needs to be processed.
2882 (lambda (item type depth
)
2883 (let* ((counter (pop item
))
2886 ((eq type
'descriptive
)
2887 ;; Stick DTSTART to ISTART by
2888 ;; left-trimming the latter.
2889 (concat (let ((s (eval istart
)))
2890 (or (and (string-match "[ \t\n\r]+\\'" s
)
2891 (replace-match "" t t s
))
2894 ((and counter
(eq type
'ordered
))
2895 (concat (eval icount
) "%s"))
2896 (t (concat (eval istart
) "%s")))
2899 ;; Replace checkbox if any is found.
2901 ((string-match "\\[CBON\\]" first
)
2902 (setq first
(replace-match cbon t t first
)))
2903 ((string-match "\\[CBOFF\\]" first
)
2904 (setq first
(replace-match cboff t t first
)))
2905 ((string-match "\\[CBTRANS\\]" first
)
2906 (setq first
(replace-match cbtrans t t first
))))
2907 ;; Insert descriptive term if TYPE is `descriptive'.
2908 (when (eq type
'descriptive
)
2909 (let* ((complete (string-match "^\\(.*\\)[ \t]+::" first
))
2912 (org-trim (match-string 1 first
)))
2915 (org-trim (substring first
(match-end 0)))
2917 (setq first
(concat (eval dtstart
) term
(eval dtend
)
2918 (eval ddstart
) desc
))))
2921 (mapconcat (lambda (e)
2923 (funcall export-sublist e
(1+ depth
))))
2924 item
(or (eval csep
) "")))))))
2927 ;; Export sublist SUB at DEPTH.
2929 (let* ((type (car sub
))
2934 (concat (eval ostart
) "%s" (eval oend
)))
2935 ((eq type
'descriptive
)
2936 (concat (eval dstart
) "%s" (eval dend
)))
2937 (t (concat (eval ustart
) "%s" (eval uend
))))
2939 (format fmt
(mapconcat (lambda (e)
2940 (funcall export-item e type depth
))
2941 items
(or (eval isep
) ""))))))))
2942 (concat (funcall export-sublist list
0) "\n")))
2944 (defun org-list-to-latex (list &optional params
)
2945 "Convert LIST into a LaTeX list.
2946 LIST is as returned by `org-list-parse-list'. PARAMS is a property list
2947 with overruling parameters for `org-list-to-generic'."
2948 (org-list-to-generic
2951 '(:splice nil
:ostart
"\\begin{enumerate}\n" :oend
"\\end{enumerate}"
2952 :ustart
"\\begin{itemize}\n" :uend
"\\end{itemize}"
2953 :dstart
"\\begin{description}\n" :dend
"\\end{description}"
2954 :dtstart
"[" :dtend
"] "
2955 :istart
"\\item " :iend
"\n"
2956 :icount
(let ((enum (nth depth
'("i" "ii" "iii" "iv"))))
2958 ;; LaTeX increments counter just before
2959 ;; using it, so set it to the desired
2960 ;; value, minus one.
2961 (format "\\setcounter{enum%s}{%s}\n\\item "
2965 :cbon
"\\texttt{[X]}" :cboff
"\\texttt{[ ]}"
2966 :cbtrans
"$\\boxminus$")
2969 (defun org-list-to-html (list &optional params
)
2970 "Convert LIST into a HTML list.
2971 LIST is as returned by `org-list-parse-list'. PARAMS is a property list
2972 with overruling parameters for `org-list-to-generic'."
2973 (org-list-to-generic
2976 '(:splice nil
:ostart
"<ol>\n" :oend
"\n</ol>"
2977 :ustart
"<ul>\n" :uend
"\n</ul>"
2978 :dstart
"<dl>\n" :dend
"\n</dl>"
2979 :dtstart
"<dt>" :dtend
"</dt>\n"
2980 :ddstart
"<dd>" :ddend
"</dd>"
2981 :istart
"<li>" :iend
"</li>"
2982 :icount
(format "<li value=\"%s\">" counter
)
2983 :isep
"\n" :lsep
"\n" :csep
"\n"
2984 :cbon
"<code>[X]</code>" :cboff
"<code>[ ]</code>"
2985 :cbtrans
"<code>[-]</code>")
2988 (defun org-list-to-texinfo (list &optional params
)
2989 "Convert LIST into a Texinfo list.
2990 LIST is as returned by `org-list-parse-list'. PARAMS is a property list
2991 with overruling parameters for `org-list-to-generic'."
2992 (org-list-to-generic
2995 '(:splice nil
:ostart
"@itemize @minus\n" :oend
"@end itemize"
2996 :ustart
"@enumerate\n" :uend
"@end enumerate"
2997 :dstart
"@table @asis\n" :dend
"@end table"
2998 :dtstart
" " :dtend
"\n"
2999 :istart
"@item\n" :iend
"\n"
3002 :cbon
"@code{[X]}" :cboff
"@code{[ ]}"
3003 :cbtrans
"@code{[-]}")
3006 (defun org-list-to-subtree (list &optional params
)
3007 "Convert LIST into an Org subtree.
3008 LIST is as returned by `org-list-parse-list'. PARAMS is a property list
3009 with overruling parameters for `org-list-to-generic'."
3010 (let* ((rule (cdr (assq 'heading org-blank-before-new-entry
)))
3011 (level (org-reduced-level (or (org-current-level) 0)))
3012 (blankp (or (eq rule t
)
3013 (and (eq rule
'auto
)
3015 (outline-previous-heading)
3016 (org-previous-line-empty-p)))))
3019 ;; Return the string for the heading, depending on depth D
3020 ;; of current sub-list.
3022 (let ((oddeven-level (+ level d
1)))
3023 (concat (make-string (if org-odd-levels-only
3024 (1- (* 2 oddeven-level
))
3028 (org-list-to-generic
3032 :dtstart
" " :dtend
" "
3033 :istart
(funcall get-stars depth
)
3034 :icount
(funcall get-stars depth
)
3035 :isep
(if blankp
"\n\n" "\n")
3036 :csep
(if blankp
"\n\n" "\n")
3037 :cbon
"DONE" :cboff
"TODO" :cbtrans
"TODO")
3042 ;; arch-tag: 73cf50c1-200f-4d1d-8a53-4e842a5b11c8
3043 ;;; org-list.el ends here