coi ro do mi’e la saski’o tu’a dei cu ve ciksi tu’a lo me mi moi jbobau
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
| Unicode table - List of most common Unicode characters * | |
| * This summary list contains about 2000 characters for most common ocidental/latin languages and most printable symbols but not chinese, japanese, arab, archaic and some unprintable. | |
| Contains character codes in HEX (hexadecimal), decimal number, name/description and corresponding printable symbol. | |
| What is Unicode? | |
| Unicode is a standard created to define letters of all languages and characters such as punctuation and technical symbols. Today, UNICODE (UTF-8) is the most used character set encoding (used by almost 70% of websites, in 2013). The second most used character set is ISO-8859-1 (about 20% of websites), but this old encoding format is being replaced by Unicode. | |
| How to identify the Unicode number for a character? | |
| Type or paste a character: |
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
| // A nano dependent type-checker featuring inductive types via self encodings. | |
| // All computation rules are justified by interaction combinator semantics, | |
| // resulting in major simplifications and improvements over old Kind-Core. | |
| // A more complete file, including superpositions (for optimal unification) | |
| // is available on the Interaction-Type-Theory repository. | |
| // Credits also to Franchu and T6 for insights. | |
| // This is a new development, may have bugs (: | |
| // Lists | |
| type List<A> = |
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
| var soundex = function (s) { | |
| var a = s.toLowerCase().split(''), | |
| f = a.shift(), | |
| r = '', | |
| codes = { | |
| a: '', e: '', i: '', o: '', u: '', | |
| b: 1, f: 1, p: 1, v: 1, | |
| c: 2, g: 2, j: 2, k: 2, q: 2, s: 2, x: 2, z: 2, | |
| d: 3, t: 3, | |
| l: 4, |
This is a brief introduction to Lojban, a constructed human language. It has a very nice, fun, regular grammar that computers and humans alike can understand easily.
All Lojban words are either particles (tiny words that help the grammar) or verbs (which tell us how nouns relate).
A Lojban sentence consists of a main verb with a bunch of nouns plugged into it.
A Lojban verb definition looks like this:
Translated to Markdown from this ancient TeX file. I’m not sure who made the original.
Hover over a link to see the place structure. Click it to view gismu info on Wiktionary.
girzu(group)
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
| function Vertex(name) { | |
| this.name = name; | |
| this.index = null; | |
| this.lowlink = null; | |
| this.onStack = false; | |
| this.children = []; | |
| } | |
| function TarjanRunner() { |
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
| def deBruijn(n, k): | |
| ''' | |
| An implementation of the FKM algorithm for generating the de Bruijn | |
| sequence containing all k-ary strings of length n, as described in | |
| "Combinatorial Generation" by Frank Ruskey. | |
| ''' | |
| a = [ 0 ] * (n + 1) | |
| def gen(t, p): |
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
| /** By_Sean_Eron_Anderson [email protected] */ | |
| #include <stdbool.h> | |
| #include <stdint.h> | |
| #include <endian.h> | |
| #define CHAR_BIT 8 | |
| void Compute_the_sign_of_an_integer() { | |
| /*Compute the sign of an integer*/ |
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
| const logicGates = { | |
| nand (a, b) { return !(a && b); }, | |
| not (a) { return this.nand (a, a); }, | |
| and (a, b) { return this.not (this.nand (a, b)); }, | |
| or (a, b) { return this.nand (this.not (a), this.not(b)); }, | |
| nor (a, b) { return this.not (this.or (a, b)); }, | |
| xor (a, b) { return this.and (this.nand (a, b), this.or(a, b)); }, | |
| xnor (a, b) { return this.not (this.xor (a, b)); } | |
| }; |
NewerOlder