/usr/include/d/gtkd-3/gst/base/QueueArray.d is in libgstreamerd-3-dev 3.7.5-2build1.
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 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 | /*
* This file is part of gtkD.
*
* gtkD 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 3
* of the License, or (at your option) any later version, with
* some exceptions, please read the COPYING file.
*
* gtkD 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 gtkD; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110, USA
*/
// generated automatically - do not change
// find conversion definition on APILookup.txt
// implement new conversion functionalities on the wrap.utils pakage
module gst.base.QueueArray;
private import glib.ConstructionException;
private import gobject.ObjectG;
private import gst.base.c.functions;
public import gst.base.c.types;
private import gtkd.Loader;
/**
* #GstQueueArray is an object that provides standard queue functionality
* based on an array instead of linked lists. This reduces the overhead
* caused by memory management by a large factor.
*/
public class QueueArray
{
/** the main Gtk struct */
protected GstQueueArray* gstQueueArray;
protected bool ownedRef;
/** Get the main Gtk struct */
public GstQueueArray* getQueueArrayStruct(bool transferOwnership = false)
{
if (transferOwnership)
ownedRef = false;
return gstQueueArray;
}
/** the main Gtk struct as a void* */
protected void* getStruct()
{
return cast(void*)gstQueueArray;
}
/**
* Sets our main struct and passes it to the parent class.
*/
public this (GstQueueArray* gstQueueArray, bool ownedRef = false)
{
this.gstQueueArray = gstQueueArray;
this.ownedRef = ownedRef;
}
~this ()
{
if ( Linker.isLoaded(LIBRARY_GSTBASE) && ownedRef )
gst_queue_array_free(gstQueueArray);
}
/**
* Drops the queue element at position @idx from queue @array.
*
* Params:
* idx = index to drop
*
* Returns: the dropped element
*
* Since: 1.2
*/
public void* dropElement(uint idx)
{
return gst_queue_array_drop_element(gstQueueArray, idx);
}
/**
* Drops the queue element at position @idx from queue @array and copies the
* data of the element or structure that was removed into @p_struct if
* @p_struct is set (not NULL).
*
* Params:
* idx = index to drop
* pStruct = address into which to store the data of the dropped structure, or NULL
*
* Returns: TRUE on success, or FALSE on error
*
* Since: 1.6
*/
public bool dropStruct(uint idx, void* pStruct)
{
return gst_queue_array_drop_struct(gstQueueArray, idx, pStruct) != 0;
}
/**
* Finds an element in the queue @array, either by comparing every element
* with @func or by looking up @data if no compare function @func is provided,
* and returning the index of the found element.
*
* Note that the index is not 0-based, but an internal index number with a
* random offset. The index can be used in connection with
* gst_queue_array_drop_element(). FIXME: return index 0-based and make
* gst_queue_array_drop_element() take a 0-based index.
*
* Params:
* func = comparison function, or %NULL to find @data by value
* data = data for comparison function
*
* Returns: Index of the found element or -1 if nothing was found.
*
* Since: 1.2
*/
public uint find(GCompareFunc func, void* data)
{
return gst_queue_array_find(gstQueueArray, func, data);
}
/**
* Frees queue @array and all memory associated to it.
*
* Since: 1.2
*/
public void free()
{
gst_queue_array_free(gstQueueArray);
ownedRef = false;
}
/**
* Returns the length of the queue @array
*
* Returns: the length of the queue @array.
*
* Since: 1.2
*/
public uint getLength()
{
return gst_queue_array_get_length(gstQueueArray);
}
/**
* Checks if the queue @array is empty.
*
* Returns: %TRUE if the queue @array is empty
*
* Since: 1.2
*/
public bool isEmpty()
{
return gst_queue_array_is_empty(gstQueueArray) != 0;
}
/**
* Returns the head of the queue @array and does not
* remove it from the queue.
*
* Returns: The head of the queue
*
* Since: 1.2
*/
public void* peekHead()
{
return gst_queue_array_peek_head(gstQueueArray);
}
/**
* Returns the head of the queue @array without removing it from the queue.
*
* Returns: pointer to element or struct, or NULL if @array was empty. The
* data pointed to by the returned pointer stays valid only as long as
* the queue array is not modified further!
*
* Since: 1.6
*/
public void* peekHeadStruct()
{
return gst_queue_array_peek_head_struct(gstQueueArray);
}
/**
* Returns and head of the queue @array and removes
* it from the queue.
*
* Returns: The head of the queue
*
* Since: 1.2
*/
public void* popHead()
{
return gst_queue_array_pop_head(gstQueueArray);
}
/**
* Returns the head of the queue @array and removes it from the queue.
*
* Returns: pointer to element or struct, or NULL if @array was empty. The
* data pointed to by the returned pointer stays valid only as long as
* the queue array is not modified further!
*
* Since: 1.6
*/
public void* popHeadStruct()
{
return gst_queue_array_pop_head_struct(gstQueueArray);
}
/**
* Pushes @data to the tail of the queue @array.
*
* Params:
* data = object to push
*
* Since: 1.2
*/
public void pushTail(void* data)
{
gst_queue_array_push_tail(gstQueueArray, data);
}
/** */
public void pushTailStruct(void* pStruct)
{
gst_queue_array_push_tail_struct(gstQueueArray, pStruct);
}
/**
* Allocates a new #GstQueueArray object with an initial
* queue size of @initial_size.
*
* Params:
* initialSize = Initial size of the new queue
*
* Returns: a new #GstQueueArray object
*
* Since: 1.2
*
* Throws: ConstructionException GTK+ fails to create the object.
*/
public this(uint initialSize)
{
auto p = gst_queue_array_new(initialSize);
if(p is null)
{
throw new ConstructionException("null returned by new");
}
this(cast(GstQueueArray*) p);
}
/**
* Allocates a new #GstQueueArray object for elements (e.g. structures)
* of size @struct_size, with an initial queue size of @initial_size.
*
* Params:
* structSize = Size of each element (e.g. structure) in the array
* initialSize = Initial size of the new queue
*
* Returns: a new #GstQueueArray object
*
* Since: 1.6
*
* Throws: ConstructionException GTK+ fails to create the object.
*/
public this(size_t structSize, uint initialSize)
{
auto p = gst_queue_array_new_for_struct(structSize, initialSize);
if(p is null)
{
throw new ConstructionException("null returned by new_for_struct");
}
this(cast(GstQueueArray*) p);
}
}
|