7 #define HTHistory_record HTHiReco
8 #define HTHistory_backtrack HTHiBack
9 #define HTHistory_canBacktrack HTHiCaBa
10 #define HTHistory_moveBy HTHiMoBy
11 #define HTHistory_canMoveBy HTHiCaMo
12 #define HTHistory_read HTHiRead
13 #define HTHistory_recall HTHiReca
14 #define HTHistory_count HTHiCoun
15 #define HTHistory_leavingFrom HTHiLeFr
22 /* Record the jump to an anchor
23 ** ----------------------------
26 extern void HTHistory_record
28 (HTAnchor * destination)
31 /* Go back in history (find the last visited node)
35 extern HTAnchor * HTHistory_backtrack
36 NOPARAMS; /* FIXME: Should we add a `sticky' option ? */
38 extern BOOL HTHistory_canBacktrack
41 /* Browse through references in the same parent node
42 ** -------------------------------------------------
44 ** Take the n-th child's link after or before the one we took to get here.
45 ** Positive offset means go towards most recently added children.
48 extern HTAnchor * HTHistory_moveBy
53 extern BOOL HTHistory_canMoveBy
58 #define HTHistory_next (HTHistory_moveBy (+1))
59 #define HTHistory_canNext (HTHistory_canMoveBy (+1))
60 #define HTHistory_previous (HTHistory_moveBy (-1))
61 #define HTHistory_canPrevious (HTHistory_canMoveBy (-1))
68 /* Read numbered visited anchor (1 is the oldest)
69 ** ----------------------------
72 extern HTAnchor * HTHistory_read
77 /* Recall numbered visited anchor (1 is the oldest)
78 ** ------------------------------
79 ** This reads the anchor and stores it again in the list, except if last.
82 extern HTAnchor * HTHistory_recall
87 /* Number of Anchors stored
88 ** ------------------------
90 ** This is needed in order to check the validity of certain commands
92 (not needed for now. Use canBacktrack, etc.)
93 extern int HTHistory_count NOPARAMS;
96 /* Change last history entry
97 ** -------------------------
99 ** Sometimes we load a node by one anchor but leave by a different
100 ** one, and it is the one we left from which we want to remember.
102 extern void HTHistory_leavingFrom
107 #endif /* HTHISTORY_H */