/frameworks/opt/calendar/tests/src/com/android/calendarcommon2/ |
EventRecurrenceTest.java | 353 verifyRecurType("FREQ=DAILY;BYDAY=1SU,-2MO,+33TU,WE,TH,FR,SA", 365 EventRecurrence.WE, 383 verifyRecurType("FREQ=WEEKLY;WKST=MO;UNTIL=20100129T130000Z;INTERVAL=1;BYDAY=MO,TU,WE,", 394 EventRecurrence.WE, 409 + "BYDAY=MO,TU,WE,TH,FR,SA,SU", 420 EventRecurrence.WE, 438 verifyRecurType("FREQ=MONTHLY;BYDAY=MO,TU,WE,TH,FR;BYSETPOS=-1", 449 EventRecurrence.WE, 553 verifyRecurType("FREQ=WEEKLY;WKST=SU;INTERVAL=1;BYDAY=MO,TU,WE,TH,FR", 564 EventRecurrence.WE, [all...] |
/frameworks/opt/calendar/src/com/android/calendarcommon2/ |
EventRecurrence.java | 44 public static final int WE = 0x00080000; 98 /* values for bit vector that keeps track of what we have already seen */ 132 sParseWeekdayMap.put("WE", WE); 165 * constants. btw, I think we should switch to those here too, to 179 return WE; 202 return WE; 223 case WE: 238 * constants. btw, I think we should switch to those here too, to 251 case WE [all...] |
/external/llvm/utils/TableGen/ |
CodeGenSchedule.cpp | 53 // reason to use top-level bars, but we need a way to verify they don't exist 143 // Reserve space because we can. Reallocation would be ok. 295 WE = SchedWrites.end(); WI != WE; ++WI) { 561 for (IdxIter WI = SC.Writes.begin(), WE = SC.Writes.end(); WI != WE; ++WI) 578 for (IdxIter WI = Writes.begin(), WE = Writes.end(); WI != WE; ++WI) 620 for (IdxIter WI = OperWrites.begin(), WE = OperWrites.end(); WI != WE; ++WI) [all...] |
SubtargetEmitter.cpp | [all...] |
/packages/apps/Calendar/src/com/android/calendar/ |
EventRecurrenceFormatter.java | 107 // Cache this stuff so we won't have to redo work again later. 166 case EventRecurrence.WE: return Calendar.WEDNESDAY;
|
/packages/apps/Calendar/src/com/android/calendar/event/ |
EditEventHelper.java | 283 // It's a problem if we try to save a non-existent or invalid model or if we're 284 // modifying an existing event and we have the wrong original model 360 // We've changed a recurring event to a non-recurring event. 361 // If the event we are editing is the first in the series, 367 // Update the current repeating event to end at the new start time. We 382 // We need to update the existing recurrence to end before the exception 383 // event starts. If the recurrence rule has a COUNT, we need to adjust 387 // we don't want to overwrite it. 406 // We've changed a recurring event to a non-recurring event [all...] |
/external/llvm/lib/Transforms/Vectorize/ |
BBVectorize.cpp | 535 // We mark this instruction as zero-cost because scalar GEPs are usually 536 // lowered to the intruction addressing mode. At the moment we don't 619 // If this is a trivial offset, then we'll get something like 620 // 1*sizeof(type). With target data, which we need anyway, this will get 720 // Now we have a map of all of the pairable instructions and we need to [all...] |
/external/e2fsprogs/lib/et/ |
texinfo.tex | 7 % BECAUSE THIS PROGRAM IS LICENSED FREE OF CHARGE, WE PROVIDE ABSOLUTELY 94 %Software Foundation at 675 Mass Ave, Cambridge, MA 02139. We have not yet 95 %worked out a simple rule that can be stated here, but we will often permit 96 %this. We will be guided by the two goals of preserving the free status of 108 % Save some parts of plain tex whose names we will redefine. 585 % When we turn headings on, set the page number to 1, 844 % To define \realbackslash, we must make \ not be an escape. 845 % We must first make another character (@) an escape 846 % so we do not become unable to do a definition. 866 % Now produce the complete index entry. We process the index-string again [all...] |
/cts/suite/cts/deviceTests/browserbench/assets/octane/ |
pdfjs.js | 383 ///////// The PDF we want to render, encoded in base64. //////// [all...] |