sanmai/pipeline

General purpose collections pipeline

, _(*1)

Pipeline is a PHP library that brings the power of streaming pipelines to your code. Inspired by the pipe operator (|>), typical in functional programming languages, Pipeline lets you chain a series of operations on your data concisely, clearly, and readably. This approach simplifies complex data transformations and makes your code more maintainable and easier to test., _(*2)

The pipeline uses lazy evaluation to optimize performance, especially for large datasets. This means operations are not executed immediately but deferred until the final result is needed. The pipeline is built as a chain of generator functions, processing data iteratively without loading the entire dataset into memory., _(*3)

This means the actual computation is deferred until the final result is needed. This approach offers the benefits of reduced memory usage, making it suitable for handling massive datasets, improved performance by avoiding unnecessary computations, and efficiency for large datasets or even infinite sequences. For example, if you have an array with a million numbers and want to find the first five even numbers multiplied by 2, thanks to the lazy evaluation, it will only process the first few necessary numbers., _(*4)

The pipeline makes dealing with iterable types as easy as possible, making it a perfect tool for bespoke data processing pipelines, hence the name. If you ever piped together several bash commands where one command uses the output of another in succession, this library does just that for PHP functions, generators, arrays, and iterators., _(*5)

The pipeline has the most essential yet basic building blocks. It boasts methods to map, filter, reduce, zip, and unpack data from arbitrary generators and all kinds of standard iterators., _(*6)

This rigorously tested library just works. Pipeline neither defines nor throws any exceptions., _(*7)

Install

composer require sanmai/pipeline

The latest version requires PHP 7.4 or above, including PHP 8.2 and later., _(*8)

Some earlier versions work under PHP 5.6 and above, but they are not as feature-complete., _(*9)

Documentation

Read the full documentation, _(*10)

The documentation includes:, _(*11)

• Quick start guide to get up and running
• Full Pipeline API reference for a deep dive
• Cookbook with practical recipes and patterns
• Best practices with tips for effective usage

Use

use function Pipeline\take;

// iterable corresponds to arrays, generators, iterators
// we use an array here simplicity sake
$iterable = range(1, 3);

// wrap the initial iterable with a pipeline
$pipeline = take($iterable);

// join side by side with other iterables of any type
$pipeline->zip(
    \range(1, 3),
    map(function () {
        yield 1;
        yield 2;
        yield 3;
    })
);

// lazily process their elements together
$pipeline->unpack(function (int $a, int $b, int $c) {
    return $a - $b - $c;
});

// map one value into several more
$pipeline->map(function ($i) {
    yield pow($i, 2);
    yield pow($i, 3);
});

// simple one-to-one mapper
$pipeline->cast(function ($i) {
    return $i - 1;
});

// map into arrays
$pipeline->map(function ($i) {
    yield [$i, 2];
    yield [$i, 4];
});

// unpack array into arguments
$pipeline->unpack(function ($i, $j) {
    yield $i * $j;
});

// one way to filter
$pipeline->map(function ($i) {
    if ($i > 50) {
        yield $i;
    }
});

// this uses a filtering iterator from SPL under the hood
$pipeline->filter(function ($i) {
    return $i > 100;
});

// reduce to a single value; can be an array or any value
$value = $pipeline->fold(0, function ($carry, $item) {
    // for the sake of convenience the default reducer from the simple
    // pipeline does summation, just like we do here
    return $carry + $item;
});

var_dump($value);
// int(104)

API entry points

All entry points always return an instance of the pipeline., _(*12)

Instance methods in a nutshell

Pipeline is an iterator and can be used as any other iterable., _(*13)

Pipeline can be used as an argument to count(). Implements Countable. Be warned that operation of counting values is a terminal operation., _(*14)

In general, Pipeline instances are mutable, meaning every Pipeline-returning method returns the very same Pipeline instance. This gives us great flexibility on trusting someone or something to add processing stages to a Pipeline instance, while also avoiding non-obvious mistakes, raised from a need to strictly follow a fluid interface. E.g. if you add a processing stage, it stays there no matter if you capture the return value or not. This peculiarity could have been a thread-safety hazard in other circumstances, but under PHP this is not an issue., _(*15)

Caveats

