Download the PHP package dan-on/php-interval-tree without Composer

On this page you can find all versions of the php package dan-on/php-interval-tree. It is possible to download/install these versions without Composer. Possible dependencies are resolved automatically.

FAQ

After the download, you have to make one include require_once('vendor/autoload.php');. After that you have to import the classes with use statements.

Example:
If you use only one package a project is not needed. But if you use more then one package, without a project it is not possible to import the classes with use statements.

In general, it is recommended to use always a project to download your libraries. In an application normally there is more than one library needed.
Some PHP packages are not free to download and because of that hosted in private repositories. In this case some credentials are needed to access such packages. Please use the auth.json textarea to insert credentials, if a package is coming from a private repository. You can look here for more information.

  • Some hosting areas are not accessible by a terminal or SSH. Then it is not possible to use Composer.
  • To use Composer is sometimes complicated. Especially for beginners.
  • Composer needs much resources. Sometimes they are not available on a simple webspace.
  • If you are using private repositories you don't need to share your credentials. You can set up everything on our site and then you provide a simple download link to your team member.
  • Simplify your Composer build process. Use our own command line tool to download the vendor folder as binary. This makes your build process faster and you don't need to expose your credentials for private repositories.
Please rate this library. Is it a good library?

Example code of dan-on/php-interval-tree

Informations about the package php-interval-tree

PHP Interval tree

Latest Stable Version Total Downloads License PHP Version Require

Overview

Package dan-on/php-interval-tree is an implementation of self balancing binary search tree data structure called Red-Black Tree.

Based on interval tree described in "Introduction to Algorithms 3rd Edition", published by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.

Complexity

Operation Best, Average, Worst
Insertion O(log(n))
Search O(log(n))
Remove O(log(n))
Space O(n)

Installing via Composer

Usage

Interval Tree

insert(IntervalInterface $interval, mixed $value): void

Insert new pair (interval + value) into interval tree

findIntersections(IntervalInterface $interval): Iterator\

Find pairs which intervals intersect with given interval

hasIntersection(IntervalInterface $interval): bool

Returns true if interval has at least one intersection in tree

countIntersections(IntervalInterface $interval): int

Count intersections given interval in tree

remove(IntervalInterface $interval, $value): bool

Remove node from tree by interval and value

exist(IntervalInterface $interval, $value): bool

Returns true if interval and value exist in the tree

isEmpty(): bool

Returns true if tree is empty

getSize(): int

Get number of items stored in the interval tree

Intervals

There are numeric and DateTimeInterface-based interval types included.

Numeric interval

DateTime interval

Tests

All versions of php-interval-tree with dependencies

PHP Build Version
Package Version
Requires php Version >=7.3
Composer command for our command line client (download client) This client runs in each environment. You don't need a specific PHP version etc. The first 20 API calls are free. Standard composer command

The package dan-on/php-interval-tree contains the following files

Loading the files please wait ....