A short example showing how to register a structure and get it to generate in all biomes in NeoForge, Forge, and Fabric! (check the branches)

Amazon Chennai Training on Java and OOPS

Aulas e exercícios da matéria: Introdução à Programação Orientada a Objetos I (INE5603)

The better terrain algorithm for javascript

Algorithms and data structures in Java! From University of Oviedo, Data structures & algorithms subject.

Data Structures and Algorithms (DSA) - Java Language Using Integrated Development Environments NetBeans

Several utilities and common algorithms used in my remaining projects and libraries. It includes Basic Linear Algebra (bla) library, which provides multiple Vector and Matrix operations. A simple JSON parser, several structures and generic utilities.

程序猿的内功修炼，学好算法与数据结构

A Combining Tree is an N-ary tree of nodes, that follows software combining to reduce memory contention while updating a shared value.

Elimination-backoff stack is an unbounded lock-free LIFO linked list, that eliminates concurrent pairs of pushes and pops with exchanges.

CS146: Data Structures at SJSU (Algorithms By Robert Sedgewick et al)

Data Structures using Java

Java programming projects

Array queue is a bounded lock-based FIFO queue using an array. It uses 2 separate locks for head and tail.

A Locked Queue in a concurrent FIFO queue that uses locks and conditions to block enqueue when queue is full, and dequeue when it is empty.

FIFO Read-write Lock blocks any new readers once a writer requests, thus preventing writer lock-out due to continual stream of readers.

A Bathroom Lock allows N genders (thread types) to access a common bathroom (critical section) such that different genders do not clash.

Bitonic network is a balanced counting network that allows processes to decompose operations, like counting, and reduce memory contention.

Off-Heap Primitives Library

Semaphore is a generalization of mutual exclusion locks. It allows at most N threads into critical section. Java has a built-in Semaphore.