Search Results for "node-red"

...Generics include Ravenscar compatible versions for real-time systems. Also Includes paraffinalia, which is a set of useful generics for parallel quicksort, fast fourier transform, function integration, prefix sum, and Red-Black trees

...Fast & Lean High-performant. Small 8K gzipped runtime with precompiled templates in the browser. Crazy extensible with custom filters and extensions. Everywhere available in node and all modern web browsers, with thorough precompilation options. Nunjucks allows you to port all of your existing templates from a project to something that's easier to manage. By moving your templates to the client, transfer sizes are reduced and page responsiveness increases significantly. Your API supplies data, meaning you can decouple testing the front-end from testing the back-end.

$. What it does? This tool walks down through the source directory tree. Within each directory node, it reads the files. By the file extension, you can specify which kind of the files to be read. While iterating those files, it inserts the comment lines for the copyright notice into each of them. Finally, the new files are written to the corresponding directory node under the destination directory tree. $. Default templates As default, I wrote the templates of the copryright notice of: GNU General Public License version 3 Apache License, Version 2.0 for the files with: .java .xml .sh .txt extensions...

==== Template "Red Grid", HTML5 et CSS3 ==== Version Template: 1.0 Date: Avril 2014 Author: Pascal Gibert Project url: Codage : HTML5, CSS3. Licence CC BY-SA 4.0 : http://creativecommons.org/licenses/by-sa/4.0/ Download: ==== Caractéristiques du template ==== Responsive, pour mobiles et tablettes Format pour tous navigateurs Un bloc introduction Un bloc de cinq sections Un footer Font Awesome Icons : http://fontawesome.io

A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit finds and iteration. Is approx. 50-100% faster than red-black trees and up to 20% faster than O(1) hash tables.

Delphi class incapsulating functionality of Red-black binary search tree