93 karma · joined February 20, 2007
When using unsigned ints for backward iteration, I'm partial to looping as:
for (i = size - 1; i < size; i--) {
...
}
- it's content addresses / merkle DAG all the way down. The commit's hash is something like meta (author, description, timestamp) + parents hash + root value hash. The root value is composed of the schema, and pointers to table and index maps. Tables and indexes are merkle DAGs of the table data organized in a structure a bit like a B-tree, but with cut points chosen by a rolling value hash in order to probabilistically re-synchronize on incremental changes. Some details: https://www.dolthub.com/blog/2020-04-01-how-dolt-stores-tabl... , https://www.dolthub.com/blog/2020-05-13-dolt-commit-graph-an...
- currently table data is stored row major for full rows of the table and so diffing cannot efficiently ignore individual columns.
- direct conflicts are computed on a row-by-row basis, using the primary key of the row. And then constraints and foreign key references are maintained and validated across merges and edits.
HTH, happy to answer any further questions :).
https://github.com/golang/go/blob/master/src/context/context...
So in this case, errgroup probably doesn't have a choice and needs to call cancel() at some point.
Transliteration:
karmaṇy-evādhikāras te mā phaleṣhu kadāchana
You can read more here: https://www.holy-bhagavad-gita.org/chapter/2/verse/47
It's quite rushed and somewhat flat at parts. Some of the abridged recordings I've listened to do more justice to the excerpts they've chosen. But it's a heroic effort none the less. For me, it made the full Wake accessible and alive in a way that made me really enjoy spending time with it.