This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| mtron> @dr.chat("""what do you think of the claims and looseends?""") | |
| ┌agent response───────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────┐ | |
| │Honestly? **Really well done.** And I mean that specifically. │ | |
| │ │ | |
| │**The taxonomy is the smartest part.** `decision`, `problem`, `observation`, `solution` — that's not just "here are some notes." It captures *wh |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| mtron> */usr/marko/scratch.==[name=>_,root=>_,command=>_] | |
| ==>[ | |
| name=>'scratch', | |
| root=>mfs:src/test/resources/scratch, | |
| command=>[ | |
| mvn_build=>/m/ide/inst/command/runner?result<=#{?}(to=>#::T), | |
| mvn_clean=>/m/ide/inst/command/runner?result<=#{?}(to=>#::T), | |
| mvn_exec=>/m/ide/inst/command/runner?result<=#{?}(to=>#::T), | |
| code_tree=>inst?#{*}<=#{?}(max=>isa(int::T).else(2)){*max.split(tree_select::[root=>!*/usr/marko/scratch/root,max=>id(),flatten=>true]@scratch_tree)}]] | |
| mtron> */usr/marko/scratch/code/1.as(web:java::T) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| $ bin/drstynx | |
| ______ _______ __ PhaseShift Studio | |
| | _ \ .----. | _ | |_.--.--.-----.--.--. | |
| |. | \| ___| 1___| _| | | |_ _| | |
| |. | |__||__|____ |____|___ |__|__|__.__| | |
| |: 1 / |: 1 | |_____| presents .. | |
| |::.. . / |::.. . | a metatron bomb | |
| `------' `-------' | |
| version 0.1-alpha |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /------------------------\ | |
| \|| Graph Concepts ||/ | |
| /|| by Marko A. Rodriguez ||\ | |
| \------------------------/ | |
| Graph Modeling | |
| Vertex, Edge (w/ properties) | |
| -- simple data model | |
| -- expressive data model |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| static JsonObject toJson(const byte *payload, const uint32_t length) { | |
| char *json = (char *)malloc(length); | |
| memcpy(json, payload, length); | |
| if (json[0] == NULL) { | |
| json = json + 2; | |
| } | |
| json[length - 1] = NULL; | |
| StaticJsonDocument<256> doc; | |
| DeserializationError error = deserializeJson(doc, json); | |
| if (error) { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| mmlang> 5 => int+2-<(nat;nat+10)=(vertex;vertex)=>edge | |
| ==>edge:('outV'->vertex:('id'->nat:7),'inV'->vertex:('id'->nat:17)) | |
| mmlang> int => int+2-<(nat;nat+10)=(vertex;vertex)=>edge | |
| ==>edge<=int[plus,2] | |
| [split,(nat{?}<=int[is,bool<=int[gt,0]];nat{?}<=int[is,bool<=int[gt,0]][plus,10])] | |
| [combine,(vertex;vertex)] | |
| [as,edge<=(vertex;vertex) | |
| [split,('outV'->vertex<=(vertex;vertex)[get,0,_], | |
| 'inV'->vertex<=(vertex;vertex)[get,1,_])]] |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| mmlang> int => vertex | |
| ==>vertex<=int[is,bool<=int[gt,0]] | |
| [coerce,vertex{?}<=nat{?}[split,('id'->nat)]] | |
| mmlang> int => vertex => -<(_;_) | |
| ==>(vertex:('id'->nat);vertex:('id'->nat))<=int[is,bool<=int[gt,0]] | |
| [coerce,vertex{?}<=nat{?}[split,('id'->nat)]] | |
| [split,(vertex:('id'->nat);vertex:('id'->nat))] | |
| mmlang> int => vertex => -<(_;_) => edge |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| mmlang> [1,2,3] // a stream of 3 ints | |
| ==>1 | |
| ==>2 | |
| ==>3 | |
| mmlang> [1,2,3][id] // passing the stream through the [id] instruction (ring *) | |
| ==>1 | |
| ==>2 | |
| ==>3 | |
| mmlang> [1,2,3][[id],[id]] // passing the stream across two branches with [id] instructions (ring +) | |
| ==>1{2} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // all cascading coercion is completely determined within the obj graph and thus, realized as instructions. | |
| mmlang> :[model,digraph] | |
| ==>_ | |
| mmlang> int | |
| ==>int | |
| mmlang> int => nat | |
| ==>nat<=int[is,bool<=int[gt,0]] | |
| mmlang> int => nat => vertex | |
| ==>vertex<=int[is,bool<=int[gt,0]][split,('id'->nat)] | |
| mmlang> int => nat => vertex -<(_;_) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| int => nat[plus,1] => vertex => -<(_;_) => edge | |
| nat <=int[is>0][plus,1] | |
| vertex <=int[is>0][plus,1][split,('id'->nat)] | |
| (vertex;vertex) <=int[is>0][plus,1][split,('id'->nat)][split,(vertex;vertex)] | |
| edge <=int[is>0][plus,1][split,('id'->nat)][split,(vertex;vertex)][combine,[split,('outV'->[get,0],'inV'->[get,1])]] |
NewerOlder