orxfun Goto Github PK

cv

CV - Ugur Arikan

orx-bench-shortest-path

Benchmarks for single source single sink shortest path implementations

orx-closure

An explicit closure with absolute seperation of the captured data from the function.

orx-concurrent-bag

An efficient, convenient and lightweight grow-only concurrent data structure allowing high performance concurrent collection.

orx-concurrent-iter

A thread-safe, ergonomic and lightweight concurrent iterator trait and efficient implementations.

orx-concurrent-ordered-bag

An efficient, convenient and lightweight grow-only concurrent data structure allowing high performance and ordered concurrent collection.

orx-concurrent-vec

An efficient, convenient and lightweight grow-only read & write concurrent data structure allowing high performance concurrent collection.

orx-fixed-vec

An efficient fixed capacity vector with pinned elements.

orx-fun-compose

A function composition library for C#, heavily experimental right now, would be more practical if C# gets generic operator overloading.

orx-fun-funvec

Unified functional collections allowing access by index.

orx-fun-option

An option type for C# aiming to be explicit while concise.

orx-fun-result

A simple result type for C#, not minding the error type, instead aiming to be explicit, concise and fluent.

orx-funvec

Traits to unify access to elements of n-dimensional vectors which are particularly useful in algorithms requiring both flexibility through abstraction over inputs and performance through monomorphization.

orx-imp-vec

A data structure to enable conveniently building performant self referential collections such as trees, graphs and linked lists.

orx-linked-list

An efficient and recursive singly and doubly linked list implementation.

orx-mathprog-gallery

Gallery of mathematical models by orx-mathprog of well-known problems.

orx-parallel

placeholder

orx-pinned-concurrent-col

A core data structure with a focus to enable high performance, possibly lock-free, concurrent collections using a PinnedVec as the underlying storage.

orx-pinned-vec

PinnedVec trait defines the interface for vectors which guarantee that elements added to the vector are pinned to their memory locations unless explicitly changed.

orx-priority-queue

Priority queue traits and efficient d-ary heap implementations.

orx-selfref-col

`SelfRefCol` is a core data structure to conveniently build safe and efficient self referential collections, such as linked lists and trees.

orx-split-vec

An efficient constant access time vector with dynamic capacity and pinned elements.

orx-tree

go green

orxfun