Service.php 9.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310
  1. <?php
  2. namespace App\Service;
  3. use Illuminate\Support\Facades\Cache;
  4. use Illuminate\Support\Facades\Redis;
  5. /**
  6. * 公用的公共服务
  7. * @package App\Models
  8. */
  9. class Service
  10. {
  11. public $log;
  12. public $total = 0;
  13. public function __construct()
  14. {
  15. }
  16. //分页共用
  17. public function limit($db, $columns, $request)
  18. {
  19. $per_page = $request['page_size'] ?? 20;
  20. $page = $request['page_index'] ?? 1;
  21. $return = $db->paginate($per_page, $columns, 'page', $page)->toArray();
  22. $data['total'] = $return['total'];
  23. $data['data'] = $return['data'];
  24. return $data;
  25. }
  26. //抽象一个查询条件,省的每天写很多行
  27. protected function is_exist_db($data, $word, $words, $db, $formula = '=', $type = '')
  28. {
  29. if (isset($data[$word]) && ($data[$word] !== null && $data[$word] !== '' && $data[$word] !== [])) {
  30. switch ($type) {
  31. case 'time':
  32. $data[$word] = ctype_digit($data[$word]) ? $data[$word] : strtotime($data[$word]);
  33. if ($formula == '<'||$formula == '<=') $data[$word] += 86400;
  34. $db = $db->where($words, $formula, $data[$word]);
  35. break;
  36. case 'like':
  37. $db = $db->where($words, $type, '%' . $data[$word] . '%');
  38. break;
  39. case 'in':
  40. if (is_array($data[$word])) {
  41. $db = $db->wherein($words, $data[$word]);
  42. } else {
  43. $db = $db->wherein($words, explode(',', $data[$word]));
  44. }
  45. break;
  46. default:
  47. $db = $db->where($words, $formula, $data[$word]);
  48. break;
  49. }
  50. return $db;
  51. }
  52. return $db;
  53. }
  54. //判断是否为空
  55. protected function isEmpty($data, $word)
  56. {
  57. if (isset($data[$word]) && (!empty($data[$word]) || $data[$word] === '0'|| $data[$word] === 0)) return false;
  58. return true;
  59. }
  60. //递归处理数据成子父级关系
  61. public function makeTree($parentId, &$node)
  62. {
  63. $tree = [];
  64. foreach ($node as $key => $value) {
  65. if ($value['parent_id'] == $parentId) {
  66. $tree[$value['id']] = $value;
  67. unset($node[$key]);
  68. if (isset($tree[$value['id']]['children'])) {
  69. $tree[$value['id']]['children'] = array_merge($tree[$value['id']]['children'], $this->makeTree($value['id'], $node));
  70. } else {
  71. $tree[$value['id']]['children'] = $this->makeTree($value['id'], $node);
  72. }
  73. }
  74. }
  75. return $tree;
  76. }
  77. //进行递归处理数组的排序问题
  78. public function set_sort_circle($data){
  79. foreach ($data as $k=>$v){
  80. // var_dump($v);die;
  81. if(isset($v['children'])&&!empty($v['children'])){
  82. $data[$k]['children'] = $this->set_sort_circle($v['children']);
  83. }
  84. }
  85. $data = array_merge($data);
  86. return $data;
  87. }
  88. //根据编码规则获取每一级的code
  89. public function get_rule_code($code, $rule)
  90. {
  91. $rules = [];
  92. $num = 0;
  93. foreach ($rule as $v) {
  94. $num += $v['num'];
  95. $code = substr($code, 0, $num);
  96. if (strlen($code) != $num) continue;
  97. $rules[] = $code;
  98. }
  99. return $rules;
  100. }
  101. function curlOpen($url, $config = array())
  102. {
  103. $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');
  104. $arr = array_merge($arr, $config);
  105. $ch = curl_init();
  106. curl_setopt($ch, CURLOPT_URL, $url);
  107. curl_setopt($ch, CURLOPT_RETURNTRANSFER, $arr['return']);
  108. curl_setopt($ch, CURLOPT_NOBODY, $arr['nobody']);
  109. curl_setopt($ch, CURLOPT_FOLLOWLOCATION, 1);
  110. curl_setopt($ch, CURLOPT_USERAGENT, $arr['useragent']);
  111. curl_setopt($ch, CURLOPT_REFERER, $arr['referer']);
  112. curl_setopt($ch, CURLOPT_TIMEOUT, $arr['timeout']);
  113. curl_setopt($ch, CURLOPT_HEADER, $arr['returnheader']);//��ȡheader
  114. if($arr['gzip']) curl_setopt($ch, CURLOPT_ENCODING, 'gzip,deflate');
  115. if($arr['ssl'])
  116. {
  117. curl_setopt($ch, CURLOPT_SSL_VERIFYPEER, false);
  118. curl_setopt($ch, CURLOPT_SSL_VERIFYHOST, false);
  119. }
  120. if(!empty($arr['cookie']))
  121. {
  122. curl_setopt($ch, CURLOPT_COOKIEJAR, $arr['cookie']);
  123. curl_setopt($ch, CURLOPT_COOKIEFILE, $arr['cookie']);
  124. }
  125. if(!empty($arr['proxy']))
  126. {
  127. //curl_setopt($ch, CURLOPT_PROXYTYPE, CURLPROXY_HTTP);
  128. curl_setopt ($ch, CURLOPT_PROXY, $arr['proxy']);
  129. if(!empty($arr['userpwd']))
  130. {
  131. curl_setopt($ch,CURLOPT_PROXYUSERPWD,$arr['userpwd']);
  132. }
  133. }
  134. //ip�Ƚ����⣬�ü�ֵ��ʾ
  135. if(!empty($arr['header']['ip']))
  136. {
  137. array_push($arr['header'],'X-FORWARDED-FOR:'.$arr['header']['ip'],'CLIENT-IP:'.$arr['header']['ip']);
  138. unset($arr['header']['ip']);
  139. }
  140. $arr['header'] = array_filter($arr['header']);
  141. if(!empty($arr['header']))
  142. {
  143. curl_setopt($ch, CURLOPT_HTTPHEADER, $arr['header']);
  144. }
  145. if($arr['request'] === 'put'){
  146. curl_setopt ($ch, CURLOPT_CUSTOMREQUEST, "PUT");
  147. curl_setopt($ch, CURLOPT_POSTFIELDS,$arr['post']);
  148. }elseif($arr['post'] != false)
  149. {
  150. curl_setopt($ch, CURLOPT_POST, true);
  151. if(is_array($arr['post']) && $arr['isupfile'] === false)
  152. {
  153. $post = http_build_query($arr['post']);
  154. }
  155. else
  156. {
  157. $post = $arr['post'];
  158. }
  159. curl_setopt($ch, CURLOPT_POSTFIELDS, $post);
  160. }
  161. $result = curl_exec($ch);
  162. curl_close($ch);
  163. return $result;
  164. }
  165. function getAllIdsArr($data, $pid = 0, $prefix = '', &$result = []) {
  166. foreach ($data as $node) {
  167. if ($node['parent_id'] == $pid) {
  168. $id = $prefix . $node['id'];
  169. $result[] = $id;
  170. $this->getAllIdsArr($data, $node['id'], $id . ',', $result);
  171. }
  172. }
  173. return $result;
  174. }
  175. function getLongestStr($arr = [], $searchStr){
  176. if(empty($arr) || ! $searchStr) return '';
  177. if(! is_string($searchStr)) $searchStr = (string)$searchStr;
  178. $longest = '';
  179. foreach ($arr as $str) {
  180. if (strpos($str, $searchStr) !== false && strlen($str) > strlen($longest)) {
  181. $longest = $str;
  182. }
  183. }
  184. return $longest;
  185. }
  186. function getAllDescendants($data, $id) {
  187. $result = array(); // 存储结果的数组
  188. foreach ($data as $node) {
  189. if ($node['parent_id'] == $id) { // 如果当前节点的父 ID 等于指定 ID,则将该节点添加到结果中
  190. $result[] = $node['id'];
  191. // 递归查询该节点的所有子孙节点,并将结果合并到结果数组中
  192. $result = array_merge($result, $this->getAllDescendants($data, $node['id']));
  193. }
  194. }
  195. return $result;
  196. }
  197. /**
  198. * @param $key
  199. * @return bool
  200. */
  201. function isLock($key){
  202. if(Cache::has($key)){
  203. $status = false;
  204. }else{
  205. $status = Cache::add($key,1,1);
  206. }
  207. return $status;
  208. }
  209. /**
  210. * @param $key
  211. */
  212. function delLock($key){
  213. Cache::forget($key);
  214. }
  215. //后台端 某些需要限制请求频率的接口
  216. public function limitingSendRequestBackg($key,$ttl = 5){
  217. if($ttl < 5) $ttl = 5;
  218. // 使用Redis Facade设置,当键名不存在时才设置成功
  219. if (Redis::setnx($key, 1)) {
  220. Redis::expire($key, $ttl); //多少秒后过期
  221. return [true, ''];
  222. }
  223. return [false,'操作频繁, 请在 ' . $ttl . '秒后重试'];
  224. }
  225. // 校验域名是否通畅可达
  226. // $domain baidu.com 不要带http这些协议头
  227. // gethostbyname() 函数可能会受到 PHP 配置中的 allow_url_fopen 和 disable_functions 选项的限制
  228. function isDomainAvailable($domain) {
  229. $ip = gethostbyname($domain);
  230. dd(filter_var($ip, FILTER_VALIDATE_IP) === false);
  231. // 如果解析失败或者返回的 IP 地址与输入的域名相同,则说明域名无效
  232. if ($ip === $domain || filter_var($ip, FILTER_VALIDATE_IP) === false) return false;
  233. return true;
  234. }
  235. function isHostReachable($host, $port = 80, $timeout = 5) {
  236. if (filter_var($host, FILTER_VALIDATE_IP) !== false) {
  237. // 直接使用 IP 地址
  238. $ip = $host;
  239. } else {
  240. // 获取主机名对应的 IP 地址
  241. $ip = gethostbyname($host);
  242. if ($ip === $host) {
  243. // 如果 gethostbyname 返回原始主机名,则无法解析
  244. return false;
  245. }
  246. }
  247. // 尝试连接到服务器
  248. $socket = @fsockopen($ip, $port, $errno, $errstr, $timeout);
  249. if ($socket) {
  250. fclose($socket);
  251. return true; // 成功连接
  252. }
  253. return false; // 连接失败
  254. }
  255. }