Germany

Ugur Arikan

Expert
@orxfun

Operations Research, optimization, algorithms, systems design. love rust.

orx-parallel. A performant and configurable parallel computing library for computations defined as compositions of iterator methods.

309

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

39

orx-concurrent-vec. A thread-safe, efficient and lock-free vector allowing concurrent grow, read and update operations.

17

orx-tree. A beautiful tree 🌳 with convenient, efficient, parallelizable growth, mutation and traversal features.

15

orx-linked-list. A linked list implementation with unique features and an extended list of constant time methods providing high performance traversals and mutations.

10

orx-priority-queue. Priority queue traits and efficient d-ary heap implementations.

10

orx-local-search. placeholder: local search

5

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

5

orx-concurrent-iter. A thread-safe and ergonomic concurrent iterator trait and efficient lock-free implementations.

5

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

3

orx-iterable. Defines and implements Iterable, Collection and CollectionMut traits to represent types that can be iterated over multiple times.

3

orx-v. Traits to unify all vectors!

3

orx-meta. Meta structures such as statically typed queues of heterogeneous elements.

3

talk-composing-zero-cost-abstractions-in-route-optimization. JavaScript

2

orx-split-vec. An efficient dynamic capacity vector with pinned element guarantees.

2

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.

2

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

2

orx-self-or. Defines SoR (self-or-ref) and SoM (self-or-mut) traits that are useful in reducing code duplication and pushing forward the ownership transfer decision from the type designer to the consumer.

2

orx-imp-vec. ImpVec stands for immutable push vector 👿, it is a data structure which allows appending elements with a shared reference.

2

orx-pseudo-default. PseudoDefault trait allows to create a cheap default instance of a type, which does not claim to be useful.

1

orx-fixed-vec. An efficient fixed capacity vector with pinned element guarantees.

1

orxfun.

1

orx-concurrent-option. ConcurrentOption is a thread-safe and lock-free read-write option type.

1

orx-criterion. orx-criterion extends criterion with an experimentation model so you can compare algorithm variants and parameter choices across many input shapes, then get a summary.

1
24
Apply