KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#dsh #dsh-plugin #ai-agents #developer-tools #ai-agent #claude-code #mcp #typescript #codex #cli #rust #deepseek-harness

intervalset

★ 49 Open GitHub ↗

Efficient immutable interval sets

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# intervalsets

Efficient immutable interval sets for [spire](https://github.com/non/spire).

Two of these data structures have since been included into [spire-extras](https://github.com/non/spire/tree/master/extras/src/main/scala/spire/math/extras/interval).

[![Build Status](https://travis-ci.org/rklaehn/intervalset.png)](https://travis-ci.org/rklaehn/intervalset)
[![codecov.io](http://codecov.io/github/rklaehn/intervalset/coverage.svg?branch=master)](http://codecov.io/github/rklaehn/intervalset?branch=master)
[![Maven Central](https://maven-badges.herokuapp.com/maven-central/com.rklaehn/intervalset_2.12/badge.svg)](https://maven-badges.herokuapp.com/maven-central/com.rklaehn/intervalset_2.12)
[![Scaladoc](http://javadoc-badge.appspot.com/com.rklaehn/intervalset_2.12.svg?label=scaladoc)](http://javadoc-badge.appspot.com/com.rklaehn/intervalset_2.12)

This repository contains two data structures for sets of *non-overlapping* intervals. Boundaries are either inclusive or exclusive, so (0..2] is different to [1..2].

## IntervalTrie

[IntervalTrie](IntervalTrie.md) is based on a binary TRIE and requires the element type to be convertable to a long while preserving order. This is the case for all primitive types.

## IntervalSeq

[IntervalSeq](IntervalSeq.md) is based on sorted sequences of boundary values and works for any element type for which an Order instance is available.

## IntervalMap

[IntervalMap](IntervalMap.md) is a generalization of IntervalSeq to more complex values. This is the most generic data structure. It requires an Order[K] for the keys, and something like a Bool[V] or a Monoid[V] for the values.

## QuickArrayMerge

An utility to merge two sorted arrays with a close to optimal number of comparisons. This is what operations in IntervalSeq and IntervalMap are based on.

## ScalaWorld presentation

[Presentation at ScalaWorld 2017](https://www.youtube.com/watch?v=Lb07lshL4cw)

intervalset

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README