Home
last modified time | relevance | path

Searched refs:openings (Results 1 – 10 of 10) sorted by relevance

/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
DBidi.java544 Opening[] openings = new Opening[SIMPLE_OPENINGS_COUNT]; field in Bidi.BracketData
2049 bd.openings = new Opening[SIMPLE_OPENINGS_COUNT]; in bracketInit()
2105 if (pLastIsoRun.limit >= bd.openings.length) { /* no available new entry */ in bracketAddOpening()
2106 Opening[] saveOpenings = bd.openings; in bracketAddOpening()
2109 count = bd.openings.length; in bracketAddOpening()
2110 bd.openings = new Opening[count * 2]; in bracketAddOpening()
2114 System.arraycopy(saveOpenings, 0, bd.openings, 0, count); in bracketAddOpening()
2116 pOpening = bd.openings[pLastIsoRun.limit]; in bracketAddOpening()
2118 pOpening = bd.openings[pLastIsoRun.limit]= new Opening(); in bracketAddOpening()
2134 qOpening = bd.openings[k]; in fixN0c()
[all …]
/external/icu/android_icu4j/src/main/java/android/icu/text/
DBidi.java544 Opening[] openings = new Opening[SIMPLE_OPENINGS_COUNT]; field in Bidi.BracketData
2013 bd.openings = new Opening[SIMPLE_OPENINGS_COUNT]; in bracketInit()
2069 if (pLastIsoRun.limit >= bd.openings.length) { /* no available new entry */ in bracketAddOpening()
2070 Opening[] saveOpenings = bd.openings; in bracketAddOpening()
2073 count = bd.openings.length; in bracketAddOpening()
2074 bd.openings = new Opening[count * 2]; in bracketAddOpening()
2078 System.arraycopy(saveOpenings, 0, bd.openings, 0, count); in bracketAddOpening()
2080 pOpening = bd.openings[pLastIsoRun.limit]; in bracketAddOpening()
2082 pOpening = bd.openings[pLastIsoRun.limit]= new Opening(); in bracketAddOpening()
2098 qOpening = bd.openings[k]; in fixN0c()
[all …]
/external/icu/icu4c/source/common/
Dubidi.c681 bd->openings=pBiDi->openingsMemory; in bracketInit()
684 bd->openings=bd->simpleOpenings; in bracketInit()
750 if(bd->openings==bd->simpleOpenings) in bracketAddOpening()
753 bd->openings=pBiDi->openingsMemory; /* may have changed */ in bracketAddOpening()
756 pOpening=&bd->openings[pLastIsoRun->limit]; in bracketAddOpening()
774 for(k=openingIndex+1, qOpening=&bd->openings[k]; k<pLastIsoRun->limit; k++, qOpening++) { in fixN0c()
801 pOpening=&bd->openings[openIdx]; in bracketProcessClosing()
848 bd->openings[pLastIsoRun->limit-1].position==pOpening->position) in bracketProcessClosing()
856 bd->openings[k].position==pOpening->position) in bracketProcessClosing()
857 bd->openings[k--].match=0; in bracketProcessClosing()
[all …]
Dubidiimp.h172 Opening *openings; /* pointer to current array of entries */ member
/external/netperf/doc/
Dtexinfo.tex4174 % table of contents chapter openings themselves.
/external/e2fsprogs/doc/
Dtexinfo.tex4569 % table of contents chapter openings themselves.
/external/e2fsprogs/lib/et/
Dtexinfo.tex4569 % table of contents chapter openings themselves.
/external/bison/build-aux/
Dtexinfo.tex5970 % table of contents chapter openings themselves.
/external/libmicrohttpd/doc/
Dtexinfo.tex5971 % table of contents chapter openings themselves.
/external/tpm2/
Dpart4.txt2879 …The number of available session slot openings. When this is 1, a session can't be created or loade…
14733 414 // Don't bother looking if no openings