Search Results for "squid-graph"

...Dependency injection tools like Wire aim to simplify the management of initialization code. You describe your services and their dependencies, either as code or as configuration, then Wire processes the resulting graph to figure out ordering and how to pass each service what it needs.

...Binaryen has a simple C API in a single header, and can also be used from JavaScript. It accepts input in WebAssembly-like form but also accepts a general control flow graph for compilers that prefer that. Binaryen's internal IR uses compact data structures and is designed for completely parallel codegen and optimization, using all available CPU cores. Binaryen's IR also compiles down to WebAssembly extremely easily and quickly because it is essentially a subset of WebAssembly. Binaryen's optimizer has many passes (see an overview later down) that can improve code size and speed. ...

...Сurrent version ( v. 9.1.1.395B): Examples for Delphi, Lazarus , GCC (Codeblock), MSVC. Demo: Fractals Julia; Visualizing of functions of complex variable - complex domain coloring , graph plotting & finding roots F(x), Fourier series. Old version (v.8.4.17.250): Examples for Delphi, FPC, Builder, MSVC , GCC (Codeblock) , VB6, FreeBasic. Download files: Foreval_all.7z (Foreval v9 + Foreval v8 + ForevalZ + all examples + doc) - recommend ForevalG9.7z (Foreval v9 + examples v9+ doc) (math parser, math expression parser, evaluate formula, evaluator, symbolic, differentiation, derivative , complex)

directed graph layout program for GML (Graph-Markup-Language) graph or partial graphviz DOT graph

We extend the Eclipse IDE with tools for development in Haskell, a functional programming language, providing support for a wide range of tools (compilers, interpreters, doc tools etc.) in a coherent, convenient and configurable environment.

ANGEL-Automatic differentiation Nested Graph Elimination Library is a template library using the Boost Graph Library and the Standard C++ Library; it provides sparse representations of c-graphs their dual line graphs and vertex, edge and face elimina

https://github.com/jplevyak/ifa IFA, Iterative Flow Analysis is a combined data-flow and control flow analysis. It is capable of resolving the concrete types (as opposed to the nominal or declared types) and the interprocedural call graph for statically or dynamically typed programs.

The Firm library implements the Firm intermediate representation (ir), a graph based SSA intermediate represenation for compilers.

Optimix - An Optimizer-Generator based on Graph-Rewriting

This is a collection of several simple functional languages all based on combinator graph reduction techniques for interpretation. For now there's only one package here: lazy-l, which is an interpreter for Alonzo Church's untyped lambda calculus.

This is a project to create a compiler that converts grammars written in SRGS standard (http://www.w3.org/TR/speech-grammar/) to a graph understandable by HMM based ASR engines. Check srgs-parser.sf.net