Changeset 1887
- Timestamp:
- Mar 31, 2009, 7:38:16 PM (14 years ago)
- Location:
- trunk/yat/utility
- Files:
-
- 13 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/yat/utility/ColumnStream.h
r1797 r1887 6 6 /* 7 7 Copyright (C) 2007, 2008 Jari Häkkinen, Peter Johansson 8 Copyright (C) 2009 Peter Johansson 8 9 9 10 This file is part of svndigest, http://dev.thep.lu.se/svndigest … … 102 103 Requirement: T should have operator 103 104 operator<<(ostream&, const T&) 105 106 \relates ColumnStream 104 107 */ 105 108 template <typename T> -
trunk/yat/utility/CommandLine.h
r1797 r1887 179 179 Option::print(void) function. 180 180 \see OptionHelp 181 182 \relates CommandLine 181 183 */ 182 184 std::ostream& operator<<(std::ostream&, const CommandLine&); -
trunk/yat/utility/DataIterator.h
r1797 r1887 81 81 82 82 Convenient function in same fashion as std::make_pair. 83 84 \relates DataIterator 83 85 */ 84 86 template<typename Base> -
trunk/yat/utility/DataWeight.h
r1797 r1887 79 79 80 80 \return true if lhs.data() == rhs.data() 81 82 \relates DataWeight 81 83 */ 82 84 bool operator==(const DataWeight& lhs, const DataWeight& rhs); … … 86 88 87 89 \return true if lhs.data() != rhs.data() 90 91 \relates DataWeight 88 92 */ 89 93 bool operator!=(const DataWeight&, const DataWeight&); … … 93 97 94 98 \return true if lhs data is less than rhs data 99 100 \relates DataWeight 95 101 */ 96 102 bool operator<(const DataWeight&, const DataWeight&); … … 100 106 101 107 \return true if lhs data is greater than rhs data 108 109 \relates DataWeight 102 110 */ 103 111 bool operator>(const DataWeight&, const DataWeight&); … … 107 115 108 116 \return true if lhs.data() <= rhs.data() 117 118 \relates DataWeight 109 119 */ 110 120 bool operator<=(const DataWeight&, const DataWeight&); … … 114 124 115 125 \return true if lhs.data() >= rhs.data() 126 127 \relates DataWeight 116 128 */ 117 129 bool operator>=(const DataWeight&, const DataWeight&); -
trunk/yat/utility/DataWeightProxy.h
r1797 r1887 108 108 /** 109 109 \brief equality operator 110 111 \relates DataWeightProxy 110 112 */ 111 113 template<typename DataIterator, typename WeightIterator> -
trunk/yat/utility/Matrix.h
r1823 r1887 518 518 \return True if all elements in the Matrix is zero, false 519 519 otherwise. 520 521 \relates Matrix 520 522 */ 521 523 bool isnull(const Matrix&); … … 525 527 526 528 \return The maximum value of the Matrix. 529 530 \relates Matrix 527 531 */ 528 532 double max(const Matrix&); … … 532 536 533 537 \return The minimum value of the Matrix. 538 539 \relates Matrix 534 540 */ 535 541 double min(const Matrix&); … … 542 548 543 549 \note Lower index has precedence (searching in row-major order). 550 551 \relates Matrix 544 552 */ 545 553 void minmax_index(const Matrix&, … … 559 567 560 568 \return True if the \a templat Matrix contains at least one NaN. 569 570 \relates Matrix 561 571 */ 562 572 bool nan(const Matrix& templat, Matrix& flag); … … 568 578 569 579 \throw GSL_error if sizes are not equal. 580 581 \relates Matrix 570 582 */ 571 583 void swap(Matrix&, Matrix&); … … 573 585 /** 574 586 \brief The output operator for the Matrix class. 587 588 \relates Matrix 575 589 */ 576 590 std::ostream& operator<< (std::ostream& s, const Matrix&); … … 578 592 /** 579 593 \brief Vector Matrix multiplication 594 595 \relates Matrix 580 596 */ 581 597 Vector operator*(const Matrix&, const VectorBase&); … … 583 599 /** 584 600 \brief Matrix Vector multiplication 601 602 \relatesalso Matrix 603 604 \relatesalso VectorBase 585 605 */ 586 606 Vector operator*(const VectorBase&, const Matrix&); -
trunk/yat/utility/MatrixWeighted.h
r1816 r1887 273 273 274 274 \see MatrixWeighted::swap(MatrixWeighted&) 275 276 \relates MatrixWeighted 275 277 */ 276 278 void swap(MatrixWeighted&, MatrixWeighted&); -
trunk/yat/utility/Range.h
r1797 r1887 6 6 /* 7 7 Copyright (C) 2008 Jari Häkkinen, Peter Johansson 8 Copyright (C) 2009 Peter Johansson 8 9 9 10 This file is part of the yat library, http://dev.thep.lu.se/yat … … 95 96 96 97 \since New in yat 0.5 98 99 \relatesalso Range 97 100 */ 98 101 template<typename T1, typename T2> … … 103 106 104 107 \since New in yat 0.5 108 109 \relatesalso Range 105 110 */ 106 111 template<typename T1, typename T2> … … 115 120 116 121 \since New in yat 0.5 122 123 \relatesalso Range 117 124 */ 118 125 template<typename T1, typename T2> … … 123 130 124 131 \since New in yat 0.5 132 133 \relatesalso Range 125 134 */ 126 135 template<typename T1, typename T2> … … 131 140 132 141 \since New in yat 0.5 142 143 \relatesalso Range 133 144 */ 134 145 template<typename T1, typename T2> … … 139 150 140 151 \since New in yat 0.5 152 153 \relatesalso Range 141 154 */ 142 155 template<typename T1, typename T2> -
trunk/yat/utility/TypeInfo.h
r1797 r1887 6 6 /* 7 7 Copyright (C) 2007, 2008 Jari Häkkinen, Peter Johansson 8 Copyright (C) 2009 Peter Johansson 8 9 9 10 This file is part of the yat library, http://dev.thep.lu.se/yat … … 76 77 \brief Equality comparison 77 78 \return true iff underlying std::type_info are equal 79 80 \relates TypeInfo 78 81 */ 79 82 bool operator==(const TypeInfo&, const TypeInfo&); … … 81 84 /** 82 85 \brief Based on operator== 86 87 \relates TypeInfo 83 88 */ 84 89 bool operator!=(const TypeInfo&, const TypeInfo&); … … 87 92 \brief Ordering relation 88 93 \return true iff underlying lhs.get()<rhs.get() 94 95 \relates TypeInfo 89 96 */ 90 97 bool operator<(const TypeInfo& lhs, const TypeInfo& rhs); … … 92 99 /** 93 100 \brief Based on operators == and < 101 102 \relates TypeInfo 94 103 */ 95 104 bool operator<=(const TypeInfo&, const TypeInfo&); … … 97 106 /** 98 107 \brief Based on operator < 108 109 \relates TypeInfo 99 110 */ 100 111 bool operator>(const TypeInfo&, const TypeInfo&); … … 102 113 /** 103 114 \brief Based on operator <= 115 116 \relates TypeInfo 104 117 */ 105 118 bool operator>=(const TypeInfo&, const TypeInfo&); -
trunk/yat/utility/Vector.h
r1797 r1887 186 186 187 187 \throw GSL_error if Vector lengths differs. 188 189 \relates Vector 188 190 */ 189 191 void swap(Vector&, Vector&); -
trunk/yat/utility/VectorBase.h
r1797 r1887 176 176 \return True if all elements in the VectorBase is zero, false 177 177 othwerwise. 178 179 \relates VectorBase 178 180 */ 179 181 bool isnull(const VectorBase&); … … 183 185 184 186 \return The maximum value of the VectorBase. 187 188 \relates VectorBase 185 189 */ 186 190 double max(const VectorBase&); … … 192 196 193 197 \note Lower index has precedence. 198 199 \relates VectorBase 194 200 */ 195 201 size_t max_index(const VectorBase&); … … 199 205 200 206 \return The minimum value of the VectorBase. 207 208 \relates VectorBase 201 209 */ 202 210 double min(const VectorBase&); … … 208 216 209 217 \note Lower index has precedence. 218 219 \relates VectorBase 210 220 */ 211 221 size_t min_index(const VectorBase&); … … 223 233 224 234 \return True if the \a templat VectorBase contains at least one NaN. 235 236 \relates VectorBase 225 237 */ 226 238 bool nan(const VectorBase& templat, Vector& flag); … … 235 247 index of the greatest element in \a invec . The VectorBase \a invec 236 248 is not changed. 249 250 \relatesalso VectorBase 237 251 */ 238 252 void sort_index(std::vector<size_t>& sort_index, const VectorBase& invec); … … 241 255 Similar to sort_index but creates a VectorBase with indices to 242 256 the \a k smallest elements in \a invec. 257 258 \relatesalso VectorBase 243 259 */ 244 260 void sort_smallest_index(std::vector<size_t>& sort_index, size_t k, … … 248 264 Similar to sort_index but creates a VectorBase with indices to 249 265 the \a k largest elements in \a invec. 266 267 \relatesalso VectorBase 250 268 */ 251 269 void sort_largest_index(std::vector<size_t>& sort_index, size_t k, … … 256 274 257 275 \return The sum. 276 277 \relates VectorBase 258 278 */ 259 279 double sum(const VectorBase&); … … 269 289 s << setfill(':') << v; 270 290 \endverbatim 291 292 \relates VectorBase 271 293 */ 272 294 std::ostream& operator<<(std::ostream& s, const VectorBase& v); -
trunk/yat/utility/WeightIterator.h
r1797 r1887 80 80 81 81 Convenient function in same fashion as std::make_pair. 82 83 \relates WeightIterator 82 84 */ 83 85 template<typename Base> -
trunk/yat/utility/WeightedIterator.h
r1543 r1887 5 5 6 6 /* 7 Copyright (C) 2008 Peter Johansson7 Copyright (C) 2008, 2009 Peter Johansson 8 8 9 9 This file is part of the yat library, http://dev.thep.lu.se/yat … … 131 131 132 132 Convenient function in same fashion as std::make_pair. 133 134 \relates WeightedIterator 133 135 */ 134 136 template<typename DataIterator, typename WeightIterator>
Note: See TracChangeset
for help on using the changeset viewer.