Lines Matching refs:item
52 foreach($tab as $item){
53 $this->_fillTree($tree, $this->_getNS($item), $item, '');
83 private function _getNS($item) {
84 if($item['type'] === 'd'){
85 // If $item is itself a namespace then:
99 $lastChar = substr($item['id'], -1);
100 $IdSplit = explode(':', $item['id']);
102 if ($item['ns'] !== false){
104 || count(explode(':', $item['ns'])) === count($IdSplit) -2){ // case 2
109 if ($this->str_contains($item['id'], ':')){ // case 4
117 // It $item is a page then:
121 if ($item['ns'] === false) {
125 return explode(':', $item['ns']);
138 private function _fillTree($tree, $keys, $item, $parentId) {
139 if (empty($keys)){ // We've reach the end of the journey. We register the data of $item
140 if($item['type'] === 'd') {
141 $tree->self = $item;
143 $tree->pages []= $item;
145 } else { // We're not at the place of $item in the tree yet, we continue to go down
153 $this->_fillTree($tree->children[$key], $keys, $item, $currentId);
230 * implementations and that those implementation are performing sorts based on $item["sort"].