137 lines
3.3 KiB
PHP
137 lines
3.3 KiB
PHP
<?php namespace Oxbow\Repos;
|
|
|
|
|
|
use Illuminate\Support\Str;
|
|
use Oxbow\Page;
|
|
|
|
class PageRepo
|
|
{
|
|
protected $page;
|
|
|
|
/**
|
|
* PageRepo constructor.
|
|
* @param $page
|
|
*/
|
|
public function __construct(Page $page)
|
|
{
|
|
$this->page = $page;
|
|
}
|
|
|
|
public function getById($id)
|
|
{
|
|
return $this->page->findOrFail($id);
|
|
}
|
|
|
|
public function getAll()
|
|
{
|
|
return $this->page->all();
|
|
}
|
|
|
|
public function getBySlug($slug, $bookId)
|
|
{
|
|
return $this->page->where('slug', '=', $slug)->where('book_id', '=', $bookId)->first();
|
|
}
|
|
|
|
public function newFromInput($input)
|
|
{
|
|
$page = $this->page->fill($input);
|
|
return $page;
|
|
}
|
|
|
|
public function countBySlug($slug, $bookId)
|
|
{
|
|
return $this->page->where('slug', '=', $slug)->where('book_id', '=', $bookId)->count();
|
|
}
|
|
|
|
public function destroyById($id)
|
|
{
|
|
$page = $this->getById($id);
|
|
$page->delete();
|
|
}
|
|
|
|
public function getBySearch($term)
|
|
{
|
|
$terms = explode(' ', trim($term));
|
|
$query = $this->page;
|
|
foreach($terms as $term) {
|
|
$query = $query->where('text', 'like', '%'.$term.'%');
|
|
}
|
|
return $query->get();
|
|
}
|
|
|
|
public function getBreadCrumbs($page)
|
|
{
|
|
$tree = [];
|
|
$cPage = $page;
|
|
while($cPage->parent && $cPage->parent->id !== 0) {
|
|
$cPage = $cPage->parent;
|
|
$tree[] = $cPage;
|
|
}
|
|
return count($tree) > 0 ? array_reverse($tree) : false;
|
|
}
|
|
|
|
/**
|
|
* Creates a tree of child pages, Nested by their
|
|
* set parent pages.
|
|
* @param $bookId
|
|
* @param bool $currentPageId
|
|
* @return array
|
|
*/
|
|
public function getTreeByBookId($bookId, $currentPageId = false)
|
|
{
|
|
$topLevelPages = $this->getTopLevelPages($bookId);
|
|
$pageTree = [];
|
|
|
|
foreach($topLevelPages as $key => $topPage) {
|
|
$pageTree[$key] = $this->toArrayTree($topPage, $currentPageId);
|
|
}
|
|
|
|
return $pageTree;
|
|
}
|
|
|
|
/**
|
|
* Creates a page tree array with the supplied page
|
|
* as the parent of the tree.
|
|
* @param $page
|
|
* @param bool $currentPageId
|
|
* @return mixed
|
|
*/
|
|
private function toArrayTree($page, $currentPageId = false)
|
|
{
|
|
$cPage = $page->toSimpleArray();
|
|
$cPage['current'] = ($currentPageId !== false && $cPage['id'] === $currentPageId);
|
|
$cPage['pages'] = [];
|
|
foreach($page->children as $key => $childPage) {
|
|
$cPage['pages'][$key] = $this->toArrayTree($childPage);
|
|
}
|
|
$cPage['hasChildren'] = count($cPage['pages']) > 0;
|
|
return $cPage;
|
|
}
|
|
|
|
/**
|
|
* Gets the pages at the top of the page hierarchy.
|
|
* @param $bookId
|
|
*/
|
|
private function getTopLevelPages($bookId)
|
|
{
|
|
return $this->page->where('book_id', '=', $bookId)->where('page_id', '=', 0)->orderBy('priority')->get();
|
|
}
|
|
|
|
/**
|
|
* Applies a sort map to all applicable pages.
|
|
* @param $sortMap
|
|
* @param $bookId
|
|
*/
|
|
public function applySortMap($sortMap, $bookId)
|
|
{
|
|
foreach($sortMap as $index => $map) {
|
|
$page = $this->getById($map->id);
|
|
if($page->book_id === $bookId) {
|
|
$page->page_id = $map->parent;
|
|
$page->priority = $index;
|
|
$page->save();
|
|
}
|
|
}
|
|
}
|
|
|
|
} |