Home
last modified time | relevance | path

Searched refs:Degree (Results 1 – 18 of 18) sorted by relevance

/external/XNNPACK/src/math/
Dexpm1.sollya23 print("Degree-5 P[expm1(x)] with 0 constraint on [-log(2)/2, log(2)/2] =", horner(P));
31 print("Degree-6 P[expm1(x)] with 0 constraint on [-log(2)/2, log(2)/2] =", horner(P));
39 print("Degree-5 P[expm1(x)] with 0+x constraint on [-log(2)/2, log(2)/2] =", horner(P));
47 print("Degree-6 P[expm1(x)] with 0+x constraint on [-log(2)/2, log(2)/2] =", horner(P));
55 print("Degree-4 P[expm1(x)] with 0+x constraint on [-log(2)/8, log(2)/8] =", horner(P));
63 print("Degree-4 P[expm1(x)] with 0 constraint on [-log(2)/16, log(2)/16] =", horner(P));
71 print("Degree-4 P[expm1(x)] with 0+x constraint on [-log(2)/16, log(2)/16] =", horner(P));
79 print("Degree-3 P[expm1(x)] with 0 constraint on [-log(2)/16, log(2)/16] =", horner(P));
87 print("Degree-3 P[expm1(x)] with 0+x constraint on [-log(2)/16, log(2)/16] =", horner(P));
95 print("Degree-4 P[expm1(x)] with 0+x constraint on [-log(2)/32, log(2)/32] =", horner(P));
[all …]
Dexp.sollya19 print("Degree-5 P[exp(x)] with 1 constraint on [-log(2)/2, log(2)/2] =", horner(P));
27 print("Degree-5 P[exp(x)] with 1+x constraint on [-log(2)/2, log(2)/2] =", horner(P));
35 print("Degree-4 P[exp(x)] with 1+x constraint on [-log(2)/8, log(2)/8] =", horner(P));
43 print("Degree-4 P[exp(x)] with 1 constraint on [-log(2)/16, log(2)/16] =", horner(P));
51 print("Degree-4 P[exp(x)] with 1+x constraint on [-log(2)/16, log(2)/16] =", horner(P));
59 print("Degree-3 P[exp(x)] with 1 constraint on [-log(2)/16, log(2)/16] =", horner(P));
67 print("Degree-3 P[exp(x)] with 1+x constraint on [-log(2)/16, log(2)/16] =", horner(P));
75 print("Degree-3 P[exp(x)] with 1+x constraint on [-log(2)/32, log(2)/32] =", horner(P));
83 print("Degree-2 P[exp(x)] with 1+x constraint on [-log(2)/64, log(2)/64] =", horner(P));
91 print("Degree-2 P[exp(x)] with 1 constraint on [-log(2)/128, log(2)/128] =", horner(P));
[all …]
/external/skia/src/gpu/tessellate/
DWangsFormula.h34 template<int Degree> constexpr float length_term(float precision) { in length_term()
35 return (Degree * (Degree - 1) / 8.f) * precision; in length_term()
37 template<int Degree> constexpr float length_term_p2(float precision) { in length_term_p2()
38 return ((Degree * Degree) * ((Degree - 1) * (Degree - 1)) / 64.f) * (precision * precision); in length_term_p2()
/external/eigen/unsupported/Eigen/src/Splines/
DSpline.h40 enum { Degree = _Degree /*!< The spline curve's degree. */ }; enumerator
65 : m_knots(1, (Degree==Dynamic ? 2 : 2*Degree+2)) in Spline()
66 , m_ctrls(ControlPointVectorType::Zero(Dimension,(Degree==Dynamic ? 1 : Degree+1))) in Spline()
70 enum { MinDegree = (Degree==Dynamic ? 0 : Degree) }; in Spline()
260 …VectorBlock<BasisVectorType,Degree>(left,1,p) = u - VectorBlock<const KnotVectorType,Degree>(U,i+1… in BasisFunctions()
261 …VectorBlock<BasisVectorType,Degree>(right,1,p) = VectorBlock<const KnotVectorType,Degree>(U,i+1,p)… in BasisFunctions()
DSplineFwd.h17 template <typename Scalar, int Dim, int Degree = Dynamic> class Spline;
30 enum { Degree = _Degree /*!< The spline curve's degree. */ };
/external/llvm/lib/CodeGen/SelectionDAG/
DScheduleDAGFast.cpp706 unsigned Degree = OpN->getNodeId(); in ScheduleNode() local
707 assert(Degree > 0 && "Predecessor over-released!"); in ScheduleNode()
708 OpN->setNodeId(--Degree); in ScheduleNode()
709 if (Degree == 0) in ScheduleNode()
732 unsigned Degree = N->use_size(); in Schedule() local
733 N->setNodeId(Degree); in Schedule()
752 unsigned Degree = Glue->getNodeId(); in Schedule() local
761 --Degree; in Schedule()
762 GUser->setNodeId(UDegree + Degree); in Schedule()
DSelectionDAG.cpp6576 unsigned Degree = N->getNumOperands(); in AssignTopologicalOrder() local
6577 if (Degree == 0) { in AssignTopologicalOrder()
6587 N->setNodeId(Degree); in AssignTopologicalOrder()
6601 unsigned Degree = P->getNodeId(); in AssignTopologicalOrder() local
6602 assert(Degree != 0 && "Invalid node degree"); in AssignTopologicalOrder()
6603 --Degree; in AssignTopologicalOrder()
6604 if (Degree == 0) { in AssignTopologicalOrder()
6613 P->setNodeId(Degree); in AssignTopologicalOrder()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/
DScheduleDAGFast.cpp698 unsigned Degree = OpN->getNodeId(); in ScheduleNode() local
699 assert(Degree > 0 && "Predecessor over-released!"); in ScheduleNode()
700 OpN->setNodeId(--Degree); in ScheduleNode()
701 if (Degree == 0) in ScheduleNode()
724 unsigned Degree = N->use_size(); in Schedule() local
725 N->setNodeId(Degree); in Schedule()
744 unsigned Degree = Glue->getNodeId(); in Schedule() local
752 --Degree; in Schedule()
753 GUser->setNodeId(UDegree + Degree); in Schedule()
DSelectionDAG.cpp8555 DenseMap<SDNode *, unsigned> Degree; in CreateTopologicalOrder() local
8559 Degree[&N] = NOps; in CreateTopologicalOrder()
8566 unsigned &UnsortedOps = Degree[U]; in CreateTopologicalOrder()
8682 unsigned Degree = N->getNumOperands(); in AssignTopologicalOrder() local
8683 if (Degree == 0) { in AssignTopologicalOrder()
8693 N->setNodeId(Degree); in AssignTopologicalOrder()
8707 unsigned Degree = P->getNodeId(); in AssignTopologicalOrder() local
8708 assert(Degree != 0 && "Invalid node degree"); in AssignTopologicalOrder()
8709 --Degree; in AssignTopologicalOrder()
8710 if (Degree == 0) { in AssignTopologicalOrder()
[all …]
/external/tensorflow/tensorflow/core/api_def/base_api/
Dapi_def_SparseMatrixOrderingAMD.pbtxt10 description: "The Approximate Minimum Degree (AMD) ordering of `input`."
12 summary: "Computes the Approximate Minimum Degree (AMD) ordering of `input`."
14 Computes the Approximate Minimum Degree (AMD) ordering for a sparse matrix.
/external/python/google-api-python-client/samples/maps_engine/
Dpolygons.prj1 …,SPHEROID["WGS_1984",6378137,298.257223563]],PRIMEM["Greenwich",0],UNIT["Degree",0.017453292519943…
/external/llvm/lib/CodeGen/
DScheduleDAG.cpp473 unsigned Degree = SU->Succs.size(); in InitDAGTopologicalSorting() local
475 Node2Index[NodeNum] = Degree; in InitDAGTopologicalSorting()
478 if (Degree == 0) { in InitDAGTopologicalSorting()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
DScheduleDAG.cpp482 unsigned Degree = SU.Succs.size(); in InitDAGTopologicalSorting() local
484 Node2Index[NodeNum] = Degree; in InitDAGTopologicalSorting()
487 if (Degree == 0) { in InitDAGTopologicalSorting()
/external/llvm/lib/Target/AMDGPU/
DSIMachineScheduler.cpp1141 unsigned Degree = Block->getSuccs().size(); in topologicalSort() local
1142 TopDownBlock2Index[i] = Degree; in topologicalSort()
1143 if (Degree == 0) { in topologicalSort()
/external/mesa3d/include/D3D9/
Dd3d9types.h1720 D3DDEGREETYPE Degree; member
1738 D3DDEGREETYPE Degree; member
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/
DSIMachineScheduler.cpp1290 unsigned Degree = Block->getSuccs().size(); in topologicalSort() local
1291 TopDownBlock2Index[i] = Degree; in topologicalSort()
1292 if (Degree == 0) { in topologicalSort()
/external/libexif/po/
Dnl.po2694 "Geeft de GPS-DOP (Degree Of Precision, mate van nauwkeurigheid). Een HDOP-"
/external/kotlinx.coroutines/benchmarks/src/jmh/resources/
Dwords.shakespeare.txt.gz1a 2A 3Aaron 4AARON 5abaissiez 6abandon 7abandoned 8abase 9Abase 10 ...