• 设为首页
  • 点击收藏
  • 手机版
    手机扫一扫访问
    迪恩网络手机版
  • 关注官方公众号
    微信扫一扫关注
    公众号

TypeScript jsw-logger.JSWLogger类代码示例

原作者: [db:作者] 来自: [db:来源] 收藏 邀请

本文整理汇总了TypeScript中jsw-logger.JSWLogger的典型用法代码示例。如果您正苦于以下问题:TypeScript JSWLogger类的具体用法?TypeScript JSWLogger怎么用?TypeScript JSWLogger使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。



在下文中一共展示了JSWLogger类的4个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的TypeScript代码示例。

示例1: initLogger

	static initLogger(showLogs: boolean = false, throwExceptions: boolean = true) {
		JSWLogger.__dropInstance();
		JSWLogger.getInstance({ hideAllLogs: !showLogs, throwError: throwExceptions });
	}
开发者ID:EastolfiWebDev,项目名称:MongoPortable,代码行数:4,代码来源:test.helper.ts


示例2: hlprint

 hlprint(s: string): number {
     var num;
     
     for (var i = 0, len = s.length; i < len; i++) {
         if (s.charCodeAt(i) < 32) {
             num = s.charCodeAt(i) <= 15 ? "0" + s.charCodeAt(i).toString(16) : s.charCodeAt(i).toString(16);
             
             this.logger.silly(num + " ");
         } else {
             num = s.charCodeAt(i) <= 15 ? "0" + s.charCodeAt(i).toString(16) : s.charCodeAt(i).toString(16);
             
             this.logger.silly(num + " ");
         }
     }
     
     this.logger.silly("\n\n");
     
     return num;
 }
开发者ID:EastolfiWebDev,项目名称:MongoPortable,代码行数:19,代码来源:BinaryParser.ts


