HomeSort by relevance Sort by last modified time
    Searched defs:in (Results 401 - 425 of 3981) sorted by null

<<11121314151617181920>>

  /packages/apps/TV/tests/common/src/com/android/tv/testing/testinput/
ChannelStateData.java 5 * you may not use this file except in compliance with the License.
10 * Unless required by applicable law or agreed to in writing, software
30 public ChannelStateData createFromParcel(Parcel in) {
31 return new ChannelStateData(in);
50 private ChannelStateData(Parcel in) {
51 mTuneStatus = in.readInt();
52 in.readTypedList(mTvTrackInfos, TvTrackInfo.CREATOR);
53 mSelectedAudioTrackId = in.readString();
54 mSelectedVideoTrackId = in.readString();
  /packages/apps/UnifiedEmail/src/org/apache/commons/io/
CopyUtils.java 6 * (the "License"); you may not use this file except in compliance with
11 * Unless required by applicable law or agreed to in writing, software
53 * let you specify the buffer size because in modern VMs the impact on speed
58 * to the <code>copy</code> methods in <code>Buffered*</code> streams. For
61 * copy( new BufferedInputStream( in ), new BufferedOutputStream( out ) );
66 * would usually suggest wrapping in a BufferedInputStream. The
109 * @deprecated Use IOUtils. Will be removed in 2.0.
111 * Null handling behaviour changed in IOUtils (null data does not
123 * Instances should NOT be constructed in standard programming.
135 * @throws IOException In case of an I/O proble
156 ByteArrayInputStream in = new ByteArrayInputStream(input); local
176 ByteArrayInputStream in = new ByteArrayInputStream(input); local
248 InputStreamReader in = new InputStreamReader(input); local
267 InputStreamReader in = new InputStreamReader(input, encoding); local
310 StringReader in = new StringReader(input); local
    [all...]
  /packages/apps/UnifiedEmail/src/org/apache/commons/io/input/
AutoCloseInputStream.java 6 * (the "License"); you may not use this file except in compliance with
11 * Unless required by applicable law or agreed to in writing, software
26 * closed, so any allocated in-memory buffers can be freed even if the
42 * @param in underlying input stream
44 public AutoCloseInputStream(InputStream in) {
45 super(in);
62 in.close();
63 in = new ClosedInputStream();
71 * @return next byte in the stream, or -1 if no more bytes are available
75 int n = in.read()
    [all...]
  /packages/services/BuiltInPrintService/src/com/android/bips/jni/
SizeD.java 6 * you may not use this file except in compliance with the License.
11 * Unless required by applicable law or agreed to in writing, software
24 * Describes a width and height in arbitrary units.
44 public SizeD(Parcel in) {
45 this(in.readDouble(), in.readDouble());
68 public SizeD createFromParcel(Parcel in) {
69 return new SizeD(in);
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/
SwapByteOrder.h 32 // The DLL version of the runtime lacks these functions (bug!?), but in a
103 } in, out; local
104 in.f = C;
105 out.i = SwapByteOrder_32(in.i);
113 } in, out; local
114 in.d = C;
115 out.i = SwapByteOrder_64(in.i);
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Support/
SwapByteOrder.h 32 // The DLL version of the runtime lacks these functions (bug!?), but in a
103 } in, out; local
104 in.f = C;
105 out.i = SwapByteOrder_32(in.i);
113 } in, out; local
114 in.d = C;
115 out.i = SwapByteOrder_64(in.i);
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Support/
SwapByteOrder.h 32 // The DLL version of the runtime lacks these functions (bug!?), but in a
103 } in, out; local
104 in.f = C;
105 out.i = SwapByteOrder_32(in.i);
113 } in, out; local
114 in.d = C;
115 out.i = SwapByteOrder_64(in.i);
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Support/
SwapByteOrder.h 32 // The DLL version of the runtime lacks these functions (bug!?), but in a
103 } in, out; local
104 in.f = C;
105 out.i = SwapByteOrder_32(in.i);
113 } in, out; local
114 in.d = C;
115 out.i = SwapByteOrder_64(in.i);
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Support/
SwapByteOrder.h 32 // The DLL version of the runtime lacks these functions (bug!?), but in a
103 } in, out; local
104 in.f = C;
105 out.i = SwapByteOrder_32(in.i);
113 } in, out; local
114 in.d = C;
115 out.i = SwapByteOrder_64(in.i);
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Support/
SwapByteOrder.h 32 // The DLL version of the runtime lacks these functions (bug!?), but in a
103 } in, out; local
104 in.f = C;
105 out.i = SwapByteOrder_32(in.i);
113 } in, out; local
114 in.d = C;
115 out.i = SwapByteOrder_64(in.i);
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Support/
SwapByteOrder.h 32 // The DLL version of the runtime lacks these functions (bug!?), but in a
103 } in, out; local
104 in.f = C;
105 out.i = SwapByteOrder_32(in.i);
113 } in, out; local
114 in.d = C;
115 out.i = SwapByteOrder_64(in.i);
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/
SwapByteOrder.h 32 // The DLL version of the runtime lacks these functions (bug!?), but in a
103 } in, out; local
104 in.f = C;
105 out.i = SwapByteOrder_32(in.i);
113 } in, out; local
114 in.d = C;
115 out.i = SwapByteOrder_64(in.i);
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Support/
SwapByteOrder.h 32 // The DLL version of the runtime lacks these functions (bug!?), but in a
103 } in, out; local
104 in.f = C;
105 out.i = SwapByteOrder_32(in.i);
113 } in, out; local
114 in.d = C;
115 out.i = SwapByteOrder_64(in.i);
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Support/
SwapByteOrder.h 32 // The DLL version of the runtime lacks these functions (bug!?), but in a
103 } in, out; local
104 in.f = C;
105 out.i = SwapByteOrder_32(in.i);
113 } in, out; local
114 in.d = C;
115 out.i = SwapByteOrder_64(in.i);
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Support/
SwapByteOrder.h 32 // The DLL version of the runtime lacks these functions (bug!?), but in a
103 } in, out; local
104 in.f = C;
105 out.i = SwapByteOrder_32(in.i);
113 } in, out; local
114 in.d = C;
115 out.i = SwapByteOrder_64(in.i);
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Support/
SwapByteOrder.h 32 // The DLL version of the runtime lacks these functions (bug!?), but in a
103 } in, out; local
104 in.f = C;
105 out.i = SwapByteOrder_32(in.i);
113 } in, out; local
114 in.d = C;
115 out.i = SwapByteOrder_64(in.i);
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Support/
SwapByteOrder.h 32 // The DLL version of the runtime lacks these functions (bug!?), but in a
103 } in, out; local
104 in.f = C;
105 out.i = SwapByteOrder_32(in.i);
113 } in, out; local
114 in.d = C;
115 out.i = SwapByteOrder_64(in.i);
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Support/
SwapByteOrder.h 32 // The DLL version of the runtime lacks these functions (bug!?), but in a
103 } in, out; local
104 in.f = C;
105 out.i = SwapByteOrder_32(in.i);
113 } in, out; local
114 in.d = C;
115 out.i = SwapByteOrder_64(in.i);
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/benchmarks/
ContainerBenchmarks.hpp 13 auto in = gen(st.range(0)); local
14 const auto begin = in.begin();
15 const auto end = in.end();
16 benchmark::DoNotOptimize(&in);
25 auto in = gen(st.range(0)); local
26 const auto end = in.end();
29 for (auto it = in.begin(); it != end; ++it) {
38 auto in = gen(st.range(0)); local
39 const auto end = in.end();
43 for (auto it = in.begin(); it != end; ++it)
53 auto in = gen(st.range(0)); local
69 auto in = gen(st.range(0)); local
84 auto in = gen(st.range(0)); local
99 auto in = gen(st.range(0)); local
    [all...]
filesystem.bench.cpp 15 const auto in = gen(st.range(0)); local
17 for (auto& Part : in)
32 const auto in = gen(st.range(0)); local
34 for (auto& Part : in)
50 const auto in = gen(st.range(0)); local
52 for (auto& Part : in)
81 const auto in = gen(st.range(0)); local
83 for (auto& Part : in)
100 const auto in = gen(st.range(0)); local
102 for (auto& Part : in)
119 const auto in = gen(st.range(0)); local
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/src/
hash.cpp 23 // handle all next_prime(i) for i in [1, 210), special case 0
138 // some potential prime numbers are not prime. In an ideal world, all potential
183 // If n is small enough, search in small_primes
189 // Start searching list of potential primes: L * k0 + indices[in]
194 size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L) local
196 n = L * k0 + indices[in];
201 // 2. The i > sqrt(n), in which case n is prime.
561 if (++in == M)
564 in = 0;
566 n = L * k0 + indices[in];
    [all...]
  /prebuilts/ndk/r16/sources/third_party/vulkan/src/libs/glm/gtx/
