Search Results for "data structure" - Page 2

in-place sorting algorithm with O(n*log(k)) time komplexity. The data have to be the structure: struct { unsigned (char/short/int/long); [...] }

Job Arranger for Zabbix is an open source job scheduler for Zabbix is very famous integrated monitoring software. It is an add-on software of Zabbix. Job Arranger for Zabbix uses MySQL/PostgreSQL(same schema of Zabbix Database) to store data. The server and agent are written in C Language. and the client GUI is written in C#. The basic structure of Job Arranger for Zabbix is the same as Zabbix. Job Arranger for Zabbix use the basic information of Zabbix they are the user accounts, roles, host, and etc. Released under the terms of GNU General Public License version 2, Job Arranger for Zabbix is free software. ...

NanoCap is a generic application for the construction of low energy fullerene and capped nanotube structures. It provides an ideal tool to accompany the study of finite carbon molecules using computer simulation. The implementation involves a standalone application which includes a GUI and allows for dynamic visual inspection through 3D rendering. In addition, the NanoCap core libraries can be used in custom Python scripts that enabled the user to produce structures in bulk or to include the...

XanLib is a Linux library which provides data structures like hash tables, lists, pipes etc.. Each data structure exposes both synchronized and not synchronized methods.

Importer library to import assets from different common 3D file formats such as Collada, Blend, Obj, X, 3DS, LWO, MD5, MD2, MD3, MDL, MS3D and a lot of other formats. The data is stored in an own in-memory data-format, which can be easily processed. www.open3mod.com/ is a 3D model viewer and exporter based on Assimp that is also Open Source.

Coconut framework is base infrastructure for Mac OS X application. For more details, see the project web page (http://coconut-frmwk.sourceforge.net).

...hard sphere structure factor can be used, too -long computation times (depending on problem size and amount of constraints) from hours to a few days are possible -non-parallelized code

Symmetrical Mulitple Databace - Non center, auto spliting, auto backup, auto error recover, data storage and calculation distribute. For large scale web site storage and calculation. Small Server - Simply multiply thread socket server. Nodes are some servers or hosts with fixed ip-port pairs. Nodes are configed with several known friends. Every node maintains a hash table-rbtree data structure that contains the node map information.

Collection of utilities based on two basics classes: Matematica and VarData. Matematica) performs math operations on vectors and matrices for smoothing, interpolation, convolution, image processing... VarData) manipulate a structure of points connected by links. Addraw) openGL engine. ElPoly) analyze mechanical properties of polymer and membrane like structures. Addyn) perform molecular dynamics and Monte Carlo simulations and has a solver for 4th oder PDE. Avvis) perform all the operation of Matematica on different sets of data visualized on a Qt graphical interface. ...

The main idea of this project – to implement the solution that can be used to: construct custom network mesh or distributed network cluster structure with several relations types between nodes, formalize the data flow processing goes from upper node level central source point to down nodes and backward, formalize the management requests handling from multiple source points, support native reducing of multiple nodes results (aggregation, duplicates elimination, sorting and so on), internally support powerful full-text search engine and data storage, provide transactions-less and transactional requests processing, support flexible run-time changes of cluster infrastructure, have many languages bindings for client-side integration APIs in one product build on C++ language... ...

This library implements a thread-safe skip list data structure - a kind of list with good insertion, deletion and searching performances. It uses Fred Fish's dbug library as internal tracing/debugging system. See the web site for more details.

A capsule tree is a general purpose, self-balancing tree data structure for large, ordered, data-sets. It is designed to provide the same characteristics as B-trees and B+trees, but built from the ground up for in-memory usage. In other words, there are no provisions for “slow” I/O cases. The original motivation for this tree was a better backend for memory managers. However, the end result was a new sub-category of trees.

ViNSS View is a highly flexible tool for drawing RNA secondary structures. Secondary structures can be visualized as classical secondary structure plot, circle plot, linear plot or mountain plot. ViNSS View allows manual editing and several drawing styles, as well as a fully automated conjugate gradients minimization approach to draw more complex structures without user interaction. In addition, ViNSS View allows you to incorporate non-canonical base pairs into your drawing.

Library to implement popular data structures in C which doesn't need any modification to existing structures. SSDI stands for Store, Search, Delete, Iterate. Data structures which implement these will be added in this. Inspired by the ease in which a list can be created in Perl. Hope to bring such easy programmability using this library. Currently, sorted linked list, binary tree, AVL tree are implemented. Packaging not implemented.

Burrow-owl is a software package for visualizing multidimensional nuclear magnetic resonance (NMR) spectra, with an emphasis on spectra used in macromolecular structure determination.

Singly Linked-list - Doubly Linked-list - Stack - Queue - Deque - Generic Tree - AVL Tree - RB Tree

ODD is a tool for optimal domain decomposition of atomic structure guided by the given molecular dynamics data.

This project aims to create a Python SQLite based data offline/online analytics program targetted mainly on web analytics. The main development would involve a complete python powered (C/C++ intermediate wrappers if required) sqlite analysis engine.

aztree library is an implementation of most types of tree data-structure in C language. The library will implement these different type of trees. Binary, Self-balancing binary search, B-trees, Tries, BSP, Non-binary and few used in Computer Graphics

The project's purpose is to implement different types of data structures (Avl trees, Red-black trees, Binary heaps, etc.) using easy-to-read C code so it may be helpful to newbies to the world of data structure.

A collection of compact, powerful programs and functions, written in C, for the analysis and transformation of data. No object or structure dependencies, no fancy interfaces - just good tools.

XPN is relies on a non relational native XML database, where XML documents are stored in a compressed form and indices enables fast access to structure and content, thus enabling a fast evaluation of XQuery queries.

ht://Check is more than a link checker. It's particularly suitable for checking broken links, anchors and web accessibility barriers, but retrieved data can also be used for Web structure mining. Uses a MySQL backend. Derived from ht://Dig.

Promote is an easy to use, generic data structure and utility library for C,C++, and possibly more.

Unit tests and examples for data structure in C. It can be used for teaching and training. You can use Eclipse with CDT to open and use it. You can ask yuandong1222@gmail.com for help or visit yuandong.cnblogs.com.