It's heavily optimised for minimal memory use, over speed, because Red doesn't have garbage collection yet.
I haven't implemented string escaping yet.
You can use JSON for example to communicate with a Fossil server, in combination with the cURL binding.
Maxim
Announcing Stone DB, a New commercial project I am currently starting design and implementation on, it is partially funded.
Stone will be an "enterprise level" node/graph DB. Coded in C (no C++), it is currently planned to become Open-source within a short timeframe.
much more is detailed in my initial project draft, some surprising capabilities, but I wanted to keep the list here short, just to give the main idea.
Some of the end GOALS are: ---------------------------------------- -Eventual native Integration in Rebol 3 ( & Red? ), much like Neo4j is integrated to java (as are most other graph DBs).
-terra/petabyte level capacity (if you have access to a filesystem with such a capacity. SAN or RAID array for example).
-100 billion nodes, 1 trillion associations are minimums I want to reach, even possible with 32 bit executables which typically use half the RAM.
-unique directional, associative and "qualified node" querying system, allows you to probe the db across all datasets, without using any pre-determined records.
-windows / linux compatible as initial targets.
If you are : -------------- - interested in helping write code, - interested in knowing more about Stone's planned technology and featureset - currently using some node DB, - would be happy to test (even just , hey it started ;-) - support the DB via funding - put time on documentation - writing generic clients (web client like neo4j would be nice) ...
once it starts being useful outside of my initial, pretty raw prototype phase, please let me know and I'll put you in a list of people to reach out at opportunate points in the Stone DB development.
obviously, I'll hapilly chat here if any of you have questions.
(here in altme, but in the ann-Reply group ;)
Kaj
I implemented SINGLE? and OFFSET? for Red in common.red:
I've also started collecting commonly used PARSE rules in there, so far for string parsing:
whitespace digit non-zero ("1" - "9")
AdrianS
Kaj, for offset? should the function not test that the series passed in refer to the same undelying series (but a different position)? I see that Rebol doesn't do this check either, but wouldn't it make sense to do so? What is the point of comparing positions in different underlying series?
Gregg
My implementation of OFFSET? in Red is exactly the same as Kaj's. I didn't thinl about adding that check either, but I think I have used it on different series at least once in the past, tracking progress in two different queues.
Kaj
By request, I added a /deep refinement on my JSON emitter for emitting nested blocks as objects. The /map refinement now only works on even sized blocks, instead of considering odd sized blocks an error:
The JSON loader now supports string escaping, except Unicode escapes, which are implemented but are waiting for Red's LOAD to support char! syntax with parens: #"^(0000)"
The Unicode escapes \u aren't really implemented yet: they always output NULL, but they're only needed for obscure control characters.
Kaj
To simplify the TNetStrings and JSON converters for Red, I implemented found?, any-word!, any-word?, series?, any-string!, any-string?, any-block! and any-block? in common.red: