日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

當前位置: 首頁 > 编程资源 > 编程问答 >内容正文

编程问答

bugly中批量隐藏版本

發布時間:2023/12/6 编程问答 35 豆豆
生活随笔 收集整理的這篇文章主要介紹了 bugly中批量隐藏版本 小編覺得挺不錯的,現在分享給大家,幫大家做個參考.

App項目使用Bugly的內測分發功能進行整包的測試,但日積月累之后,版本就會特別多。而線上同時跑的版本可能不過三個左右,那么多版本會干擾到查看崩潰、選擇版本,如何隱藏呢?

右上角,更多 –> 產品設置 –> 版本管理

可是bugly有bug,只能設置顯示,不能設置隱藏 >_<,好幾十個版本要一個一個去點擊隱藏,好麻煩,所以就用Fiddler抓了一下包然后整了一個腳本。

注:本想直接用一個for循環里 new Image().src 的方法直接批量請求,但發現它請求的時候參數fsn每次都不一樣,而且頭里面加了X-token,所以只能去扒它的代碼了,用webpack發布的腳本,對源碼進行了適當的修改。

// uuid.js // // Copyright (c) 2010-2012 Robert Kieffer // MIT License - http://opensource.org/licenses/mit-license.php // Unique ID creation requires a high quality random # generator. We feature // detect to determine the best RNG source, normalizing to a function that // returns 128-bits of randomness, since that's what's usually required // var _rng = require('./rng'); var rng;// var crypto = global.crypto || global.msCrypto; // for IE 11 // if (crypto && crypto.getRandomValues) { // // WHATWG crypto-based RNG - http://wiki.whatwg.org/wiki/Crypto // // Moderately fast, high quality // var _rnds8 = new Uint8Array(16); // rng = function whatwgRNG() { // crypto.getRandomValues(_rnds8); // return _rnds8; // }; // }if (!rng) {// Math.random()-based (RNG)// // If all else fails, use Math.random(). It's fast, but is of unspecified// quality.var _rnds = new Array(16);rng = function() {for (var i = 0, r; i < 16; i++) {if ((i & 0x03) === 0) r = Math.random() * 0x100000000;_rnds[i] = r >>> ((i & 0x03) << 3) & 0xff;}return _rnds;}; }// module.exports = rng; var _rng = rng;// // WEBPACK FOOTER // ./~/uuid/rng-browser.js // module id = 955 // module chunks = 0// Maps for number <-> hex string conversion var _byteToHex = []; var _hexToByte = {}; for (var i = 0; i < 256; i++) {_byteToHex[i] = (i + 0x100).toString(16).substr(1);_hexToByte[_byteToHex[i]] = i; }// **`parse()` - Parse a UUID into it's component bytes** function parse(s, buf, offset) {var i = (buf && offset) || 0,ii = 0;buf = buf || [];s.toLowerCase().replace(/[0-9a-f]{2}/g, function(oct) {if (ii < 16) { // Don't overflow!buf[i + ii++] = _hexToByte[oct];}});// Zero out remaining bytes if string was shortwhile (ii < 16) {buf[i + ii++] = 0;}return buf; }// **`unparse()` - Convert UUID byte array (ala parse()) into a string** function unparse(buf, offset) {var i = offset || 0,bth = _byteToHex;return bth[buf[i++]] + bth[buf[i++]] +bth[buf[i++]] + bth[buf[i++]] + '-' +bth[buf[i++]] + bth[buf[i++]] + '-' +bth[buf[i++]] + bth[buf[i++]] + '-' +bth[buf[i++]] + bth[buf[i++]] + '-' +bth[buf[i++]] + bth[buf[i++]] +bth[buf[i++]] + bth[buf[i++]] +bth[buf[i++]] + bth[buf[i++]]; }// **`v1()` - Generate time-based UUID** // // Inspired by https://github.com/LiosK/UUID.js // and http://docs.python.org/library/uuid.html// random #'s we need to init node and clockseq var _seedBytes = _rng();// Per 4.5, create and 48-bit node id, (47 random bits + multicast bit = 1) var _nodeId = [_seedBytes[0] | 0x01,_seedBytes[1], _seedBytes[2], _seedBytes[3], _seedBytes[4], _seedBytes[5] ];// Per 4.2.2, randomize (14 bit) clockseq var _clockseq = (_seedBytes[6] << 8 | _seedBytes[7]) & 0x3fff;// Previous uuid creation time var _lastMSecs = 0,_lastNSecs = 0;// See https://github.com/broofa/node-uuid for API details function v1(options, buf, offset) {var i = buf && offset || 0;var b = buf || [];options = options || {};var clockseq = options.clockseq !== undefined ? options.clockseq : _clockseq;// UUID timestamps are 100 nano-second units since the Gregorian epoch,// (1582-10-15 00:00). JSNumbers aren't precise enough for this, so// time is handled internally as 'msecs' (integer milliseconds) and 'nsecs'// (100-nanoseconds offset from msecs) since unix epoch, 1970-01-01 00:00.var msecs = options.msecs !== undefined ? options.msecs : new Date().getTime();// Per 4.2.1.2, use count of uuid's generated during the current clock// cycle to simulate higher resolution clockvar nsecs = options.nsecs !== undefined ? options.nsecs : _lastNSecs + 1;// Time since last uuid creation (in msecs)var dt = (msecs - _lastMSecs) + (nsecs - _lastNSecs) / 10000;// Per 4.2.1.2, Bump clockseq on clock regressionif (dt < 0 && options.clockseq === undefined) {clockseq = clockseq + 1 & 0x3fff;}// Reset nsecs if clock regresses (new clockseq) or we've moved onto a new// time intervalif ((dt < 0 || msecs > _lastMSecs) && options.nsecs === undefined) {nsecs = 0;}// Per 4.2.1.2 Throw error if too many uuids are requestedif (nsecs >= 10000) {throw new Error('uuid.v1(): Can\'t create more than 10M uuids/sec');}_lastMSecs = msecs;_lastNSecs = nsecs;_clockseq = clockseq;// Per 4.1.4 - Convert from unix epoch to Gregorian epochmsecs += 12219292800000;// `time_low`var tl = ((msecs & 0xfffffff) * 10000 + nsecs) % 0x100000000;b[i++] = tl >>> 24 & 0xff;b[i++] = tl >>> 16 & 0xff;b[i++] = tl >>> 8 & 0xff;b[i++] = tl & 0xff;// `time_mid`var tmh = (msecs / 0x100000000 * 10000) & 0xfffffff;b[i++] = tmh >>> 8 & 0xff;b[i++] = tmh & 0xff;// `time_high_and_version`b[i++] = tmh >>> 24 & 0xf | 0x10; // include versionb[i++] = tmh >>> 16 & 0xff;// `clock_seq_hi_and_reserved` (Per 4.2.2 - include variant)b[i++] = clockseq >>> 8 | 0x80;// `clock_seq_low`b[i++] = clockseq & 0xff;// `node`var node = options.node || _nodeId;for (var n = 0; n < 6; n++) {b[i + n] = node[n];}return buf ? buf : unparse(b); }// **`v4()` - Generate random UUID**// See https://github.com/broofa/node-uuid for API details function v4(options, buf, offset) {// Deprecated - 'format' argument, as supported in v1.2var i = buf && offset || 0;if (typeof(options) == 'string') {buf = options == 'binary' ? new Array(16) : null;options = null;}options = options || {};var rnds = options.random || (options.rng || _rng)();// Per 4.4, set bits for version and `clock_seq_hi_and_reserved`rnds[6] = (rnds[6] & 0x0f) | 0x40;rnds[8] = (rnds[8] & 0x3f) | 0x80;// Copy bytes to buffer, if providedif (buf) {for (var ii = 0; ii < 16; ii++) {buf[i + ii] = rnds[ii];}}return buf || unparse(rnds); }// Export public API var uuid = v4; uuid.v1 = v1; uuid.v4 = v4; uuid.parse = parse; uuid.unparse = unparse;function $param(json) {return Object.keys(json).reduce((sum, key) => {return `${(sum.length ? `${sum}&` : sum)}${key}=${json[key]}`;}, ''); }function getCookie(name) {var arr, reg = new RegExp("(^| )" + name + "=([^;]*)(;|$)");if (arr = document.cookie.match(reg))return unescape(arr[2]);elsereturn null; }// 根據php打到cookie的skey值生成一個token,然后把這個值塞到請求頭 function getToken() {/* eslint-disable no-bitwise*/var skey = getCookie('token-skey');let hash = 5381;if (skey) {for (let i = 0, len = skey.length; i < len; ++i) {hash += (hash << 5 & 0x7fffffff) + skey.charAt(i).charCodeAt();}return hash & 0x7fffffff;} }var APP_JSON_CONTENT_TYPE = 'application/json;charset=utf-8'; var REG_URL_PARAM = /\{(\w+)\}/ig; var basehttp = "https://bugly.qq.com/v2"; var baseUrl = "https://bugly.qq.com/v2";var apiBaseUrl = "https://api.bugly.qq.com/bugly2.0/";function ajaxAsync(method, uri, data = {}, options) {var headers = {method,credentials: 'include',headers: {'Content-Type': APP_JSON_CONTENT_TYPE,Accept: APP_JSON_CONTENT_TYPE,'X-token': getToken(),},};// var mmHeader = {// method: 'POST',// credentials: 'include',// headers: {// 'Content-Type': APP_JSON_CONTENT_TYPE,// Accept: APP_JSON_CONTENT_TYPE,// 'X-token': getToken(),// },// };if (method !== 'GET' && method !== 'DELETE') {headers.body = JSON.stringify(data);}// console.log("fetch header: %s, url: %s", JSON.stringify(headers));var startTime = new Date().getTime();return fetch(getReqUrl(method, uri, data, options), headers).then((response) => {var endTime = new Date().getTime();if (uri.indexOf('mmLogFromWeb') === -1 && uri.indexOf('trail/organize') === -1 &&uri.indexOf('trail/trailer') === -1) {// var param = {// interface: uri,// times: endTime - startTime,// statusCode: response.status,// };// mmHeader.body = JSON.stringify(param);var imgSrc = `${window.webSitePathName}/mmLogFromWeb?interface=${uri}&times=${endTime - startTime}&statusCode=${response.status}`;var img = new Image();img.src = imgSrc;// fetch(getReqUrl('POST', "/mmLogFromWeb", data, {}), mmHeader).catch((response) => Promise.resolve({ response })); }return new Promise((resolve) => {response.json().then((json) => {resolve({json,response});}).catch(() => {resolve({response});});});}).then(({json,response}) => Promise.resolve({json,response})).catch((response) => {return Promise.resolve({response});}); }function getReqUrl(method, uri, data, options) {let url = uri;// console.log("getReqUrl: ", method, ", data: ", data);if (uri.slice(0, basehttp.length) === basehttp) {url = uri;// url = uri;} else {url = (uri.indexOf('api') > -1 ? apiBaseUrl : baseUrl) + uri;}// console.log("before data: ", JSON.stringify(data), ", url: ", url, ", userId: ", data.userId);url = url.replace(REG_URL_PARAM, (...args) => {var key = args && !!args[1] && args[1];var ret = key ? data[key] : args[0];delete data[key];return ret;});//if (!Object.keys(data).length) {// return url;//}if (method === 'GET' || method === 'DELETE') {var dataLength = Object.keys(data).length;url += (dataLength > 0 ? `?${$param(data)}` : '');}if (options && options.query) {url += (`?${$param(options.query)}`);}// 萬一不是restful設計的url,需要處理,先?分割,然后token分割,然后合并// console.log("url === ", url);// if (url && url.indexOf("?") != -1) {// let urlArr = url.split("?");//// if (urlArr.length) {// let baseUrlHead = urlArr[0].split("/token/")[0];// url = baseUrlHead + "?" + urlArr[1] + "&token=" + token;//重新拼接url// }// }if (url) {if (url.indexOf('?') !== -1) {url += '&fsn=' + uuid.v4();} else {url += '?fsn=' + uuid.v4();}}return url; }// *********** 刪除版本調用此方法即可 *********** function deleteVersion(versionName) {var uri = '/apps/{appId}/platformId/{pid}/userId/{userId}/isShow/{isShow}/disableVersion';var data = {appId: "當前操作的AppID",pid: 1,isShow: false,userId: "當前登錄的QQ號(需要有操作權限)",version: ""};data.version = versionName;return ajaxAsync('GET', uri, data, undefined); }// 示例 V2.4.xxx.xx的版本僅保留三個指定的版本,其余全部刪除掉 var liElementArray = document.getElementsByTagName('li'); var keepVersionList = ['2.4.2.2003206', '2.4.0.2003171', '2.4.3.2003255', '2.4.1.2003203']; for (var i = 0, len = liElementArray.length; i < len; i++) {var liElement = liElementArray[i]; if (liElement.className === '_2DfZ7MzVviIlRz6RqqrP3w') { if (/\>(2\.4\.\d\.\d+)\</.test(liElement.outerHTML)) {var versionName = RegExp['$1'];if (keepVersionList.indexOf(versionName) == -1) {console.log(versionName);deleteVersion(versionName);} else {console.log('skip version : ' + versionName);}}} }

