refresh composer and add phpcs and phpunit

Author: tdebatty

.gitignore

@@ -1 +1,2 @@
-/nbproject/private/
+/nbproject/private/
+/vendor/

README.md

@@ -1,27 +1,20 @@
 # php-language-processing
 
-[![Latest Stable Version](https://poser.pugx.org/webd/language/v/stable)](https://packagist.org/packages/webd/language) [![Total Downloads](https://poser.pugx.org/webd/language/downloads)](https://packagist.org/packages/webd/language)
+[![Latest Stable Version](https://poser.pugx.org/webd/language/v/stable)](https://packagist.org/packages/webd/language)
+[![Total Downloads](https://poser.pugx.org/webd/language/downloads)](https://packagist.org/packages/webd/language)
 
 A PHP library for language processing. Includes string distance function 
 (Levenshtein, Jaro-Winkler, LCS-distance...), stemming, hashing etc.
 
-Installation using Composer
----------------------------
+## Installation
 
-in composer.json :
-```
-"require": {
-    "webd/language": "dev-master"
-}
+```bash
+composer require webd/language
 ```
 
-Then
-```
-composer install
-```
 
-Usage
------
+
+## Usage
 
 ```php
 use webd\language\StringDistance;

composer.json

@@ -3,5 +3,15 @@
     "description":  "A library for language processing. Includes string distance function (Levenshtein, Jaro-Winkler,...), stemming, etc.",
     "autoload": {
         "psr-0": {"": "src/"}
+    },
+    "require-dev": {
+        "squizlabs/php_codesniffer": "^4.0",
+        "slevomat/coding-standard": "^8.28",
+        "phpunit/phpunit": "^13.0"
+    },
+    "config": {
+        "allow-plugins": {
+            "dealerdirect/phpcodesniffer-composer-installer": true
+        }
     }
-}
+}

nbproject/project.properties

@@ -10,7 +10,7 @@ auxiliary.org-netbeans-modules-php-phpunit.phpUnit_2e_path=
 auxiliary.org-netbeans-modules-php-phpunit.test_2e_groups_2e_ask=false
 auxiliary.org-netbeans-modules-php-phpunit.test_2e_run_2e_all=false
 include.path=${php.global.include.path}
-php.version=PHP_53
+php.version=PHP_74
 source.encoding=UTF-8
 src.dir=.
 tags.asp=false

phpcs.xml

@@ -0,0 +1,16 @@
+<?xml version="1.0"?>
+<ruleset name="PHP_CodeSniffer">
+    <description>The coding standard for our project.</description>
+    <rule ref="PSR2"/>
+
+    <file>src</file>
+    <file>tests</file>
+
+    <!-- Show progression -->
+    <arg value="p"/>
+    
+    <!-- Add rules from slevomat 
+    https://cylab.be/blog/169/detect-unnecessary-use-statements-with-php-codesniffer -->
+    <config name="installed_paths" value="../../slevomat/coding-standard"/>
+    <rule ref="SlevomatCodingStandard.Namespaces.UnusedUses"/>
+</ruleset>

src/webd/language/LCS.php

@@ -2,11 +2,11 @@
 namespace webd\language;
 
 /**
- * The longest common subsequence (LCS) problem consists in finding the 
- * longest subsequence common to two (or more) sequences. It differs from 
- * problems of finding common substrings: unlike substrings, subsequences are 
- * not required to occupy consecutive positions within the original sequences. 
- * 
+ * The longest common subsequence (LCS) problem consists in finding the
+ * longest subsequence common to two (or more) sequences. It differs from
+ * problems of finding common substrings: unlike substrings, subsequences are
+ * not required to occupy consecutive positions within the original sequences.
+ *
  * Used by the diff utility, by Git for reconciling multiple changes, etc.
  */
 class LCS
@@ -15,7 +15,8 @@ class LCS
     private $X = "";
     private $Y = "";
 
-    public function __construct($str1, $str2) {
+    public function __construct($str1, $str2)
+    {
 
         $this->X = $str1;
         $this->Y = $str2;
@@ -26,7 +27,7 @@ public function __construct($str1, $str2) {
         $this->C = array();
 
         for ($i = 0; $i <= $m; $i++) {
-           $this->C[$i][0] = 0;
+            $this->C[$i][0] = 0;
         }
 
         for ($j = 0; $j <= $n; $j++) {
@@ -37,7 +38,6 @@ public function __construct($str1, $str2) {
             for ($j = 1; $j <= $n; $j++) {
                 if ($str1[$i-1] == $str2[$j-1]) {
                     $this->C[$i][$j] = $this->C[$i-1][$j-1] + 1;
-                    
                 } else {
                     $this->C[$i][$j] = max($this->C[$i][$j-1], $this->C[$i-1][$j]);
                 }
@@ -52,31 +52,36 @@ public function __construct($str1, $str2) {
         //            C[i,j] := max(C[i,j-1], C[i-1,j])
     }
 
-    public function length() {
+    public function length()
+    {
         return $this->C[strlen($this->X)][strlen($this->Y)];
     }
 
-    public function __toString() {
+    public function __toString()
+    {
         return $this->value();
     }
 
-    public function value() {
+    public function value()
+    {
         return $this->backtrack(strlen($this->X), strlen($this->Y));
     }
 
     /**
-     * Edit distance when only insertion and deletion is allowed (no 
+     * Edit distance when only insertion and deletion is allowed (no
      * substitution)
      * = strlen(str1) + strlen(str2) - 2 * length(LCS(str1, str2))
      * @param type $string1
      * @param type $string2
      */
-    public function distance() {
+    public function distance()
+    {
         return strlen($this->X) + strlen($this->Y) - 2 * $this->length();
     }
 
 
-    private function backtrack($i, $j) {
+    private function backtrack($i, $j)
+    {
         if ($i == 0 || $j == 0) {
             return "";
         }
@@ -104,7 +109,7 @@ private function backtrack($i, $j) {
     }
 
 //    /**
-//     * Edit distance when only insertion and deletion is allowed (no 
+//     * Edit distance when only insertion and deletion is allowed (no
 //     * substitution)
 //     * = strlen(str1) + strlen(str2) - 2 * length(LCS(str1, str2))
 //     * @param type $string1
@@ -113,19 +118,19 @@ private function backtrack($i, $j) {
 //    public static function distance($str1, $str2) {
 //        return strlen($str1) + strlen($str2) - 2 * self::length($str1, $str2);
 //    }
-//    
+//
 //    public static function lcs($str1, $str2) {
 //        $lcs = new LCS($str1, $str2);
 //        return $lcs->backtrack(strlen($str1), strlen($str2));
 //    }
 //    /**
-//     * 
+//     *
 //     * @param type $string1
 //     * @param type $string2
 //     */
 //    public static function length($string1, $string2) {
 //        $lcs = new LCS($str1, $str2);
 //        return $lcs->C;
-//        
+//
 //    }
-}
+}