- Most of the time,
\tt
/\texttt
instead ofverb!!
- Create macro for common tools
\Javascript
- Section, Table and Figure with a majuscule, (stop forgetting about this)
- an rdf because "an airdieff"
- "semantic" → adjectif, "semantics" → nom (même au singulier)
This file contains 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
// https://github.com/BruJu/PREC/blob/master/prec3/vocabulary-reader.js | |
// Developed for debug purpose | |
function PropertyMapper::printPropertyMapper() { | |
console.error("PropertyMapper {"); | |
console.error(` iri:`); | |
console.error(this.iri); | |
console.error(" description node:"); | |
console.error(this.descriptionNode); | |
console.error(" src:"); |
This file contains 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
const N3 = require('n3'); | |
/** | |
* Return the description of the `term`. | |
* | |
* The description is: | |
* - the term itself if it is not a blank node | |
* - if it is a blank node, a list of every [predicate, object] for which | |
* there exists a (term, predicate, object) quad in the default graph of the | |
* store |
This file contains 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
const assert = require('assert'); | |
const N3 = require('n3'); | |
const namespace = require('@rdfjs/namespace'); | |
const ex = namespace("http://example.org/", N3.DataFactory); | |
const rdf = namespace("http://rdf.org/", N3.DataFactory); | |
describe('N3 Parser', function() { | |
it('should parse nested nested quad', function() { | |
let q = (new N3.Parser()).parse("<< << <sss> <ssp> <sso> >> <sp> <so> >> <p> <o> .")[0]; |
This file contains 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
<http://bruy.at/julian> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://schema.org/Person> . |
This file contains 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
/* | |
The problematic: | |
I want enum dispatch for a trait. | |
I could used | |
https://docs.rs/enum_dispatch/0.3.5/enum_dispatch/ |
This file contains 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
#include "../advent_of_code.hpp" | |
#include "../util/regex_helper.hpp" | |
#include <map> | |
// https://adventofcode.com/2015/day/17 | |
namespace { | |
size_t to(const std::vector<int> & containers, const std::vector<int> & leftovers, int target, size_t i = 0) { | |
// Solution |
In this gist, we explore the possibilites offered by emscripten/embind to implement WasmTree backend. This evaluation is obviously biaised as WasmTree was conceived with wasm-bindgen possibilites and contraints in mind
embind documentation: https://emscripten.org/docs/porting/connecting_cpp_and_javascript/embind.html
- Install emscripten: https://emscripten.org/docs/getting_started/downloads.html
This file contains 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
// https://play.rust-lang.org/ | |
#[derive(Debug)] | |
struct A { | |
x: u32 | |
} | |
fn main() { | |
let x = A { x: 7 }; | |
Context : I had trouble to compare Graphy and WasmTree behaviour on match calls, so I tried to understand how Graphy works.
Graphy semmed like it used some cache or lazy matching, so I did some tests
const graphy_factory = require('@graphy/core.data.factory')
const dataset = require('@graphy/memory.dataset.fast')();