https://github.com/sadit/intersections.jl

Algorithms for computing intersection using sorted lists of integers as sets
https://github.com/sadit/intersections.jl

Last synced: 6 months ago
JSON representation

Algorithms for computing intersection using sorted lists of integers as sets

• Host: GitHub
• URL: https://github.com/sadit/intersections.jl
• Owner: sadit
• License: mit
• Created: 2021-10-12T23:41:48.000Z (about 4 years ago)
• Default Branch: main
• Last Pushed: 2023-03-23T01:55:31.000Z (almost 3 years ago)
• Last Synced: 2025-07-01T11:04:52.005Z (6 months ago)
• Language: Julia
• Size: 172 KB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
[![Dev](https://img.shields.io/badge/docs-dev-blue.svg)](https://sadit.github.io/Intersections.jl/dev)

[![CI](https://github.com/sadit/Intersections.jl/actions/workflows/ci.yml/badge.svg)](https://github.com/sadit/Intersections.jl/actions/workflows/ci.yml)

# Intersections

It implements some intersection algorithms for sorted lists of integers.

# Usage

You can found Pluto notebooks for examples and benchmarking in the

[examples](https://github.com/sadit/Intersections.jl/tree/main/examples) directory.