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

Beacon API maximum data size limit All In One

Beacon API maximum data size limit All In One

// sendBeacon limit for Chrome v40 on Windows (2^16)
function test(n = 65536) {
    const url = 'http://jsfiddle.net?sendbeacon';
    // generate string of length n
    // http://stackoverflow.com/questions/14343844/create-a-string-of-variable-length-filled-with-a-repeated-character
    // const data = new Array(n+1).join('X');
    const data = `X`.repeat(n);
    const result = navigator.sendBeacon(url, data);
    // false
    if(!result) {
        flag = false;
        window.localStorage.setItem('beacon-api-max-size', n);
        alert(`data limit reached ${n}`);
    } else {
        // ignore
    }
    return result;
}

let flag = true;
let n = 65536;
// 2^16 / Math.pow(2, 10); / 2**16
while (flag) {
    test(n);
    n += 2**10;
}


// sendBeacon limit for Chrome v40 on Windows (2^16)
function test(n = 65536) {
    const url = 'https://cdn.xgqfrms.xyz/?sendbeacon';
    // generate string of length n
    // http://stackoverflow.com/questions/14343844/create-a-string-of-variable-length-filled-with-a-repeated-character
    // const data = new Array(n+1).join('X');
    const data = `X`.repeat(n);
    const result = navigator.sendBeacon(url, data);
    // false
    if(!result) {
        flag = false;
        window.localStorage.setItem('beacon-api-max-size', n);
        alert(`data limit reached ${n}`);
    } else {
        // ignore
    }
    return result;
}

let flag = true;
let n = 1;
// let n = 65536;
// 2^16 / Math.pow(2, 10); / 2**16
while (flag) {
    test(n);
    n += 2**10;
}
// 12289 ❌

// sendBeacon limit for Chrome v40 on Windows (2^16)
function test(n = 65536) {
    const url = 'https://cdn.xgqfrms.xyz/?sendbeacon';
    // generate string of length n
    // http://stackoverflow.com/questions/14343844/create-a-string-of-variable-length-filled-with-a-repeated-character
    // const data = new Array(n+1).join('X');
    const data = `X`.repeat(n);
    const result = navigator.sendBeacon(url, data);
    // false
    if(!result) {
        flag = false;
        window.localStorage.setItem('beacon-api-max-size', n);
        alert(`data limit reached ${n}`);
    } else {
        // ignore
    }
    return result;
}

let flag = true;
let n = 100000000000;
// let n = 65536;
// 2^16 / Math.pow(2, 10); / 2**16
while (flag) {
    test(n);
    n += 2**10;
}
VM347:7 Uncaught RangeError: Invalid string length
    at String.repeat (<anonymous>)

https://cdn.xgqfrms.xyz/?sendbeacon



// sendBeacon limit for Chrome v40 on Windows (2^16)
function test(n = 65536) {
    const url = 'https://cdn.xgqfrms.xyz/?sendbeacon';
    // generate string of length n
    // http://stackoverflow.com/questions/14343844/create-a-string-of-variable-length-filled-with-a-repeated-character
    // const data = new Array(n+1).join('X');
    const data = `X`.repeat(n);
    const result = navigator.sendBeacon(url, data);
    // false
    if(!result) {
        flag = false;
        window.localStorage.setItem('beacon-api-max-size', n);
        alert(`data limit reached ${n}`);
    } else {
        // ignore
    }
    return result;
}

let flag = true;
let n = 100000000;
// let n = 65536;
// 2^16 / Math.pow(2, 10); / 2**16
while (flag) {
    test(n);
    n += 2**10;
}
100001024

refs

https://stackoverflow.com/questions/28989640/navigator-sendbeacon-data-size-limits



©xgqfrms 2012-2020

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

原创文章,版权所有©️xgqfrms, 禁止转载 🈲️,侵权必究⚠️!


posted @   xgqfrms  阅读(140)  评论(5编辑  收藏  举报
编辑推荐:
· AI与.NET技术实操系列(二):开始使用ML.NET
· 记一次.NET内存居高不下排查解决与启示
· 探究高空视频全景AR技术的实现原理
· 理解Rust引用及其生命周期标识(上)
· 浏览器原生「磁吸」效果!Anchor Positioning 锚点定位神器解析
阅读排行:
· DeepSeek 开源周回顾「GitHub 热点速览」
· 记一次.NET内存居高不下排查解决与启示
· 物流快递公司核心技术能力-地址解析分单基础技术分享
· .NET 10首个预览版发布:重大改进与新特性概览!
· .NET10 - 预览版1新功能体验(一)
历史上的今天:
2020-04-07 taro render html
2020-04-07 TDD & Unit testing
2020-04-07 Taro 版本
2020-04-07 小程序 webview 自动打开新页面
2020-04-07 Taro Next
2020-04-07 taro 渲染 html
2019-04-07 Algorithm Visualizer
点击右上角即可分享
微信分享提示