/usr/include/octave-3.2.4/octave/oct-map.h is in octave3.2-headers 3.2.4-12.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 | /*
Copyright (C) 1994, 1995, 1996, 1997, 2000, 2002, 2003, 2004, 2005,
2006, 2007, 2009 John W. Eaton
This file is part of Octave.
Octave is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 3 of the License, or (at your
option) any later version.
Octave is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with Octave; see the file COPYING. If not, see
<http://www.gnu.org/licenses/>.
*/
#if !defined (octave_oct_map_h)
#define octave_oct_map_h 1
#include <algorithm>
#include <map>
#include "Cell.h"
#include "oct-obj.h"
class string_vector;
class
OCTINTERP_API
Octave_map
{
public:
typedef std::map<std::string, Cell>::iterator iterator;
typedef std::map<std::string, Cell>::const_iterator const_iterator;
typedef std::list<std::string>::iterator key_list_iterator;
typedef std::list<std::string>::const_iterator const_key_list_iterator;
// Warning! You should always use at least two dimensions.
Octave_map (const dim_vector& dv = dim_vector (0, 0),
const Cell& key_vals = Cell ());
Octave_map (const std::string& k, const octave_value& value)
: map (), key_list (), dimensions (1, 1)
{
map[k] = value;
key_list.push_back (k);
}
Octave_map (const string_vector& sv)
: map (), key_list (), dimensions (0, 0)
{
for (octave_idx_type i = 0; i < sv.length (); i++)
{
std::string k = sv[i];
map[k] = Cell ();
key_list.push_back (k);
}
}
Octave_map (const std::string& k, const Cell& vals)
: map (), key_list (), dimensions (vals.dims ())
{
map[k] = vals;
key_list.push_back (k);
}
Octave_map (const std::string& k, const octave_value_list& val_list)
: map (), key_list (), dimensions (1, val_list.length ())
{
map[k] = val_list;
key_list.push_back (k);
}
Octave_map (const Octave_map& m)
: map (m.map), key_list (m.key_list), dimensions (m.dimensions) { }
Octave_map& operator = (const Octave_map& m)
{
if (this != &m)
{
map = m.map;
key_list = m.key_list;
dimensions = m.dimensions;
}
return *this;
}
~Octave_map (void) { }
Octave_map squeeze (void) const;
Octave_map permute (const Array<int>& vec, bool inv = false) const;
// This is the number of keys.
octave_idx_type nfields (void) const { return map.size (); }
void del (const std::string& k)
{
iterator p = map.find (k);
if (p != map.end ())
{
map.erase (p);
key_list_iterator q
= std::find (key_list.begin (), key_list.end (), k);
assert (q != key_list.end ());
key_list.erase (q);
}
}
iterator begin (void) { return iterator (map.begin ()); }
const_iterator begin (void) const { return const_iterator (map.begin ()); }
iterator end (void) { return iterator (map.end ()); }
const_iterator end (void) const { return const_iterator (map.end ()); }
std::string key (const_iterator p) const { return p->first; }
Cell& contents (const std::string& k);
Cell contents (const std::string& k) const;
Cell& contents (iterator p)
{ return p->second; }
Cell contents (const_iterator p) const
{ return p->second; }
int intfield (const std::string& k, int def_val = 0) const;
std::string stringfield (const std::string& k,
const std::string& def_val = std::string ()) const;
iterator seek (const std::string& k) { return map.find (k); }
const_iterator seek (const std::string& k) const { return map.find (k); }
bool contains (const std::string& k) const
{ return (seek (k) != map.end ()); }
void clear (void)
{
map.clear ();
key_list.clear ();
}
string_vector keys (void) const;
octave_idx_type rows (void) const { return dimensions(0); }
octave_idx_type columns (void) const { return dimensions(1); }
dim_vector dims (void) const { return dimensions; }
int ndims (void) const { return dimensions.length (); }
Octave_map transpose (void) const;
Octave_map reshape (const dim_vector& new_dims) const;
void resize (const dim_vector& dv, bool fill = false);
octave_idx_type numel (void) const { return dimensions.numel (); }
Octave_map concat (const Octave_map& rb, const Array<octave_idx_type>& ra_idx);
Octave_map& maybe_delete_elements (const octave_value_list& idx);
Octave_map& assign (const octave_value_list& idx, const Octave_map& rhs);
Octave_map& assign (const octave_value_list& idx, const std::string& k,
const Cell& rhs);
Octave_map& assign (const std::string& k, const octave_value& rhs);
Octave_map& assign (const std::string& k, const Cell& rhs);
Octave_map index (const octave_value_list& idx,
bool resize_ok = false) const;
private:
// The map of names to values.
std::map<std::string, Cell> map;
// An extra list of keys, so we can keep track of the order the keys
// are added for compatibility with you know what.
std::list<std::string> key_list;
// The current size.
mutable dim_vector dimensions;
void maybe_add_to_key_list (const std::string& k)
{
if (! contains (k))
key_list.push_back (k);
}
};
#endif
/*
;;; Local Variables: ***
;;; mode: C++ ***
;;; End: ***
*/
|