simd_mat4.hpp 7 /// in the Software without restriction, including without limitation the rights
12 /// The above copyright notice and this permission notice shall be included in
17 /// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
19 /// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20 /// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
94 __m128 const in[4]); variable
  /system/core/libsparse/
img2simg.c 5 * you may not use this file except in compliance with the License.
10 * Unless required by applicable law or agreed to in writing, software
48 int in; local
70 in = STDIN_FILENO;
72 in = open(argv[1], O_RDONLY | O_BINARY);
73 if (in < 0) {
89 len = lseek64(in, 0, SEEK_END);
90 lseek64(in, 0, SEEK_SET);
99 ret = sparse_file_read(s, in, false, false);
111 close(in);
    [all...]
simg2simg.c 5 * you may not use this file except in compliance with the License.
10 * Unless required by applicable law or agreed to in writing, software
44 int in; local
61 in = open(argv[1], O_RDONLY | O_BINARY);
62 if (in < 0) {
67 s = sparse_file_import(in, true, false);
112 close(in);
  /system/core/libutils/tests/
String8_test.cpp 5 * you may not use this file except in compliance with the License.
10 * Unless required by applicable law or agreed to in writing, software
77 const char *in = "some string"; local
78 EXPECT_EQ(NO_MEMORY, String8("").setTo(in, SIZE_MAX));
84 // first character in the pair and handling the rest correctly.

Completed in 1805 milliseconds

<<11121314151617181920>>