| /external/bison/src/ |
| conflicts.c | 382 | and flag as inconsistent the states that still have conflicts. |
400 set_conflicts (states[i], errors);
402 /* For uniformity of the code, make sure all the states have a valid
404 if (!states[i]->errs)
405 states[i]->errs = errs_new (0, 0);
503 | Output the detailed description of states with conflicts. |
513 state *s = states[i];
544 count += count_sr_conflicts (states[i]);
545 count += count_rr_conflicts (states[i], false);
576 src_total += count_sr_conflicts (states[i])
[all...] |
| /frameworks/base/core/java/android/bluetooth/ |
| BluetoothManager.java | 152 * states.
154 * <p> If none of the devices match any of the given states,
165 * @param states Array of states. States can be one of
172 public List<BluetoothDevice> getDevicesMatchingConnectionStates(int profile, int[] states) {
185 devices = iGatt.getDevicesMatchingConnectionStates(states);
|
| IBluetoothHeadset.aidl | 31 List<BluetoothDevice> getDevicesMatchingConnectionStates(in int[] states);
|
| /frameworks/base/core/java/android/view/inputmethod/ |
| InputConnectionWrapper.java | 229 public boolean clearMetaKeyStates(int states) {
230 return mTarget.clearMetaKeyStates(states);
|
| InputConnection.java | [all...] |
| /external/gmock/src/ |
| gmock-spec-builders.cc | 582 StateMap& states() { return states_; } function in class:__anon11286::MockObjectRegistry
650 g_mock_object_registry.states()[mock_obj].leakable = true;
678 if (g_mock_object_registry.states().count(mock_obj) == 0) {
687 g_mock_object_registry.states()[mock_obj].function_mockers;
705 g_mock_object_registry.states()[mock_obj].function_mockers.insert(mocker);
715 MockObjectState& state = g_mock_object_registry.states()[mock_obj];
739 g_mock_object_registry.states().begin();
740 it != g_mock_object_registry.states().end(); ++it) {
745 g_mock_object_registry.states().erase(it);
757 if (g_mock_object_registry.states().count(mock_obj) == 0)
[all...] |
| /external/google-breakpad/src/testing/src/ |
| gmock-spec-builders.cc | 582 StateMap& states() { return states_; } function in class:__anon11531::MockObjectRegistry
650 g_mock_object_registry.states()[mock_obj].leakable = true;
678 if (g_mock_object_registry.states().count(mock_obj) == 0) {
687 g_mock_object_registry.states()[mock_obj].function_mockers;
705 g_mock_object_registry.states()[mock_obj].function_mockers.insert(mocker);
715 MockObjectState& state = g_mock_object_registry.states()[mock_obj];
739 g_mock_object_registry.states().begin();
740 it != g_mock_object_registry.states().end(); ++it) {
745 g_mock_object_registry.states().erase(it);
757 if (g_mock_object_registry.states().count(mock_obj) == 0)
[all...] |
| /external/guava/guava/src/com/google/common/util/concurrent/ |
| ServiceManager.java | 225 * invoked in the same order as the underlying service enters those states. Additionally, at most
251 * invoked in the same order as the underlying service enters those states. Additionally, at most
372 * <p>N.B. This snapshot is guaranteed to be consistent, i.e. the set of states returned will
413 final Multiset<State> states = servicesByState.keys(); field in class:ServiceManager.ServiceManagerState
444 return states.count(RUNNING) == numberOfServices
445 || states.contains(STOPPING)
446 || states.contains(TERMINATED)
447 || states.contains(FAILED);
456 return states.count(TERMINATED) + states.count(FAILED) == numberOfServices
[all...] |
| /packages/apps/DeskClock/src/com/android/deskclock/timer/ |
| TimerFragment.java | 59 * Displays a vertical list of timers in all states.
340 final int[] states = computePageIndicatorStates(page, pageIndicatorCount, pageCount); local
341 for (int i = 0; i < states.length; i++) {
342 final int state = states[i];
382 final int[] states = new int[pageIndicatorCount]; local
383 Arrays.fill(states, 0);
387 return states;
391 Arrays.fill(states, 0, rangeSize, R.drawable.ic_swipe_circle_dark);
395 states[0] = R.drawable.ic_swipe_circle_top;
400 states[rangeSize - 1] = R.drawable.ic_swipe_circle_bottom
[all...] |
| /external/autotest/client/cros/networking/ |
| mm1_proxy.py | 247 def wait_for_states(self, states,
250 Wait for the modem to transition to a state in |states|.
252 This method does not support transitory states (eg. enabling,
255 @param states: List of states the modem can transition to.
258 one of the accepted states.
261 for state in states:
269 'wait_for_states() does not support transitory states.')
273 mm1_constants.MM_MODEM_PROPERTY_NAME_STATE] in states,
276 'states: %s, current state=%s'
[all...] |
| /packages/apps/Bluetooth/src/com/android/bluetooth/a2dp/ |
| A2dpService.java | 170 List<BluetoothDevice> getDevicesMatchingConnectionStates(int[] states) {
172 return mStateMachine.getDevicesMatchingConnectionStates(states);
273 public List<BluetoothDevice> getDevicesMatchingConnectionStates(int[] states) {
276 return service.getDevicesMatchingConnectionStates(states);
|
| /packages/apps/Bluetooth/src/com/android/bluetooth/a2dpsink/ |
| A2dpSinkService.java | 151 List<BluetoothDevice> getDevicesMatchingConnectionStates(int[] states) {
153 return mStateMachine.getDevicesMatchingConnectionStates(states);
278 public List<BluetoothDevice> getDevicesMatchingConnectionStates(int[] states) {
281 return service.getDevicesMatchingConnectionStates(states);
|
| /packages/apps/Settings/src/com/android/settings/fuelgauge/ |
| BatteryFlagParser.java | 41 return ((mState2 ? record.states2 : record.states) & mFlag) != 0;
|
| /frameworks/base/core/java/android/text/method/ |
| MetaKeyKeyListener.java | 67 * // Use the combined meta states from the event and the key listener.
110 // so as not to conflict with any meta key states publicly defined by KeyEvent.
417 public void clearMetaKeyState(View view, Editable content, int states) {
418 clearMetaKeyState(content, states);
421 public static void clearMetaKeyState(Editable content, int states) {
422 if ((states&META_SHIFT_ON) != 0) content.removeSpan(CAP);
423 if ((states&META_ALT_ON) != 0) content.removeSpan(ALT);
424 if ((states&META_SYM_ON) != 0) content.removeSpan(SYM);
425 if ((states&META_SELECTING) != 0) content.removeSpan(SELECTING);
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/pgen2/ |
| pgen.py | 39 states = []
46 states.append(arcs)
47 c.states.append(states)
48 c.dfas[c.symbol2number[name]] = (states, self.make_first(c, name))
170 # To turn an NFA into a DFA, we define the states of the DFA
171 # to correspond to *sets* of states of the NFA. Then do some
188 states = [DFAState(closure(start), finish)]
189 for state in states: # NB states grows while we're iteratin
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/pgen2/ |
| pgen.py | 39 states = []
46 states.append(arcs)
47 c.states.append(states)
48 c.dfas[c.symbol2number[name]] = (states, self.make_first(c, name))
170 # To turn an NFA into a DFA, we define the states of the DFA
171 # to correspond to *sets* of states of the NFA. Then do some
188 states = [DFAState(closure(start), finish)]
189 for state in states: # NB states grows while we're iteratin
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/pgen2/ |
| pgen.py | 39 states = []
46 states.append(arcs)
47 c.states.append(states)
48 c.dfas[c.symbol2number[name]] = (states, self.make_first(c, name))
170 # To turn an NFA into a DFA, we define the states of the DFA
171 # to correspond to *sets* of states of the NFA. Then do some
188 states = [DFAState(closure(start), finish)]
189 for state in states: # NB states grows while we're iteratin
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/pgen2/ |
| pgen.py | 39 states = []
46 states.append(arcs)
47 c.states.append(states)
48 c.dfas[c.symbol2number[name]] = (states, self.make_first(c, name))
170 # To turn an NFA into a DFA, we define the states of the DFA
171 # to correspond to *sets* of states of the NFA. Then do some
188 states = [DFAState(closure(start), finish)]
189 for state in states: # NB states grows while we're iteratin
[all...] |
| /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/mashups/ |
| order.py | 193 states = [i.state for i in r.instances]
194 if states.count('running') != len(states):
195 print(states)
197 states = [i.update() for i in r.instances]
|
| /external/freetype/src/psnames/ |
| psmodule.c | 255 FT_UInt *states )
265 if ( states[n] == 0 )
268 states[n] = 1;
280 FT_UInt *states )
290 states[n] = 2;
|
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/psnames/ |
| psmodule.c | 255 FT_UInt *states )
265 if ( states[n] == 0 )
268 states[n] = 1;
280 FT_UInt *states )
290 states[n] = 2;
|
| /external/pdfium/third_party/freetype/src/psnames/ |
| psmodule.c | 255 FT_UInt *states )
265 if ( states[n] == 0 )
268 states[n] = 1;
280 FT_UInt *states )
290 states[n] = 2;
|
| /system/extras/tests/net_test/ |
| sock_diag.py | 72 "InetDiagReqV2", "=BBBxIS", "family protocol ext states id",
229 states=ALL_NON_TIME_WAIT):
241 diag_req = InetDiagReqV2((family, protocol, ext, states, sock_id))
339 states = 0xffffffff variable in class:SockDiag
341 sock_id=sock_id, ext=ext, states=states)
|
| /external/llvm/lib/Support/ |
| regengine.inc | 81 states st; /* current states */
82 states fresh; /* states for a fresh start */
83 states tmp; /* temporary */
84 states empty; /* empty set of states */
95 static states step(struct re_guts *, sopno, sopno, states, int, states);
[all...] |
| /external/selinux/sepolgen/src/sepolgen/ |
| lex.py | 77 self.lexstatere = {} # Dictionary mapping lexer states to master regexs
78 self.lexstateretext = {} # Dictionary mapping lexer states to regex strings
80 self.lexstatestack = [] # Stack of lexer states
461 # state names, this function returns a tuple (states,tokenname) where states
472 states = tuple(parts[1:i])
474 states = ('INITIAL',)
476 if 'ANY' in states:
477 states = tuple(names.keys())
480 return (states,tokenname
[all...] |
