| /frameworks/base/core/java/android/content/res/ |
| ColorStateList.java | 63 * states that a view must either be in or not be in and the color specifies the color associated
65 * An item with no state spec is considered to match any set of states and is generally useful as
98 * states to colors.
100 public ColorStateList(int[][] states, @ColorInt int[] colors) {
101 mStateSpecs = states;
227 * Creates a new ColorStateList that has the same states and colors as this
480 * {@link android.view.View} states.
482 * @param stateSet an array of {@link android.view.View} states
487 * @return the color associated with that set of states in this {@link ColorStateList}.
511 * Return the states in this {@link ColorStateList}. The returned arra
548 final int[] states = stateSpecs[specIndex]; local
576 final int[][] states = mStateSpecs; local
[all...] |
| /frameworks/base/core/java/android/os/storage/ |
| OnObbStateChangeListener.java | 21 * states.
78 * Called when an OBB has changed states.
|
| /frameworks/base/core/java/android/view/inputmethod/ |
| InputConnectionWrapper.java | 117 public boolean clearMetaKeyStates(int states) {
118 return mTarget.clearMetaKeyStates(states);
|
| /frameworks/base/core/res/res/drawable/ |
| btn_check.xml | 19 <!-- Enabled states -->
50 <!-- Disabled states -->
|
| btn_check_holo_dark.xml | 19 <!-- Enabled states -->
50 <!-- Disabled states -->
|
| btn_check_holo_light.xml | 19 <!-- Enabled states -->
50 <!-- Disabled states -->
|
| /frameworks/opt/net/wifi/service/java/com/android/server/wifi/ |
| README.txt | 13 WifiService: Implements the IWifiManager 3rd party API. The API and the device state information (screen on/off, battery state, sleep policy) go as input into the WifiController which tracks high level states as to whether STA or AP mode is operational and controls the WifiStateMachine to handle bringup and shut down.
23 WifiStateMachine: Tracks the various states on STA and AP connectivity and handles bring up and shut down.
|
| /frameworks/opt/telephony/src/java/com/android/internal/telephony/ |
| EventLogTags.logtags | 45 # uses a new tag, "gsm_rat_switched_new", to log the correct service states.
80 # to log the correct "network_from" and "network_to" service states.
|
| /hardware/libhardware/include/hardware/ |
| bt_av.h | 22 /* Bluetooth AV connection states */
30 /* Bluetooth AV datapath states */
|
| bt_hl.h | 22 /* HL connection states */
45 /* HL connection states */
|
| /libcore/dalvik/src/main/java/dalvik/annotation/ |
| TestLevel.java | 20 * Defines an enumeration of possible states a test case can be in.
70 * the specification states that a method does nothing.
|
| /packages/apps/Settings/src/com/android/settings/vpn2/ |
| ConfigPreference.java | 60 String[] states = getContext().getResources() local
62 setSummary(states[mState]);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| regex_nfa.h | 207 * with its outgoing transition(s). All states have a single outgoing
208 * transition, except for accepting states (which have no outgoing
209 * transitions) and alt states, which have two outgoing transitions.
250 /// The Grep Matcher works on sets of states. Here are sets of states.
256 * A collection of all states making up an NFA.
259 * K is a finite set of states,
262 * F is a set of final (accepting) states.
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| regex_nfa.h | 207 * with its outgoing transition(s). All states have a single outgoing
208 * transition, except for accepting states (which have no outgoing
209 * transitions) and alt states, which have two outgoing transitions.
250 /// The Grep Matcher works on sets of states. Here are sets of states.
256 * A collection of all states making up an NFA.
259 * K is a finite set of states,
262 * F is a set of final (accepting) states.
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| regex_nfa.h | 207 * with its outgoing transition(s). All states have a single outgoing
208 * transition, except for accepting states (which have no outgoing
209 * transitions) and alt states, which have two outgoing transitions.
250 /// The Grep Matcher works on sets of states. Here are sets of states.
256 * A collection of all states making up an NFA.
259 * K is a finite set of states,
262 * F is a set of final (accepting) states.
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| regex_nfa.h | 196 // outgoing transition(s). All states have a single outgoing transition,
197 // except for accepting states (which have no outgoing transitions) and alt
198 // states, which have two outgoing transitions.
239 // The Grep Matcher works on sets of states. Here are sets of states.
242 // A collection of all states making up an NFA
245 // K is a finite set of states,
248 // F is a set of final (accepting) states.
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| regex_nfa.h | 196 // outgoing transition(s). All states have a single outgoing transition,
197 // except for accepting states (which have no outgoing transitions) and alt
198 // states, which have two outgoing transitions.
239 // The Grep Matcher works on sets of states. Here are sets of states.
242 // A collection of all states making up an NFA
245 // K is a finite set of states,
248 // F is a set of final (accepting) states.
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| regex_nfa.h | 196 // outgoing transition(s). All states have a single outgoing transition,
197 // except for accepting states (which have no outgoing transitions) and alt
198 // states, which have two outgoing transitions.
239 // The Grep Matcher works on sets of states. Here are sets of states.
242 // A collection of all states making up an NFA
245 // K is a finite set of states,
248 // F is a set of final (accepting) states.
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| regex_nfa.h | 196 // outgoing transition(s). All states have a single outgoing transition,
197 // except for accepting states (which have no outgoing transitions) and alt
198 // states, which have two outgoing transitions.
239 // The Grep Matcher works on sets of states. Here are sets of states.
242 // A collection of all states making up an NFA
245 // K is a finite set of states,
248 // F is a set of final (accepting) states.
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| regex_nfa.h | 207 * with its outgoing transition(s). All states have a single outgoing
208 * transition, except for accepting states (which have no outgoing
209 * transitions) and alt states, which have two outgoing transitions.
250 /// The Grep Matcher works on sets of states. Here are sets of states.
256 * A collection of all states making up an NFA.
259 * K is a finite set of states,
262 * F is a set of final (accepting) states.
|
| /sdk/find_java2/WinLauncher2/ |
| WinLauncher2.rc | 20 // English (United States) resources
149 #endif // English (United States) resources
|
| /external/bison/src/ |
| lalr.c | 84 transitions *sp = states[s]->transitions;
118 transitions *sp = states[s]->transitions;
124 to_state[k] = sp->states[i]->number;
172 transitions *sp = states[stateno]->transitions;
230 symbol_number symbol1 = states[to_state[i]]->accessing_symbol;
238 state *s = states[from_state[i]];
384 state_lookahead_tokens_count (states[i],
397 state_lookahead_tokens_count (states[i],
401 states[i]->reductions->lookahead_tokens = pLA;
420 reductions *reds = states[i]->reductions
[all...] |
| /external/aac/libSBRenc/src/ |
| resampler.cpp | 314 FDKmemclear(DownSampler->downFilter.states, sizeof(DownSampler->downFilter.states));
374 FIXP_BQS (*states)[2] = downFilter->states;
393 state1 = states[0][s1];
394 state2 = states[0][s2];
401 /* Load merged states (from next section) */
402 state1b = states[i+1][s1];
403 state2b = states[i+1][s2];
409 states[i+1][s2] = y<<1
[all...] |
| /bionic/libc/upstream-netbsd/lib/libc/regex/ |
| engine.c | 117 states st; /* current states */
118 states fresh; /* states for a fresh start */
119 states tmp; /* temporary */
120 states empty; /* empty set of states */
134 static states step(struct re_guts *g, sopno start, sopno stop, states bef, int ch, states aft)
[all...] |
| /art/compiler/dex/ |
| pass_driver_me_post_opt.cc | 30 * Disadvantage is the passes can't change their internal states depending on CompilationUnit:
|
