Skip to main content

Theme table with pager - Drupal 8

public function nodeList() {
    $header = [
      'Nid',
      'Title',
    ];
    $query = \Drupal::database()->select('node', 'n');
    $query->fields('n', ['nid']);
    $pager = $query->extend('Drupal\Core\Database\Query\PagerSelectExtender')->limit(10);
    $results = $pager->execute()->fetchAll();

    foreach ($results as $key => $result) {
      $node = Node::load($result->nid);
      $row = [];
      $row = [
        'nid' => $node->id(),
        'title' => $node->getTitle(),
      ];
      $rows[] = $row;
    }
    $build['table_data'] = [
      '#type' => 'table',
      '#header' => $header,
      '#rows' => $rows,
    ];
    // Finally add the pager.
    $build['pager'] = array(
      '#type' => 'pager'
    );

    return $build;
  }

Comments

Popular posts from this blog

Use Case Diagram for Online Book Store

Online Movie Ticket Booking Sequence Diagram

Linear search & Binary search using Template

Write a program to search an element from a list. Give user the option to perform Linear or Binary search. Use Template functions. #include<iostream> using namespace std; template <class T> void Lsearch(T *a, T item, int n) { int z=0; for(int i=0;i<n;i++) { if(a[i]== item) { z=1; cout<<"\n Item found at position = "<<i+1<<"\n\n"; } else if(z!=1) { z=0; } } if(z==0) cout<<"\n Item not found in the list\n\n"; } template <class T> void Bsearch(T *a, T item, int n) { int beg=0,end=n-1; int mid=beg+end/2; while((a[mid]!=item) && (n>0)) { if(item>a[mid]) beg=mid; else end=mid; mid=(beg+end)/2; n--; } if(a[mid]==item) cout<<"\n Item found at position = "<<mid+1<<"\n\n"; else cout<<"\n Item not found in the list\n\n"; } void main() { int iarr[10] = {2,42,56,86,87,99,323,546,767,886};