| /frameworks/base/libs/androidfw/ |
| BackupHelpers.cpp | 976 FileState states[4];
980 states[0].modTime_sec = 0xfedcba98;
981 states[0].modTime_nsec = 0xdeadbeef;
982 states[0].mode = 0777; // decimal 511, hex 0x000001ff
983 states[0].size = 0xababbcbc;
984 states[0].crc32 = 0x12345678;
985 states[0].nameLen = -12;
986 r.s = states[0];
990 states[1].modTime_sec = 0x93400031;
991 states[1].modTime_nsec = 0xdeadbeef
[all...] |
| /external/icu/icu4c/source/common/ |
| rbbicst.pl | 29 $states{"pop"} = 255; # Add the "pop" to the list of defined state names.
62 if ($states{$state_name} != 0) {
65 $states{$state_name} = $num_states;
161 # We read all states first, before writing anything, so that the state numbers
162 # for the destination states are all available to be written.
184 # Check that all of the destination states have been defined
187 $states{"exit"} = 0; # Predefined state name, terminates state machine.
189 if ($states{$state_dest_state[$state]} == 0 && $state_dest_state[$state] ne "exit") {
193 if ($state_push_state[$state] ne "" && $states{$state_push_state[$state]} == 0) {
302 print " $states{$state_dest_state[$state]},"
[all...] |
| /external/llvm/utils/TableGen/ |
| DFAPacketizerEmitter.cpp | 72 // represents the possible resource states that can result from adding a L_or_M
76 // two states [0x01] and [0x10] into a DFA with a single state [0x01, 0x10].
79 // a map from inputs to new states.
104 // PossibleStates is the set of valid resource states that ensue from valid
133 // Set of states. Need to keep this sorted to emit the transition table.
135 StateSet states; member in class:__anon15675::DFA
184 // Iterate over all resource states in currentState.
242 auto IterPair = states.insert(State());
268 DFA::StateSet::iterator SI = states.begin();
271 std::vector<int> StateEntry(states.size())
[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/libxml2/ |
| relaxng.c | 321 int nbState; /* the number of states */
374 xmlRelaxNGStatesPtr states; /* the accumulated state list */ member in struct:_xmlRelaxNGValidCtxt
376 xmlRelaxNGStatesPtr freeState; /* the pool of free valid states */
1026 xmlRngVErrMemory(ctxt, "allocating states\n");
1035 xmlRngVErrMemory(ctxt, "allocating states\n");
10167 xmlRelaxNGStatesPtr states = NULL, res = NULL; local
10311 xmlRelaxNGStatesPtr states = NULL; local
10601 xmlRelaxNGStatesPtr states, res; local
[all...] |
| /frameworks/base/core/java/android/bluetooth/ |
| BluetoothManager.java | 149 * states.
151 * <p> If none of the devices match any of the given states,
162 * @param states Array of states. States can be one of
169 public List<BluetoothDevice> getDevicesMatchingConnectionStates(int profile, int[] states) {
182 devices = iGatt.getDevicesMatchingConnectionStates(states);
|
| /external/bison/src/ |
| LR0.c | 1 /* Generate the LR(0) parser states for Bison.
234 | SHIFTSET is set up as a vector of those states. |
300 | Build STATES. |
306 states = xcalloc (nstates, sizeof *states);
313 the states have valid transitions and reductions members,
322 states[s->number] = s;
333 | Compute the LR(0) parser states (see state.h for details) from the |
349 /* States are queued when they are created; process them all. */
362 /* Find the itemsets of the states that shifts can reach. *
[all...] |
| /external/openfst/src/include/fst/ |
| const-fst.h | 19 // Simple concrete immutable FST whose states and arcs are each stored
41 // States and arcs each implemented by single arrays, templated on the
111 // States implemented by array *states_ below, arcs by (single) *arcs_.
131 MappedFile *states_region_; // Mapped file for states
133 State *states_; // States represenation
135 StateId nstates_; // Number of states
165 // Count # of states and arcs.
339 // before writing to compute number of states and arcs.
382 size_t pos = 0, states = 0; local
392 ++states;
[all...] |
| minimize.h | 50 // - states
122 // where E is the number of edges in the machine and N is number of states.
125 // An N Log N algorithm for minimizing states in a finite automaton
212 // - loop over states in fst and split on final, creating two blocks
287 // Partioning of states into equivalence classes
296 // Priority queue of open arc iterators for all states in the 'splitter'
391 // cluster states according to height (distance to final state)
405 // refine states based on arc sort (out degree, arc equivalence)
415 // sort states within equivalence class
448 // Given a partition and a mutable fst, merge states of Fst inplac
[all...] |
| push.h | 41 // initial state when 'reverse == false' and to the final states when
59 // divided at the final states if 'at_final == true' and at the
67 // Remove 'w' from the final states
96 // states.
122 // states.
|
| state-reachable.h | 35 // Computes the (final) states reachable from a given state in an FST.
43 // final states must have out-degree 0.
135 // Tests reachability of final states from a given state. To test for
178 // Access to the state-to-index mapping. Unassigned states have index -1.
182 // to the final states as intervals of the final state indices.
|
| /frameworks/opt/telephony/src/java/com/android/internal/telephony/cdma/ |
| CdmaServiceStateTracker.java | 362 String states[] = (String[])ar.result; local
369 if (states.length > 9) {
371 if (states[4] != null) {
372 baseStationId = Integer.parseInt(states[4]);
374 if (states[5] != null) {
375 baseStationLatitude = Integer.parseInt(states[5]);
377 if (states[6] != null) {
378 baseStationLongitude = Integer.parseInt(states[6]);
385 if (states[8] != null) {
386 systemId = Integer.parseInt(states[8])
623 String states[]; local
[all...] |
| /external/aac/libFDK/include/ |
| FDK_hybrid.h | 116 FIXP_DBL *bufferLFReal[3]; /*!< LF real filter states. */
117 FIXP_DBL *bufferLFImag[3]; /*!< LF imag filter states. */
127 FIXP_DBL *pLFmemory; /*!< Pointer to LF states buffer. */
128 FIXP_DBL *pHFmemory; /*!< Pointer to HF states buffer. */
130 UINT LFmemorySize; /*!< Size of LF states buffer. */
131 UINT HFmemorySize; /*!< Size of HF states buffer. */
178 * \param initStatesFlag Indicates whether the states buffer has to be cleared.
192 * \brief Adjust Hybrdid Analysis Filterbank states.
195 * \param scalingValue Scaling value to be applied on filter states.
|
| /packages/apps/Messaging/src/com/android/messaging/ui/conversation/ |
| ConversationActivityUiState.java | 26 * Keeps track of the different UI states that the ConversationActivity may be in. This acts as
36 /*------ Overall UI states (conversation & contact picker) ------*/
75 // to be in sync with the UI states. Outside of the UI updates, the UI states here should
76 // ALWAYS be consistent with the actual states of the activity.
83 // The conversation activity may be initialized with only one of two states:
169 // This cannot happen when we are in one of the full-screen contact picking states.
209 // UI presentation to be temporarily out of sync with the states here.
271 // Always verify state validity whenever we initialize states.
|
| /external/icu/icu4c/source/tools/makeconv/ |
| makeconv.c | 493 staticData->maxBytesPerChar=(int8_t)data->ucm->states.maxCharLength;
494 staticData->minBytesPerChar=(int8_t)data->ucm->states.minCharLength;
495 staticData->conversionType=data->ucm->states.conversionType;
543 if(data->ucm->states.outputType<0) {
544 data->ucm->states.outputType=(int8_t)data->ucm->states.maxCharLength-1;
587 baseStates=&data->ucm->states;
638 UCMStates *states, *baseStates; local
652 states=&data->ucm->states;
[all...] |
| /external/jmonkeyengine/engine/src/test/jme3test/app/ |
| TestIDList.java | 153 StateCol[] states = new StateCol[20]; local
154 for (int i = 0; i < states.length; i++)
155 states[i] = new StateCol();
159 for (int i = 0; i < states.length; i++){
160 setState(states[i]);
|
| /external/libphonenumber/geocoder/test/com/google/i18n/phonenumbers/geocoding/ |
| PhoneNumberOfflineGeocoderTest.java | 69 // a result, the country name of United States in simplified Chinese is returned.
85 assertEquals("United States",
140 // User in Italy, American number. We should just show United States, in Spanish, and not more
147 // User in the States, language German, should show detailed data.
150 // User in the States, language French, no data for French, so we fallback to English detailed
|
| /external/lzma/xz-embedded/ |
| xz_lzma2.h | 23 * Maximum number of position states. A position state is the lowest pb
25 * are different sets of probabilities for different position states.
57 /* Total number of states */
58 #define STATES 12
60 /* The lowest 7 states indicate that the previous state was a literal. */
|
| /external/parameter-framework/parameter/ |
| SelectionCriterion.cpp | 131 // States
132 strFormattedDescription += "Possible states ";
139 // States
166 // States
167 strFormattedDescription += ", states: " +
|
| /external/valgrind/helgrind/ |
| README_MSMProp2.txt | 90 States are New, Read(VTS,LS), Write(VTS,LS)
126 Interpretation of the states
130 and MSMProp2 are easier to understand if the states Read and Write are
153 If we ignore the LS component of these states, the intuitive
154 interpretation of the VTS component is that it states the earliest
|
| /frameworks/support/design/eclair-mr1/android/support/design/widget/ |
| FloatingActionButtonEclairMr1.java | 250 final int[][] states = new int[3][]; local
254 states[i] = FOCUSED_ENABLED_STATE_SET;
258 states[i] = PRESSED_ENABLED_STATE_SET;
263 states[i] = new int[0];
267 return new ColorStateList(states, colors);
|
| /packages/apps/QuickSearchBox/src/com/android/quicksearchbox/ |
| SearchWidgetProvider.java | 78 SearchWidgetState[] states = new SearchWidgetState[appWidgetIds.length]; local
80 states[i] = getSearchWidgetState(context, appWidgetIds[i]);
82 return states;
91 SearchWidgetState[] states = getSearchWidgetStates(context); local
93 for (SearchWidgetState state : states) {
|
| /frameworks/base/core/java/android/content/ |
| UndoManager.java | 34 * a stack of undo states; each state can have one or more undo operations
137 // number of undo states we write to not exceed X bytes.
209 * Set the maximum number of undo states that will be retained.
219 * Return the current maximum number of undo states.
226 * Perform undo of last/top <var>count</var> undo states. The states impacted
229 * undo states will be visible and available for undo. If non-null, only those
230 * states that contain one of the owners specified here will be visible.
231 * @param count Number of undo states to pop.
232 * @return Returns the number of undo states that were actually popped
[all...] |
| /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...] |
