| /frameworks/support/paging/runtime/src/main/java/androidx/paging/ |
| PagedStorageDiffHelper.java | 35 final int newSize = newList.size() - newOffset - newList.computeTrailingNulls();
56 return newSize;
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 334 /// @param NewSize Array of desired node sizes.
337 unsigned CurSize[], const unsigned NewSize[]) {
340 if (CurSize[n] == NewSize[n])
344 NewSize[n] - CurSize[n]);
348 if (CurSize[n] >= NewSize[n])
358 if (CurSize[n] == NewSize[n])
362 CurSize[n] - NewSize[n]);
366 if (CurSize[n] >= NewSize[n])
373 assert(CurSize[n] == NewSize[n] && "Insufficient element shuffle");
387 /// NewSize[] will be filled in such that
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| MemoryLocation.h | 106 MemoryLocation getWithNewSize(uint64_t NewSize) const {
108 Copy.Size = NewSize;
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| IntervalMap.h | 335 /// @param NewSize Array of desired node sizes.
338 unsigned CurSize[], const unsigned NewSize[]) {
341 if (CurSize[n] == NewSize[n])
345 NewSize[n] - CurSize[n]);
349 if (CurSize[n] >= NewSize[n])
359 if (CurSize[n] == NewSize[n])
363 CurSize[n] - NewSize[n]);
367 if (CurSize[n] >= NewSize[n])
374 assert(CurSize[n] == NewSize[n] && "Insufficient element shuffle");
388 /// NewSize[] will be filled in such that
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/ |
| MemoryLocation.h | 106 MemoryLocation getWithNewSize(uint64_t NewSize) const {
108 Copy.Size = NewSize;
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| IntervalMap.h | 335 /// @param NewSize Array of desired node sizes.
338 unsigned CurSize[], const unsigned NewSize[]) {
341 if (CurSize[n] == NewSize[n])
345 NewSize[n] - CurSize[n]);
349 if (CurSize[n] >= NewSize[n])
359 if (CurSize[n] == NewSize[n])
363 CurSize[n] - NewSize[n]);
367 if (CurSize[n] >= NewSize[n])
374 assert(CurSize[n] == NewSize[n] && "Insufficient element shuffle");
388 /// NewSize[] will be filled in such that
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/ |
| MemoryLocation.h | 106 MemoryLocation getWithNewSize(uint64_t NewSize) const {
108 Copy.Size = NewSize;
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| IntervalMap.h | 335 /// @param NewSize Array of desired node sizes.
338 unsigned CurSize[], const unsigned NewSize[]) {
341 if (CurSize[n] == NewSize[n])
345 NewSize[n] - CurSize[n]);
349 if (CurSize[n] >= NewSize[n])
359 if (CurSize[n] == NewSize[n])
363 CurSize[n] - NewSize[n]);
367 if (CurSize[n] >= NewSize[n])
374 assert(CurSize[n] == NewSize[n] && "Insufficient element shuffle");
388 /// NewSize[] will be filled in such that
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/ |
| MemoryLocation.h | 113 MemoryLocation getWithNewSize(uint64_t NewSize) const {
115 Copy.Size = NewSize;
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| IntervalMap.h | 335 /// @param NewSize Array of desired node sizes.
338 unsigned CurSize[], const unsigned NewSize[]) {
341 if (CurSize[n] == NewSize[n])
345 NewSize[n] - CurSize[n]);
349 if (CurSize[n] >= NewSize[n])
359 if (CurSize[n] == NewSize[n])
363 CurSize[n] - NewSize[n]);
367 if (CurSize[n] >= NewSize[n])
374 assert(CurSize[n] == NewSize[n] && "Insufficient element shuffle");
388 /// NewSize[] will be filled in such that
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Analysis/ |
| MemoryLocation.h | 113 MemoryLocation getWithNewSize(uint64_t NewSize) const {
115 Copy.Size = NewSize;
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| IntervalMap.h | 335 /// @param NewSize Array of desired node sizes.
338 unsigned CurSize[], const unsigned NewSize[]) {
341 if (CurSize[n] == NewSize[n])
345 NewSize[n] - CurSize[n]);
349 if (CurSize[n] >= NewSize[n])
359 if (CurSize[n] == NewSize[n])
363 CurSize[n] - NewSize[n]);
367 if (CurSize[n] >= NewSize[n])
374 assert(CurSize[n] == NewSize[n] && "Insufficient element shuffle");
388 /// NewSize[] will be filled in such that
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/ |
| MemoryLocation.h | 113 MemoryLocation getWithNewSize(uint64_t NewSize) const {
115 Copy.Size = NewSize;
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| IntervalMap.h | 335 /// @param NewSize Array of desired node sizes.
338 unsigned CurSize[], const unsigned NewSize[]) {
341 if (CurSize[n] == NewSize[n])
345 NewSize[n] - CurSize[n]);
349 if (CurSize[n] >= NewSize[n])
359 if (CurSize[n] == NewSize[n])
363 CurSize[n] - NewSize[n]);
367 if (CurSize[n] >= NewSize[n])
374 assert(CurSize[n] == NewSize[n] && "Insufficient element shuffle");
388 /// NewSize[] will be filled in such that
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/ |
| MemoryLocation.h | 113 MemoryLocation getWithNewSize(uint64_t NewSize) const {
115 Copy.Size = NewSize;
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 334 /// @param NewSize Array of desired node sizes.
337 unsigned CurSize[], const unsigned NewSize[]) {
340 if (CurSize[n] == NewSize[n])
344 NewSize[n] - CurSize[n]);
348 if (CurSize[n] >= NewSize[n])
358 if (CurSize[n] == NewSize[n])
362 CurSize[n] - NewSize[n]);
366 if (CurSize[n] >= NewSize[n])
373 assert(CurSize[n] == NewSize[n] && "Insufficient element shuffle");
387 /// NewSize[] will be filled in such that
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| MemoryLocation.h | 106 MemoryLocation getWithNewSize(uint64_t NewSize) const {
108 Copy.Size = NewSize;
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| IntervalMap.h | 335 /// @param NewSize Array of desired node sizes.
338 unsigned CurSize[], const unsigned NewSize[]) {
341 if (CurSize[n] == NewSize[n])
345 NewSize[n] - CurSize[n]);
349 if (CurSize[n] >= NewSize[n])
359 if (CurSize[n] == NewSize[n])
363 CurSize[n] - NewSize[n]);
367 if (CurSize[n] >= NewSize[n])
374 assert(CurSize[n] == NewSize[n] && "Insufficient element shuffle");
388 /// NewSize[] will be filled in such that
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
| MemoryLocation.h | 106 MemoryLocation getWithNewSize(uint64_t NewSize) const {
108 Copy.Size = NewSize;
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| IntervalMap.h | 335 /// @param NewSize Array of desired node sizes.
338 unsigned CurSize[], const unsigned NewSize[]) {
341 if (CurSize[n] == NewSize[n])
345 NewSize[n] - CurSize[n]);
349 if (CurSize[n] >= NewSize[n])
359 if (CurSize[n] == NewSize[n])
363 CurSize[n] - NewSize[n]);
367 if (CurSize[n] >= NewSize[n])
374 assert(CurSize[n] == NewSize[n] && "Insufficient element shuffle");
388 /// NewSize[] will be filled in such that
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/ |
| MemoryLocation.h | 106 MemoryLocation getWithNewSize(uint64_t NewSize) const {
108 Copy.Size = NewSize;
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| IntervalMap.h | 335 /// @param NewSize Array of desired node sizes.
338 unsigned CurSize[], const unsigned NewSize[]) {
341 if (CurSize[n] == NewSize[n])
345 NewSize[n] - CurSize[n]);
349 if (CurSize[n] >= NewSize[n])
359 if (CurSize[n] == NewSize[n])
363 CurSize[n] - NewSize[n]);
367 if (CurSize[n] >= NewSize[n])
374 assert(CurSize[n] == NewSize[n] && "Insufficient element shuffle");
388 /// NewSize[] will be filled in such that
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Analysis/ |
| MemoryLocation.h | 113 MemoryLocation getWithNewSize(uint64_t NewSize) const {
115 Copy.Size = NewSize;
|
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| IntervalMap.h | 335 /// @param NewSize Array of desired node sizes.
338 unsigned CurSize[], const unsigned NewSize[]) {
341 if (CurSize[n] == NewSize[n])
345 NewSize[n] - CurSize[n]);
349 if (CurSize[n] >= NewSize[n])
359 if (CurSize[n] == NewSize[n])
363 CurSize[n] - NewSize[n]);
367 if (CurSize[n] >= NewSize[n])
374 assert(CurSize[n] == NewSize[n] && "Insufficient element shuffle");
388 /// NewSize[] will be filled in such that
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Analysis/ |
| MemoryLocation.h | 113 MemoryLocation getWithNewSize(uint64_t NewSize) const {
115 Copy.Size = NewSize;
|
