comparison lisp/emacs-lisp/ewoc.el @ 70994:d3750d5046d7

(ewoc--node-branch): Merge into unique caller.

70993:320310f2740c

;; "the dll" (or rather the dynamically bound `ewoc--current-dll').

(defvar ewoc--current-dll)

(defstruct (ewoc--node
	    (:type vector)		;required for ewoc--node-branch hack
	    (:constructor ewoc--node-create (start-marker data)))
  left right data start-marker)

(defalias 'ewoc--node-branch 'aref
  "Get the left (CHILD=0) or right (CHILD=1) child of the NODE.

\(fn NODE CHILD)")

(defun ewoc--node-next (node)
  "Return the node after NODE, or nil if NODE is the last node."
  (let ((R (ewoc--node-right node)))
    (unless (eq ewoc--current-dll R) R)))

  "Return the Nth node from the doubly linked list `ewoc--current-dll'.
N counts from zero.  If N is negative, return the -(N+1)th last element.
If N is out of range, return nil.
Thus, (ewoc--node-nth 0) returns the first node,
and (ewoc--node-nth -1) returns the last node."
  ;; Branch 0 ("follow left pointer") is used when n is negative.
  ;; Branch 1 ("follow right pointer") is used otherwise.
  (let* ((branch (if (< n 0) 0 1))
	 (node   (ewoc--node-branch ewoc--current-dll branch)))
    (if (< n 0) (setq n (- -1 n)))
    (while (and (not (eq ewoc--current-dll node)) (> n 0))
      (setq node (ewoc--node-branch node branch))
      (setq n (1- n)))
    (unless (eq ewoc--current-dll node) node)))

(defun ewoc-location (node)
  "Return the start location of NODE."

70994:d3750d5046d7

;; "the dll" (or rather the dynamically bound `ewoc--current-dll').

(defvar ewoc--current-dll)

(defstruct (ewoc--node
	    (:type vector)		;ewoc--node-nth needs this
	    (:constructor ewoc--node-create (start-marker data)))
  left right data start-marker)

(defun ewoc--node-next (node)
  "Return the node after NODE, or nil if NODE is the last node."
  (let ((R (ewoc--node-right node)))
    (unless (eq ewoc--current-dll R) R)))

  "Return the Nth node from the doubly linked list `ewoc--current-dll'.
N counts from zero.  If N is negative, return the -(N+1)th last element.
If N is out of range, return nil.
Thus, (ewoc--node-nth 0) returns the first node,
and (ewoc--node-nth -1) returns the last node."
  ;; Presuming a node is ":type vector", starting with `left' and `right':
  ;; Branch 0 ("follow left pointer") is used when n is negative.
  ;; Branch 1 ("follow right pointer") is used otherwise.
  (let* ((branch (if (< n 0) 0 1))
	 (node   (aref ewoc--current-dll branch)))
    (if (< n 0) (setq n (- -1 n)))
    (while (and (not (eq ewoc--current-dll node)) (> n 0))
      (setq node (aref node branch))
      (setq n (1- n)))
    (unless (eq ewoc--current-dll node) node)))

(defun ewoc-location (node)
  "Return the start location of NODE."