walk a tree and return something, like Array.prototype.map.
Walk any kind of tree structure depth- or breadth-first. Supports promises and advanced map-reduce operations with a very small API.
TypeScript definitions for ms
Rope-based persistent sequence type
Interval search tree with TypeScript support
TypeScript definitions for deep-eql
No description provided.
htmlparser2 tree adapter for parse5.
TypeScript definitions for is-glob
Gonzales Preprocessor Edition (fast CSS parser)
TypeScript definitions for async-retry
JavaScript parser, mangler/compressor and beautifier toolkit
Binary Search Trees
Language service for HTML
Codecs for strings of different sizes and encodings
Declarative portals for React
walk paths fast and efficiently
HTML/XML processor
OS utilities.
unist utility to visit nodes
Access to and manipulation of core WordPress entities.
mdast utility to serialize markdown
TypeScript definitions for shell-quote
mdast extension to parse and serialize GFM task list items
The RKelly library will parse JavaScript and return a parse tree.
This library allows you to input a tree structure (node with children), a context, and comparators then outputs you the matching tree structure.
The RKelly library will parse JavaScript and return a parse tree.
The RKelly library will parse JavaScript and return a parse tree.
The RBelly library will parse JavaScript and Bellejs and return a parse tree.
This is a Ruby library that allows you to get a tree from a remote location over sftp. When the resulting hash is serialized into JSON it uses the JSTree syntax.
Line-tree parses indented lines of text and returns an array representing a tree structure.
The RKelly library will parse JavaScript and return a parse tree.
Print TracePoint(:b_call, :b_return, :c_call, :c_return, :call, :return, :class, :end, :thread_begin, :thread_end) in tree view, to console or html
The RKelly library will parse JavaScript and return a parse tree, fixed to support ruby 1.9.3
ParseTree is a C extension (using RubyInline) that extracts the parse tree for an entire class or a specific method and returns it as a s-expression (aka sexp) using ruby's arrays, strings, symbols, and integers. As an example: def conditional1(arg1) if arg1 == 0 then return 1 end return 0 end becomes: [:defn, :conditional1, [:scope, [:block, [:args, :arg1], [:if, [:call, [:lvar, :arg1], :==, [:array, [:lit, 0]]], [:return, [:lit, 1]], nil], [:return, [:lit, 0]]]]]
Ruby implementation of JsonLogic. JsonLogic rules are JSON trees. The engine walks that tree and returns a Ruby value. Full compliance with both core and community-extended specifications.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.