/dports/math/givaro/givaro-4.1.1/src/library/poly1/ |
H A D | givpoly1dense.h | 249 Rep& stdmul( Rep& R, const Rep& P, const Rep& Q) const; 279 Rep& axpy (Rep& r, const Rep& a, const Rep& x, const Rep& y) const; 281 Rep& axpyin(Rep& r, const Rep& a, const Rep& x) const; 284 Rep& maxpy (Rep& r, const Rep& a, const Rep& b, const Rep& c) const; 290 Rep& axmy (Rep& r, const Rep& a, const Rep& x, const Rep& y) const; 297 Rep& divmod( Rep& q, Rep& r, const Rep& a, const Rep& b ) const; 300 Rep& divmodin( Rep& q, Rep& r, const Rep& b ) const; 304 Rep& pdivmod( Rep& q, Rep& r, Type_t& m, const Rep& a, const Rep& b ) const; 313 Rep& gcd ( Rep& D, const Rep& P, const Rep& Q) const; 314 Rep& gcd ( Rep& D, Rep& U, Rep& V, const Rep& P, const Rep& Q) const; [all …]
|
/dports/math/givaro/givaro-4.1.1/src/kernel/integer/ |
H A D | givinteger.h | 106 Rep& mul( Rep& r, const Rep& a, const Rep& b ) const in mul() 110 Rep& div( Rep& r, const Rep& a, const Rep& b ) const in div() 114 Rep& mod( Rep& r, const Rep& a, const Rep& b ) const in mod() 118 Rep& add( Rep& r, const Rep& a, const Rep& b ) const in add() 126 Rep& divmod( Rep& q, Rep& r, const Rep& a, const Rep& b ) const in divmod() 156 Rep& axpy( Rep& r, const Rep& a, const Rep& b, const Rep& c ) const in axpy() 160 Rep& maxpy( Rep& r, const Rep& a, const Rep& b, const Rep& c ) const in maxpy() 168 Rep& axmy( Rep& r, const Rep& a, const Rep& b, const Rep& c ) const in axmy() 192 Rep& gcd( Rep& g, Rep& u, Rep& v, const Rep& a, const Rep& b ) const in gcd() 246 Rep& sqrt(Rep& s, Rep& r, const Rep& n) const in sqrt() [all …]
|
H A D | givintnumtheo.h | 44 Rep& phi(Rep& res, const Container<Rep, Alloc<Rep> >& Lf, const Rep& n) const ; 46 Rep& phi(Rep& r, const Rep& n) const ; 51 Rep& prim_root(Rep&, const Rep&) const ; 67 Rep& lowest_prim_root(Rep&, const Rep&) const ; 69 Rep& order(Rep&, const Rep&, const Rep&) const ; 84 Rep& prim_inv(Rep & , const Rep&) const ; 85 Rep& prim_elem(Rep & , const Rep&) const ; 87 Rep& prim_base(Rep & , const Rep&) const ; 88 Rep& lambda_base(Rep & , const Rep&) const ; 92 Rep& lambda(Rep & , const Rep&) const ; [all …]
|
H A D | givintsqrootmod.h | 36 typedef typename IntFactorDom < MyRandIter >::Rep Rep; typedef 43 Rep & sqrootmod (Rep & x, const Rep & a, const Rep & n) const { in sqrootmod() 52 Rep tmp; in sqrootmod() 89 Rep & sqrootmodprime (Rep & x, const Rep & a, const Rep & p) const; 92 …Rep & sqrootmodprimepower (Rep & x, const Rep & a, const Rep & p, const uint64_t k, const Rep &pk)… 95 Rep & sqrootmodpoweroftwo (Rep & x, const Rep & a,const uint64_t k, const Rep & pk) const; 104 Rep & sqrootlinear (Rep & x, const Rep & a,const Rep & p,const uint64_t k) const; 107 Rep & sqroottwolinear(Rep & x, const Rep & a,const uint64_t k) const; 115 …Rep & sqroothensellift (Rep & x, const Rep & a, const Rep & p, const uint64_t k, const Rep & pk) c… 119 …Rep & sqrootonemorelift (Rep & x, const Rep & a, const Rep & p, const uint64_t k, const Rep & pk) … [all …]
|
/dports/math/givaro/givaro-4.1.1/src/library/tools/ |
H A D | givfixedtrunc.h | 66 Rep& assign( Rep& p, const Rep& q) const in assign() 104 Rep& add ( Rep& res, const Rep& u, const Rep& v ) const in add() 113 Rep& sub ( Rep& res, const Rep& u, const Rep& v ) const in sub() 124 Rep& mul ( Rep& res, const Rep& u, const Rep& v ) const in mul() 138 Rep& axpy (Rep& r, const Rep& a, const Rep& x, const Rep& y) const in axpy() 142 Rep& axpyin(Rep& r, const Rep& a, const Rep& x) const in axpyin() 150 Rep& axmy (Rep& r, const Rep& a, const Rep& x, const Rep& y) const in axmy() 154 Rep& axmyin(Rep& r, const Rep& a, const Rep& x) const in axmyin() 163 Rep& maxpy (Rep& r, const Rep& a, const Rep& x, const Rep& y) const in maxpy() 167 Rep& maxpyin(Rep& r, const Rep& a, const Rep& x) const in maxpyin() [all …]
|
H A D | givquotientdomain.h | 50 Rep& assign(Rep& p, const Rep& Q) const in assign() 95 Rep& mul ( Rep& q, const Rep& a, const Rep& b ) const in mul() 103 Rep& add ( Rep& r, const Rep& u, const Rep& v ) const in add() 111 Rep& sub ( Rep& r, const Rep& u, const Rep& v ) const in sub() 138 Rep& div ( Rep& q, const Rep& a, const Rep& b ) const in div() 142 Rep& axpy (Rep& r, const Rep& a, const Rep& x, const Rep& y) const in axpy() 146 Rep& axpyin(Rep& r, const Rep& a, const Rep& x) const in axpyin() 151 Rep& maxpy (Rep& r, const Rep& a, const Rep& x, const Rep& y) const in maxpy() 156 Rep& axmyin(Rep& r, const Rep& a, const Rep& x) const in axmyin() 161 Rep& maxpyin(Rep& r, const Rep& a, const Rep& x) const in maxpyin() [all …]
|
H A D | givtruncdomain.h | 110 Rep& assign( Rep& p, const Rep& q) const in assign() 248 Rep& add ( Rep& res, const Rep& u, const Rep& v ) const in add() 261 Rep& neg(Rep& R, const Rep& P) const in neg() 273 Rep& sub ( Rep& res, const Rep& u, const Rep& v ) const in sub() 289 Rep& mul ( Rep& res, const Rep& u, const Rep& v ) const in mul() 310 Rep& axpy (Rep& r, const Rep& a, const Rep& x, const Rep& y) const in axpy() 314 Rep& axpyin(Rep& r, const Rep& a, const Rep& x) const in axpyin() 329 Rep& axmy (Rep& r, const Rep& a, const Rep& x, const Rep& y) const in axmy() 333 Rep& axmyin(Rep& r, const Rep& a, const Rep& x) const in axmyin() 346 Rep& maxpy (Rep& r, const Rep& a, const Rep& x, const Rep& y) const in maxpy() [all …]
|
H A D | givfractiondomain.h | 94 Rep& assign( Rep& p, const Rep& q) const in assign() 176 Rep& mul ( Rep& q, const Rep& a, const Rep& b ) const in mul() 202 Rep& add ( Rep& res, const Rep& u, const Rep& v ) const in add() 244 Rep& sub ( Rep& res, const Rep& u, const Rep& v ) const in sub() 307 Rep& div ( Rep& q, const Rep& a, const Rep& b ) const in div() 312 Rep& axpy (Rep& r, const Rep& a, const Rep& x, const Rep& y) const in axpy() 348 Rep& axpyin(Rep& r, const Rep& a, const Rep& x) const in axpyin() 369 Rep& maxpy (Rep& r, const Rep& a, const Rep& x, const Rep& y) const in maxpy() 406 Rep& axmyin(Rep& r, const Rep& a, const Rep& x) const in axmyin() 427 Rep& maxpyin(Rep& r, const Rep& a, const Rep& x) const in maxpyin() [all …]
|
/dports/math/givaro/givaro-4.1.1/src/kernel/field/ |
H A D | gfq.h | 247 Rep& mul (Rep& r, const Rep a, const Rep b) const; 248 Rep& div (Rep& r, const Rep a, const Rep b) const; 249 Rep& add (Rep& r, const Rep a, const Rep b) const; 250 Rep& sub (Rep& r, const Rep a, const Rep b) const; 251 Rep& neg (Rep& r, const Rep a) const; 276 Rep& axpy (Rep& r, const Rep a, const Rep b, const Rep c) const; 281 Rep& axpyin (Rep& r, const Rep a, const Rep b) const; 285 Rep& axmy (Rep& r, const Rep a, const Rep b, const Rep c) const; 290 Rep& maxpy (Rep& r, const Rep a, const Rep b, const Rep c) const; 293 Rep& axmyin (Rep& r, const Rep a, const Rep b) const; [all …]
|
/dports/math/givaro/givaro-4.1.1/src/kernel/ring/ |
H A D | modular-log16.h | 144 Rep& mul (Rep& r, const Rep& a, const Rep& b) const; 145 Rep& div (Rep& r, const Rep& a, const Rep& b) const; 146 Rep& add (Rep& r, const Rep& a, const Rep& b) const; 147 Rep& sub (Rep& r, const Rep& a, const Rep& b) const; 148 Rep& neg (Rep& r, const Rep& a) const; 161 Rep& axpy (Rep& r, const Rep& a, const Rep& b, const Rep& c) const; 162 Rep& axpyin (Rep& r, const Rep& a, const Rep& b) const; 165 Rep& axmy (Rep& r, const Rep& a, const Rep& b, const Rep& c) const; 167 Rep& axmyin (Rep& r, const Rep& a, const Rep& b) const; 170 Rep& maxpy (Rep& r, const Rep& a, const Rep& b, const Rep& c) const; [all …]
|
/dports/devel/adabooch/bc-20160321/src/ |
H A D | bc-containers-trees-binary.adb | 59 Temp.Rep.Count := Temp.Rep.Count + 1; 66 return Left.Rep.all = Right.Rep.all; 163 T.Rep.Count := T.Rep.Count + 1; 179 T.Rep.Left := Swap_With.Rep; 182 T.Rep.Right := Swap_With.Rep; 185 Swap_With.Rep.Parent := T.Rep; 209 T.Rep := T.Rep.Left; 241 T.Rep := T.Rep.Right; 274 T.Rep.Count := T.Rep.Count - 1; 275 T.Rep := T.Rep.Parent; [all …]
|
H A D | bc-trees-binary_trees.adb | 59 Temp.Rep.Count := Temp.Rep.Count + 1; 66 return Left.Rep.all = Right.Rep.all; 163 T.Rep.Count := T.Rep.Count + 1; 179 T.Rep.Left := Swap_With.Rep; 182 T.Rep.Right := Swap_With.Rep; 185 Swap_With.Rep.Parent := T.Rep; 209 T.Rep := T.Rep.Left; 241 T.Rep := T.Rep.Right; 274 T.Rep.Count := T.Rep.Count - 1; 275 T.Rep := T.Rep.Parent; [all …]
|
H A D | bc-graphs.adb | 64 G.Rep := V.Rep; 65 G.Rep.Count := G.Rep.Count + 1; 107 A.Rep.Count := A.Rep.Count - 1; 122 A.Rep.Count := A.Rep.Count - 1; 188 return L.Rep = R.Rep; 196 V.Rep.Count := V.Rep.Count - 1; 259 return L.Rep = R.Rep; 267 A.Rep.Count := A.Rep.Count - 1; 436 V.Rep.Count := V.Rep.Count + 1; 446 V.Rep.Count := V.Rep.Count - 1; [all …]
|
H A D | bc-containers-trees-multiway.adb | 95 return Left.Rep = Right.Rep; 198 T.Rep.Child := From_Tree.Rep; 206 From_Tree.Rep.Parent := T.Rep; 226 T.Rep.Child := From_Tree.Rep; 243 From_Tree.Rep.Parent := T.Rep; 297 T.Rep.Count := T.Rep.Count + 1; 325 T.Rep.Child := Swap_With.Rep; 330 Swap_With.Rep.Parent := T.Rep; 367 T.Rep.Count := T.Rep.Count - 1; 368 T.Rep := T.Rep.Parent; [all …]
|
H A D | bc-trees-multiway_trees.adb | 96 return Left.Rep = Right.Rep; 180 T.Rep := From_Tree.Rep; 181 T.Rep.Count := T.Rep.Count + 1; 184 From_Tree.Rep.Parent := T.Rep; 186 T.Rep.Child := From_Tree.Rep; 238 T.Rep.Count := T.Rep.Count + 1; 265 T.Rep.Child := Swap_With.Rep; 270 Swap_With.Rep.Parent := T.Rep; 306 T.Rep.Count := T.Rep.Count - 1; 307 T.Rep := T.Rep.Parent; [all …]
|
H A D | bc-graphs-undirected.adb | 49 Second.Rep.Incoming := A.Rep; 50 A.Rep.Count := A.Rep.Count + 1; 55 First.Rep.Outgoing := A.Rep; 56 A.Rep.Count := A.Rep.Count + 1; 113 A.Rep.Count := A.Rep.Count - 1; 117 V.Rep.Outgoing := A.Rep; 121 A.Rep.From := V.Rep; 149 V.Rep.Incoming := A.Rep; 153 A.Rep.To := V.Rep; 164 V.Rep := A.Rep.From; [all …]
|
H A D | bc-graphs-directed.adb | 49 To.Rep.Incoming := A.Rep; 50 A.Rep.Count := A.Rep.Count + 1; 51 To.Rep.Count := To.Rep.Count + 1; 55 From.Rep.Outgoing := A.Rep; 56 A.Rep.Count := A.Rep.Count + 1; 126 V.Rep.Outgoing := A.Rep; 130 A.Rep.From := V.Rep; 158 V.Rep.Incoming := A.Rep; 162 A.Rep.To := V.Rep; 172 V.Rep := A.Rep.From; [all …]
|
H A D | bc-lists-double.adb | 61 return L.Rep = R.Rep; 108 L.Rep := From_List.Rep; 109 L.Rep.Count := L.Rep.Count + 1; 199 L.Rep := From_List.Rep; 412 L.Rep.Count := L.Rep.Count + 1; 421 L.Rep := With_List.Rep; 422 L.Rep.Count := L.Rep.Count + 1; 436 L.Rep.Count := L.Rep.Count + 1; 449 L.Rep.Next := With_List.Rep; 463 L.Rep := L.Rep.Next; [all …]
|
H A D | bc-containers-lists-double.adb | 86 return L.Head.Rep = R.Head.Rep; 118 L.Head.Rep := From_List.Head.Rep; 119 L.Head.Rep.Count := L.Head.Rep.Count + 1; 211 L.Head.Rep := From_List.Head.Rep; 424 L.Head.Rep.Count := L.Head.Rep.Count + 1; 433 L.Head.Rep := With_List.Head.Rep; 434 L.Head.Rep.Count := L.Head.Rep.Count + 1; 463 L.Head.Rep.Next := With_List.Head.Rep; 477 L.Head.Rep := L.Head.Rep.Next; 501 L.Head.Rep := L.Head.Rep.Previous; [all …]
|
/dports/math/givaro/givaro-4.1.1/src/library/vector/ |
H A D | givvectordense.h | 70 void init( Rep& v, const Rep& u ) const in init() 76 void assign ( Rep& r, const Rep& v) const in assign() 117 void add ( Rep& res, const Rep& u, const Rep& v ) const; 124 void sub ( Rep& res, const Rep& u, const Rep& v ) const; 135 void axpy ( Rep& res, const Type_t& a, const Rep& x, const Rep& y )const; 139 void axmy ( Rep& res, const Type_t& a, const Rep& x, const Rep& y ) const; 158 void axpy ( Rep& res, const Rep& a, const Rep& x, const Rep& y ) const; 160 void axpyin( Rep& res, const Rep& a, const Rep& x ) const; 162 void axmy ( Rep& res, const Rep& a, const Rep& x, const Rep& y ) const; 164 void axmyin( Rep& res, const Rep& a, const Rep& x ) const; [all …]
|
H A D | givvectorsparse.h | 66 void assign (Rep& r, const Rep& v) in assign() 72 int areEqual ( const Rep& P, const Rep& Q) const; 73 int areNEqual( const Rep& P, const Rep& Q) const; 81 void add ( Rep& res, const Rep& op1, const Rep& op2) const; 82 void sub ( Rep& res, const Rep& op1, const Rep& op2) const; 85 void dot ( Type_t& res, const Rep& u, const Rep& v ) const; 88 void addin( Rep& res, const Rep& u ) const; 91 void subin( Rep& res, const Rep& u ) const; 95 void neg ( Rep& res, const Rep& u ) const; 106 void map( Rep& r, const UNOP& op, const Rep& u) const; [all …]
|
/dports/math/givaro/givaro-4.1.1/src/library/matrix/ |
H A D | givmatdense.h | 73 void assign (Rep& r, const Rep& a) in assign() 87 void mulin ( Rep& res, const Rep& u ) const; 88 void mul ( Rep& res, const Rep& u, const Rep& v ) const; 89 void addin ( Rep& res, const Rep& u ) const; 90 void add ( Rep& res, const Rep& u, const Rep& v ) const; 92 void sub ( Rep& res, const Rep& u, const Rep& v ) const; 106 void axpy ( Rep& res, const Type_t& a, const Rep& x, const Rep& y )const; 110 void axmy ( Rep& res, const Type_t& a, const Rep& x, const Rep& y ) const; 115 void axpy ( Rep& res, const Type_t& a, const Rep& A, const Rep& X, 118 void axpy ( Rep& res, const Rep& A, const Rep& X, const Rep& Y ) const; [all …]
|
/dports/math/givaro/givaro-4.1.1/src/kernel/system/ |
H A D | givgenarith.h | 47 void init ( Rep& r, const Rep a ) const { r = a; }; in init() 48 void assign( Rep& r, const Rep a ) const { r = a; }; in assign() 58 void mul( Rep& r, const Rep a, const Rep b ) const { r = a * b; }; in mul() 59 void div( Rep& r, const Rep a, const Rep b ) const { r = a / b; }; in div() 60 void mod( Rep& r, const Rep a, const Rep b ) const { r = a % b; }; in mod() 61 void add( Rep& r, const Rep a, const Rep b ) const { r = a + b; }; in add() 62 void sub( Rep& r, const Rep a, const Rep b ) const { r = a - b; }; in sub() 70 void axpy( Rep& r, const Rep a, const Rep b, const Rep c ) const in axpy() 72 void axpyin( Rep& r, const Rep a, const Rep b ) const { r += a * b; }; in axpyin() 73 void axmy( Rep& r, const Rep a, const Rep b, const Rep c ) const in axmy() [all …]
|
/dports/math/givaro/givaro-4.1.1/src/kernel/rational/ |
H A D | givrational.h | 235 Rep& mul( Rep& r, const Rep& a, const Rep& b ) const { return r = a * b; }; in mul() 236 Rep& div( Rep& r, const Rep& a, const Rep& b ) const { return r = a / b; }; in div() 237 Rep& add( Rep& r, const Rep& a, const Rep& b ) const { return r = a + b; }; in add() 245 Rep& axpy( Rep& r, const Rep& a, const Rep& b, const Rep& c ) const in axpy() 247 Rep& axpyin( Rep& r, const Rep& a, const Rep& b ) const in axpyin() 249 Rep& maxpy( Rep& r, const Rep& a, const Rep& b, const Rep& c ) const in maxpy() 251 Rep& axmy( Rep& r, const Rep& a, const Rep& b, const Rep& c ) const in axmy() 253 Rep& axmyin( Rep& r, const Rep& a, const Rep& b ) const in axmyin() 255 Rep& maxpyin( Rep& r, const Rep& a, const Rep& b ) const in maxpyin() 259 Rep& neg( Rep& r, const Rep& a ) const { in neg() [all …]
|
/dports/textproc/zorba/zorba-2.7.0/src/util/string/ |
H A D | rstring.h | 2419 template<class Rep> inline rstring<Rep>& 2434 template<class Rep> inline rstring<Rep>& 2441 template<class Rep> inline rstring<Rep>& 2448 template<class Rep> inline rstring<Rep>& 2456 template<class Rep> inline rstring<Rep>& 2462 template<class Rep> inline rstring<Rep>& 2471 template<class Rep> inline rstring<Rep>& 2477 template<class Rep> inline rstring<Rep>& 2483 template<class Rep> inline rstring<Rep>& 2545 template<class Rep> inline rstring<Rep>& [all …]
|