From 2ee59c5fc73349cff1dc8c4bad056ebe09d07233 Mon Sep 17 00:00:00 2001 From: "Yann Esposito (Yogsototh)" Date: Sat, 12 Mar 2022 11:19:58 +0100 Subject: [PATCH] notes/deep_merge_exploration.org --- notes/deep_merge_exploration.org | 14 +++++++++++++- 1 file changed, 13 insertions(+), 1 deletion(-) diff --git a/notes/deep_merge_exploration.org b/notes/deep_merge_exploration.org index f35cf5f0..77ec0e16 100644 --- a/notes/deep_merge_exploration.org +++ b/notes/deep_merge_exploration.org @@ -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