Logo
Explore Help
Sign In
Experiments/libabacus
1
0
Fork 0
You've already forked libabacus
Code Issues 4 Pull Requests Releases Wiki Activity
Files
1960ded07071c037bb894aed34bc664eee572183
libabacus/src
History
Danila Fedorin 1960ded070 Add initial implementation of a reference counting trie.
2018-04-06 23:55:56 -07:00
..
debug.c
Make distinction between prefix and postfix unary operators in trees.
2018-03-17 18:25:23 -07:00
lexer.c
Replace C++-style comments with C90 compatible ones.
2018-03-18 19:21:09 -07:00
libabacus.c
Make a single "operator" token, and specialize after parse.
2018-03-17 20:56:25 -07:00
main.c
Create main source file.
2018-02-03 23:49:52 -08:00
parser.c
Check for NULL where tree can be NULL.
2018-03-18 23:42:49 -07:00
parsetype.c
Add a parse type struct, used to hold type data as it is parsed.
2018-03-06 16:45:43 -08:00
ref_trie.c
Add initial implementation of a reference counting trie.
2018-04-06 23:55:56 -07:00
ref_vec.c
Add a vector of reference counted values.
2018-03-31 22:18:36 -07:00
refcount.c
Add a null reference that doesn't call malloc.
2018-04-06 23:53:40 -07:00
reserved.c
Register reserved operators as tokens.
2018-03-16 23:09:11 -07:00
table.c
Switch the table to using tries.
2018-03-24 20:47:34 -07:00
tree.c
Add a function to check if a tree node has a scope.
2018-03-24 00:36:10 -07:00
trie.c
Implement foreach for the trie.
2018-03-24 20:40:42 -07:00
util.c
Add utility functions for copying strings.
2018-03-06 16:45:55 -08:00
Powered by Gitea Version: 1.25.2 Page: 160ms Template: 14ms
English
Bahasa Indonesia Deutsch English Español Français Gaeilge Italiano Latviešu Magyar nyelv Nederlands Polski Português de Portugal Português do Brasil Suomi Svenska Türkçe Čeština Ελληνικά Български Русский Українська فارسی മലയാളം 日本語 简体中文 繁體中文(台灣) 繁體中文(香港) 한국어
Licenses API