• Since most callback are lazily evaluated as more data coming in and out, you must consume the results with a plain foreach or use a reduce() to make sure processing happens., _(*16)

  foreach ($pipeline as $result) {
      // Processing happens only if you consume the results.
      // Want to stop early after few results? Not a problem here!
  }
  

  Almost nothing will happen unless you use the results. That's the point of lazy evaluation after all!, _(*17)

• That said, if a non-generator used to seed the pipeline, it will be executed eagerly., _(*18)

  $pipeline = new \Pipeline\Standard();
  $pipeline->map(function () {
      // will be executed immediately on the spot, unless yield is used
      return $this->veryExpensiveMethod();
  })->filter();
  

  In the above case the pipeline will store an array internally, with which the pipeline will operate eagerly whenever possible. Ergo, when in doubt, use a generator., _(*19)

  $pipeline->map(function () {
      // will be executed only as needed, when needed
      yield $this->veryExpensiveMethod();
  })->filter();
  

• Keys for yielded values are being kept as is on a best effort basis, so one must take care when using iterator_to_array() on a pipeline: values with duplicate keys will be discarded with only the last value for a given key being returned., _(*20)

  $pipeline = \Pipeline\map(function () {
      yield 'foo' => 'bar';
      yield 'foo' => 'baz';
  });
  
  var_dump(iterator_to_array($pipeline));
  /* ['foo' => 'baz'] */
  

  Safer would be to use provided toList() method. It will return all values regardless of keys used, making sure to discard all keys in the process., _(*21)

  var_dump($pipeline->toList());
  /* ['bar', 'baz'] */
  

  If necessary to preserve the keys, there's a sister method toAssoc()., _(*22)

• The resulting pipeline is an iterator and should be assumed not rewindable, just like generators it uses., _(*23)

  $pipeline = \Pipeline\map(function () {
      yield 1;
  });
  
  $sum = $pipeline->reduce();
  
  // Won't work the second time though
  $pipeline->reduce();
  // Exception: Cannot traverse an already closed generator
  

  Although there are some cases where a pipeline can be rewinded and reused just like a regular array, a user should make no assumptions about this behavior as it is not a part of the API compatibility guarantees., _(*24)

• Pipeline implements IteratorAggregate which is not the same as Iterator. Where the latter needed, the pipeline can be wrapped with an IteratorIterator:, _(*25)

  $iterator = new \IteratorIterator($pipeline);
  /** @var $iterator \Iterator */
  

• Iterating over a pipeline all over again results in undefined behavior. Best to avoid doing this., _(*26)

Classes and interfaces: overview

• \Pipeline\Standard is the main user-facing class for the pipeline with sane defaults for most methods.

This library is built to last. There's not a single place where an exception is thrown. Never mind any asserts whatsoever., _(*27)

Methods

__construct()

Takes an instance of Traversable or none. In the latter case the pipeline must be primed by passing an initial generator to the map method., _(*28)

$pipeline->map()

Takes a processing stage in a form of a generator function or a plain mapping function. Provided no callback does nothing., _(*29)

$pipeline->map(function (Customer $customer) {
    foreach ($customer->allPayments() as $item) {
        yield $item;
    }
});

// Now process all and every payment
$pipeline->map(function (Payment $payment) {
    return $payment->amount;
});

Can also take an initial generator, where it must not require any arguments., _(*30)

$pipeline = new \Pipeline\Standard();
$pipeline->map(function () {
    yield $this->foo;
    yield $this->bar;
});

$pipeline->flatten()

Flatten inputs:, _(*31)

$pipeline->map(function () {
    yield [1];
    yield [2, 3];
})->unpack()->toList();
// [1, 2, 3]

$pipeline->unpack()

An extra variant of map which unpacks arrays into arguments for a callback., _(*32)

Where with map() you would use:, _(*33)

$pipeline->map(function ($args) {
    list ($a, $b) = $args;

    // and so on
});

With unpack() these things are done behind the scene for you:, _(*34)

$pipeline->map(function () {
    yield [-1, [10, 20], new DateTime()];
});
$pipeline->unpack(function ($a, array $b, \DateTime ...$dates) {
    // and so on
});

You can have all kinds of standard type checks with ease too., _(*35)

