ladder

Ladder is a lightning-fast persistent queue designed for efficient data storage and retrieval, developed in Java. This project addresses the need for a simple yet robust queuing mechanism that can handle high volumes of data while ensuring persistence.

Key Features

• Speed: Leveraging advanced algorithms, Ladder ensures high-speed operations for both inserting and retrieving data.
• Simplicity: The API is straightforward, making it easy for developers to integrate into their applications.
• Persistence: Data remains intact between application runs, allowing for long-term storage and reliability.

Usage Examples

To create a persistent queue instance, use the following code snippet:

String path = "/path/to/your/queue/dir";
Queue queue = new LadderQueue(
    new File(path),
    LadderQueueOptions.builder()
        .dataFlushThreshold(512 * 1024)
        .maxFileSize(100 * 1024)
        .build()
);

Basic Operations

• Put data into the queue:

byte[] data = new byte[] {...};
queue.put(data);

• Take data from the queue:

byte[] read = queue.take();

• Poll data from the queue with a timeout:

long timeoutInMs = 500;
byte[] read = queue.poll(timeoutInMs);

Ladder is ideal for developers seeking a reliable queuing solution without the overhead of complex configurations. Start using Ladder today to manage your data efficiently!