Download the PHP package martanlv/koki without Composer
On this page you can find all versions of the php package martanlv/koki. It is possible to download/install these versions without Composer. Possible dependencies are resolved automatically.
Table of contents
Download martanlv/koki
More information about martanlv/koki
Files in martanlv/koki
Download martanlv/koki
More information about martanlv/koki
Files in martanlv/koki
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:
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.
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?
Informations about the package koki
Interval Tree: The idea is to augment a self-balancing Binary Search Tree (BST) like Red Black Tree, AVL Tree, etc ~to maintain set of intervals~ so that all operations can be done in O(Logn) time.
Todo:
- [ ] ***Segment tree stores intervals, and optimized for "which of these intervals contains a given point" queries.
- [x] Interval tree stores intervals as well, but optimized for "which of these intervals overlap with a given interval" queries. It can also be used for point queries - similar to segment tree.
- [ ] Range tree stores points, and optimized for "which points fall within a given interval" queries.
- [ ] Binary indexed tree stores items-count per index, and optimized for "how many items are there between index m and n" queries.
Performance / Space consumption for one dimension:
- [ ] Segment tree - O(n logn) preprocessing time, O(k+logn) query time, O(n logn) space
- [x] Interval tree - O(n logn) preprocessing time, O(k+logn) query time, O(n) space
- [ ] Range tree - O(n logn) preprocessing time, O(k+logn) query time, O(n) space
- [ ] Binary Indexed tree - O(n logn) preprocessing time, O(logn) query time, O(n) space (k is the number of reported results).
All data structures can be dynamic, in the sense that the usage scenario includes both data changes and queries:
- [ ] Segment tree - interval can be added/deleted in O(logn) time (see here)
- [ ] Interval tree - interval can be added/deleted in O(logn) time
- [ ] Range tree - new points can be added/deleted in O(logn) time (see here)
- [ ] Binary Indexed tree - the items-count per index can be increased in O(logn) time
Higher dimensions (d>1):
- [ ] Segment tree - O(n(logn)^d) preprocessing time, O(k+(logn)^d) query time, O(n(logn)^(d-1)) space
- [ ] Interval tree - O(n logn) preprocessing time, O(k+(logn)^d) query time, O(n logn) space
- [ ] Range tree - O(n(logn)^d) preprocessing time, O(k+(logn)^d) query time, O(n(logn)^(d-1))) space
- [ ] Binary Indexed tree - O(n(logn)^d) preprocessing time, O((logn)^d) query time, O(n(logn)^d) space
Beethooven approves.
--
__
All versions of koki with dependencies
PHP Build Version
Package Version
Requires
php Version
^7.0
The package martanlv/koki contains the following files
Loading the files please wait ....