脚本宝典收集整理的这篇文章主要介绍了php – 在模型中使用查询的Codeigniter分页,脚本宝典觉得挺不错的,现在分享给大家,也给大家做个参考。
function show_kegiatan($offset,$limit) { $query= $this->db->query("SELECT kegiatan . *,lk . *,fakultas.*,count( kegiatan_review.reviews ) AS 'Komentar',fakultas.* FROM kegiatan INNER JOIN lk ON lk.id_LK = kegiatan.id_LK INNER JOIN fakultas on fakultas.id_fakultas = lk.id_fakultas LEFT OUTER JOIN kegiatan_review ON kegiatan.id_kegiatan = kegiatan_review.id_kegiatan GROUP BY kegiatan.id_kegiatan ORDER BY kegiatan.tahun_periode DESC limit $offset",$limit); if ($query->num_rows() > 0) { return $query->result(); } }
在我的控制器中
public function kegiatan($offset=0) { $data['user']=$this->m_login->get_user($this->session->userdata('sesi_admin')); $jml = $this->db->get('kegiatan'); $config['base_url'] = base_url().'admin/kegiatan'; $config['total_rows'] = $jml->num_rows(); $config['per_page'] = 3; $config['uri_segment'] = 3; $config['full_tag_open'] = "<ul class='pagination pagination-sm' style='position:relative; top:-25px;'>"; $config['full_tag_close'] ="</ul>"; $config['num_tag_open'] = '<li>'; $config['num_tag_close'] = '</li>'; $config['cur_tag_open'] = "<li class='disabled'><li class='active'><a href='#'>"; $config['cur_tag_close'] = "<span class='sr-only'></span></a></li>"; $config['next_tag_open'] = "<li>"; $config['next_tagl_close'] = "</li>"; $config['prev_tag_open'] = "<li>"; $config['prev_tagl_close'] = "</li>"; $config['first_tag_open'] = "<li>"; $config['first_tagl_close'] = "</li>"; $config['last_tag_open'] = "<li>"; $config['last_tagl_close'] = "</li>"; $this->pagination->initialize($config); $data['halaman'] = $this->pagination->create_links(); $data['offset'] = $offset; $data['kegiatan'] = $this->m_admin->show_kegiatan($config['per_page'],$offset); $this->load->templateadmin('in/admin_kegiatan',$data); }
在我的输出中,Offset确实有效,但数据无法成功运行.我的模特怎么了?
limit $offset",$limit
应该
limit $offset,$limit"
以上是脚本宝典为你收集整理的php – 在模型中使用查询的Codeigniter分页全部内容,希望文章能够帮你解决php – 在模型中使用查询的Codeigniter分页所遇到的问题。
本图文内容来源于网友网络收集整理提供,作为学习参考使用,版权属于原作者。
如您有任何意见或建议可联系处理。小编QQ:384754419,请注明来意。