@@ -40,9 +40,9 @@ |
||
| 40 | 40 | public function parse(Node $node): void |
| 41 | 41 | { |
| 42 | 42 | $types = [ |
| 43 | - '-', '*', |
|
| 44 | - '^', '@', |
|
| 45 | - '%' |
|
| 43 | + '-', '*', |
|
| 44 | + '^', '@', |
|
| 45 | + '%' |
|
| 46 | 46 | ]; |
| 47 | 47 | |
| 48 | 48 | if (in_array($node->command(), $types) === true) { |
@@ -56,7 +56,7 @@ |
||
| 56 | 56 | $key = -1; |
| 57 | 57 | foreach (synapse()->brain->topic($topic)->triggers() as $index => $info) { |
| 58 | 58 | if ($info->getText() === $string) { |
| 59 | - $trigger= $info; |
|
| 59 | + $trigger = $info; |
|
| 60 | 60 | $key = $index; |
| 61 | 61 | break; |
| 62 | 62 | } |
@@ -102,7 +102,7 @@ discard block |
||
| 102 | 102 | $triggers = $this->determineWordCount($triggers); |
| 103 | 103 | $triggers = $this->determineTypeCount($triggers); |
| 104 | 104 | |
| 105 | - return $triggers->sort(function ($current, $previous) { |
|
| 105 | + return $triggers->sort(function($current, $previous) { |
|
| 106 | 106 | return ($current->getOrder() < $previous->getOrder()) ? -1 : 1; |
| 107 | 107 | })->reverse(); |
| 108 | 108 | } |
@@ -116,7 +116,7 @@ discard block |
||
| 116 | 116 | */ |
| 117 | 117 | protected function determineTypeCount(Collection $triggers): Collection |
| 118 | 118 | { |
| 119 | - return $triggers->each(function (&$trigger) use ($triggers) { |
|
| 119 | + return $triggers->each(function(&$trigger) use ($triggers) { |
|
| 120 | 120 | |
| 121 | 121 | $order = $trigger->getOrder(); |
| 122 | 122 | $type = $trigger->getType(); |
@@ -75,7 +75,7 @@ |
||
| 75 | 75 | $triggers = synapse()->brain->topic($topic)->triggers(); |
| 76 | 76 | |
| 77 | 77 | if ($recursion === synapse()->memory->global()->get('depth')) { |
| 78 | - synapse()->rivescript->warn("Top many recursive calls to :func", ["func" => __CLASS__ . "::" . __FUNCTION__]); |
|
| 78 | + synapse()->rivescript->warn("Top many recursive calls to :func", ["func" => __CLASS__."::".__FUNCTION__]); |
|
| 79 | 79 | return "ERR: Deep Recursion Detected"; |
| 80 | 80 | } |
| 81 | 81 | |