j_rfid_project/app/Service/Service.php

<?php

namespace App\Service;


/**
 * 公用的公共服务
 * @package App\Models
 */
class Service
{

    public $log;
    public $total = 0;

    public function __construct()
    {

    }

    //分页共用
    public function limit($db, $columns, $request)
    {
        $per_page = $request['page_size'] ?? 9999;
        $page = $request['page_index'] ?? 1;
        $return = $db->paginate($per_page, $columns, 'page', $page)->toArray();

        $data['total'] = $return['total'];
        $data['data'] = $return['data'];
        return $data;
    }


    //抽象一个查询条件，省的每天写很多行
    protected function is_exist_db($data, $word, $words, $db, $formula = '=', $type = '')
    {
        if (isset($data[$word]) && ($data[$word] !== null && $data[$word] !== '' && $data[$word] !== [])) {
            switch ($type) {
                case 'time':
                    $data[$word] = ctype_digit($data[$word]) ? $data[$word] : strtotime($data[$word]);
                    if ($formula == '<'||$formula == '<=') $data[$word] += 86400;
                    $db = $db->where($words, $formula, $data[$word]);
                    break;
                case 'like':
                    $db = $db->where($words, $type, '%' . $data[$word] . '%');
                    break;
                case 'in':
                    if (is_array($data[$word])) {
                        $db = $db->wherein($words, $data[$word]);
                    } else {
                        $db = $db->wherein($words, explode(',', $data[$word]));
                    }

                    break;
                default:
                    $db = $db->where($words, $formula, $data[$word]);
                    break;
            }

            return $db;
        }
        return $db;
    }


    //判断是否为空
    protected function isEmpty($data, $word)
    {
        if (isset($data[$word]) && (!empty($data[$word]) || $data[$word] === '0'|| $data[$word] === 0)) return false;
        return true;
    }


    //递归处理数据成子父级关系
    public function makeTree($parentId, &$node)
    {
        $tree = [];
        foreach ($node as $key => $value) {
            if ($value['parent_id'] == $parentId) {
                $tree[$value['id']] = $value;
                unset($node[$key]);
                if (isset($tree[$value['id']]['children'])) {
                    $tree[$value['id']]['children'] = array_merge($tree[$value['id']]['children'], $this->makeTree($value['id'], $node));
                } else {
                    $tree[$value['id']]['children'] = $this->makeTree($value['id'], $node);
                }
            }
        }
        return $tree;
    }

    //进行递归处理数组的排序问题
    public function set_sort_circle($data){
        foreach ($data as $k=>$v){
//            var_dump($v);die;
            if(isset($v['children'])&&!empty($v['children'])){
                $data[$k]['children'] =  $this->set_sort_circle($v['children']);
            }
        }
        $data = array_merge($data);

        return $data;
    }


    //根据编码规则获取每一级的code
    public function get_rule_code($code, $rule)
    {
        $rules = [];
        $num = 0;
        foreach ($rule as $v) {
            $num += $v['num'];
            $code = substr($code, 0, $num);
            if (strlen($code) != $num) continue;
            $rules[] = $code;

        }

        return $rules;
    }



