FremyCompany

// once in the headers
defineMetaEvent('Namespace','Click');

// then when you need it
document.body.onNamespaceClick.add(function(e) { /*...*/ });
document.body.onNamespaceClick.clear();

FremyCompany

<main>
	some main content here
	<section style="position: not-relative; width: 100px; height: 100px; background: blue; color: white; overflow: hidden;">
		some section content here
		<aside style="position: absolute; top: 5px; left: 50px; background: red; -ms-wrap-flow: both">
			some aside content here
		</aside>
	</section>
</main>

FremyCompany

At the time of writing, the input devices landscape is fragmented, very fragmented. Beside a few common concepts inherited from the very first input devices (mouses and keyboards), it's impossible to get out of input devices the raw input they collect and make something useful out of it.

Inspirations

The aim of this proposal is to philosophically draw from the Pointer Events specification and unify a large range of input devices by providing a new set of fundamental concepts

FremyCompany

//
// HELPER
//
var MetadataHolder = function() {
  var map = new WeakMap();
  var get = function(obj) {
    return map.get(obj)
  }
  get.init = function(obj, val) {
    map.set(obj, val);

FremyCompany

Spoiler pages for the FindNearbyWords challenge

The goal of the exercise is to find an efficient way to take an existing word and lookup all words in a dictionary that differ from the original by only a single character. This is the kernel function for larger algorithmic problems like the Word Ladder, where you try to find the shortest route between two words, by changing one character at a time, and where each intermediate step must be in an intial dictionary of words.

Bruce Force

The simplest algorithm possible will take the input word and then compare it against every word in the dictionary, character by character, and count the differences. If the character differences between the word are just 1, then we add it to our list, otherwise we reject it. JavaScript has the Array.filter method which does precisely what we want and we just supply a function which returns true or false depending on if our criterion are met.

It is possible to optimize differsByOne further to get more benefits, but given t

FremyCompany

This algorithm collects the words of a dictionary identical to a given words, one letter excepted.

To achieve a faster speed, the dictionnary is transformed into a tree of nodes containing the words letter by letter, as such:

{
  "a": {
    "b": {
      "c": {
 "d": {

FremyCompany

const element = dom.div.id("main-content").role("main")`
  Hello, my name is ${html.a.href('//jakearchibald.com')`Jake Archibald`}.
  I like: 
  ${dom.ul`
    ${dom.li`The web`}
    ${dom.li`Food`}
    ${dom.li`…actually that's it`}
  `}
`;

FremyCompany

//
// TEST EVERY TWO-CHAR TO-LOWER/TO-UPPER COMBINATION
//

var arr = []; for(var i = 0; i<=256; i++) { for(var j = 0; j<=256; j++) { var str = String.fromCharCode(i)+String.fromCharCode(j); arr.push(str+str.toLowerCase()+str.toUpperCase()) } };
var resultArr = [ "\u0000\u0000\u0000\u0000\u0000\u0000", "\u0000\u0001\u0000\u0001\u0000\u0001", "\u0000\u0002\u0000\u0002\u0000\u0002", "\u0000\u0003\u0000\u0003\u0000\u0003", "\u0000\u0004\u0000\u0004\u0000\u0004", "\u0000\u0005\u0000\u0005\u0000\u0005", "\u0000\u0006\u0000\u0006\u0000\u0006", "\u0000\u0007\u0000\u0007\u0000\u0007", "\u0000\b\u0000\b\u0000\b", "\u0000\t\u0000\t\u0000\t", "\u0000\n\u0000\n\u0000\n", "\u0000\u000b\u0000\u000b\u0000\u000b", "\u0000\f\u0000\f\u0000\f", "\u0000\r\u0000\r\u0000\r", "\u0000\u000e\u0000\u000e\u0000\u000e", "\u0000\u000f\u0000\u000f\u0000\u000f", "\u0000\u0010\u0000\u0010\u0000\u0010", "\u0000\u0011\u0000\u0011\u0000\u0011", "\u0000\u0012\u0000\u0012\u0000\u0012", "\u0000\u0013\u0000\u0013\u0000\u0013", "\u0000\u0014\u0000\

FremyCompany

Computing the table height

The height of a table is the largest of:

• The specified height of the table (percentages are resolved against ancestors as usual)
• The height required for the rows and the vertical border-spacings. For each row, the largest of:
• The row’s specified height if it is defined in non-percentages units (0 otherwise)
  • Also the eventual rowgroup specified size, using the usual splitting among tracks
• The height deemed necessary to render all its cells when running the same algorithm that is being used to compute a column min-width, where the min-height of a cell is the largest of:
  • The cell’s specified height if it is defined in non-percentages units (0 otherwise)
  • The height of the cell border and padding plus the scrollHeight of its content layouted as if:
• the cell height was set to 0px and overflow was set to hidden,

FremyCompany

declare var Map: { new(): Map<any,any> };
interface Map<IndexType, ValueType> {
    get(index:IndexType): ValueType,
    set(index:IndexType, value:ValueType)
}

declare var MappingSystem: MappingSystemConstructor;
interface MappingSystemConstructor {
    new(): MappingSystem<any,any,any,any>
    NodeMappingSystem: NodeMappingSystemConstructor