k' => $rank)); return $r; } /* * @param int $page 页数 * @param int $pagesize 每页显示数量 * @param bool $desc 排序TRUE倒序 FALSE升序 * @return mixed * 遍历所有主题tid */ function page_find($page = 1, $pagesize = 20, $desc = TRUE) { $orderby = TRUE == $desc ? -1 : 1; $arrlist = page__find($cond = array(), array('tid' => $orderby), $page, $pagesize, 'tid', array('tid','rank')); return $arrlist; } /* * @param $fid 版块fid 支持数组 $fid = array(1,2,3) * @param int $page 页数 * @param int $pagesize 每页显示数量 * @param bool $desc 排序TRUE降序 FALSE升序 * @return mixed 返回遍历tid数据 */ function page_find_by_fid($fid, $page = 1, $pagesize = 1000, $desc = TRUE) { $orderby = TRUE == $desc ? -1 : 1; $arrlist = page__find($cond = array('fid' => $fid), array('rank' => $orderby), $page, $pagesize, 'tid', array('tid','rank')); return $arrlist; } /* * @param $tid 主题tid * @return bool 返回FALSE失败 TRUE成功 */ function page_delete($tid) { if (empty($tid)) return FALSE; $r = page__delete(array('tid' => $tid)); return $r; } function page_count() { $n = page__count(); return $n; } /* * @param $fid 版块fid * @return mixed 返回版块下主题数量 */ function page_fid_count($fid) { $n = page__count(array('fid' => $fid)); return $n; } ?> $v = implode(",", $v); $temp[] = $v; } // 去掉重复的字符串,也就是重复的一维数组 $temp = array_unique($temp); // 再将拆开的数组重新组装 $output = array(); foreach ($temp as $k => $v) { if ($stkeep) $k = $starr[$k]; if ($ndformat) { $temparr = explode(",", $v); foreach ($temparr as $ndkey => $ndval) $output[$k][$ndarr[$ndkey]] = $ndval; } else $output[$k] = explode(",", $v); } return $output; } // 合并二维数组 如重复 值以第一个数组值为准 function array2_merge($array1, $array2, $key = '') { if (empty($array1) || empty($array2)) return NULL; $arr = array(); foreach ($array1 as $k => $v) { isset($v[$key]) ? $arr[$v[$key]] = array_merge($v, $array2[$k]) : $arr[] = array_merge($v, $array2[$k]); } return $arr; } /* * 对二维数组排序 两个数组必须有一个相同的键值 * $array1 需要排序数组 * $array2 按照该数组key排序 * */ function array2_sort_key($array1, $array2, $key = '') { if (empty($array1) || empty($array2)) return NULL; $arr = array(); foreach ($array2 as $k => $v) { if (isset($v[$key]) && $v[$key] == $array1[$v[$key]][$key]) { $arr[$v[$key]] = $array1[$v[$key]]; } else { $arr[] = $v; } } return $arr; } ?>模式