Searched refs:openings (Results 1 – 16 of 16) sorted by relevance
81 std::stack<char> openings; in Capturer() local91 openings.push(c); in Capturer()97 openings.pop(); in Capturer()100 if (start != pos && openings.size() == 0) { in Capturer()108 assert(openings.size() == 0 && "Mismatched openings"); in Capturer()
66 : openings(opens) in window_toggle_values()71 openings_type openings; member126 [&](){return localState->coordinator.in(localState->openings);}, in window_toggle_observer()294 static auto member(Observable&& o, Openings&& openings, ClosingSelector&& closingSelector) in member()295 …-> decltype(o.template lift<Value>(WindowToggle(std::forward<Openings>(openings), std::forward<Clo… in member()296 …return o.template lift<Value>(WindowToggle(std::forward<Openings>(openings), std::forward<Clo… in member()309 …static auto member(Observable&& o, Openings&& openings, ClosingSelector&& closingSelector, Coordin… in member()310 …-> decltype(o.template lift<Value>(WindowToggle(std::forward<Openings>(openings), std::forward<Clo… in member()311 …return o.template lift<Value>(WindowToggle(std::forward<Openings>(openings), std::forward<Clo… in member()
549 Opening[] openings = new Opening[SIMPLE_OPENINGS_COUNT]; field in Bidi.BracketData2059 bd.openings = new Opening[SIMPLE_OPENINGS_COUNT]; in bracketInit()2115 if (pLastIsoRun.limit >= bd.openings.length) { /* no available new entry */ in bracketAddOpening()2116 Opening[] saveOpenings = bd.openings; in bracketAddOpening()2119 count = bd.openings.length; in bracketAddOpening()2120 bd.openings = new Opening[count * 2]; in bracketAddOpening()2124 System.arraycopy(saveOpenings, 0, bd.openings, 0, count); in bracketAddOpening()2126 pOpening = bd.openings[pLastIsoRun.limit]; in bracketAddOpening()2128 pOpening = bd.openings[pLastIsoRun.limit]= new Opening(); in bracketAddOpening()2144 qOpening = bd.openings[k]; in fixN0c()[all …]
549 Opening[] openings = new Opening[SIMPLE_OPENINGS_COUNT]; field in Bidi.BracketData2025 bd.openings = new Opening[SIMPLE_OPENINGS_COUNT]; in bracketInit()2081 if (pLastIsoRun.limit >= bd.openings.length) { /* no available new entry */ in bracketAddOpening()2082 Opening[] saveOpenings = bd.openings; in bracketAddOpening()2085 count = bd.openings.length; in bracketAddOpening()2086 bd.openings = new Opening[count * 2]; in bracketAddOpening()2090 System.arraycopy(saveOpenings, 0, bd.openings, 0, count); in bracketAddOpening()2092 pOpening = bd.openings[pLastIsoRun.limit]; in bracketAddOpening()2094 pOpening = bd.openings[pLastIsoRun.limit]= new Opening(); in bracketAddOpening()2110 qOpening = bd.openings[k]; in fixN0c()[all …]
682 bd->openings=pBiDi->openingsMemory; in bracketInit()685 bd->openings=bd->simpleOpenings; in bracketInit()754 if(bd->openings==bd->simpleOpenings) in bracketAddOpening()757 bd->openings=pBiDi->openingsMemory; /* may have changed */ in bracketAddOpening()760 pOpening=&bd->openings[pLastIsoRun->limit]; in bracketAddOpening()778 for(k=openingIndex+1, qOpening=&bd->openings[k]; k<pLastIsoRun->limit; k++, qOpening++) { in fixN0c()805 pOpening=&bd->openings[openIdx]; in bracketProcessClosing()852 bd->openings[pLastIsoRun->limit-1].position==pOpening->position) in bracketProcessClosing()860 bd->openings[k].position==pOpening->position) in bracketProcessClosing()861 bd->openings[k--].match=0; in bracketProcessClosing()[all …]
175 Opening *openings; /* pointer to current array of entries */ member
9604 std::stack<char> openings; in Capturer() local9614 openings.push(c); in Capturer()9620 openings.pop(); in Capturer()9623 if (start != pos && openings.size() == 0) { in Capturer()9631 assert(openings.size() == 0 && "Mismatched openings"); in Capturer()
2883 * Distribute #15 and Distribute #48: Introduced a socket timeout of 15 seconds on url openings
4569 % table of contents chapter openings themselves.
5971 % table of contents chapter openings themselves.
META-INF/ META-INF/MANIFEST.MF com/ com/ibm/ com/ ...
140938 openings %27522 ˈopənɪŋz
118270 openings %38927 ˈopənɪŋz