namibj

The graphql_derive.rs example of declarative-dataflow has been broken for a long time, but I was curious and wanted to try it out. After failed bisection attempts, I decided to just look at commit dates and to manually convince cargo to use the code as it was when the example was written.

Below are instructions for building the example. I hope to get an IPFS CID ready soon, which would contain everything needed to build the example, but crates.io and GitHub should suffice for the time being.

mkdir TimelyDataflow
git clone -b graphql_derive_overrides https://github.com/namibj/differential-dataflow TimelyDataflow/differential-dataflow
git clone -b graphql_derive_overrides https://github.com/namibj/timely-dataflow TimelyDataflow/timely-dataflow
mkdir comnik

namibj

namibj

Keybase proof

I hereby claim:

• I am namibj on github.
• I am namibj (https://keybase.io/namibj) on keybase.
• I have a public key ASDJ3ltEeJ0iZIp_21vcdFuFaTO2L2kZKlJ54TVBXEhtPAo

To claim this, I am signing this object:

namibj

UpdateCTestConfiguration  from :/home/namibj/src/obj/DartConfiguration.tcl
UpdateCTestConfiguration  from :/home/namibj/src/obj/DartConfiguration.tcl
Test project /home/namibj/src/obj
Constructing a list of tests
Done constructing a list of tests
Updating test list for fixtures
Added 0 tests to meet fixture requirements
Checking test dependency graph...
Checking test dependency graph end
test 1

namibj

cleanupOldBlock [B
	traverse Roots [x
		if x in B [
			copy x -> nexx
			memWriteOrderingFence
			forward x > newx
		]
	]
	sync invalidate cached pointers
	traverse Roots [x

namibj

#Algorithmische Mathematik ##1. Einführung Algorithmus = endliche Rechenforschrift, die spezifiziert:

• Was wird als Eingabe akzeptiert?
• Welche Rechenschritte werden in welcher Reihenfolge ausgeführt, ggf. in Abhängigkeit von Eingabewerten und Zwischenerebnissen
• Wann stoppt der Algorithmus und was wird dann ausgegeben?

(Formale definitionen, z.B. -Turingmaschine -Progrtammiersprache (z.B. C+++))

namibj

// Originally from: https://www.quora.com/What-is-the-toughest-coding-question-that-you-faced-in-an-interview
//
// You have 4 strings.
// You can rearrange each string in anyway you want and then you are going to construct a trie from these 4 strings.
// What is the minimum possible number of nodes in this trie?
namespace Test
{
    using System;
    using System.Collections.Generic;
    using System.Linq;