• xgqfrms™, xgqfrms® : xgqfrms's offical website of GitHub!


    js console API All In One

    const log = console.log;
    
    for(const key in console) {
      log(`navigator.${key} =`, key, typeof key, console[key]);
    }
    
    // navigator.debug = debug string ƒ debug() { [native code] }
    // navigator.error = error string ƒ error() { [native code] }
    // navigator.info = info string ƒ info() { [native code] }
    // navigator.log = log string ƒ log() { [native code] }
    // navigator.warn = warn string ƒ warn() { [native code] }
    // navigator.dir = dir string ƒ dir() { [native code] }
    // navigator.dirxml = dirxml string ƒ dirxml() { [native code] }
    // navigator.table = table string ƒ table() { [native code] }
    // navigator.trace = trace string ƒ trace() { [native code] }
    // navigator.group = group string ƒ group() { [native code] }
    // navigator.groupCollapsed = groupCollapsed string ƒ groupCollapsed() { [native code] }
    // navigator.groupEnd = groupEnd string ƒ groupEnd() { [native code] }
    // navigator.clear = clear string ƒ clear() { [native code] }
    // navigator.count = count string ƒ count() { [native code] }
    // navigator.countReset = countReset string ƒ countReset() { [native code] }
    // navigator.assert = assert string ƒ assert() { [native code] }
    // navigator.profile = profile string ƒ profile() { [native code] }
    // navigator.profileEnd = profileEnd string ƒ profileEnd() { [native code] }
    // navigator.time = time string ƒ time() { [native code] }
    // navigator.timeLog = timeLog string ƒ timeLog() { [native code] }
    // navigator.timeEnd = timeEnd string ƒ timeEnd() { [native code] }
    // navigator.timeStamp = timeStamp string ƒ timeStamp() { [native code] }
    // navigator.context = context string ƒ context() { [native code] }
    
    
    

    refs

    https://jsconsole.com/



    ©xgqfrms 2012-2020

    www.cnblogs.com 发布文章使用:只允许注册用户才可以访问!


  • 相关阅读:
    树上莫队学习笔记
    点分治学习笔记
    7.11总结
    线段树合并学习笔记
    7.10总结
    bzoj1201: [HNOI2005]数三角形----递推+bitset
    bitset(01串)优化
    Tarjan系列1
    bsgs(Baby Steps Giant Steps)算法
    [SD2015]序列统计——solution
  • 原文地址:https://www.cnblogs.com/xgqfrms/p/13968393.html
Copyright © 2020-2023  润新知