PageSourceSearch

https://beepboopbotz.io/_next/static/chunks/pages/sdt/join/[code]-6c54bc5f4cb0c794.js

js beepboopbotz.io collected 2026-10-08 23:37:06 UTC 3,342 bytes, 1 lines download raw bytes

1(self.webpackChunk_N_E=self.webpackChunk_N_E||[]).push([[27],{60162:function(t,e,n){(window.__NEXT_P=window.__NEXT_P||[]).push(["/sdt/join/[code]",function(){return n(13073)}])},13073:function(t,e,n){"use strict";n.r(e),n.d(e,{default:function(){return f}});var r=n(85893),i=n(11163),o=n(9008),u=n(67294),s=n(98368),a=n.n(s);function f(){var t=(0,i.useRouter)();return(0,u.useEffect)((function(){if(t.isReady){var e=t.query.code;e&&(a().set("ref",e),t.push("/sdt/tournaments"))}}),[t.isReady]),(0,r.jsx)("div",{className:"home",children:(0,r.jsxs)(o.default,{children:[(0,r.jsx)("title",{children:"Beep Boop - Sudden Death Tournaments"}),(0,r.jsx)("link",{rel:"icon",href:"/favicon.ico"}),(0,r.jsx)("meta",{name:"theme-color",content:"#677587"}),(0,r.jsx)("meta",{name:"description",content:"Beep Boop Botz Sudden Death Tournaments (SDT) are a ruthless, exhilarating test of strategy and strength where bots fight for survival."})]})})}},9008:function(t,e,n){t.exports=n(83121)},11163:function(t,e,n){t.exports=n(80880)},98368:function(t){t.exports=function(){"use strict";function t(t){return t=JSON.stringify(t),!!/^\{[\s\S]*\}$/.test(t)}function e(t){return void 0===t||"function"===typeof t?t+"":JSON.stringify(t)}function n(t){if("string"===typeof t)try{return JSON.parse(t)}catch(e){return t}}function r(t){return"[object Function]"==={}.toString.call(t)}function i(t){return"[object Array]"===Object.prototype.toString.call(t)}function o(t){var e="_Is_Incognit",n="yes";try{t||(t=window.localStorage),t.setItem(e,n),t.removeItem(e)}catch(i){var r={_data:{},setItem:function(t,e){return r._data[t]=String(e)},getItem:function(t){return r._data.hasOwnProperty(t)?r._data[t]:void 0},removeItem:function(t){return delete r._data[t]},clear:function(){return r._data={}}};t=r}finally{t.getItem(e)===n&&t.removeItem(e)}return t}var u=o();function s(){if(!(this instanceof s))return new s}s.prototype={set:function(n,r){if(n&&!t(n))u.setItem(n,e(r));else if(t(n))for(var i in n)this.set(i,n[i]);return this},get:function(t){if(!t){var e={};return this.forEach((function(t,n){return e[t]=n})),e}if("?"===t.charAt(0))return this.has(t.substr(1));var r=arguments;if(r.length>1){for(var i={},o=0,s=r.length;o<s;o++){var a=n(u.getItem(r[o]));this.has(r[o])&&(i[r[o]]=a)}return i}return n(u.getItem(t))},clear:function(){return u.clear(),this},remove:function(t){var e=this.get(t);return u.removeItem(t),e},has:function(t){return{}.hasOwnProperty.call(this.get(),t)},keys:function(){var t=[];return this.forEach((function(e){t.push(e)})),t},forEach:function(t){for(var e=0,n=u.length;e<n;e++){var r=u.key(e);t(r,this.get(r))}return this},search:function(t){for(var e=this.keys(),n={},r=0,i=e.length;r<i;r++)e[r].indexOf(t)>-1&&(n[e[r]]=this.get(e[r]));return n}};var a=null;function f(e,n){var o=arguments,u=null;if(a||(a=s()),0===o.length)return a.get();if(1===o.length){if("string"===typeof e)return a.get(e);if(t(e))return a.set(e)}if(2===o.length&&"string"===typeof e){if(!n)return a.remove(e);if(n&&"string"===typeof n)return a.set(e,n);n&&r(n)&&(u=null,u=n(e,a.get(e)),f.set(e,u))}if(2===o.length&&i(e)&&r(n))for(var c=0,h=e.length;c<h;c++)u=n(e[c],a.get(e[c])),f.set(e[c],u);return f}for(var c in s.prototype)f[c]=s.prototype[c];return f}()}},function(t){t.O(0,[774,888,179],(function(){return e=60162,t(t.s=e);var e}));var e=t.O();_N_E=e}]);

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.