/usr/include/glibmm-2.4/glibmm/valuearray.h is in libglibmm-2.4-dev 2.50.0-1.
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 219 220 221 222 223 224 225 | // Generated by gmmproc 2.50.0 -- DO NOT MODIFY!
#ifndef _GLIBMM_VALUEARRAY_H
#define _GLIBMM_VALUEARRAY_H
#include <glibmmconfig.h>
#ifndef GLIBMM_DISABLE_DEPRECATED
/* Copyright (C) 2002-2009 The gtkmm Development Team
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free
* Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include <glib-object.h>
#include <glibmm/value.h>
#include <sigc++/functors/slot.h>
// This whole file is deprecated.
#ifndef DOXYGEN_SHOULD_SKIP_THIS
extern "C" { typedef struct _GValueArray GValueArray; }
#endif
namespace Glib
{
/** A container structure to maintain an array of generic values.
* The prime purpose of a ValueArray is for it to be used as an object property
* that holds an array of values. A ValueArray wraps an array of ValueBase
* elements.
*
* @newin{2,22}
*
* @deprecated Use std::vector<Glib::ValueBase*> or std::vector< Glib::Value<> >
* instead of Glib::ValueArray.
*/
class ValueArray
{
public:
#ifndef DOXYGEN_SHOULD_SKIP_THIS
using CppObjectType = ValueArray;
using BaseObjectType = GValueArray;
#endif /* DOXYGEN_SHOULD_SKIP_THIS */
/** Get the GType for this class, for use with the underlying GObject type system.
*/
static GType get_type() G_GNUC_CONST;
explicit ValueArray(GValueArray* gobject, bool make_a_copy = true);
ValueArray(const ValueArray& other);
ValueArray& operator=(const ValueArray& other);
ValueArray(ValueArray&& other) noexcept;
ValueArray& operator=(ValueArray&& other) noexcept;
~ValueArray() noexcept;
void swap(ValueArray& other) noexcept;
///Provides access to the underlying C instance.
GValueArray* gobj() { return gobject_; }
///Provides access to the underlying C instance.
const GValueArray* gobj() const { return gobject_; }
///Provides access to the underlying C instance. The caller is responsible for freeing it. Use when directly setting fields in structs.
GValueArray* gobj_copy() const;
protected:
GValueArray* gobject_;
private:
public:
/** For example,
* int on_compare(const Glib::ValueBase& v1, const Glib::ValueBase& v2);.
* The compare function should return -1 if v1 < v2, 0 if v1 == v2, and 1 if
* v1 > v2.
*/
using SlotCompare = sigc::slot<int, const Glib::ValueBase&, const Glib::ValueBase&>;
/** Default constructor. Constructs a new array with no pre-allocation.
*/
ValueArray();
/** Constructs a new array with pre-allocation.
*/
ValueArray(guint n_preallocated);
/** Return the value at @a index contained in the value array.
* @param index Index of the value of interest.
* @param value An uninitialized ValueBase in which to store the result. If
* the get is successful, @a value will be valid, otherwise it will remain
* uninitialized.
* @return whether the get was successful or not.
*/
bool get_nth(guint index, Glib::ValueBase& value);
/** Insert a copy of @a value as last element of @a value_array. If @a value is
* <tt>nullptr</tt>, an uninitialized value is appended.
*
* Deprecated: 2.32: Use Array and Glib::array_append_val() instead.
*
* @param value Value to copy into ValueArray, or <tt>nullptr</tt>.
* @return The ValueArray passed in as @a value_array.
*/
Glib::ValueArray& append(const Glib::ValueBase& value);
/** Insert a copy of @a value as first element of @a value_array. If @a value is
* <tt>nullptr</tt>, an uninitialized value is prepended.
*
*
* Deprecated: 2.32: Use Array and Glib::array_prepend_val() instead.
*
* @param value Value to copy into ValueArray, or <tt>nullptr</tt>.
* @return The ValueArray passed in as @a value_array.
*/
Glib::ValueArray& prepend(const Glib::ValueBase& value);
/** Insert a copy of @a value at specified position into @a value_array. If @a value
* is <tt>nullptr</tt>, an uninitialized value is inserted.
*
* Deprecated: 2.32: Use Array and Glib::array_insert_val() instead.
*
* @param index Insertion position, must be <= value_array->;n_values.
* @param value Value to copy into ValueArray, or <tt>nullptr</tt>.
* @return The ValueArray passed in as @a value_array.
*/
Glib::ValueArray& insert(guint index, const Glib::ValueBase& value);
/** Remove the value at position @a index from @a value_array.
*
* Deprecated: 2.32: Use Array and g_array_remove_index() instead.
*
* @param index Position of value to remove, which must be less than
* @a value_array->n_values.
* @return The ValueArray passed in as @a value_array.
*/
Glib::ValueArray& remove(guint index);
/** Sort @a value_array using @a compare_func to compare the elements according to
* the semantics of CompareFunc.
*
* The current implementation uses the same sorting algorithm as standard
* C qsort() function.
*
* Deprecated: 2.32: Use Array and g_array_sort().
*
* @param compare_func Function to compare elements.
* @return The ValueArray passed in as @a value_array.
*/
Glib::ValueArray& sort(const SlotCompare& compare_func);
};
} //namespace Glib
namespace Glib
{
/** @relates Glib::ValueArray
* @param lhs The left-hand side
* @param rhs The right-hand side
*/
inline void swap(ValueArray& lhs, ValueArray& rhs) noexcept
{ lhs.swap(rhs); }
} // namespace Glib
namespace Glib
{
/** A Glib::wrap() method for this object.
*
* @param object The C instance.
* @param take_copy False if the result should take ownership of the C instance. True if it should take a new copy or ref.
* @result A C++ instance that wraps this C instance.
*
* @relates Glib::ValueArray
*/
Glib::ValueArray wrap(GValueArray* object, bool take_copy = false);
#ifndef DOXYGEN_SHOULD_SKIP_THIS
template <>
class Value<Glib::ValueArray> : public Glib::Value_Boxed<Glib::ValueArray>
{};
#endif /* DOXYGEN_SHOULD_SKIP_THIS */
} // namespace Glib
#endif // GLIBMM_DISABLE_DEPRECATED
#endif /* _GLIBMM_VALUEARRAY_H */
|