HomeSort by relevance Sort by last modified time
    Searched refs:N0 (Results 1 - 25 of 58) sorted by null

1 2 3

  /external/clang/test/CXX/temp/temp.spec/temp.expl.spec/
p2.cpp 18 namespace N0 {
33 template<> void N0::f0(int) { } // okay
36 template<> void N0::f0(long) { } // expected-error{{does not enclose namespace}}
39 template<> void N0::f0(double); // expected-warning{{C++11 extension}}
40 template<> void N0::f0(double) { }
49 namespace N0 {
73 void N0::X0<T>::ft1(T t, U u) {
77 template<typename T> T N0::X0<T>::member;
79 template<> struct N0::X0<void> { }; // expected-warning{{C++11 extension}}
80 N0::X0<void> test_X0
    [all...]
p2-0x.cpp 20 namespace N0 {
35 template<> void N0::f0(int) { } // okay
38 template<> void N0::f0(long) { } // expected-error{{does not enclose namespace}}
41 template<> void N0::f0(double) { }
50 namespace N0 {
74 void N0::X0<T>::ft1(T t, U u) {
78 template<typename T> T N0::X0<T>::member;
80 template<> struct N0::X0<void> { };
81 N0::X0<void> test_X0;
84 template<> struct N0::X0<const void> { }; // expected-error{{class template specialization of 'X0' not in a namespace e (…)
    [all...]
  /external/ceres-solver/include/ceres/internal/
variadic_evaluate.h 49 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4,
67 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4,
69 struct VariadicEvaluate<Functor, T, N0, N1, N2, N3, N4, N5, N6, N7, N8, 0> {
84 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4,
86 struct VariadicEvaluate<Functor, T, N0, N1, N2, N3, N4, N5, N6, N7, 0, 0> {
100 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4,
102 struct VariadicEvaluate<Functor, T, N0, N1, N2, N3, N4, N5, N6, 0, 0, 0> {
115 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4,
117 struct VariadicEvaluate<Functor, T, N0, N1, N2, N3, N4, N5, 0, 0, 0, 0> {
129 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4
    [all...]
autodiff.h 189 // Takes N 1st order parts, starting at index N0, and puts them in the M x N
191 template <typename JetT, typename T, int N0, int N>
197 src[i].v.template segment<N>(N0);
203 // C++0x). N0 through N5 are the dimension of the input arguments to
206 int N0 = 0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0,
227 << "(ignore trailing 0s): " << N0 << ", " << N1 << ", " << N2 << ", "
231 typedef Jet<T, N0 + N1 + N2 + N3 + N4 + N5 + N6 + N7 + N8 + N9> JetT;
233 N0 + N1 + N2 + N3 + N4 + N5 + N6 + N7 + N8 + N9 + num_outputs);
237 const int jet1 = N0;
238 const int jet2 = N0 + N1
    [all...]
numeric_diff.h 53 int N0, int N1, int N2, int N3, int N4,
61 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>::Call(
68 int N0, int N1, int N2, int N3, int N4,
83 int N0, int N1, int N2, int N3, int N4,
143 if (!EvaluateImpl<CostFunctor, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>(
159 if (!EvaluateImpl<CostFunctor, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>(
183 int N0, int N1, int N2, int N3, int N4,
187 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9,
  /external/clang/test/CXX/basic/basic.lookup/basic.lookup.unqual/
p3.cpp 6 namespace N0 {
  /external/ceres-solver/include/ceres/
autodiff_cost_function.h 156 int N0, // Number of parameters in block 0.
167 N0, N1, N2, N3, N4,
190 N0, N1, N2, N3, N4,
207 CostFunctor, double, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>
211 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>::Differentiate(
215 N0, N1, N2, N3, N4,
numeric_diff_cost_function.h 177 int N0 = 0, // Number of parameters in block 0.
189 N0, N1, N2, N3, N4,
201 N0, N1, N2, N3, N4,
219 const int kNumParameters = N0 + N1 + N2 + N3 + N4 + N5 + N6 + N7 + N8 + N9;
221 (N0 > 0) + (N1 > 0) + (N2 > 0) + (N3 > 0) + (N4 > 0) +
226 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>(
243 if (N1) parameters_reference_copy[1] = parameters_reference_copy[0] + N0;
276 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9, \
283 N0, N1, N2, N3, N4, \
sized_cost_function.h 48 int N0 = 0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0,
68 << "(ignore trailing 0s): " << N0 << ", " << N1 << ", " << N2 << ", "
76 ADD_PARAMETER_BLOCK(N0);
cost_function_to_functor.h 103 int N0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0,
126 << "(ignore trailing 0s): " << N0 << ", " << N1 << ", " << N2 << ", "
133 (N0 > 0) + (N1 > 0) + (N2 > 0) + (N3 > 0) + (N4 > 0) +
137 CHECK_EQ(N0, parameter_block_sizes[0]);
150 N0 + N1 + N2 + N3 + N4 + N5 + N6 + N7 + N8 + N9);
154 CHECK_NE(N0, 0);
171 CHECK_NE(N0, 0);
191 CHECK_NE(N0, 0);
213 CHECK_NE(N0, 0);
237 CHECK_NE(N0, 0)
    [all...]
gradient_checker.h 65 int M = 0, int N0 = 0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0>
127 if (N0) {
128 CHECK_EQ(N0, block_sizes[0]);
178 NumericDiffCostFunction<CostFunctionToProbe, CENTRAL, M, N0, N1, N2, N3, N4>
numeric_diff_functor.h 114 int N0 = 0, int N1 = 0 , int N2 = 0, int N3 = 0, int N4 = 0,
125 N0, N1, N2, N3, N4,
136 N0, N1, N2, N3, N4,
345 N0, N1, N2, N3, N4,
  /external/llvm/lib/CodeGen/SelectionDAG/
DAGCombiner.cpp 291 SDValue SimplifySelect(SDLoc DL, SDValue N0, SDValue N1, SDValue N2);
292 SDValue SimplifySelectCC(SDLoc DL, SDValue N0, SDValue N1, SDValue N2,
295 SDValue SimplifySetCC(EVT VT, SDValue N0, SDValue N1, ISD::CondCode Cond,
308 SDValue MatchBSwapHWordLow(SDNode *N, SDValue N0, SDValue N1,
310 SDValue MatchBSwapHWord(SDNode *N, SDValue N0, SDValue N1);
619 SDValue N0, N1, N2;
620 if (isSetCCEquivalent(N, N0, N1, N2) && N.getNode()->hasOneUse())
673 SDValue N0, SDValue N1) {
674 EVT VT = N0.getValueType();
675 if (N0.getOpcode() == Opc)
    [all...]
TargetLowering.cpp     [all...]
  /external/llvm/include/llvm/ADT/
StringSwitch.h 84 template<unsigned N0, unsigned N1>
85 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1],
90 template<unsigned N0, unsigned N1, unsigned N2>
91 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1],
96 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3>
97 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1],
103 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4>
104 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1],
  /external/clang/test/CXX/dcl.decl/dcl.meaning/dcl.fct.default/
p4.cpp 11 namespace N0 {
  /external/llvm/unittests/IR/
MDBuilderTest.cpp 85 MDNode *N0 = MDHelper.createTBAANode("Node", R);
89 EXPECT_EQ(N0, N3);
90 EXPECT_NE(N0, N1);
91 EXPECT_NE(N0, N2);
92 EXPECT_GE(N0->getNumOperands(), 2U);
95 EXPECT_TRUE(isa<MDString>(N0->getOperand(0)));
98 EXPECT_EQ(cast<MDString>(N0->getOperand(0))->getString(), "Node");
101 EXPECT_EQ(N0->getOperand(1), R);
  /external/clang/test/CXX/temp/temp.arg/temp.arg.type/
p2.cpp 22 namespace N0 {
  /external/chromium_org/third_party/opus/src/celt/
rate.c 150 int N0;
152 N0 = m->eBands[j+1]-m->eBands[j];
154 if (N0<<i == 1)
170 if (N0 > 2)
172 N0>>=1;
175 /* N0=1 bands can't be split down to N<2. */
176 else if (N0 <= 1)
179 N0<<=LM0;
186 N = N0;
432 int N0, N, den
    [all...]
bands.c 265 int N0;
273 N0 = m->eBands[i+1]-m->eBands[i];
282 t = N0<<LM;
289 sqrt_1 = celt_rsqrt(N0<<LM);
338 for (j=0;j<N0;j++)
348 renormalise_vector(X, N0<<LM, Q15ONE);
449 int i, c, N0;
457 N0 = M*m->shortMdctSize;
466 celt_norm * OPUS_RESTRICT x = X+M*eBands[i]+c*N0;
548 static void deinterleave_hadamard(celt_norm *X, int N0, int stride, int hadamard
    [all...]
  /external/libopus/celt/
rate.c 150 int N0;
152 N0 = m->eBands[j+1]-m->eBands[j];
154 if (N0<<i == 1)
170 if (N0 > 2)
172 N0>>=1;
175 /* N0=1 bands can't be split down to N<2. */
176 else if (N0 <= 1)
179 N0<<=LM0;
186 N = N0;
432 int N0, N, den
    [all...]
bands.c 265 int N0;
273 N0 = m->eBands[i+1]-m->eBands[i];
282 t = N0<<LM;
289 sqrt_1 = celt_rsqrt(N0<<LM);
338 for (j=0;j<N0;j++)
348 renormalise_vector(X, N0<<LM, Q15ONE);
449 int i, c, N0;
457 N0 = M*m->shortMdctSize;
466 celt_norm * OPUS_RESTRICT x = X+M*eBands[i]+c*N0;
548 static void deinterleave_hadamard(celt_norm *X, int N0, int stride, int hadamard
    [all...]
  /external/clang/test/SemaCXX/
linkage-spec.cpp 31 namespace N0 {
  /external/llvm/lib/Target/MSP430/
MSP430ISelDAGToDAG.cpp 146 SDValue N0 = N.getOperand(0);
148 if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(N0)) {
152 } else if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(N0)) {
157 } else if (ExternalSymbolSDNode *S = dyn_cast<ExternalSymbolSDNode>(N0)) {
160 } else if (JumpTableSDNode *J = dyn_cast<JumpTableSDNode>(N0)) {
164 AM.BlockAddr = cast<BlockAddressSDNode>(N0)->getBlockAddress();
165 //AM.SymbolFlags = cast<BlockAddressSDNode>(N0)->getTargetFlags();
  /external/ceres-solver/internal/ceres/
reorder_program_test.cc 45 template <int kNumResiduals, int N0, int N1, int N2>
47 SizedCostFunction<kNumResiduals, N0, N1, N2> {

Completed in 1163 milliseconds

1 2 3