| /plugin/aichat/vendor/mehrab-wj/tiktoken-php/data/ |
| H A D | vocab.bpe | 13616 Ġha bits
36761 Ġor bits
|
| /plugin/amcharts/assets/amcharts/plugins/export/libs/jszip/ |
| H A D | jszip.js | 5842 bits = state.bits;
6074 state.bits = bits;
6485 bits = state.bits;
6833 bits -= bits & 7;
6888 bits -= bits & 7;
7505 state.bits = bits;
7621 var bits = opts.bits;
8194 for (bits = 0; bits <= MAX_BITS; bits++) {
8249 for (bits = max_length; bits !== 0; bits--) {
8286 for (bits = 1; bits <= MAX_BITS; bits++) {
[all …]
|
| H A D | jszip.min.js | 13 …bits,r=e.lencode,s=e.distcode,t=(1<<e.lenbits)-1,u=(1<<e.distbits)-1;a:do{15>q&&(p+=B[f++]<<q,q+=8…
14 …bits=n,(c.wsize||p!==a.avail_out&&c.mode<lb&&(c.mode<ib||b!==z))&&l(a,a.output,a.next_out,p-a.avai…
|
| /plugin/amcharts/assets/amcharts/plugins/export/libs/pdfmake/ |
| H A D | pdfmake.js | 23407 for (bits = 0; bits <= MAX_BITS; bits++) {
23462 for (bits = max_length; bits !== 0; bits--) {
23499 for (bits = 1; bits <= MAX_BITS; bits++) {
23579 for (bits = 0; bits <= MAX_BITS; bits++) {
24833 bits = state.bits;
25181 bits -= bits & 7;
25236 bits -= bits & 7;
25853 state.bits = bits;
26026 bits = state.bits;
26258 state.bits = bits;
[all …]
|
| H A D | pdfmake.min.js | 12 …bits=0,this.length=0,this.offset=0,this.extra=0,this.lencode=null,this.distcode=null,this.lenbits=…
13 …bits=v}},function(t,e,n){"use strict";var r=n(52),i=15,o=852,a=592,s=0,h=1,u=2,l=[3,4,5,6,7,8,9,10…
16 …bits=this.data[a++],this.height=this.data.readUInt16BE(a),a+=2,this.width=this.data.readUInt16BE(a…
|
| H A D | pdfmake.min.js.map | 1 …bits","datalen","nlenbits","calculateecc","genpoly","modulus","polylen","genpolylen","quotient","a…
|
| /plugin/amcharts/assets/amcharts/plugins/export/libs/xlsx/ |
| H A D | xlsx.js | 1519 var bits = -7, d = isLE ? -1 : 1, i = isLE ? (nl - 1) : 0, s = buf[idx + i];
1522 e = s & ((1 << (-bits)) - 1); s >>>= (-bits); bits += el;
1523 for (; bits > 0; e = e * 256 + buf[idx + i], i += d, bits -= 8);
1524 m = e & ((1 << (-bits)) - 1); e >>>= (-bits); bits += ml;
1525 for (; bits > 0; m = m * 256 + buf[idx + i], i += d, bits -= 8);
|
| H A D | xlsx.min.js | 3 …bits=-7,d=isLE?-1:1,i=isLE?nl-1:0,s=buf[idx+i];i+=d;e=s&(1<<-bits)-1;s>>>=-bits;bits+=el;for(;bits…
|
| H A D | xlsx.min.map | 1 …t","xsi","xsd","main","readIEEE754","isLE","nl","ml","el","eMax","eBias","bits","NaN","Infinity","…
|
| /plugin/authgooglesheets/vendor/phpseclib/phpseclib/phpseclib/Common/Functions/ |
| H A D | Strings.php | 327 $bits = '';
331 $bits .= sprintf('%032b', $digit);
336 $bits .= sprintf('%064b', $digit);
340 return $trim ? ltrim($bits, '0') : $bits;
|
| /plugin/authgooglesheets/vendor/phpseclib/phpseclib/phpseclib/Crypt/ |
| H A D | RSA.php | 322 * @param int $bits
324 public static function createKey($bits = 2048) argument
328 $regSize = $bits >> 1; // divide by two to see how many bits P and Q would be
330 $num_primes = floor($bits / self::$smallestPrime);
336 if ($num_primes == 2 && $bits >= 384 && self::$defaultExponent == 65537) {
347 $rsa = openssl_pkey_new(['private_key_bits' => $bits] + $config);
375 extract(BigInteger::minMaxBits($bits));
430 $privatekey->k = $bits >> 3;
|
| /plugin/authgooglesheets/vendor/phpseclib/phpseclib/phpseclib/File/ |
| H A D | ASN1.php | 773 …$bits = count($mapping['mapping']) == $size ? [] : array_fill(0, count($mapping['mapping']) - $siz…
777 $bits[] = (bool) ($current & (1 << $j));
784 if ($bits[$i]) {
1039 $bits = array_fill(0, count($mapping['mapping']), 0);
1043 $bits[$i] = 1;
1058 unset($bits[$i]);
1061 $bits = implode('', array_pad($bits, $size + $offset + 1, 0));
1062 $bytes = explode(' ', rtrim(chunk_split($bits, 8, ' ')));
|
| /plugin/authgooglesheets/vendor/phpseclib/phpseclib/phpseclib/Math/ |
| H A D | BigInteger.php | 382 * @param int $bits
384 public function setPrecision($bits) argument
386 $this->value->setPrecision($bits);
615 * @param int $bits
618 public static function minMaxBits($bits) argument
623 extract($class::minMaxBits($bits));
|
| /plugin/authgooglesheets/vendor/phpseclib/phpseclib/phpseclib/Math/BigInteger/Engines/ |
| H A D | BCMath.php | 638 * @param int $bits
642 protected static function setBitmask($bits) argument
644 $temp = parent::setBitmask($bits);
|
| H A D | Engine.php | 294 $result = $this->precision > 0 ? substr($bits, -$this->precision) : ltrim($bits, '0');
421 * @param int $bits
425 if ($bits < 1) {
431 $this->precision = $bits;
453 * @param int $bits
458 return new static(chr((1 << ($bits & 0x7)) - 1) . str_repeat(chr(0xFF), $bits >> 3), 256);
537 $bits = $this->toBytes();
548 $temp = ord($bits[0]);
587 * @param int $bits
592 $bytes = $bits >> 3;
[all …]
|
| H A D | GMP.php | 130 $bits = gmp_strval(gmp_init($hex, 16), 2);
133 $bits = substr($bits, -$this->precision);
137 return '0' . $bits;
140 return $bits;
|
| /plugin/barcodes/vendor/jucksearm/php-barcode/lib/ |
| H A D | QRcode.php | 1749 $bits += 4;
1753 $bits += 7;
1757 return $bits;
1768 $bits += 6;
1770 return $bits;
1851 $bits = 0;
1885 return $bits;
1974 $total += $bits;
1992 $bits = $cbs[1];
1993 if ($bits < 0) {
[all …]
|
| /plugin/bible/bible_douayRheims/ |
| H A D | James.txt | 56 …3:3. For if we put bits into the mouths of horses, that they may obey us: and we turn about their …
|
| /plugin/bpmnio/vendor/bpmn-js/dist/ |
| H A D | bpmn-modeler.production.min.js | 2 …function(e){return r.hats[e]},r.set=function(e,t){return r.hats[e]=t,r},r.bits=e||128,r.base=n||16…
|
| H A D | bpmn-navigated-viewer.production.min.js | 2 …function(e){return r.hats[e]},r.set=function(e,t){return r.hats[e]=t,r},r.bits=e||128,r.base=n||16…
|
| H A D | bpmn-viewer.production.min.js | 2 …function(e){return r.hats[e]},r.set=function(e,t){return r.hats[e]=t,r},r.bits=e||128,r.base=n||16…
|
| /plugin/bpmnio/vendor/dmn-js/dist/ |
| H A D | dmn-modeler.production.min.js | 2 …function(e){return r.hats[e]},r.set=function(e,t){return r.hats[e]=t,r},r.bits=e||128,r.base=n||16…
|
| H A D | dmn-navigated-viewer.production.min.js | 2 …function(e){return i.hats[e]},i.set=function(e,t){return i.hats[e]=t,i},i.bits=e||128,i.base=n||16…
|
| H A D | dmn-viewer.production.min.js | 2 …function(e){return i.hats[e]},i.set=function(e,t){return i.hats[e]=t,i},i.bits=e||128,i.base=n||16…
|
| /plugin/bpmnioeditor/vendor/bpmnio-js/ |
| H A D | bpmn-modeler.development.js | 58 var hat = module.exports = function (bits, base) {
60 if (bits === undefined) bits = 128;
61 if (bits <= 0) return '0';
63 var digits = Math.log(Math.pow(2, bits)) / Math.log(base);
65 digits = Math.log(Math.pow(2, bits / i)) / Math.log(base) * i;
84 if (parsed !== Infinity && parsed >= Math.pow(2, bits)) {
85 return hat(bits, base)
90 hat.rack = function (bits, base, expandBy) { argument
95 if (expandBy) bits += expandBy;
99 var id = hat(bits, base);
[all …]
|