historical/toontown-classic.git/panda/include/eggMorphList.I
2024-01-16 11:20:27 -06:00

201 lines
4.1 KiB
Text

/**
* PANDA 3D SOFTWARE
* Copyright (c) Carnegie Mellon University. All rights reserved.
*
* All use of this software is subject to the terms of the revised BSD
* license. You should have received a copy of this license along
* with this source code in a file named "LICENSE."
*
* @file eggMorphList.I
* @author drose
* @date 1999-01-29
*/
/**
*
*/
template<class MorphType>
INLINE EggMorphList<MorphType>::
EggMorphList() {
}
/**
*
*/
template<class MorphType>
INLINE EggMorphList<MorphType>::
EggMorphList(const EggMorphList<MorphType> &copy) :
_morphs(copy._morphs)
{
}
/**
*
*/
template<class MorphType>
INLINE void EggMorphList<MorphType>::
operator = (const EggMorphList &copy) {
_morphs = copy._morphs;
}
/**
*
*/
template<class MorphType>
INLINE EggMorphList<MorphType>::
~EggMorphList() {
}
/**
*
*/
template<class MorphType>
INLINE bool EggMorphList<MorphType>::
operator == (const EggMorphList<MorphType> &other) const {
return (_morphs == other._morphs);
}
/**
*
*/
template<class MorphType>
INLINE bool EggMorphList<MorphType>::
operator != (const EggMorphList<MorphType> &other) const {
return (_morphs != other._morphs);
}
/**
*
*/
template<class MorphType>
INLINE bool EggMorphList<MorphType>::
operator < (const EggMorphList<MorphType> &other) const {
return (_morphs < other._morphs);
}
/**
* compare_to() compares a different space than the operator methods, which
* only check the morph's name. compare_to() compares the name and the value
* as well.
*/
template<class MorphType>
int EggMorphList<MorphType>::
compare_to(const EggMorphList<MorphType> &other, double threshold) const {
if (_morphs.size() != other._morphs.size()) {
return (int)_morphs.size() - (int)other._morphs.size();
}
for (size_t i = 0; i < _morphs.size(); i++) {
int compare = _morphs[i].compare_to(other._morphs[i], threshold);
if (compare < 0) {
return compare;
}
}
return 0;
}
/**
*
*/
template<class MorphType>
INLINE typename EggMorphList<MorphType>::iterator EggMorphList<MorphType>::
begin() {
return _morphs.begin();
}
/**
*
*/
template<class MorphType>
INLINE typename EggMorphList<MorphType>::const_iterator EggMorphList<MorphType>::
begin() const {
return _morphs.begin();
}
/**
*
*/
template<class MorphType>
INLINE typename EggMorphList<MorphType>::iterator EggMorphList<MorphType>::
end() {
return _morphs.end();
}
/**
*
*/
template<class MorphType>
INLINE typename EggMorphList<MorphType>::const_iterator EggMorphList<MorphType>::
end() const {
return _morphs.end();
}
/**
*
*/
template<class MorphType>
INLINE typename EggMorphList<MorphType>::size_type EggMorphList<MorphType>::
size() const {
return _morphs.size();
}
/**
*
*/
template<class MorphType>
INLINE bool EggMorphList<MorphType>::
empty() const {
return _morphs.empty();
}
/**
* This is similar to the insert() interface for sets, except it does not
* guarantee that the resulting list is sorted.
*
* We have this member function so the EggMorphList resembles a set. It used
* to *be* a set, but we cannot export STL sets from a Windows DLL.
*/
template<class MorphType>
std::pair<typename EggMorphList<MorphType>::iterator, bool> EggMorphList<MorphType>::
insert(const MorphType &value) {
std::pair<iterator, bool> result;
typename Morphs::iterator mi;
for (mi = _morphs.begin(); mi != _morphs.end(); ++mi) {
if ((*mi) == value) {
// This value is already present.
result.first = mi;
result.second = false;
return result;
}
}
// This value is not already present; add it to the list.
_morphs.push_back(value);
result.first = _morphs.begin() + _morphs.size() - 1;
result.second = true;
return result;
}
/**
* Empties the list of morphs.
*/
template<class MorphType>
INLINE void EggMorphList<MorphType>::
clear() {
_morphs.clear();
}
/**
*
*/
template<class MorphType>
void EggMorphList<MorphType>::
write(std::ostream &out, int indent_level, const std::string &tag,
int num_dimensions) const {
const_iterator i;
for (i = begin(); i != end(); ++i) {
indent(out, indent_level);
i->output(out, tag, num_dimensions);
out << "\n";
}
}