summaryrefslogtreecommitdiffstats
path: root/lib.h
diff options
context:
space:
mode:
authorKaz Kylheku <kaz@kylheku.com>2019-09-22 16:11:33 -0700
committerKaz Kylheku <kaz@kylheku.com>2019-09-22 16:11:33 -0700
commit6d7ae0d677f9c507d15af86cf51f365d6248401d (patch)
tree9ebcd11271eb7863f059d5822d576d48e1efb0ff /lib.h
parent63feff9c54a81056c7f5cf82792602aaee199ced (diff)
downloadtxr-6d7ae0d677f9c507d15af86cf51f365d6248401d.tar.gz
txr-6d7ae0d677f9c507d15af86cf51f365d6248401d.tar.bz2
txr-6d7ae0d677f9c507d15af86cf51f365d6248401d.zip
New data type: tnode.
Binary search tree nodes are being added as a basic heap data type. The C type tag is TNOD, and the Lisp type is tnode. Binary search tree nodes have three elements: a key, a left child and a right child. The printed notation is #N(key left right). Quasiquoting is supported: ^#N(,foo ,bar) but not splicing. Because tnodes have three elements, they they fit into TXR's four-word heap cell, not requiring any additional memory allocation. These nodes are going to be the basis for a binary search tree container, which will use the scapegoat tree algorithm for maintaining balance. * tree.c, tree.h: New files. * Makefile (OBJS): Adding tree.o. * eval.c (expand_qquote_rec): Recurse through tnode cells, so unquotes work inside #N syntax. * gc.c (finalize): Add TNOD to no-op case in switch; tnodes don't require finalization. (mark_obj): Traverse tnode cell. * hash.c (equal_hash): Add TNOD case. * lib.c (tnode_s): New symbol variable. (seq_kind_tab): New entry for TNOD, mapping to SEQ_NOTSEQ. (code2type, equal): Handle TNOD. (obj_init): Initialize tnode_s variable. (obj_print_impl, populate_obj_hash): Handle TNOD. (init): Call tree_init function in tree.c. * lib.h (enum type, type_t): New enumeration TNOD. (struct tnod): New struct type. (union obj, obj_t): New union member tn of type struct tnod. (tnode_s): Declard. * parserc.c (circ_backpatch): Handle TNOD, so circular notation works through tnode cells. * parser.l (grammar): Recognize #N prefix, mapping to HASH_N token. * parser.y (HASH_N): New grammar terminal symbol. (tnode): New nonterminal symbol. (i_expr, n_expr): Add tnode cases to productions. (yybadtoken): Map HASH_N to "#N" string.
Diffstat (limited to 'lib.h')
-rw-r--r--lib.h11
1 files changed, 9 insertions, 2 deletions
diff --git a/lib.h b/lib.h
index 9368cb08..e47b84c6 100644
--- a/lib.h
+++ b/lib.h
@@ -67,7 +67,7 @@ typedef double_uintptr_t dbl_ucnum;
typedef enum type {
NIL = TAG_PTR, NUM = TAG_NUM, CHR = TAG_CHR, LIT = TAG_LIT, CONS,
STR, SYM, PKG, FUN, VEC, LCONS, LSTR, COBJ, CPTR, ENV,
- BGNUM, FLNUM, RNG, BUF, MAXTYPE = BUF
+ BGNUM, FLNUM, RNG, BUF, TNOD, MAXTYPE = TNOD
/* If extending, check TYPE_SHIFT and all ocurrences of MAX_TYPE */
} type_t;
@@ -300,6 +300,12 @@ struct buf {
val size;
};
+struct tnod {
+ obj_common;
+ val left, right;
+ val key;
+};
+
union obj {
struct any t;
struct cons c;
@@ -317,6 +323,7 @@ union obj {
struct flonum fl;
struct range rn;
struct buf b;
+ struct tnod tn;
};
#if CONFIG_GEN_GC
@@ -476,7 +483,7 @@ extern val null_s, t, cons_s, str_s, chr_s, fixnum_sl;
extern val sym_s, pkg_s, fun_s, vec_s;
extern val stream_s, hash_s, hash_iter_s, lcons_s, lstr_s, cobj_s, cptr_s;
extern val atom_s, integer_s, number_s, sequence_s, string_s;
-extern val env_s, bignum_s, float_s, range_s, rcons_s, buf_s;
+extern val env_s, bignum_s, float_s, range_s, rcons_s, buf_s, tnode_s;
extern val var_s, expr_s, regex_s, chset_s, set_s, cset_s, wild_s, oneplus_s;
extern val nongreedy_s;
extern val quote_s, qquote_s, unquote_s, splice_s;