Search Results for "squid-graph"

Vincent Radio {Adrix.NT} presents Paged Lists & Iterators GXS for C++ Sources by Vincent Radio {Adrix.NT} also contains - Little Docs about Paged Lists (docx, pdf) - VR Basic Common Utils Sources (Array List ...) - VR Generic Multi Dim Array Class - VR Generic MDArray List Mgr Class - VR Generic Adjacency (List | Matrix) Direct Graph Classes - VR List Interface with STL Support with some nice implementations (ArrayList, Paged-LIst) - Env Var Notes for sources for C++ Builder (Embarcadero) - Special DLLs Build - Embarcadero C++Builder VCL Test Application for Paged List - Dev-C++, Visual Studio Build Projects have fun another fine SunStorm release for more products write to ... ...

Vincent Radio {Adrix.NT} Sources Library & Applications : Delphi C++ Java VRCalc++ C# VRCalc++ Object Oriented Scripting Language - Engine Source Pascal Code - Delphi Packages Build Prjs - VRCalc++ Scripted System Std RT Library - Guides & Docs (CHM, PDF, DOCX) - VCL & FMX (FireMonkey) Support - Script Test Code (Lang RTL VCL FMX) - Visual Stage Project : VCL & FMX Paged Lists & Iterators : Delphi C++ Java C# Multi-Dim Arrays & Direct Graph Classes : Delphi C++ Java VRCalc++ C# Delphi Drag&Drop Applications - VRCalc++ Script Executors: Terminal, VCL, FMX - VRMultiEdit - VRLazyCodeEditor - VR Astro Vision (Astrology) - Paged List Test - VRMosaic : Delphi C++Builder Java C# +with auto resolver - VR Free Chess 2D - VRBlocks - VRGraphStage - VR TTT OX + icons & bitmaps + VCL VisualStyles + Build Projects + instructions to build projects to build projects - Delphi : RAD Studio - C++ : Dev-C++ - java : NetBeans - C# : MS/VS adrixnt@hotmail.it

Wallaroo is a dependency injection library for C++. With wallaroo you can easily separate the object graph from the class implementation. You can create objects and wiring them using strings, so that you can load the "object graph" from a configuration file.

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.