Download the PHP package marcj/topsort without Composer

On this page you can find all versions of the php package marcj/topsort. 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 marcj/topsort

Informations about the package topsort

Topological Sort / Dependency resolver in PHP

Build Status Code Climate Test Coverage

This library provides several implementations of a Topological Sort (topSort). In additional to the plain sorting algorithm it provides several implementations of a Grouped Topological Sort, means you can pass items with a type which will be grouped together in the sorting. With its implementation of using strings instead of arrays its over 20x faster than regular implementations.

What is it?

A topological sort is useful for determining dependency loading. It tells you which elements need to be proceeded first in order to fulfill all dependencies in the correct order.

Example usage: Unit of Work (relations), simple Package manager, Dependency Injection, ...

Examples:

Sometimes you want to group equal types together (imagine a UnitOfWork which wants to combine all elements from the same type to stored those in one batch):

You can only store strings as elements. To sort PHP objects you can stored its hash instead. $sorter->add(spl_object_hash($obj1), [spl_object_hash($objt1Dep)]).

Installation

Use composer package: marcj/topsort

Implementations

tl;dr: Use FixedArraySort for normal topSort or GroupedStringSort for grouped topSort since its always the fastest and has a good memory footprint.

ArraySort

This is the most basic, most inefficient implementation of topSort using plain php arrays.

FixedArraySort

This uses \SplFixedArray of php and is therefore much more memory friendly.

StringSort

This uses a string as storage and has therefore no array overhead. It's thus a bit faster and has almost equal memory footprint like FixedArraySort. Small drawback: You can not store element ids containing a null byte.

GroupedArraySort

This is the most basic, not so efficient implementation of grouped topSort using plain php arrays.

GroupedStringSort

This uses a string as storage and has therefore no array operations overhead. It's extremely faster and has better memory footprint than GroupedArraySort. Small drawback: You can not store element ids containing a null byte.

Benchmarks with PHP 7.0.9

Test data: 1/3 has two edges, 1/3 has one edge and 1/3 has no edges. Use the benchmark command in ./bin/console to play with it.

Count Implementation Memory Duration
50 FixedArraySort 0b 0.0001s
50 ArraySort 0b 0.0001s
50 StringSort 0b 0.0001s
1,000 FixedArraySort 53,432b 0.0013s
1,000 ArraySort 37,720b 0.0012s
1,000 StringSort 89,112b 0.0013s
10,000 FixedArraySort 692,464b 0.0141s
10,000 ArraySort 529,240b 0.0138s
10,000 StringSort 1,080,472b 0.0154s
100,000 FixedArraySort 5,800,200b 0.1540s
100,000 ArraySort 4,199,280b 0.1499s
100,000 StringSort 10,124,000b 0.1645s
1,000,000 FixedArraySort 49,561,888b 1.5456s
1,000,000 ArraySort 33,559,408b 1.5597s
1,000,000 StringSort 95,480,848b 1.7942s
Count Implementation Memory Duration
50 GroupedArraySort 0b 0.0002s
50 GroupedStringSort 0b 0.0002s
1,000 GroupedArraySort 112,280b 0.0090s
1,000 GroupedStringSort 99,440b 0.0025s
10,000 GroupedArraySort 1,431,320b 0.8385s
10,000 GroupedStringSort 1,176,304b 0.0267s
100,000 GroupedArraySort 12,318,072b 132.9709s
100,000 GroupedStringSort 11,129,144b 0.2788s
1,000,000 GroupedArraySort - too long
1,000,000 GroupedStringSort 106,488,496b 3.0879s

All versions of topsort 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 marcj/topsort contains the following files

Loading the files please wait ....