?

如果正巧遇到有幾十個上百個版本需要批量刪除的,可以直接copy上面的代碼,適當進行修改便可使用。

總結

以上是生活随笔為你收集整理的bugly中批量隐藏版本的全部內容,希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯,歡迎將生活随笔推薦給好友。

主站蜘蛛池模板: 一个人在线观看免费视频www | 日日射av | 国产三级全黄裸体 | 精品自拍视频 | 无码av天堂一区二区三区 | 91狠狠综合 | 香蕉伊思人视频 | 激情六月 | 美女被娇喘流出白 | a级黄视频 | 一本色道久久综合亚洲精品小说 | 无套内谢大学处破女www小说 | h毛片| 国产做爰xxxⅹ久久久精华液 | 午夜国产视频 | 国产午夜福利视频在线观看 | 日本色妞 | 91精品国产91久久久久福利 | 国产成人亚洲综合 | 欧美亚洲国产另类 | 日韩精品一区中文字幕 | 又黄又爽视频在线观看 | 中国国产精品 | 蜜桃成人在线观看 | 中文字幕在线视频日韩 | 久久久久成人精品无码中文字幕 | 免费在线看黄网站 | 婷婷777 | av免费观看大全 | 男生和女生操操 | 50一60岁老妇女毛片 | 激情国产 | 欧美一区二区在线视频 | 伊人久久青青 | 女人一区二区 | 大桥未久在线视频 | 精品日本一区二区三区 | aaa在线| 97国产视频| 欧美精品色哟哟 | 久久久久久久久影院 | 日日狠狠久久偷偷四色综合免费 | 关之琳三级全黄做爰在线观看 | 女人叉开腿让男人桶 | 波多野结衣在线播放视频 | 最近中文字幕在线观看 | 欧美裸体网站 | 亚洲xx在线 | 老熟女重囗味hdxx69 | 激情婷婷六月天 | 91国内精品久久久久 | 毛片a级片 | 少妇精品视频一区二区 | 一级视频在线观看 | 91视频网址入口 | 国产精品资源站 | 91网站大全 | 午夜久久久 | 日韩综合色 | 99在线观看免费视频 | 91黑丝在线观看 | 一级bbbbbbbbb毛片 | av在哪里看 | 国产精品资源站 | 台湾综合色 | 日韩在线观看不卡 | 成长快手短视频在线观看 | 久久久久久久久免费 | 五月激情在线观看 | 91传媒在线视频 | 一本一道久久综合 | 男人天堂新地址 | 亚洲人视频在线观看 | 亚洲中文字幕无码爆乳av | av导航网站 | 99热综合 | 精品少妇3p | 一区二区中文 | 婷婷色激情 | 成年人在线免费观看网站 | 琪琪电影午夜理论片八戒八戒 | 久久精品丝袜高跟鞋 | 一本久久综合亚洲鲁鲁五月天 | 国产又粗又猛又黄又爽 | 免费在线观看成年人视频 | 国产一区视频观看 | 白嫩白嫩国产精品 | 九九av| 天天狠狠 | 日韩污污 | 久久露脸| 激情网站在线 | 国产主播在线一区 | 黄色免费成人 | 欧美人妻精品一区二区三区 | 五月天综合社区 | av中出在线 | 一级视频片 | 麻豆传媒视频入口 |