摘要:要實(shí)現(xiàn)的效果都是在同級目錄下的文件,需要服務(wù)器環(huán)境布局黑體
要實(shí)現(xiàn)的效果
都是在同級目錄下的文件,需要服務(wù)器環(huán)境
布局
Document
JS腳本
PHP數(shù)據(jù):
array ( 0 => array ( "signal" => "-", "path" => "/var/www/html/goms-kmg-v4/application/pc/logs/index.html", "file" => "index.html", "sub_file" => array ( ), ), 1 => array ( "signal" => "-", "path" => "/var/www/html/goms-kmg-v4/application/pc/logs/log-2016-11-15.log", "file" => "log-2016-11-15.log", "sub_file" => array ( ), ), 2 => array ( "signal" => "-", "path" => "/var/www/html/goms-kmg-v4/application/pc/logs/log-2016-11-07.log", "file" => "log-2016-11-07.log", "sub_file" => array ( ), ), 3 => array ( "signal" => "-", "path" => "/var/www/html/goms-kmg-v4/application/pc/logs/log-2016-11-11.log", "file" => "log-2016-11-11.log", "sub_file" => array ( ), ), 4 => array ( "signal" => "-", "path" => "/var/www/html/goms-kmg-v4/application/pc/logs/log-2016-11-14.log", "file" => "log-2016-11-14.log", "sub_file" => array ( ), ), 5 => array ( "signal" => "-", "path" => "/var/www/html/goms-kmg-v4/application/pc/logs/out.log", "file" => "out.log", "sub_file" => array ( ), ), 6 => array ( "signal" => "d", "path" => "/var/www/html/goms-kmg-v4/application/pc/logs/flight_dynamic_update", "file" => "flight_dynamic_update", "sub_file" => array ( 0 => array ( "signal" => "d", "path" => "/var/www/html/goms-kmg-v4/application/pc/logs/flight_dynamic_update/2016-10-17", "file" => "2016-10-17", "sub_file" => array ( 0 => array ( "signal" => "-", "path" => "/var/www/html/goms-kmg-v4/application/pc/logs/flight_dynamic_update/2016-10-17/flight_add_sql.log", "file" => "flight_add_sql.log", "sub_file" => array ( ), ), ), ), ), ), 7 => array ( "signal" => "-", "path" => "/var/www/html/goms-kmg-v4/application/pc/logs/log-2016-11-13.log", "file" => "log-2016-11-13.log", "sub_file" => array ( ), ), 8 => array ( "signal" => "-", "path" => "/var/www/html/goms-kmg-v4/application/pc/logs/log-2016-11-08.log", "file" => "log-2016-11-08.log", "sub_file" => array ( ), ), 9 => array ( "signal" => "-", "path" => "/var/www/html/goms-kmg-v4/application/pc/logs/log-2016-11-04.log", "file" => "log-2016-11-04.log", "sub_file" => array ( ), ), 10 => array ( "signal" => "-", "path" => "/var/www/html/goms-kmg-v4/application/pc/logs/555.log", "file" => "555.log", "sub_file" => array ( ), ), 11 => array ( "signal" => "-", "path" => "/var/www/html/goms-kmg-v4/application/pc/logs/pm.log", "file" => "pm.log", "sub_file" => array ( ), ), 12 => array ( "signal" => "-", "path" => "/var/www/html/goms-kmg-v4/application/pc/logs/log-2016-11-09.log", "file" => "log-2016-11-09.log", "sub_file" => array ( ), ), 13 => array ( "signal" => "-", "path" => "/var/www/html/goms-kmg-v4/application/pc/logs/log-2016-11-10.log", "file" => "log-2016-11-10.log", "sub_file" => array ( ), ), 14 => array ( "signal" => "-", "path" => "/var/www/html/goms-kmg-v4/application/pc/logs/in.log", "file" => "in.log", "sub_file" => array ( ), ), ), ); echo json_encode($data);
文采不好,就不在這里詳細(xì)介紹了,但是代碼是全給了,想測試的話,直接把代碼考過去就行了。。。
文章版權(quán)歸作者所有,未經(jīng)允許請勿轉(zhuǎn)載,若此文章存在違規(guī)行為,您可以聯(lián)系管理員刪除。
轉(zhuǎn)載請注明本文地址:http://m.specialneedsforspecialkids.com/yun/22061.html
摘要:二叉查找樹是一種查找效率非常高的數(shù)據(jù)結(jié)構(gòu),它有三個(gè)特點(diǎn)。二叉查找樹的結(jié)構(gòu)不適合數(shù)據(jù)庫,因?yàn)樗牟檎倚逝c層數(shù)相關(guān)。樹是對二叉查找樹的改進(jìn)。備份機(jī)制保存數(shù)據(jù)庫的副本。 轉(zhuǎn)載自:阮一峰的網(wǎng)絡(luò)日志 所有應(yīng)用軟件之中,數(shù)據(jù)庫可能是最復(fù)雜的。 MySQL的手冊有3000多頁,PostgreSQL的手冊有2000多頁,Oracle的手冊更是比它們相加還要厚。 但是,自己寫一個(gè)最簡單...
摘要:轉(zhuǎn)載史上最簡單的平衡樹無旋作者博客地址使用此文件時(shí)請保留上述信息謝謝合作覺得文章不錯(cuò)請點(diǎn)擊鏈接為博客點(diǎn)贊高能預(yù)警所有示例代碼都是數(shù)組版的歡迎前置知識(shí)線段樹請確保你完全理解最基礎(chǔ)的線段樹和區(qū)間加法和區(qū)間求和一簡介無旋又稱是范浩強(qiáng)大佬發(fā)明的一種 【轉(zhuǎn)載】史上最簡單的平衡樹——無旋Treap 作者:fzszkl 博客地址:https://ac.nowcoder.com/discu... ...
摘要:不同于其它靜態(tài)編程語言,實(shí)現(xiàn)組合模式的難點(diǎn)是保持樹對象與葉對象之間接口保持統(tǒng)一,可借助定制接口規(guī)范,實(shí)現(xiàn)類型約束。誤區(qū)規(guī)避組合不是繼承,樹葉對象并不是父子對象組合模式的樹型結(jié)構(gòu)是一種聚合的關(guān)系,而不是。 showImg(https://segmentfault.com/img/bVbu79V?w=800&h=600); 組合模式:又叫 部分整體 模式,將對象組合成樹形結(jié)構(gòu),以表示 部分...
摘要:在樹中,每個(gè)節(jié)點(diǎn)表示一個(gè)狀態(tài),每條邊表示一個(gè)字符,從根節(jié)點(diǎn)到葉子節(jié)點(diǎn)經(jīng)過的邊即表示一個(gè)詞條。查找一個(gè)詞條最多耗費(fèi)的時(shí)間只受詞條長度影響,因此的查找性能是很高的,跟哈希算法的性能相當(dāng)。 Last-Modified: 2019年5月10日15:25:35 參考文章 c++ 使用map實(shí)現(xiàn)Trie樹 關(guān)鍵詞過濾擴(kuò)展,用于檢查一段文本中是否出現(xiàn)敏感詞,基于Double-Array Trie...
摘要:圖是構(gòu)成網(wǎng)頁的超文本標(biāo)記語言中的標(biāo)簽相互關(guān)聯(lián)關(guān)系所構(gòu)成的樹。節(jié)點(diǎn)節(jié)點(diǎn)是樹的基本構(gòu)成部分。子樹子樹是一個(gè)父節(jié)點(diǎn)的某個(gè)子節(jié)點(diǎn)的所有邊和后代節(jié)點(diǎn)所構(gòu)成的集合。高度樹的高度等于所有節(jié)點(diǎn)的層數(shù)的最大值。每個(gè)子樹的根節(jié)點(diǎn)和其父樹的根節(jié)點(diǎn)之間通過邊相連。 樹的例子 我們已經(jīng)學(xué)過了像棧和隊(duì)列這樣的線性數(shù)據(jù)結(jié)構(gòu),同時(shí)我們對遞歸也有了一定的了解,現(xiàn)在讓我們來看看另一種常見的數(shù)據(jù)結(jié)構(gòu)——樹(Tree)。樹在...
閱讀 1954·2021-11-19 09:40
閱讀 2145·2021-10-09 09:43
閱讀 3300·2021-09-06 15:00
閱讀 2818·2019-08-29 13:04
閱讀 2773·2019-08-26 11:53
閱讀 3535·2019-08-26 11:46
閱讀 2328·2019-08-26 11:38
閱讀 396·2019-08-26 11:27