firstfleetinc/brunch

Matches strings against configurable strings, globs, regular expressions, and/or functions

Minimal and efficient cross-platform file watching library

the complete solution for node.js command-line programs

Lightweight debugging utility for Node.js and the browser

Provides metadata and conversions from repository urls for GitHub, Bitbucket and GitLab

Asynchronous recursive file copy utility.

Normalizes Git URLs. For npm, but you can use it too.

Generates and consumes source maps

BDD/TDD assertion library for node.js and the browser. Test framework agnostic.

fs-extra contains methods that aren't included in the vanilla Node.js fs package. Such as recursive mkdir, copy, and remove.

simple, flexible, fun test framework

Easy dependency injection for node.js unit testing

A simple and pragmatic library for testing Node.js console output.

A registry of Brunch skeletons

Extract nodejs dependencies to browser.

Check if node_modules match package.json versions. npm / yarn install shortcut.

Dead-simple colored logger for stdout.

Sorting and matching utility using configurable string, glob, regular expression, and/or function matchers

Simple common.js `require()` definition.

Standartized fs.readFile caching mechanism for incremental build systems.

Convert objects into directory structures and back again

Get time passed since node.js app start. Similar to performance.now() from browsers.

Cross-platform universal node.js `path` module replacement that works better with Windows.

An object structure and type validation library

Yotzandre

Mathematical expressions can be understood and represented as a tree con-sisting of functions (non-leaf nodes) and their arguments (child nodes of function nodes). Such expression trees are an important concept to store and process mathematical expressions as well as the most frequently used visual-ization of the structure of mathematical expressions. Typically, researchers visualize expression trees using general purpose tools that are not optimized for mathematics. This approach is laborious, redundant if mathematical ex-pressions are available in a structured markup, such as MathML, and error-prone, since the visualization represents a researcher’s notion of what the markup of an expression should be, but not necessarily what the actual markup is. In this paper, we present VET – a tool to automatically visualize mathematical expression trees from parallel MathML. Additionally, we pre-sent a demo application to convert LaTeX input to parallel MathML, which is then visualized using VET. By visualizing the actual markup of mathematical expressions, VET enables content providers to quickly spot problems in the content MathML markup that do not affect the presentation of the expres-sion. Identifying such discrepancies previously required reading the verbose and complex parallel MathML markup. VET also allows to visualize similar and identical elements of two expressions using arbitrary similarity measures. Visualizing expression similarity shall support developers in designing re-trieval approaches and enable improved interaction concepts for users of mathematical information retrieval systems. The similarity visualization al-lows designers and users of such systems to inspect the reasoning of a simi-larity measure, rather than exclusively being provided with a scalar similarity score as is the case for most current retrieval systems.

Adds Compass support to brunch.

Dev dependency stack with Brunch supporting LESS and TypeScript.

Grunt Brunch wrapper

The little DI module that could.

yet another js-based full-stack framework

Adds JSON minification support to brunch.

Adds Compass support to brunch.

Mod loader for the Vivaldi browser