OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:tie
(Results
1 - 25
of
604
) sorted by null
1
2
3
4
5
6
7
8
9
10
11
>>
/external/chromium_org/third_party/JSON/JSON-2.59/t/
16_tied.t
10
use
Tie
::Hash;
11
use
Tie
::Array;
15
tie
my %h, '
Tie
::StdHash';
20
tie
my @a, '
Tie
::StdArray';
x16_tied.t
8
use
Tie
::Hash;
9
use
Tie
::Array;
16
tie
my %h, '
Tie
::StdHash';
21
tie
my @a, '
Tie
::StdArray';
e15_tie_ixhash.t
13
eval {require
Tie
::IxHash};
14
skip "Can't load
Tie
::IxHash.", 2 if ($@);
17
tie
%columns, '
Tie
::IxHash';
/external/clang/test/Parser/
cxx0x-for-range.cpp
14
pair<T,U> &
tie
(T &, U &);
24
for (
tie
(p, n) : m) { // expected-error {{for range declaration must declare a variable}}
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/input.output/iostreams.base/ios/basic.ios.members/
tie_ostream.pass.cpp
14
// basic_ostream<charT,traits>*
tie
(basic_ostream<charT,traits>* tiestr);
23
std::ostream* r = ios.
tie
(os);
25
assert(ios.
tie
() == os);
tie.pass.cpp
14
// basic_ostream<charT,traits>*
tie
() const;
22
assert(ios.
tie
() == 0);
/external/llvm/test/YAMLParser/
spec-02-17.data
9
tie
-fighter: '|\-*-/|'
/development/samples/TicTacToeLib/res/values/
strings.xml
21
<string name="
tie
">This is a
tie
! No one wins!</string>
/external/chromium_org/chrome/app/android/
chrome_main_delegate_android.h
16
// Set up the JNI bindings.
Tie
the Java methods with their native
/external/oprofile/libutil++/
stream_util.h
24
*
tie
and locale are not saved currently
/ndk/sources/cxx-stl/llvm-libc++/libcxx/src/
iostream.cpp
42
cin_ptr->
tie
(cout_ptr);
44
cerr_ptr->
tie
(cout_ptr);
50
wcin_ptr->
tie
(wcout_ptr);
52
wcerr_ptr->
tie
(wcout_ptr);
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/input.output/iostream.format/input.streams/iostreamclass/iostream.assign/
member_swap.pass.cpp
46
assert(is1.
tie
() == 0);
54
assert(is2.
tie
() == 0);
69
assert(is1.
tie
() == 0);
77
assert(is2.
tie
() == 0);
move_assign.pass.cpp
52
assert(is1.
tie
() == 0);
60
assert(is2.
tie
() == 0);
75
assert(is1.
tie
() == 0);
83
assert(is2.
tie
() == 0);
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/input.output/iostream.format/input.streams/istream/istream.assign/
member_swap.pass.cpp
46
assert(is1.
tie
() == 0);
54
assert(is2.
tie
() == 0);
69
assert(is1.
tie
() == 0);
77
assert(is2.
tie
() == 0);
move_assign.pass.cpp
52
assert(is1.
tie
() == 0);
60
assert(is2.
tie
() == 0);
75
assert(is1.
tie
() == 0);
83
assert(is2.
tie
() == 0);
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/input.output/iostream.format/output.streams/ostream.assign/
member_swap.pass.cpp
46
assert(os1.
tie
() == 0);
54
assert(os2.
tie
() == 0);
69
assert(os1.
tie
() == 0);
77
assert(os2.
tie
() == 0);
move_assign.pass.cpp
52
assert(os1.
tie
() == 0);
60
assert(os2.
tie
() == 0);
75
assert(os1.
tie
() == 0);
83
assert(os2.
tie
() == 0);
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/tuple/tuple.tuple/tuple.creation/
tie.pass.cpp
15
// tuple<Types&...>
tie
(Types&... t);
26
std::
tie
(i, std::ignore, s) = std::make_tuple(42, 3.14, "C++");
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/input.output/iostream.format/input.streams/iostreamclass/iostream.cons/
streambuf.pass.cpp
33
assert(is.
tie
() == 0);
46
assert(is.
tie
() == 0);
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/input.output/iostream.format/input.streams/istream/istream.cons/
streambuf.pass.cpp
33
assert(is.
tie
() == 0);
46
assert(is.
tie
() == 0);
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/input.output/iostream.format/output.streams/ostream.cons/
move.pass.cpp
51
assert(os.
tie
() == 0);
65
assert(os.
tie
() == 0);
streambuf.pass.cpp
33
assert(os.
tie
() == 0);
45
assert(os.
tie
() == 0);
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/input.output/iostreams.base/ios/basic.ios.cons/
ctor_streambuf.pass.cpp
26
assert(ios.
tie
() == 0);
39
assert(ios.
tie
() == 0);
/external/chromium/chrome/browser/sync/protocol/
extension_specifics.proto
22
// the case of a
tie
, server wins.
/external/chromium_org/base/test/
test_pending_task.h
37
// the position in some queue) to break the
tie
. Conveniently, the
Completed in 4746 milliseconds
1
2
3
4
5
6
7
8
9
10
11
>>