29 _devices(copy._devices)
38 _devices = copy._devices;
46 _devices.insert(device);
55 return _devices.erase(device) > 0;
63 size_t other_num_devices = other.
size();
64 for (
size_t i = 0; i < other_num_devices; i++) {
76 InputDevices::const_iterator it;
77 for (it = _devices.
begin(); it != _devices.
end(); ++it) {
83 _devices.
swap(new_devices);
92 InputDevices::const_iterator it = _devices.find(device);
93 return (it != _devices.
end());
119 if (_devices.
size() == 1) {
120 out <<
"1 input device";
122 out << _devices.
size() <<
" input devices";
131 write(std::ostream &out,
int indent_level)
const {
136 InputDevices::const_iterator it;
137 for (it = _devices.
begin(); it != _devices.
end(); ++it) {
138 (*it)->output(
indent(out, indent_level));
size_type_0 size() const
Returns the number of elements in the ordered vector.
void clear()
Removes all elements from the ordered vector.
iterator_0 begin()
Returns the iterator that marks the first element in the ordered vector.
iterator_0 end()
Returns the iterator that marks the end of the ordered vector.
void reserve(size_type_0 n)
Informs the vector of a planned change in size; ensures that the capacity of the vector is greater th...
void swap(ordered_vector< Key, Compare, Vector > &other)
Exchanges the contents of this vector and the other vector, in constant time (e.g....
std::ostream & indent(std::ostream &out, int indent_level)
A handy function for doing text formatting.
void sort()
Maps to sort_unique().
void push_back(const value_type_0 &key)
Adds the new element to the end of the vector without regard for proper sorting.
PANDA 3D SOFTWARE Copyright (c) Carnegie Mellon University.