With no callback, the default callback for unpack() will flatten inputs as in flatten()., _(*36)

$pipeline->cast()

Works similarly to map, but does not have a special treatment for generators. Think of array_map., _(*37)

$pipeline->cast(function (Customer $customer) {
    foreach ($customer->allPayments() as $item) {
        yield $item;
    }
});

$pipeline->map(function (\Generator $paymentGenerator) {
    // Keeps grouping as per customer
});

For this example, where map() would have filled the pipeline with a series of payments, cast() will add a generator for each customer., _(*38)

$pipeline->zip()

Sequence-joins several iterables together, forming a feed with elements side by side:, _(*39)

$pipeline = take($iterableA);
$pipeline->zip($iterableB, $iterableC);
$pipeline->unpack(function ($elementOfA, $elementOfB, $elementOfC) {
    // ... 
});

With iterators with unequal number of elements, missing elements are left as nulls., _(*40)

$pipeline->filter()

Takes a filter callback not unlike that of array_filter., _(*41)

$pipeline->filter(function ($item) {
    return $item->isGood() && $item->amount > 0;
});

The pipeline has a default callback with the same effect as in array_filter: it'll remove all falsy values., _(*42)

With the optional strict parameter, it only removes strictly null or false:, _(*43)

$pipeline->filter(strict: true);

$pipeline->slice()

Takes offset and length arguments, functioning in a very similar fashion to how array_slice does with $preserve_keys set to true., _(*44)

$pipeline->slice(1, -1);

This example will remove first and last elements of the sequence., _(*45)

Implementation uses a rolling window buffer for negative values of offset and length, and falls back on plain old array_slice for input arrays., _(*46)

$pipeline->reduce()

Takes a reducing callback not unlike that of array_reduce with two arguments for the value of the previous iteration and for the current item. As a second argument it can take an initial value., _(*47)

$total = $pipeline->reduce(function ($curry, $item) {
    return $curry + $item->amount;
}, 0);

The pipeline has a default callback that sums all values., _(*48)

$pipeline->toList()

Returns an array with all values from a pipeline. All array keys are ignored to make sure every single value is returned., _(*49)

// Yields [0 => 1, 1 => 2]
$pipeline = map(function () {
    yield 1;
    yield 2;
});

// For each value yields [0 => $i + 1, 1 => $i + 2]
$pipeline->map(function ($i) {
    yield $i + 1;
    yield $i + 2;
});

$result = $pipeline->toList();
// Since keys are ignored we get:
// [2, 3, 3, 4]

If in the example about one would use iterator_to_array($result) they would get just [3, 4]., _(*50)

$pipeline->each()

Eagerly iterates over the sequence using the provided callback., _(*51)

$pipeline->each(function ($i) {
    $this->log("Saw $i");
});

Discards the sequence after iteration unless instructed otherwise by the second argument., _(*52)

$pipeline->getIterator()

A method to conform to the Traversable interface. In case of unprimed \Pipeline\Standard it'll return an empty array iterator, essentially a no-op pipeline. Therefore this should work without errors:, _(*53)

$pipeline = new \Pipeline\Standard();
foreach ($pipeline as $value) {
    // no errors here
}

This allows to skip type checks for return values if one has no results to return: instead of false or null it is safe to return an unprimed pipeline., _(*54)

$pipeline->runningVariance()

Computes online statistics for the sequence: counts, sample mean, sample variance, standard deviation. You can access these numbers on the fly with methods such as getCount(), getMean(), getVariance(), getStandardDeviation()., _(*55)

This method also accepts an optional cast callback that should return float|null: null values are discarded. Therefore you can have several running variances computing numbers for different parts of the data., _(*56)

$pipeline->runningVariance($varianceForShippedOrders, static function (order $order): ?float {
    if (!$order->isShipped()) {
        // This order will be excluded from the computation.
        return null;
    }

    return $order->getTotal();
});

$pipeline->runningVariance($varianceForPaidOrders, static function (order $order): ?float {
    if ($order->isUnpaid()) {
        // This order will be excluded from the computation.
        return null;
    }

    return $order->getProjectedTotal();
});

As you process orders, you will be able to access $varianceForShippedOrders->getMean() and $varianceForPaidOrders->getMean()., _(*57)

