OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:N1
(Results
1 - 25
of
110
) sorted by null
1
2
3
4
5
/external/clang/test/SemaCXX/
out-of-line-def-mismatch.cpp
6
namespace
N1
{
10
void func(S1*); // expected-note {{type of 1st parameter of member declaration does not match definition ('N2::S1 *' vs 'N2::
N1
::S1 *')}}
11
void func(C1&, unsigned, const S1*); // expected-note {{type of 3rd parameter of member declaration does not match definition ('const N2::S1 *' vs 'const N2::
N1
::S1 *')}}
12
void func(const S1*, unsigned); //expected-note {{type of 1st parameter of member declaration does not match definition ('const N2::S1 *' vs 'N2::
N1
::S1')}}
20
void N2::
N1
::S2::func(S1*) {} // expected-error {{out-of-line definition of 'func' does not match any declaration in 'N2::
N1
::S2'}}
21
void N2::
N1
::S2::func(C1&, unsigned, const S1*) {} // expected-error {{out-of-line definition of 'func' does not match any declaration in 'N2::
N1
::S2'}}
22
void N2::
N1
::S2::func(S1*, double) {} // expected-error {{out-of-line definition of 'func' does not match any declaration in 'N2::
N1
::S2'}
[
all
...]
/ndk/sources/cxx-stl/llvm-libc++/test/numerics/numarray/template.valarray/valarray.members/
size.pass.cpp
24
const unsigned
N1
= sizeof(a1)/sizeof(a1[0]);
25
std::valarray<T> v1(a1,
N1
);
26
assert(v1.size() ==
N1
);
31
const unsigned
N1
= 0;
32
std::valarray<T> v1(a1,
N1
);
33
assert(v1.size() ==
N1
);
37
const unsigned
N1
= 0;
39
assert(v1.size() ==
N1
);
cshift.pass.cpp
25
const unsigned
N1
= sizeof(a1)/sizeof(a1[0]);
26
std::valarray<T> v1(a1,
N1
);
28
assert(v2.size() ==
N1
);
29
for (unsigned i = 0; i <
N1
; ++i)
36
const unsigned
N1
= sizeof(a1)/sizeof(a1[0]);
37
std::valarray<T> v1(a1,
N1
);
39
assert(v2.size() ==
N1
);
40
for (unsigned i = 0; i <
N1
; ++i)
47
const unsigned
N1
= sizeof(a1)/sizeof(a1[0]);
48
std::valarray<T> v1(a1,
N1
);
[
all
...]
shift.pass.cpp
25
const unsigned
N1
= sizeof(a1)/sizeof(a1[0]);
26
std::valarray<T> v1(a1,
N1
);
28
assert(v2.size() ==
N1
);
29
for (unsigned i = 0; i <
N1
; ++i)
36
const unsigned
N1
= sizeof(a1)/sizeof(a1[0]);
37
std::valarray<T> v1(a1,
N1
);
39
assert(v2.size() ==
N1
);
40
for (unsigned i = 0; i <
N1
; ++i)
47
const unsigned
N1
= sizeof(a1)/sizeof(a1[0]);
48
std::valarray<T> v1(a1,
N1
);
[
all
...]
sum.pass.cpp
24
const unsigned
N1
= sizeof(a1)/sizeof(a1[0]);
25
std::valarray<T> v1(a1,
N1
);
max.pass.cpp
24
const unsigned
N1
= sizeof(a1)/sizeof(a1[0]);
25
std::valarray<T> v1(a1,
N1
);
36
const unsigned
N1
= sizeof(a1)/sizeof(a1[0]);
37
std::valarray<T> v1(a1,
N1
);
min.pass.cpp
24
const unsigned
N1
= sizeof(a1)/sizeof(a1[0]);
25
std::valarray<T> v1(a1,
N1
);
36
const unsigned
N1
= sizeof(a1)/sizeof(a1[0]);
37
std::valarray<T> v1(a1,
N1
);
apply_cref.pass.cpp
28
const unsigned
N1
= sizeof(a1)/sizeof(a1[0]);
29
std::valarray<T> v1(a1,
N1
);
31
assert(v2.size() ==
N1
);
32
for (unsigned i = 0; i <
N1
; ++i)
36
const unsigned
N1
= 0;
39
assert(v2.size() ==
N1
);
44
const unsigned
N1
= sizeof(a1)/sizeof(a1[0]);
45
std::valarray<T> v1(a1,
N1
);
47
assert(v2.size() ==
N1
);
48
for (unsigned i = 0; i <
N1
; ++i
[
all
...]
apply_value.pass.cpp
28
const unsigned
N1
= sizeof(a1)/sizeof(a1[0]);
29
std::valarray<T> v1(a1,
N1
);
31
assert(v2.size() ==
N1
);
32
for (unsigned i = 0; i <
N1
; ++i)
36
const unsigned
N1
= 0;
39
assert(v2.size() ==
N1
);
44
const unsigned
N1
= sizeof(a1)/sizeof(a1[0]);
45
std::valarray<T> v1(a1,
N1
);
47
assert(v2.size() ==
N1
);
48
for (unsigned i = 0; i <
N1
; ++i
[
all
...]
/external/clang/test/ASTMerge/Inputs/
namespace1.cpp
2
namespace
N1
{
namespace2.cpp
2
namespace
N1
{
/external/clang/test/CXX/basic/basic.lookup/basic.lookup.argdep/
p2-template-id.cpp
4
namespace
N1
{
15
int &ir = f((N2::Y<
N1
::X>*)0);
20
long g(
N1
::X);
22
namespace
N1
{
/external/clang/test/Modules/Inputs/
namespaces-top.h
1
namespace
N1
{
namespaces-left.h
10
namespace
N1
{ }
12
namespace
N1
{
/ndk/sources/cxx-stl/llvm-libc++/test/numerics/numarray/template.valarray/valarray.assign/
mask_array_assign.pass.cpp
22
const std::size_t
N1
= sizeof(a1)/sizeof(a1[0]);
23
bool b[
N1
] = {true, false, false, true, true, false,
25
std::valarray<int> v1(a1,
N1
);
26
std::valarray<bool> vb(b,
N1
);
/ndk/sources/cxx-stl/llvm-libc++/test/numerics/numarray/template.valarray/valarray.cons/
mask_array.pass.cpp
22
const std::size_t
N1
= sizeof(a1)/sizeof(a1[0]);
23
bool b[
N1
] = {true, false, false, true, true, false,
25
std::valarray<int> v1(a1,
N1
);
26
std::valarray<bool> vb(b,
N1
);
/ndk/sources/cxx-stl/llvm-libc++/test/numerics/numarray/template.valarray/valarray.sub/
valarray_bool_const.pass.cpp
22
const std::size_t
N1
= sizeof(a1)/sizeof(a1[0]);
23
bool b[
N1
] = {true, false, false, true, true, false,
25
std::valarray<int> v1(a1,
N1
);
26
std::valarray<bool> vb(b,
N1
);
valarray_bool_non_const.pass.cpp
22
const std::size_t
N1
= sizeof(a1)/sizeof(a1[0]);
23
bool b[
N1
] = {true, false, false, true, true, false,
25
std::valarray<int> v1(a1,
N1
);
26
std::valarray<bool> vb(b,
N1
);
/external/clang/test/SemaTemplate/
temp_explicit_cxx0x.cpp
2
namespace
N1
{
16
template struct ::
N1
::Inner::X1<float>;
19
using namespace
N1
;
21
template struct X0<double>; // expected-error{{must occur in namespace '
N1
'}}
/external/valgrind/main/memcheck/tests/
long_namespace_xml.cpp
17
#define
N1
abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyz
32
namespace
N1
{
44
N1
::N2::f();
/external/ceres-solver/include/ceres/
sized_cost_function.h
48
int N0 = 0, int
N1
= 0, int N2 = 0, int N3 = 0, int N4 = 0,
57
CHECK((!
N1
&& !N2 && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) ||
58
((
N1
> 0) && !N2 && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) ||
59
((
N1
> 0) && (N2 > 0) && !N3 && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) ||
60
((
N1
> 0) && (N2 > 0) && (N3 > 0) && !N4 && !N5 && !N6 && !N7 && !N8 && !N9) ||
61
((
N1
> 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && !N5 && !N6 && !N7 && !N8 && !N9) ||
62
((
N1
> 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && !N6 && !N7 && !N8 && !N9) ||
63
((
N1
> 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && !N7 && !N8 && !N9) ||
64
((
N1
> 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && (N7 > 0) && !N8 && !N9) ||
65
((
N1
> 0) && (N2 > 0) && (N3 > 0) && (N4 > 0) && (N5 > 0) && (N6 > 0) && (N7 > 0) && (N8 > 0) && !N9) |
[
all
...]
/external/clang/test/PCH/
namespaces.cpp
9
N1
::t1 *ip1 = &int_val;
10
N1
::t2 *ip2 = &int_val;
37
using
N1
::used_func;
40
using
N1
::used_cls;
/external/clang/test/PCH/Inputs/
namespaces.h
3
namespace
N1
{
7
namespace
N1
{
/ndk/sources/cxx-stl/llvm-libc++/test/numerics/numarray/template.mask.array/mask.array.assign/
valarray.pass.cpp
22
const std::size_t
N1
= sizeof(a1)/sizeof(a1[0]);
25
bool b[
N1
] = {true, false, false, true, true, false,
27
std::valarray<int> v1(a1,
N1
);
29
assert(N2 == std::count(b, b+
N1
, true));
30
std::valarray<bool> vb(b,
N1
);
/ndk/sources/cxx-stl/llvm-libc++/test/numerics/numarray/template.mask.array/mask.array.comp.assign/
addition.pass.cpp
22
const std::size_t
N1
= sizeof(a1)/sizeof(a1[0]);
25
bool b[
N1
] = {true, false, false, true, true, false,
27
std::valarray<int> v1(a1,
N1
);
29
assert(N2 == std::count(b, b+
N1
, true));
30
std::valarray<bool> vb(b,
N1
);
Completed in 278 milliseconds
1
2
3
4
5