| Projects on Google Code | Results 1 - 10 of 15 |
*csheap* is a customizable [http://en.wikipedia.org/wiki/Dynamic_memory_allocation dynamic memory allocator] written in C.
It was originally written as a replacement for the standard libc malloc and the Windows runtime.
csheap is simple, making it fast and less bug-prone. It can be customized at...
= Summie =
Summie is an application to implement memory management algorithms.
== Descrição ==
Novo: [TutorialSvn Tutorial Básico de Utilização do Subversion]
Atualizado: [Todo Página de Listagem de Tarefas do Grupo!]
Novo: [System Especificação do Sistema Operacional Simulado!]
No...
This package currently contains binary, binomial, Fibonacci, pairing, skew, and leftist implementations. The heaps have been carefully crafted to interact with the Java Collections API and throughly tested (with JUnit) for industrial strength robustness.
The first version of this package is now a...
Following, at least initially, a paper by Brodal and Okasaki, we aim to provide java developers with an efficient, purely functional/persistent heap (priority queue) structure with worst-case (not amortized) guarantees. By "functional" we mean that all operations are queries with no side-effects. ...
functionalprogramming,
priorityqueue,
heap,
java,
clojure,
recursiveslowdown,
brodal,
okasaki,
search,
sorting,
sort
Design and implement a set of functions to manage a free store using a first fit strategy.
The project hold some c source files to learn c language standard library,
data structure, and algorithm. you can get it use command:
svn checkout http://learnc.googlecode.com/svn/trunk/ learnc
The code was not for production usage , just for learning the language,library,algorithm.
The directo...
=Navitron=
==Summary==
Navitron is a Navigation Software using Data of [http://www.openstreetmap.org OpenStreetmap.org]. Using different Algorithms to find the best way.
===NEWS===
*19th August 2009* - Currently rewriting the whole Code.
==Currently supported Data-sources==
<ul>
<li>OS...
An efficient, imperative Fibonacci heap library, based on the pseudocode of Cormen, Leiserson, Rivest, and Stein.
HEAP
libmem covers two areas of common functionality: heap management and string management.
libmem’s heap management API is similar to the standard `malloc` interface, except that it allows you to create multiple distinct pools of memory with different expected allocation patterns and parameters.
...