08:15 <beneroth> Good morning

08:16 <beneroth> Regenaxer, another detail to the bidi story: vim uses them for rendering, apparently

08:16 <Regenaxer> Good morning beneroth!

08:16 <beneroth> so you can state "ignoring bidi" as vip advantage over vim :P

08:16 <Regenaxer> hehe, indeed

08:44 <razzy> Good morning i wish to all! :]

08:46 <Regenaxer> Good morning razzy!

10:00 <razzy> I want to have simple graph database. my idea is to have list of symbols, each symbol represents node. I put edges of graph into properties. Question: is it bad idea? Question: can I easily put many symbols with many properties into picolisp database?

10:21 <razzy> propably solved, i will just work with symbols in DB.

10:49 <razzy> hmm, pilDB is not so easy.

11:13 <razzy> I do not understand why i cannot access symbol {5} directly.

11:14 <razzy> any external symbol {} directly

11:15 <Regenaxer> hmm, have you read the docs and/or tutorials?

11:15 <razzy> yes, i did not understand explanation

11:16 <Regenaxer> The easiest is to create an E/R model

11:17 <Regenaxer> if not, you can 'put' as many properties as you like

11:17 <Regenaxer> (put '{7} 'link1 '{A32})

11:17 <Regenaxer> that's the hard way ;)

11:19 <razzy> I will say it another way, as i uderstand it, when acessing external {} directly, i face performance loss, no data corruption, yes?

11:20 <Regenaxer> No performance loss

11:20 <Regenaxer> accessing directly is faster

11:20 <Regenaxer> compared to via an index

11:20 <Regenaxer> But it is easier to corrupt your data

11:21 <Regenaxer> E/R takes care of all the relations between objects

11:23 <razzy> I will build my own simple E/R. than propably switch to pil E/R :]

11:25 <Regenaxer> Perfect

11:25 <razzy> Regenaxer: also, i think i need one root {1}, and many (put *DB (new T) 'Symbol)

11:26 <Regenaxer> yes, that's a good start

11:26 <Regenaxer> What kind of graph do you build?

11:29 <razzy> maybe it is called double-edge.

11:32 <razzy> connection both ways.

11:44 <beneroth> +Joint

11:45 <beneroth> I would really recommend you to work with the existing pilDB top-layer ;)

11:45 <beneroth> pilDB is a graph database

11:47 <beneroth> maybe this other way of working/learning works for you... but well possible that you chose to walk a harder route than necessary

11:49 <Regenaxer> yeah, the hard way, but didactically optimal ;)

11:59 <razzy> I will propably make switch to pil E/R in future. I also want to program in pil :]

12:52 <razzy> hmm, how can i easily build and remove +Joint between two external symbols? can i have fast search for connections?

12:52 <Regenaxer> (put> ...)

12:53 <Regenaxer> Efficient search is only via index trees

12:54 <Regenaxer> nothing to do with +Joint

12:54 <Regenaxer> +Joint does not need an index, it is direct

12:58 <razzy> Thank you.

13:19 <beneroth> "pure" graph databases have no indexes, which makes them practically useless for most stuff besides path search stuff

13:19 <beneroth> bbl