vale-cocoa Goto Github PK

additionalsorts

Some popular sorting algorithms implementations in Swift over MutableCollection.

binarynode

A reference type key/value data structure represented by a node with a left and right links to children nodes

circularbuffer

A memory buffer providing amortized O(1) performance for operations on its stored elements at both start and end positions.

circularqueue

A queue data structure adopting the FIFO (first-in, first-out) policy and able to store a predefined and static number of elements only; that is attempting to enqueue new elements when its storage is full, then older elements will be overwritten.

clockviewparts

A set of SwiftUI views for creating an animatable watch view.

combinedgregorianschedule

A concrete `Schedule` type consisting of the composition of two or more `GregorianCommonTimetable` instances.

deque

A double ended queue, that is a queue which allows acces to its both ends with an amortized O(1) complexity.

dfa

A Swift implementation of determistic state automata.

dispatchresultcompletion

Helper for dispatching a result completion on given queue

graph

Graph swift implementation

gregoriancommontimetable

A concrete Schedule type for representing common timetables based on gregorian calendar time units.

heapbuffer

A memory buffer which keeps its stored elements in an order so that each stored element satisfies the heap property established by a sort function.

indexedpriorityqueue

A Swift implementation of IndexedPriorityQueue data structure

ioscorelibrary

Collection of useful screens and categories for iOS apps

linearprobinghashtable

A symbol table (a.k.a associative array, a.k.a. dictionary) adopting a linear probing hash table as its storage and implementing the same public interface of Swift Dictionary.

llrbtree

A symbol table (a.k.a associative array, a.k.a. dictionary) adopting Left Leaning Red-Black Tree 3-2 variant as its storage and implementing the same public interface of Swift Dictionary. Since the underlaying storage is a binary search tree, it relies on Key conforming to Comparable rather than Hashable.

priorityqueue

A queue data structure (with value semantics) whose elements are dequeued by priority order.

queue

A data structure which yelds its stored elements with a predetermined sequential order.

rabinkarphasher

An hasher adopting rolling hash values

ranchforecast

randomqueue

A queue adopting as dequeue policy a random approach: that is when dequeueing an element, it will randomly pick one from its stored elements.

schedule

Schedule timetable functionalities

separatechaininghashtable

A symbol table (a.k.a associative array, a.k.a. dictionary) adopting a separate chaining hash table as its storage and implementing the same public interface of Swift Dictionary.

sizinghelpers

A set helpers for sizing SwiftUI views.

slicedschedule

A concrete `Schedule` type contaning a finite number of elements.

stack

A Collection —with value semantics— implementing queue LIFO (last in, first out) functionalities.

substringenumerators

Find ranges of a substring in a string.

swift-algorithm-club

Algorithms and data structures in Swift, with explanations!

swiftpriorityqueue

A Generic Priority Queue in Pure Swift

threewaystrie

A Swift impementation of ThreeWaysTrie symbol table