Ben Wendt's blog

Consider the following three scenarios:

1. class Dog {
   ...
   public function Bark($str) {
      echo $str;
   }
   ... }
   
   

class AnimalCommunication { … public function DogBark(Dog $dog, $str) { $dog->Bark($str); } … }

2. class Dog {
   ...
   public function Bark($str) {
      echo $str;
   }
   ... }
   
   
   

class AnimalCommunication { … public function AnimalCommunicate($str) { echo $str; } … }

3. Interface IAnimal {
   public function Speak($str); }
   
   

Class Dog implements IAnimal { … public function Speak($str) { $this->Bark($str); } …. } class AnimalCommunication { … public function AnimalCommunicate(IAnimal $animal, $str) { $animal->speak($str); } … }

Note the following about these examples:

1. The first is tightly coupled to the dog class, and hence is not very extensible.
2. The second is coupled to echo. It does not allow different “animals” to output their text differently. What if we later added a TelepathicGecko class, which didn’t echo out to speak, but rather published to some ESP API somewhere? Clearly the coupling here is not ideal either.
3. The third is best. By programming to an interface, we reduce coupling to the minimum necessary amount.

A promise is a way to defer the execution of a given routine until the data it needs to run is ready. This is a very useful pattern in asynchronous languages, so using promises in a language like javascript is a great idea.

Of course PHP is (without forking) totally synchronous so there is really no reason to implement the promise pattern in PHP.

But the motto of every programmer is “if it’s a bad idea, I will do it!” (no, it isn’t), so here’s an implementation of promises in PHP:

class PromiseClass {
    private $callbacks = array();
    private $last_return;
    function promise($promise) {
        if (get_class($promise) == 'Promise') {
            return $promise;
        } else if (is_callable($promise)) {
            $this->then($promise);
            return $this;
        }
    }
    function then (callable $callback) {
        $this->callbacks[] = $callback;
        return $this;
    }
    function resolve () {
        $callback = array_shift($this->callbacks);
        if (is_callable($callback)) {
            $this->last_return = $callback($this->last_return);
        }
        if (count($this->callbacks) > 0) {
            $this->resolve();
        }
    }
}

A few things to note here:

1. First you will have to make an instance of the class.
2. You start by passing a function to the promise method. You could use then but the code wouldn’t look as descriptive or read as well.
3. You can then add any functions that would be run after with successive calls to then.
4. None of the functions that have been set up will be run until you call the resolve method on the object.

Here’s an example of usage of this useless and pointless class:

$promiser = new PromiseClass();

$promiser->promise(function() {
        echo "sleepingn";
        sleep(3);
        return 3;
    })
    ->then(function($args) {
        echo "that farn$argsn";
        sleep(1);
    })
    ->then(function() {
        echo "even farthernn";
    });

$promiser->resolve();    

Note: I’ve added some sleep statements here so it almost seems like something asynchronous is happening. Really sleep is just blocking. The output will be something like:

sleeping
that far
3
even farther

Longest common substring is a function that can be useful once in a while. Here’s a PHP implementation. Be forewarned, this runs in O(mn) time.

function longest_common_substring($string1, $string2) {
    $L = array();
    $length = 0;
    $pos = 0;
    $array1 =str_split($string1);
    $array2 =str_split($string2);
    foreach ($array1 as $i => $c1) { 
        $L[$i] = array();
        foreach ($array2 as $j => $c2) { 
            $L[$i][$j] = 0;
            if ($c1 == $c2) {
                if ($i == 0 || $j == 0) {
                    // initialize that this character position exists.
                    $L[$i][$j] = 1;
                } else {
                    // increment previous or reset.
                    if (isset($L[$i-1][$j-1])) {
                        $L[$i][$j] = $L[$i-1][$j-1] + 1;
                    } else {
                        $L[$i][$j] = 0;
                    }
                }
                if ($L[$i][$j] > $length) {
                    $length = $L[$i][$j];
                }
                if ((isset($L[$i][$j]))&&($L[$i][$j] == $length)) {
                    $pos = $i;
                }
            }
        }
    }
    if ($length > 0) {
        return substr($string1, $pos - $length + 1, $length);
    } else {
        return '';
    }
}

Usage:

$string1 = 'sadjjasdf this is the string  sdlkjhaskl';
$string2 = 'eriuhysdfnbasi this is the stringbhdjubsdi';

echo longest_common_substring($string1, $string2);