示例3: parseFloat

 /*
 encodeFloat_(data: string|number, precisionBits: number, exponentBits: number): string {
     var bias = maxBits[exponentBits - 1] - 1,
         minExp = -bias + 1,
         maxExp = bias,
         minUnnormExp = minExp - precisionBits,
         n = parseFloat(`${data}`),
         status = isNaN(n) || n == -Infinity || n == +Infinity ? n : 0,
         exp = 0,
         len = 2 * bias + 1 + precisionBits + 3,
         bin: Array<number> = new Array(len),
         signal: boolean = (n = status !== 0 ? 0 : n) < 0,
         intPart = Math.floor(n = Math.abs(n)),
         floatPart: number = n - intPart,
         lastBit,
         rounded,
         result,
         i,
         j;
 
 
     // for (i = len; i; bin[--i] = 0);
     i = len;
     while (i) {
         bin[--i] = 0;
     }
     
     // for (i = bias + 2; intPart && i; bin[--i] = intPart % 2, intPart = Math.floor(intPart / 2));
     i = bias + 2;
     while (intPart && i) {
         bin[--i] = intPart % 2;
         intPart = Math.floor(intPart / 2);
     }
     
     // for (i = bias + 1; floatPart > 0 && i; (bin[++i] = ((floatPart *= 2) >= 1) - 0 ) && --floatPart);
     i = bias + 1;
     while (floatPart > 0 && i) {
         floatPart *= 2;
         bin[++i] = floatPart >= 1 ? 1 : 0;
         
         --floatPart;
     }
     
     // for (i = -1; ++i < len && !bin[i];);
     i = 0;
     while (i < len && !bin[i]) {
         i++;
     }
   
     if (bin[(lastBit = precisionBits - 1 + (i = (exp = bias + 1 - i) >= minExp && 
             exp <= maxExp ? i + 1 : bias + 1 - (exp = minExp - 1))) + 1]) {
         if (!(rounded = bin[lastBit])) {
             // for (j = lastBit + 2; !rounded && j < len; rounded = bin[j++]);
             j = lastBit + 2;
             while (!rounded && j < len) {
                 rounded = bin[j++];
             }
         }
         
         // for (j = lastBit + 1; rounded && --j >= 0; (bin[j] = !bin[j] - 0) && (rounded = 0));
         j = lastBit;
         while (rounded && j >= 0) {
             j--;
             bin[j] = bin[j] ? 0 : 1;
             rounded = 0;
         }
     }
   
     for (i = i - 2 < 0 ? -1 : i - 3; ++i < len && !bin[i];);
     
     if ((exp = bias + 1 - i) >= minExp && exp <= maxExp) {
         ++i;
     } else if (exp < minExp) {
         exp != bias + 1 - len && exp < minUnnormExp && this.logger.warn("encodeFloat::float underflow");
         i = bias + 1 - (exp = minExp - 1);
     }
     
     if (intPart || status !== 0) {
         this.logger.warn(intPart ? "encodeFloat::float overflow" : "encodeFloat::" + status);
         
         exp = maxExp + 1;
         i = bias + 2;
     
         if (status == -Infinity) {
             signal = true; // 1
         } else if (isNaN(status)) {
             bin[i] = 1;
         }
     }
   
     // for (n = Math.abs(exp + bias), j = exponentBits + 1, result = ""; --j; result = (n % 2) + result, n = n >>= 1);
     n = Math.abs(exp + bias);
     j = exponentBits;
     result = "";
     while (j) {
         j--;
         result = (n % 2) + result;
         n = n >>= 1;
     }
     
//.........这里部分代码省略.........
开发者ID:EastolfiWebDev,项目名称:MongoPortable,代码行数:101,代码来源:BinaryParser.ts


示例4: encodeFloat

    encodeFloat(data: /*string|*/number, precisionBits: number, exponentBits: number): string {
        var bias = maxBits[exponentBits - 1] - 1
            , minExp = -bias + 1
            , maxExp = bias
            , minUnnormExp = minExp - precisionBits
            //, n = parseFloat(_.toString(data))
			, n = data
            , status = isNaN(n) || n == -Infinity || n == +Infinity ? n : 0
            , exp = 0
            , len = 2 * bias + 1 + precisionBits + 3
            , bin = new Array(len)
            , signal = (n = status !== 0 ? 0 : n) < 0
            , intPart = Math.floor(n = Math.abs(n))
            , floatPart = n - intPart
            , lastBit
            , rounded
            , result
            , i
            , j;
        
        for (i = len; i; bin[--i] = 0);
        
        for (i = bias + 2; intPart && i; bin[--i] = intPart % 2, intPart = Math.floor(intPart / 2));
        
        // for (i = bias + 1; floatPart > 0 && i; (bin[++i] = ((floatPart *= 2) >= 1) - 0 ) && --floatPart);
        for (i = bias + 1; floatPart > 0 && i; (bin[++i] = _.toNumber(((floatPart *= 2) >= 1)) ) && --floatPart);
        
        for (i = -1; ++i < len && !bin[i];);
        
        if (bin[(lastBit = precisionBits - 1 + (i = (exp = bias + 1 - i) >= minExp && exp <= maxExp ? i + 1 : bias + 1 - (exp = minExp - 1))) + 1]) {
            if (!(rounded = bin[lastBit])) {
                for (j = lastBit + 2; !rounded && j < len; rounded = bin[j++]);
            }
            
            // for (j = lastBit + 1; rounded && --j >= 0; (bin[j] = !bin[j] - 0) && (rounded = 0));
            for (j = lastBit + 1; rounded && --j >= 0; (bin[j] = _.toNumber(!bin[j])) && (rounded = 0));
            // j = lastBit + 1;
            // while (rounded && --j >= 0) {
            //     bin[j] = _.toNumber(!bin[j]);
            //     rounded = 0;
            // }
        }
        
        for (i = i - 2 < 0 ? -1 : i - 3; ++i < len && !bin[i];);
        
        if ((exp = bias + 1 - i) >= minExp && exp <= maxExp) {
            ++i;
        } else if (exp < minExp) {
            exp != bias + 1 - len && exp < minUnnormExp && this.logger.warn("encodeFloat::float underflow");
            i = bias + 1 - (exp = minExp - 1);
        }
        
        if (intPart || status !== 0) {
            this.logger.warn(intPart ? "encodeFloat::float overflow" : "encodeFloat::" + status);
            exp = maxExp + 1;
            i = bias + 2;
            
            if (status == -Infinity) {
                signal = true;
            } else if (isNaN(status)) {
                bin[i] = 1;
            }
        }
        
        for (n = Math.abs(exp + bias), j = exponentBits + 1, result = ""; --j; result = (n % 2) + result, n = n >>= 1);
        
        var r = [];
        for (n = 0, j = 0, i = (result = (signal ? "1" : "0") + result + bin.slice(i, i + precisionBits).join("")).length, r = []; i; j = (j + 1) % 8) {
            n += (1 << j) * result.charAt(--i);
            if (j == 7) {
                r[r.length] = String.fromCharCode(n);
                n = 0;
            }
        }
        
        r[r.length] = n
            ? String.fromCharCode(n)
            : "";
        
        return (this.bigEndian ? r.reverse() : r).join("");
    }
开发者ID:EastolfiWebDev,项目名称:MongoPortable,代码行数:81,代码来源:BinaryParser.ts



注:本文中的jsw-logger.JSWLogger类示例由纯净天空整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。


鲜花

握手

雷人

路过

鸡蛋
该文章已有0人参与评论

请发表评论

全部评论

专题导读
上一篇:
TypeScript jszip.file函数代码示例发布时间:2022-05-25
下一篇:
TypeScript jsverify.property函数代码示例发布时间:2022-05-25
热门推荐
热门话题
阅读排行榜

扫描微信二维码

查看手机版网站

随时了解更新最新资讯

139-2527-9053

在线客服(服务时间 9:00~18:00)

在线QQ客服
地址:深圳市南山区西丽大学城创智工业园
电邮:jeky_zhao#qq.com
移动电话:139-2527-9053

Powered by 互联科技 X3.4© 2001-2213 极客世界.|Sitemap