//# 1 ".xml2js.eobjs/jsoo/xml2js.bc.runtime.js"
// Generated by js_of_ocaml
//# buildInfo:effects=false, kind=unknown, use-js-string=true, version=5.2.0+git-0e29f0e-dirty
//# 3 ".xml2js.eobjs/jsoo/xml2js.bc.runtime.js"
//# 7 ".xml2js.eobjs/jsoo/xml2js.bc.runtime.js"
(function
(Object){
typeof globalThis !== "object"
&&
(this
? get()
: (Object.defineProperty
(Object.prototype, "_T_", {configurable: true, get: get}),
_T_));
function get(){
var global = this || self;
global.globalThis = global;
delete Object.prototype._T_;
}
}
(Object));
(function(globalThis){
"use strict";
function caml_int64_is_zero(x){return + x.isZero();}
function caml_str_repeat(n, s){
if(n == 0) return "";
if(s.repeat) return s.repeat(n);
var r = "", l = 0;
for(;;){
if(n & 1) r += s;
n >>= 1;
if(n == 0) return r;
s += s;
l++;
if(l == 9) s.slice(0, 1);
}
}
var caml_int64_offset = Math.pow(2, - 24);
function caml_raise_constant(tag){throw tag;}
var caml_global_data = [0];
function caml_raise_zero_divide(){
caml_raise_constant(caml_global_data.Division_by_zero);
}
function MlInt64(lo, mi, hi){
this.lo = lo & 0xffffff;
this.mi = mi & 0xffffff;
this.hi = hi & 0xffff;
}
MlInt64.prototype.caml_custom = "_j";
MlInt64.prototype.copy =
function(){return new MlInt64(this.lo, this.mi, this.hi);};
MlInt64.prototype.ucompare =
function(x){
if(this.hi > x.hi) return 1;
if(this.hi < x.hi) return - 1;
if(this.mi > x.mi) return 1;
if(this.mi < x.mi) return - 1;
if(this.lo > x.lo) return 1;
if(this.lo < x.lo) return - 1;
return 0;
};
MlInt64.prototype.compare =
function(x){
var hi = this.hi << 16, xhi = x.hi << 16;
if(hi > xhi) return 1;
if(hi < xhi) return - 1;
if(this.mi > x.mi) return 1;
if(this.mi < x.mi) return - 1;
if(this.lo > x.lo) return 1;
if(this.lo < x.lo) return - 1;
return 0;
};
MlInt64.prototype.neg =
function(){
var
lo = - this.lo,
mi = - this.mi + (lo >> 24),
hi = - this.hi + (mi >> 24);
return new MlInt64(lo, mi, hi);
};
MlInt64.prototype.add =
function(x){
var
lo = this.lo + x.lo,
mi = this.mi + x.mi + (lo >> 24),
hi = this.hi + x.hi + (mi >> 24);
return new MlInt64(lo, mi, hi);
};
MlInt64.prototype.sub =
function(x){
var
lo = this.lo - x.lo,
mi = this.mi - x.mi + (lo >> 24),
hi = this.hi - x.hi + (mi >> 24);
return new MlInt64(lo, mi, hi);
};
MlInt64.prototype.mul =
function(x){
var
lo = this.lo * x.lo,
mi = (lo * caml_int64_offset | 0) + this.mi * x.lo + this.lo * x.mi,
hi =
(mi * caml_int64_offset | 0) + this.hi * x.lo + this.mi * x.mi
+ this.lo * x.hi;
return new MlInt64(lo, mi, hi);
};
MlInt64.prototype.isZero =
function(){return (this.lo | this.mi | this.hi) == 0;};
MlInt64.prototype.isNeg = function(){return this.hi << 16 < 0;};
MlInt64.prototype.and =
function(x){
return new MlInt64(this.lo & x.lo, this.mi & x.mi, this.hi & x.hi);
};
MlInt64.prototype.or =
function(x){
return new MlInt64(this.lo | x.lo, this.mi | x.mi, this.hi | x.hi);
};
MlInt64.prototype.xor =
function(x){
return new MlInt64(this.lo ^ x.lo, this.mi ^ x.mi, this.hi ^ x.hi);
};
MlInt64.prototype.shift_left =
function(s){
s = s & 63;
if(s == 0) return this;
if(s < 24)
return new
MlInt64
(this.lo << s,
this.mi << s | this.lo >> 24 - s,
this.hi << s | this.mi >> 24 - s);
if(s < 48)
return new
MlInt64
(0, this.lo << s - 24, this.mi << s - 24 | this.lo >> 48 - s);
return new MlInt64(0, 0, this.lo << s - 48);
};
MlInt64.prototype.shift_right_unsigned =
function(s){
s = s & 63;
if(s == 0) return this;
if(s < 24)
return new
MlInt64
(this.lo >> s | this.mi << 24 - s,
this.mi >> s | this.hi << 24 - s,
this.hi >> s);
if(s < 48)
return new
MlInt64
(this.mi >> s - 24 | this.hi << 48 - s, this.hi >> s - 24, 0);
return new MlInt64(this.hi >> s - 48, 0, 0);
};
MlInt64.prototype.shift_right =
function(s){
s = s & 63;
if(s == 0) return this;
var h = this.hi << 16 >> 16;
if(s < 24)
return new
MlInt64
(this.lo >> s | this.mi << 24 - s,
this.mi >> s | h << 24 - s,
this.hi << 16 >> s >>> 16);
var sign = this.hi << 16 >> 31;
if(s < 48)
return new
MlInt64
(this.mi >> s - 24 | this.hi << 48 - s,
this.hi << 16 >> s - 24 >> 16,
sign & 0xffff);
return new MlInt64(this.hi << 16 >> s - 32, sign, sign);
};
MlInt64.prototype.lsl1 =
function(){
this.hi = this.hi << 1 | this.mi >> 23;
this.mi = (this.mi << 1 | this.lo >> 23) & 0xffffff;
this.lo = this.lo << 1 & 0xffffff;
};
MlInt64.prototype.lsr1 =
function(){
this.lo = (this.lo >>> 1 | this.mi << 23) & 0xffffff;
this.mi = (this.mi >>> 1 | this.hi << 23) & 0xffffff;
this.hi = this.hi >>> 1;
};
MlInt64.prototype.udivmod =
function(x){
var
offset = 0,
modulus = this.copy(),
divisor = x.copy(),
quotient = new MlInt64(0, 0, 0);
while(modulus.ucompare(divisor) > 0){offset++; divisor.lsl1();}
while(offset >= 0){
offset--;
quotient.lsl1();
if(modulus.ucompare(divisor) >= 0){
quotient.lo++;
modulus = modulus.sub(divisor);
}
divisor.lsr1();
}
return {quotient: quotient, modulus: modulus};
};
MlInt64.prototype.div =
function(y){
var x = this;
if(y.isZero()) caml_raise_zero_divide();
var sign = x.hi ^ y.hi;
if(x.hi & 0x8000) x = x.neg();
if(y.hi & 0x8000) y = y.neg();
var q = x.udivmod(y).quotient;
if(sign & 0x8000) q = q.neg();
return q;
};
MlInt64.prototype.mod =
function(y){
var x = this;
if(y.isZero()) caml_raise_zero_divide();
var sign = x.hi;
if(x.hi & 0x8000) x = x.neg();
if(y.hi & 0x8000) y = y.neg();
var r = x.udivmod(y).modulus;
if(sign & 0x8000) r = r.neg();
return r;
};
MlInt64.prototype.toInt = function(){return this.lo | this.mi << 24;};
MlInt64.prototype.toFloat =
function(){
return (this.hi << 16) * Math.pow(2, 32) + this.mi * Math.pow(2, 24)
+ this.lo;
};
MlInt64.prototype.toArray =
function(){
return [this.hi >> 8,
this.hi & 0xff,
this.mi >> 16,
this.mi >> 8 & 0xff,
this.mi & 0xff,
this.lo >> 16,
this.lo >> 8 & 0xff,
this.lo & 0xff];
};
MlInt64.prototype.lo32 =
function(){return this.lo | (this.mi & 0xff) << 24;};
MlInt64.prototype.hi32 =
function(){return this.mi >>> 8 & 0xffff | this.hi << 16;};
function caml_int64_of_int32(x){
return new MlInt64(x & 0xffffff, x >> 24 & 0xffffff, x >> 31 & 0xffff);
}
function caml_int64_to_int32(x){return x.toInt();}
function caml_int64_is_negative(x){return + x.isNeg();}
function caml_int64_neg(x){return x.neg();}
function caml_jsbytes_of_string(x){return x;}
function jsoo_sys_getenv(n){
var process = globalThis.process;
if(process && process.env && process.env[n] != undefined)
return process.env[n];
if(globalThis.jsoo_static_env && globalThis.jsoo_static_env[n])
return globalThis.jsoo_static_env[n];
}
var caml_record_backtrace_flag = 0;
(function(){
var r = jsoo_sys_getenv("OCAMLRUNPARAM");
if(r !== undefined){
var l = r.split(",");
for(v
没有合适的资源?快使用搜索试试~ 我知道了~
基于Vue框架的Tachiyomi本地漫画信息管理系统源码
共542个文件
js:337个
vue:107个
png:33个
1.该资源内容由用户上传,如若侵权请联系客服进行举报
2.虚拟产品一经售出概不退款(资源遇到问题,请及时私信上传者)
2.虚拟产品一经售出概不退款(资源遇到问题,请及时私信上传者)
版权申诉
0 下载量 123 浏览量
2024-09-28
22:31:51
上传
评论
收藏 92.3MB ZIP 举报
温馨提示
该源码是一款基于Vue框架开发的Tachiyomi本地漫画信息管理系统,包含539个文件,其中JavaScript和Vue文件各占336和107个,辅以HTML、CSS、TypeScript等前端技术,并支持png、json、scss等多种文件格式。此系统旨在为用户提供便捷的本地漫画信息管理功能。
资源推荐
资源详情
资源评论
收起资源包目录
基于Vue框架的Tachiyomi本地漫画信息管理系统源码 (542个子文件)
__UNI__E8660A9__20240104220258.apk 19.97MB
__UNI__E8660A9__20240104210606.apk 19.95MB
__UNI__E8660A9__20240104215228.apk 19.94MB
__UNI__E8660A9_cm.apk 11.61MB
apkurl 77B
certdata 148B
xml2json.cmd 309B
view.css 59KB
view.css 59KB
view.css 59KB
view.css 59KB
__uniappview.html 786B
__uniappview.html 786B
__uniappview.html 786B
__uniappview.html 786B
index.html 672B
xml2js.bc.js 3.23MB
app-service.js 2.34MB
app-view.js 958KB
view.umd.min.js 391KB
view.umd.min.js 391KB
view.umd.min.js 391KB
view.umd.min.js 391KB
app-service.js 247KB
app-service.js 247KB
app-service.js 247KB
__uniappquill.js 211KB
__uniappquill.js 211KB
__uniappquill.js 211KB
__uniappquill.js 211KB
app-view.js 71KB
app-view.js 71KB
app-view.js 71KB
__uniappes6.js 51KB
__uniappes6.js 51KB
__uniappes6.js 51KB
__uniappes6.js 51KB
sax.js 43KB
async-validator.js 38KB
__uniappchooselocation.js 38KB
__uniappchooselocation.js 38KB
__uniappchooselocation.js 38KB
__uniappchooselocation.js 38KB
parser.js 35KB
noNetwork.js 28KB
__uniappopenlocation.js 28KB
__uniappopenlocation.js 28KB
__uniappopenlocation.js 28KB
__uniappopenlocation.js 28KB
calendar.js 26KB
__uniappquillimageresize.js 24KB
__uniappquillimageresize.js 24KB
__uniappquillimageresize.js 24KB
__uniappquillimageresize.js 24KB
XMLNode.js 24KB
index.js 22KB
__uniapppicker.js 20KB
__uniapppicker.js 20KB
__uniapppicker.js 20KB
__uniapppicker.js 20KB
__uniappscan.js 20KB
__uniappscan.js 20KB
__uniappscan.js 20KB
__uniappscan.js 20KB
XMLDocumentCB.js 17KB
XMLWriterBase.js 15KB
parser.js 13KB
clipboard.min.js 13KB
nvue - backup.js 12KB
dayjs.js 11KB
XMLElement.js 9KB
clone.js 8KB
XMLDocument.js 8KB
XMLStreamWriter.js 7KB
icons.js 7KB
XMLStringifier.js 7KB
nvue.js 7KB
mixin.js 7KB
style.js 7KB
transition.js 6KB
app-config.js 6KB
test.js 6KB
Request.js 6KB
props.js 6KB
props.js 5KB
XMLDocType.js 5KB
nvue - 副本.js 5KB
nvue.js 5KB
props.js 5KB
props.js 5KB
colorGradient.js 4KB
builder.js 4KB
props.js 4KB
props.js 4KB
utils.js 4KB
value.js 4KB
mpother.js 4KB
digit.js 4KB
route.js 4KB
props.js 4KB
共 542 条
- 1
- 2
- 3
- 4
- 5
- 6
资源评论
lsx202406
- 粉丝: 2575
- 资源: 5599
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
最新资源
- F2的支付宝小程序版本.zip
- Windows winpe 迅雷单文件下载工具
- Discuz 论坛实现接口,以及结合 Discuz 的微信小程序.zip
- 基于动力学模型与RBF神经网络的沙堡持久度优化研究
- 基于周期性沙水细胞自动机模拟的最稳定沙堡地基几何形状研究与应用
- **********超分辨率模型***********
- chatgpt微信聊天小程序 java编写服务器,实现chatgpt接口的调用,微信小程序用于聊天 两者都基于webSocket进行通信.zip
- 海洋温度变化下鲭鱼与鲱鱼迁徙预测模型
- 气候变化下苏格兰地区鱼类迁移模式预测与渔业经济影响研究
- 气候变化下苏格兰小型渔业公司业务战略与鱼群迁移预测研究
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功