xeals/origami.el
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

modified python-parser code for building multi level fold tree.

Browse Source
This commit is contained in:
changrunqing 2018-01-24 11:39:29 +08:00
parent 1f38085c8f
commit a3b8bac563
1 changed files with 15 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

29
origami-parsers.el
View File

@ -192,20 +192,21 @@ position in the CONTENT."
(with-temp-buffer
(insert content)
(python-mode)
(goto-char (point-min))
(beginning-of-defun -1)
(let (beg (end (point-max)) offset acc)
(while (not (= (point) end))
(setq beg (point))
(search-forward-regexp ":" nil t)
(setq offset (- (point) beg))
(end-of-defun)
(backward-char)
(setq end (point))
(when (> offset 0)
(setq acc (cons (funcall create beg end offset nil) acc)))
(beginning-of-defun -1))
(reverse acc)))))
(defun python-subparser (beg end)
"find all fold block between beg and end."
(goto-char beg)
(let (acc)
;; iterate all same level children.
(while (and (beginning-of-defun -1) (<= (point) end)) ;; have children between beg and end?
(let* ((new-beg (point))
(new-offset (progn (search-forward-regexp ":" nil t) (- (point) new-beg)))
(new-end (progn (end-of-defun) (point))))
(setq acc (cons (funcall create new-beg new-end new-offset
(python-subparser new-beg new-end))
acc))
(goto-char new-end)))
acc))
(python-subparser (point-min) (point-max)))))
(defun origami-lisp-parser (create regex)
(lambda (content)