Home
last modified time | relevance | path

Searched refs:svector (Results 1 – 25 of 892) sorted by relevance

12345678910>>...36

/dports/cad/iverilog/verilog-11.0/
H A Dsvector.h35 template <class TYPE> class svector {
38 explicit svector() : nitems_(0), items_(0) { } in svector() function
40 explicit svector(unsigned size) : nitems_(size), items_(new TYPE[size]) in svector() function
45 svector(const svector<TYPE>&that) in svector() function
51 svector(const svector<TYPE>&l, const svector<TYPE>&r) in svector() function
60 svector(const svector<TYPE>&l, TYPE&r) in svector() function
67 ~svector() { delete[]items_; } in ~svector()
69 svector<TYPE>& operator= (const svector<TYPE>&that)
102 template <> inline svector<std::string>::svector(unsigned size) in svector() function
112 template <class T> inline std::vector<T> vector_from_svector(const svector<T>&that) in vector_from_svector()
H A DPUdp.h56 svector<string>ports;
61 svector<string>tinput;
62 svector<char> tcurrent;
63 svector<char> toutput;
/dports/math/xtensor/xtensor-0.24.0/include/xtensor/
H A Dxstorage.hpp614 class svector class
654 explicit svector(const svector<T, N2, A, I2>& rhs);
656 svector& operator=(const svector& rhs);
662 svector& operator=(const svector<T, N2, A, I2>& rhs);
664 svector(const svector& other);
749 inline svector<T, N, A, Init>::~svector() in ~svector()
758 inline svector<T, N, A, Init>::svector() noexcept in svector() function in xt::svector
793 inline svector<T, N, A, Init>::svector(const svector<T, N2, A, I2>& rhs) in svector() function in xt::svector
820 inline svector<T, N, A, Init>& svector<T, N, A, Init>::operator=(const svector& rhs) in operator =()
850 … inline svector<T, N, A, Init>& svector<T, N, A, Init>::operator=(const svector<T, N2, A, I2>& rhs) in operator =()
[all …]
/dports/math/py-z3-solver/z3-z3-4.8.10/src/ast/substitution/
H A Dexpr_offset_map.h34 vector<svector<data> > m_map;
43 svector<data> const & v = m_map[off]; in contains()
54 svector<data> const & v = m_map[off]; in find()
67 m_map.resize(off+1, svector<data>()); in insert()
68 svector<data> & v = m_map[off]; in insert()
79 typename vector<svector<data> >::iterator it = m_map.begin(); in reset()
80 typename vector<svector<data> >::iterator end = m_map.end(); in reset()
82 svector<data> & v = *it; in reset()
83 typename svector<data>::iterator it2 = v.begin(); in reset()
84 typename svector<data>::iterator end2 = v.end(); in reset()
H A Dsubstitution_tree.h46 svector<subst> m_subst;
66 svector<subst> m_compatible;
67 svector<subst> m_incompatible;
76 svector<entry> m_visit_todo;
79 void push(svector<subst> & sv, subst const & s);
84 void linearize(svector<subst> & result);
87 unsigned get_compatibility_measure(svector<subst> const & sv);
92 void mark_used_regs(svector<subst> const & sv);
94 bool is_fully_compatible(svector<subst> const & sv);
100 void display(std::ostream & out, svector<subst> const & sv) const;
[all …]
/dports/math/z3/z3-z3-4.8.13/src/ast/substitution/
H A Dexpr_offset_map.h34 vector<svector<data> > m_map;
43 svector<data> const & v = m_map[off]; in contains()
54 svector<data> const & v = m_map[off]; in find()
67 m_map.resize(off+1, svector<data>()); in insert()
68 svector<data> & v = m_map[off]; in insert()
79 typename vector<svector<data> >::iterator it = m_map.begin(); in reset()
80 typename vector<svector<data> >::iterator end = m_map.end(); in reset()
82 svector<data> & v = *it; in reset()
83 typename svector<data>::iterator it2 = v.begin(); in reset()
84 typename svector<data>::iterator end2 = v.end(); in reset()
H A Dsubstitution_tree.h46 svector<subst> m_subst;
66 svector<subst> m_compatible;
67 svector<subst> m_incompatible;
76 svector<entry> m_visit_todo;
79 void push(svector<subst> & sv, subst const & s);
84 void linearize(svector<subst> & result);
87 unsigned get_compatibility_measure(svector<subst> const & sv);
92 void mark_used_regs(svector<subst> const & sv);
94 bool is_fully_compatible(svector<subst> const & sv);
100 void display(std::ostream & out, svector<subst> const & sv) const;
[all …]
/dports/science/hypre/hypre-2.23.0/src/sstruct_mv/
H A Dsstruct_vector.c128 hypre_StructVector *svector; in hypre_SStructPVectorInitialize() local
133 svector = hypre_SStructPVectorSVector(pvector, var); in hypre_SStructPVectorInitialize()
134 hypre_StructVectorInitialize(svector); in hypre_SStructPVectorInitialize()
138 hypre_StructVectorClearGhostValues(svector); in hypre_SStructPVectorInitialize()
500 hypre_StructVector *svector; in hypre_SStructPVectorSetConstantValues() local
505 svector = hypre_SStructPVectorSVector(pvector, var); in hypre_SStructPVectorSetConstantValues()
506 hypre_StructVectorSetConstantValues(svector, value); in hypre_SStructPVectorSetConstantValues()
762 hypre_StructVector *svector; in hypre_SStructPVectorInitializeShell() local
770 hypre_StructVectorInitializeShell(svector); in hypre_SStructPVectorInitializeShell()
827 hypre_StructVector *svector; in hypre_SStructVectorClearGhostValues() local
[all …]
/dports/science/tfel-edf/tfel-3.2.1/tests/Math/ExpressionTemplates/
H A DExpr3.cxx48 using svector = vector<stensor>; in execute() typedef
54 using res3 = ResultType<int,svector,OpMult>::type; in execute()
55 TFEL_TESTS_STATIC_ASSERT((isBinaryOperationResultTypeValid<int,svector,OpMult>::value)); in execute()
56 TFEL_TESTS_STATIC_ASSERT((is_same<res3,svector>::value)); in execute()
57 TFEL_TESTS_STATIC_ASSERT((is_same<VectorTraits<svector>::NumType,stensor>::value)); in execute()
58 TFEL_TESTS_STATIC_ASSERT((is_same<VectorTraits<svector>::NumType,stensor>::value)); in execute()
59 …TFEL_TESTS_STATIC_ASSERT((is_same<stensor,ResultType<int,svector,OpMult>::type::value_type>::value… in execute()
60 using handle = ComputeBinaryResult<int,svector,OpMult>::Handle; in execute()
61 TFEL_TESTS_STATIC_ASSERT((is_same<Expr<svector,ScalarObjectOperation<int,svector,OpMult>>, in execute()
/dports/science/tfel/tfel-3.4.0/tests/Math/ExpressionTemplates/
H A DExpr3.cxx48 using svector = vector<stensor>; in execute() typedef
54 using res3 = ResultType<int,svector,OpMult>::type; in execute()
55 TFEL_TESTS_STATIC_ASSERT((isBinaryOperationResultTypeValid<int,svector,OpMult>::value)); in execute()
56 TFEL_TESTS_STATIC_ASSERT((is_same<res3,svector>::value)); in execute()
57 TFEL_TESTS_STATIC_ASSERT((is_same<VectorTraits<svector>::NumType,stensor>::value)); in execute()
58 TFEL_TESTS_STATIC_ASSERT((is_same<VectorTraits<svector>::NumType,stensor>::value)); in execute()
59 …TFEL_TESTS_STATIC_ASSERT((is_same<stensor,ResultType<int,svector,OpMult>::type::value_type>::value… in execute()
60 using handle = ComputeBinaryResult<int,svector,OpMult>::Handle; in execute()
61 TFEL_TESTS_STATIC_ASSERT((is_same<Expr<svector,ScalarObjectOperation<int,svector,OpMult>>, in execute()
/dports/math/z3/z3-z3-4.8.13/src/math/lp/
H A Dmonic.h25 svector<lp::var_index> m_vs;
32 mon_eq(lp::var_index v, const svector<lp::var_index> &vs): in mon_eq()
40 const svector<lp::var_index>& vars() const { return m_vs; } in vars()
52 svector<lp::var_index>& vars1() { return m_vs; } in vars1()
58 svector<lpvar> m_rvars;
64 monic(v, svector<lpvar>(sz, vs), idx) {} in monic()
65 monic(lpvar v, const svector<lpvar> &vs, unsigned idx): in monic()
72 svector<lpvar> const& rvars() const { return m_rvars; } in rvars()
78 svector<lpvar>::const_iterator begin() const { return vars().begin(); } in begin()
79 svector<lpvar>::const_iterator end() const { return vars().end(); } in end()
H A Dhnf_cutter.h37 svector<constraint_index> m_constraints_for_explanation;
58 …const svector<unsigned>& constraints_for_explanation() const { return m_constraints_for_explanatio… in constraints_for_explanation()
72 vector<mpq> create_b(const svector<unsigned> & basis_rows);
83 void shrink_explanation(const svector<unsigned>& basis_rows);
90 svector<unsigned> vars() const;
/dports/math/py-z3-solver/z3-z3-4.8.10/src/math/lp/
H A Dmonic.h25 svector<lp::var_index> m_vs;
32 mon_eq(lp::var_index v, const svector<lp::var_index> &vs): in mon_eq()
40 const svector<lp::var_index>& vars() const { return m_vs; } in vars()
52 svector<lp::var_index>& vars1() { return m_vs; } in vars1()
58 svector<lpvar> m_rvars;
64 monic(v, svector<lpvar>(sz, vs), idx) {} in monic()
65 monic(lpvar v, const svector<lpvar> &vs, unsigned idx): in monic()
72 svector<lpvar> const& rvars() const { return m_rvars; } in rvars()
78 svector<lpvar>::const_iterator begin() const { return vars().begin(); } in begin()
79 svector<lpvar>::const_iterator end() const { return vars().end(); } in end()
/dports/math/z3/z3-z3-4.8.13/src/smt/
H A Dspanning_tree.h35 svector<node_id> m_pred;
37 svector<int> m_depth;
38 …svector<node_id> m_thread; // Store the pointer from node i to the next node in depth-fi…
40 svector<edge_id> m_tree; // i |-> edge between (i, m_pred[i])
58 virtual void initialize(svector<edge_id> const & tree);
59 void get_descendants(node_id start, svector<node_id> & descendants);
62 …void get_path(node_id start, node_id end, svector<edge_id> & path, bool_vector & against); …
75 void initialize(svector<edge_id> const & tree);
/dports/math/py-z3-solver/z3-z3-4.8.10/src/smt/
H A Dspanning_tree.h35 svector<node_id> m_pred;
37 svector<int> m_depth;
38 …svector<node_id> m_thread; // Store the pointer from node i to the next node in depth-fi…
40 svector<edge_id> m_tree; // i |-> edge between (i, m_pred[i])
58 virtual void initialize(svector<edge_id> const & tree);
59 void get_descendants(node_id start, svector<node_id> & descendants);
62 …void get_path(node_id start, node_id end, svector<edge_id> & path, bool_vector & against); …
75 void initialize(svector<edge_id> const & tree);
/dports/games/armagetronad/armagetronad-0.2.8.3.5/src/tron/
H A DgParticles.cpp94 tmpVec = svector; in GiveBirth()
122 svector.x = vec.x; in gParticles()
123 svector.y = vec.y; in gParticles()
124 svector.z = vec.z; in gParticles()
135 pVelocity(svector.x, svector.y, svector.z); in gParticles()
/dports/science/lammps/lammps-stable_29Sep2021/src/GRANULAR/
H A Dpair_gran_hooke.cpp328 svector[0] = -ft*vtr1; in single()
329 svector[1] = -ft*vtr2; in single()
331 svector[3] = sqrt(svector[0]*svector[0] + in single()
332 svector[1]*svector[1] + in single()
333 svector[2]*svector[2]); in single()
334 svector[4] = vn1; in single()
335 svector[5] = vn2; in single()
336 svector[6] = vn3; in single()
337 svector[7] = vt1; in single()
338 svector[8] = vt2; in single()
[all …]
/dports/math/z3/z3-z3-4.8.13/src/math/polynomial/
H A Dlinear_eq_solver.h29 vector<svector<numeral> > A;
30 svector<numeral> b;
39 svector<numeral> & as = A[i]; in flush()
55 A.push_back(svector<numeral>()); in resize()
56 svector<numeral> & as = A.back(); in resize()
67 svector<numeral> & A_i = A[i]; in reset()
79 svector<numeral> & A_i = A[i]; in add()
99 svector<numeral> & A_k = A[k]; in solve()
111 svector<numeral> & A_i = A[i]; in solve()
/dports/math/py-z3-solver/z3-z3-4.8.10/src/math/polynomial/
H A Dlinear_eq_solver.h29 vector<svector<numeral> > A;
30 svector<numeral> b;
39 svector<numeral> & as = A[i]; in flush()
55 A.push_back(svector<numeral>()); in resize()
56 svector<numeral> & as = A.back(); in resize()
67 svector<numeral> & A_i = A[i]; in reset()
79 svector<numeral> & A_i = A[i]; in add()
99 svector<numeral> & A_k = A[k]; in solve()
111 svector<numeral> & A_i = A[i]; in solve()
/dports/math/sisl/SISL-SISL-4.6.0-44-g9114631/src/
H A Ds1615.c100 double svector[8]; local
196 svector[kk + kp] = spoint[kki + kp] - spoint[kki - kdim + kp];
209 tcross = svector[kk] * svector[kk + 3]
210 - svector[kk + 1] * svector[kk + 2];
/dports/math/z3/z3-z3-4.8.13/src/math/simplex/
H A Dnetwork_flow.h78 svector<edge_state> & m_states;
84 svector<edge_state> & states, edge_id & enter_id) in pivot_rule_impl()
99 svector<edge_state> & states, edge_id & enter_id) : in first_eligible_pivot()
110 svector<edge_state> & states, edge_id & enter_id) : in best_eligible_pivot()
120 svector<edge_id> m_candidates;
129 svector<edge_state> & states, edge_id & enter_id) : in candidate_list_pivot()
151 svector<edge_state> m_states;
/dports/math/py-z3-solver/z3-z3-4.8.10/src/math/simplex/
H A Dnetwork_flow.h78 svector<edge_state> & m_states;
84 svector<edge_state> & states, edge_id & enter_id) in pivot_rule_impl()
99 svector<edge_state> & states, edge_id & enter_id) : in first_eligible_pivot()
110 svector<edge_state> & states, edge_id & enter_id) : in best_eligible_pivot()
120 svector<edge_id> m_candidates;
129 svector<edge_state> & states, edge_id & enter_id) : in candidate_list_pivot()
151 svector<edge_state> m_states;
/dports/math/z3/z3-z3-4.8.13/src/util/
H A Dscoped_numeral_vector.h24 class _scoped_numeral_vector : public svector<typename Manager::numeral> {
46 svector<typename Manager::numeral>::reset(); in reset()
52 svector<typename Manager::numeral>::push_back(typename Manager::numeral()); in push_back()
66 svector<typename Manager::numeral>::shrink(sz); in shrink()
73 svector<typename Manager::numeral>::resize(sz, 0); in resize()
/dports/math/py-z3-solver/z3-z3-4.8.10/src/util/
H A Dscoped_numeral_vector.h24 class _scoped_numeral_vector : public svector<typename Manager::numeral> {
46 svector<typename Manager::numeral>::reset(); in reset()
52 svector<typename Manager::numeral>::push_back(typename Manager::numeral()); in push_back()
66 svector<typename Manager::numeral>::shrink(sz); in shrink()
73 svector<typename Manager::numeral>::resize(sz, 0); in resize()
/dports/math/z3/z3-z3-4.8.13/src/sat/
H A Dsat_bcd.h35 typedef svector<bin_clause> bin_clauses;
43 svector<bclause> m_L, m_R, m_live_clauses, m_new_L;
45 svector<uint64_t> m_rbits;
57 void pure_decompose(use_list& ul, literal lit, svector<bclause>& clauses);
72 void operator()(clause_vector& clauses, svector<bin_clause>& bins);

12345678910>>...36