1"use strict";(self.webpackChunkweb_frontend_reactjs=self.webpackChunkweb_frontend_reactjs||[]).push([[6828],{41314:(e,t,s)=>{s.d(t,{u:()=>r});var n=s(29344),i=s(2845);class r extends n.E_{constructor(){super(...arguments),this.prefix="capacitor-storage_",this.sync=!1,this.access=i.T2.whenUnlocked}async setSynchronize(e){if(this.sync=e,"ios"===n.Ii.getPlatform())return this.setSynchronizeKeychain({sync:e})}async getSynchronize(){return this.sync}async setDefaultKeychainAccess(e){this.access=e}async tryOperation(e){try{return await e()}catch(s){if(s instanceof n.I9&&(void 0!==(t=s.code)&&Object.keys(i.CA).includes(t)))throw new i.aq(s.message,s.code);throw s}var t}async get(e){let t=!(arguments.length>1&&void 0!==arguments[1])||arguments[1],s=arguments.length>2?arguments[2]:void 0;if(e){const{data:r}=await this.tryOperation(async()=>this.internalGetItem({prefixedKey:this.prefixedKey(e),sync:null!==s&&void 0!==s?s:this.sync}));if(null===r)return null;if(t){const e=function(e){const t=a.exec(e);if(t){const e=Number.parseInt(t[1],10),s=Number.parseInt(t[2],10)-1,n=Number.parseInt(t[3],10),i=Number.parseInt(t[4],10),r=Number.parseInt(t[5],10),a=Number.parseInt(t[6],10),c=Number.parseInt(t[7],10),y=Date.UTC(e,s,n,i,r,a,c);return new Date(y)}return null}(r);if(e)return e}try{return JSON.parse(r)}catch(n){throw new i.aq("Invalid data",i.CA.invalidData)}}return r.missingKey()}async getItem(e){if(e){const{data:t}=await this.tryOperation(async()=>this.internalGetItem({prefixedKey:this.prefixedKey(e),sync:this.sync}));return t}return null}async set(e,t){let s=arguments.length>3?arguments[3]:void 0,n=arguments.length>4?arguments[4]:void 0;if(e){let i=t;return(!(arguments.length>2&&void 0!==arguments[2])||arguments[2])&&t instanceof Date&&(i=t.toISOString()),this.tryOperation(async()=>this.internalSetItem({prefixedKey:this.prefixedKey(e),data:JSON.stringify(i),sync:null!==s&&void 0!==s?s:this.sync,access:null!==n&&void 0!==n?n:this.access}))}return r.missingKey()}async setItem(e,t){return e?this.tryOperation(async()=>this.internalSetItem({prefixedKey:this.prefixedKey(e),data:t,sync:this.sync,access:this.access})):r.missingKey()}async remove(e,t){if(e){const{success:s}=await this.tryOperation(async()=>this.internalRemoveItem({prefixedKey:this.prefixedKey(e),sync:null!==t&&void 0!==t?t:this.sync}));return s}return r.missingKey()}async removeItem(e){e?await this.tryOperation(async()=>this.internalRemoveItem({prefixedKey:this.prefixedKey(e),sync:this.sync})):r.missingKey()}async keys(e){const{keys:t}=await this.tryOperation(async()=>this.getPrefixedKeys({prefix:this.prefix,sync:null!==e&&void 0!==e?e:this.sync})),s=this.prefix.length;return t.map(e=>e.slice(s))}async getKeyPrefix(){return this.prefix}async setKeyPrefix(e){this.prefix=e}prefixedKey(e){return this.prefix+e}static missingKey(){throw new i.aq("No key provided",i.CA.missingKey)}}const a=/^"([0-9]{4})-([0-9]{2})-([0-9]{2})T([0-9]{2}):([0-9]{2}):([0-9]{2})(?:[\0-\t\x0B\f\x0E-\u2027\u202A-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF][\uDC00-\uDFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])([0-9]{3})Z"$/},86828:(e,t,s)=>{s.r(t),s.d(t,{SecureStorageNative:()=>i});var n=s(41314);class i extends n.u{constructor(e){super();const t=e;this.setSynchronizeKeychain=t.setSynchronizeKeychain,this.internalGetItem=t.internalGetItem,this.internalSetItem=t.internalSetItem,this.internalRemoveItem=t.internalRemoveItem,this.clearItemsWithPrefix=t.clearItemsWithPrefix,this.getPrefixedKeys=t.getPrefixedKeys}async setSynchronizeKeychain(e){}async internalGetItem(e){return{data:""}}async internalSetItem(e){}async internalRemoveItem(e){return{success:!0}}async clear(e){return this.tryOperation(async()=>this.clearItemsWithPrefix({prefix:this.prefix,sync:null!==e&&void 0!==e?e:this.sync}))}async clearItemsWithPrefix(e){}async getPrefixedKeys(e){return{keys:[]}}}}}]);
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.