Easy way to create/reuse custom cells & headers with xib written in Swift

JavaScript implementation of a double-ended queue

Task scheduling for .NET: Azure Service Bus

Easy implementation of various Data Structures in Java language. Red-Black Tree, Splay Tree, AVLTree, PriorityQueue, Doubly-Linked-List, Stack, Queue, Array, ArrayList, Disjoint-Set,Binary-Search Tree, B-Tree.

Qluent provides a very simple Fluent API and wrapper classes around the Microsoft Azure Storage SDK

Stack, Queue and Dequeue

Some codes for Queue operations such as Queue with Array, Circular Queue with Array, Queue with Linked List, Circular Queue with Linked List, Circular Queue Linked List Splitting. These are having operations such as enqueue, dequeue, traverse, insertion, deletion, traverse, isEmpty, isFull, searching etc. ( in C++)

Contains solutions for problems from LeetCode in c#. Contains only the function and not the entire code.

(WIP) Data structures implementations in Go

C programming language. Linked List, Queue, Dequeue.

In computer science, a queue is a collection in which the entities in the collection are kept in order and the principal operations on the collection are the addition of entities to the rear terminal position, known as enqueue, and removal of entities from the front terminal position, known as dequeue.

Dequeue Google Fonts loaded by the Divi theme (and the Monarch plugin).

In computer science, a double-ended queue (abbreviated to deque) is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front (head) or back (tail).

Collection of elements where insert, delete happens only at the ends.

This repository contains data structures and operations perform on them, like Stack, Queue, Link List, Trees etc.

Implementation of dequeue in C++ with tests (Accomplished for academic credit)

Queue Implementation in Java

This program is the implementation of a priority queue data structure. The program enqueues and dequeues strings using priority queue. Additionally, the program also compares other data structures like BSTs, Heaps, Linked Lists and Arrays.

Solving problems related to data structures for practice.

implementing different types of queues with a number of implementation styles

A simple and fast FIFO collection for enqueuing and dequeuing items.

Java implementation of some basic data structure with Generics

Algorithms and Data Structures

Repositório responsável por implementações de diversas estruturas de dados através da utilização da linguagem Java.

Second programming assignment for Princeton's course "Algorithms, part I"

Data Structures Implementations and Unit Tests in Python 3

Node Enqueue Server