    function curlOpen($url, $config = array())
    {
        $arr = array('post' => false,'referer' => $url,'cookie' => '', 'useragent' => 'Mozilla/4.0 (compatible; MSIE 8.0; Windows NT 6.0; Trident/4.0; SLCC1; .NET CLR 2.0.50727; .NET CLR 3.0.04506; customie8)', 'timeout' => 100, 'return' => true, 'proxy' => '', 'userpwd' => '', 'nobody' => false,'header'=>array(),'gzip'=>true,'ssl'=>true,'isupfile'=>false,'returnheader'=>false,'request'=>'post');
        $arr = array_merge($arr, $config);
        $ch = curl_init();

        curl_setopt($ch, CURLOPT_URL, $url);
        curl_setopt($ch, CURLOPT_RETURNTRANSFER, $arr['return']);
        curl_setopt($ch, CURLOPT_NOBODY, $arr['nobody']);
        curl_setopt($ch, CURLOPT_FOLLOWLOCATION, 1);
        curl_setopt($ch, CURLOPT_USERAGENT, $arr['useragent']);
        curl_setopt($ch, CURLOPT_REFERER, $arr['referer']);
        curl_setopt($ch, CURLOPT_TIMEOUT, $arr['timeout']);


        curl_setopt($ch, CURLOPT_HEADER, $arr['returnheader']);//��ȡheader
        if($arr['gzip']) curl_setopt($ch, CURLOPT_ENCODING, 'gzip,deflate');
        if($arr['ssl'])
        {
            curl_setopt($ch, CURLOPT_SSL_VERIFYPEER, false);
            curl_setopt($ch, CURLOPT_SSL_VERIFYHOST, false);
        }
        if(!empty($arr['cookie']))
        {
            curl_setopt($ch, CURLOPT_COOKIEJAR, $arr['cookie']);
            curl_setopt($ch, CURLOPT_COOKIEFILE, $arr['cookie']);
        }

        if(!empty($arr['proxy']))
        {
            //curl_setopt($ch, CURLOPT_PROXYTYPE, CURLPROXY_HTTP);
            curl_setopt ($ch, CURLOPT_PROXY, $arr['proxy']);
            if(!empty($arr['userpwd']))
            {
                curl_setopt($ch,CURLOPT_PROXYUSERPWD,$arr['userpwd']);
            }
        }

        //ip�Ƚ����⣬�ü�ֵ��ʾ
        if(!empty($arr['header']['ip']))
        {
            array_push($arr['header'],'X-FORWARDED-FOR:'.$arr['header']['ip'],'CLIENT-IP:'.$arr['header']['ip']);
            unset($arr['header']['ip']);
        }
        $arr['header'] = array_filter($arr['header']);

        if(!empty($arr['header']))
        {
            curl_setopt($ch, CURLOPT_HTTPHEADER, $arr['header']);
        }

        if($arr['request'] === 'put'){
            curl_setopt ($ch, CURLOPT_CUSTOMREQUEST, "PUT");
            curl_setopt($ch, CURLOPT_POSTFIELDS,$arr['post']);
        }elseif($arr['post'] != false)
        {
            curl_setopt($ch, CURLOPT_POST, true);
            if(is_array($arr['post']) && $arr['isupfile'] === false)
            {
                $post = http_build_query($arr['post']);
            }
            else
            {
                $post = $arr['post'];
            }
            curl_setopt($ch, CURLOPT_POSTFIELDS, $post);
        }

        $result = curl_exec($ch);
        curl_close($ch);

        return $result;
    }

    function getAllIdsArr($data, $pid = 0, $prefix = '', &$result = []) {
        foreach ($data as $node) {
            if ($node['parent_id'] == $pid) {
                $id = $prefix . $node['id'];
                $result[] = $id;
                $this->getAllIdsArr($data, $node['id'], $id . ',', $result);
            }
        }
        return $result;
    }

    function getLongestStr($arr = [], $searchStr){
        if(empty($arr) || ! $searchStr) return '';
        if(! is_string($searchStr)) $searchStr = (string)$searchStr;

        $longest = '';
        foreach ($arr as $str) {
            if (strpos($str, $searchStr) !== false && strlen($str) > strlen($longest)) {
                $longest = $str;
            }
        }
        return $longest;
    }

    function getAllDescendants($data, $id) {
        $result = array(); // 存储结果的数组

        foreach ($data as $node) {
            if ($node['parent_id'] == $id) { // 如果当前节点的父 ID 等于指定 ID，则将该节点添加到结果中
                $result[] = $node['id'];
                // 递归查询该节点的所有子孙节点，并将结果合并到结果数组中
                $result = array_merge($result, $this->getAllDescendants($data, $node['id']));
            }
        }

        return $result;
    }
}