yogsototh/deft
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

notes/deep_merge_exploration.org

Browse source
This commit is contained in:
Yann Esposito (Yogsototh) 2022-03-12 11:19:58 +01:00
parent b6c5e72715
commit 2ee59c5fc7
Signed by untrusted user who does not match committer: yogsototh
GPG key ID: 7B19A4C650D59646
1 changed files with 13 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

14
notes/deep_merge_exploration.org
View file

@ -12,4 +12,16 @@ Depending on the programming language you use, you have a different set of
root structures.
But in most languages you have roughly the same concepts.
First
Base types, like chars, numbers, often strings
Storage types, typically, arrays, list, associative array (map, hash-map).
So let's restrict ourselves to this common denominator of data structure.
Say, base types could be: char, number, string
Construction types could be map (associative array) or arrays.
Sounds simple enough.
So a common task is to "merge" such structure.
In Haskell this kind of operation would be repugnant for most programmer.
But, even in Haskell this could be useful.
So