This computation uses Welford's online algorithm, therefore it can handle very large numbers of data points., _(*58)

$pipeline->finalVariance()

A convenience method to computes the final statistics for the sequence. Accepts an optional cast method, else assumes the sequence contains valid numbers., _(*59)

// Fibonacci numbers generator
$fibonacci = map(function () {
    yield 0;

    $prev = 0;
    $current = 1;

    while (true) {
        yield $current;
        $next = $prev + $current;
        $prev = $current;
        $current = $next;
    }
});

// Statistics for the second hundred Fibonacci numbers.
$variance = $fibonacci->slice(101, 100)->finalVariance();

$variance->getStandardDeviation();
// float(3.5101061922557E+40)

$variance->getCount();
// int(100)

Type Safety

The library provides extensive generic type tracking, whether you prefer method chaining or not., _(*60)

Given the following type:, _(*61)

class Foo
{
    public function __construct(
        public int $n,
    ) {}

    public function bar(): string
    {
        return "{$this->n}\n";
    }
}

A static analyzer will correctly infer that these examples are sound:, _(*62)

$pipeline = Pipeline\take(['a' => 1, 'b' => 2, 'c' => 3])
    ->map(fn(int $n): int => $n * 2)
    ->cast(fn(int $n): Foo => new Foo($n));

foreach ($pipeline as $value) {
    echo $value->bar();
}

$pipeline = Pipeline\take(['a' => 1, 'b' => 2, 'c' => 3]);
$pipeline->map(fn(int $n): int => $n * 2);
$pipeline->cast(fn(int $n): FooB => new FooB($n));

foreach ($pipeline as $value) {
    echo $value->bar();
}

But if you were to change the signature of the class:, _(*63)

 class Foo
 {
     public function __construct(
-        public int $n,
+        public string $n,
     ) {}

-    public function bar(): string
+    public function baz(): string
     {
         return "{$this->n}\n";
     }
 }

PHPStan will correctly note that:, _(*64)

• The first parameter of class Foo constructor expects string but int given.
• There is a call to an undefined method Foo::bar().

Contributions

Contributions to documentation and test cases are welcome. Bug reports are welcome too., _(*65)

API is expected to stay as simple as it is, though., _(*66)

About collection pipelines in general

About collection pipelines programming pattern by Martin Fowler., _(*67)

In a more general sense this library implements a subset of CSP paradigm, as opposed to Actor model., _(*68)

What else is out there:, _(*69)

• Pipe operator from Hack is about same, only won't work for generators, and not under the regular PHP. See a proposal for a similar operator for JavaScript.
• nikic/iter provides functions like array_map and such, but returning lazy generators. You'll need quite some glue to accomplish the same thing Pipeline does out of box, not to mention some missing features.
• League\Pipeline is good for single values only. Similar name, but very different purpose. Not supposed to work with sequences of values. Each stage may return only one value.
• Illuminate\Support\Collection a fluent wrapper for working with arrays of data. Can only work with arrays, also immutable, which is kind of expected for an array-only wrapper.
• Knapsack is a close call. Can take a Traversable as an input, has lazy evaluation. But can't have multiple values produced from a single input. Has lots of utility functions for those who need them: they're out of scope for this project.
• transducers.php is worth a close look if you're already familiar transducers from Clojure. API is not very PHP-esque. Read as not super friendly. Detailed write-up from the author.
• Primitives for functional programming in PHP by Lars Strojny et al. is supposed to complement currently existing PHP functions, which it does, although it is subject to some of the same shortcomings as are array_map and array_filter. No method chaining.
• Chain provides a consistent and chainable way to work with arrays in PHP, although for arrays only. No lazy evaluation.
• Simple pipes with PHP generators by Hugh Grigg. Rationale and explanation for an exceptionally close concept. Probably one can use this library as a drop-in replacement, short of different method names.
• loophp's Collection looks like a viable alternative to this library, as far as processing of multi-gigabyte log files goes. Supports fluent interface. It takes the immutability as a first principle, even though PHP's generators are inherently mutable.
• If you're familiar with Java, package java.util.stream offers an implementation of the same concept.
• Collection types in Scala.

Submit a PR to add yours., _(*70)

More badges

, _(*71)