Home
last modified time | relevance | path

Searched refs:depth (Results 151 – 175 of 271) sorted by relevance

1234567891011

/plugin/components/
H A DREADME.md67 `pluginname.example`. These files can be put in subdirectories of arbitrary depth to
/plugin/davcal/vendor/sabre/xml/
H A DCHANGELOG.md143 * Changed: Reader::parse returns an array with 1 level less depth.
/plugin/davcal/vendor/sabre/dav/tests/Sabre/DAV/Locks/
H A DPluginTest.php102 $depth = $xml->xpath('/d:prop/d:lockdiscovery/d:activelock/d:depth');
103 $this->assertEquals('infinity',(string)$depth[0]);
/plugin/amcharts/assets/amcharts/plugins/export/libs/jszip/
H A Djszip.js5144 this.depth = new utils.Buf16(2*L_CODES+1); //uch depth[2*L_CODES+1];
5145 zero(this.depth);
8471 function smaller(tree, n, m, depth) { argument
8475 (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));
8494 smaller(tree, s.heap[j+1], s.heap[j], s.depth)) {
8498 if (smaller(tree, v, s.heap[j], s.depth)) { break; }
8599 s.depth[n] = 0;
8614 s.depth[node] = 0;
8648 s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;
H A Djszip.min.js13 …*cb+1),f(this.heap),this.heap_len=0,this.heap_max=0,this.depth=new C.Buf16(2*cb+1),f(this.depth),t…
14depth)&&e++,!q(b,d,a.heap[e],a.depth));)a.heap[c]=a.heap[e],c=e,e<<=1;a.heap[c]=d}function s(a,b,c…
/plugin/aichat/vendor/erusev/parsedown/
H A DREADME.md51 In both cases you should strongly consider employing defence-in-depth measures, like [deploying a Content-Security-Policy](https://scotthelme.co.uk/content-security-policy-an-introduction/) (a browser security feature) so that your page is likely to be safe even if an attacker finds a vulnerability in one of the first lines of defence above.
/plugin/photogallery/
H A Dsyntax.php339 $depth = !empty($data['recursive']) ? 0 : 1;
343 array('depth'=>$depth),
/plugin/authgooglesheets/vendor/phpseclib/phpseclib/phpseclib/Net/
H A DSFTP.php1023 static $depth = 0;
1026 if ($depth != 0 && $key == '..') {
1041 $depth++;
1043 $depth--;
/plugin/findologicxmlexport/vendor/jms/serializer/src/Metadata/Driver/
H A DAnnotationDriver.php245 $propertyMetadata->maxDepth = $annot->depth;
/plugin/sequencediagram/bower_components/lodash/dist/
H A Dlodash.js2933 function baseFlatten(array, depth, predicate, isStrict, result) { argument
2942 if (depth > 0 && predicate(value)) {
2943 if (depth > 1) {
2945 baseFlatten(value, depth - 1, predicate, isStrict, result);
7369 function flattenDepth(array, depth) {
7374 depth = depth === undefined ? 1 : toInteger(depth);
7375 return baseFlatten(array, depth);
9305 function flatMapDepth(collection, iteratee, depth) {
9306 depth = depth === undefined ? 1 : toInteger(depth);
9307 return baseFlatten(map(collection, iteratee), depth);
/plugin/sequencediagram/bower_components/lodash/
H A Dlodash.js2933 function baseFlatten(array, depth, predicate, isStrict, result) { argument
2942 if (depth > 0 && predicate(value)) {
2943 if (depth > 1) {
2945 baseFlatten(value, depth - 1, predicate, isStrict, result);
7369 function flattenDepth(array, depth) {
7374 depth = depth === undefined ? 1 : toInteger(depth);
7375 return baseFlatten(array, depth);
9305 function flatMapDepth(collection, iteratee, depth) {
9306 depth = depth === undefined ? 1 : toInteger(depth);
9307 return baseFlatten(map(collection, iteratee), depth);
/plugin/xlsx2dw/packages/jszip/
H A Djszip.js7115 this.depth = new utils.Buf16(2 * L_CODES + 1); //uch depth[2*L_CODES+1];
7116 zero(this.depth);
10684 function smaller(tree, n, m, depth) { argument
10688 (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));
10707 smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {
10711 if (smaller(tree, v, s.heap[j], s.depth)) { break; }
10812 s.depth[n] = 0;
10827 s.depth[node] = 0;
10861 s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;
/plugin/imapmarkers/syntax/
H A Dimapmarkers_simple_html_dom.php157 function dump($show_attr = true, $depth = 0) { argument
158 echo str_repeat("\t", $depth) . $this->tag;
172 $node->dump($show_attr, $depth + 1);
/plugin/diagramsnet/lib/math/jax/element/mml/
H A Djax.js19depth:"0ex",linebreak:a.LINEBREAK.AUTO},hasDimAttr:function(){return(this.hasValue("width")||this.…
/plugin/icalevents/vendor/sabre/xml/
H A DCHANGELOG.md204 * Changed: Reader::parse returns an array with 1 level less depth.
/plugin/webdav/vendor/sabre/xml/
H A DCHANGELOG.md210 * Changed: Reader::parse returns an array with 1 level less depth.
/plugin/dw2pdf/vendor/mpdf/mpdf/src/
H A DTTFontFile.php3838 $maxdepth = $depth = -1;
3841 $this->getGlyphData($originalGlyphIdx, $maxdepth, $depth, $points, $contours);
4465 function getGlyphData($originalGlyphIdx, &$maxdepth, &$depth, &$points, &$contours)
4467 $depth++;
4468 $maxdepth = max($maxdepth, $depth);
4472 $this->getGlyphData($glyphIdx, $maxdepth, $depth, $points, $contours);
4474 } elseif (($this->glyphdata[$originalGlyphIdx]['nContours'] > 0) && $depth > 0) { // simple
4479 $depth--;
4453 getGlyphData($originalGlyphIdx, & $maxdepth, & $depth, & $points, & $contours) global() argument
H A DOtlDump.php4007 function getGlyphData($originalGlyphIdx, &$maxdepth, &$depth, &$points, &$contours) argument
4009 $depth++;
4010 $maxdepth = max($maxdepth, $depth);
4013 $this->getGlyphData($glyphIdx, $maxdepth, $depth, $points, $contours);
4016 if (($this->glyphdata[$originalGlyphIdx]['nContours'] > 0) && $depth > 0) { // simple
4021 $depth--;
/plugin/codemirror/dist/modes/
H A Derlang.min.js.map1depth","len","tokenStack","dep","maybe_drop_pre","maybe_drop_post","s","last","push","slice","d","…
H A Dapl.min.js.map1 …\"greaterThanOrEqual\"],\n \"≠\": [null, \"notEqual\"],\n \"≡\": [\"depth\", \"match\"],\n …
H A Dsql.min.js.map1depth","m","pushContext","type","context","prev","indent","indentation","col","column","popContext…
/plugin/datatables/assets/jszip/dist/
H A Djszip.min.js
/plugin/jplayer/vendor/happyworm/jplayer/lib/aurora/
H A Dflac.js716 depth = stream.readUInt32(),
/plugin/xcom/
H A Dscript.js397 case 'dokuwiki.getPagelist': //(hash),(depth:n)
/plugin/diagramsnet/lib/js/jszip/
H A Djszip.min.js14 …*ea+1),f(this.heap),this.heap_len=0,this.heap_max=0,this.depth=new E.Buf16(2*ea+1),f(this.depth),t…
15depth)&&e++,!s(b,d,a.heap[e],a.depth));)a.heap[c]=a.heap[e],c=e,e<<=1;a.heap[c]=d}function u(a,b,c…

1234567891011