/usr/include/d/gtkd-3/gst/base/DataQueue.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 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 | /*
* 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.DataQueue;
private import glib.ConstructionException;
private import gobject.ObjectG;
private import gobject.Signals;
private import gst.base.c.functions;
public import gst.base.c.types;
private import std.algorithm;
/**
* #GstDataQueue is an object that handles threadsafe queueing of objects. It
* also provides size-related functionality. This object should be used for
* any #GstElement that wishes to provide some sort of queueing functionality.
*/
public class DataQueue : ObjectG
{
/** the main Gtk struct */
protected GstDataQueue* gstDataQueue;
/** Get the main Gtk struct */
public GstDataQueue* getDataQueueStruct(bool transferOwnership = false)
{
if (transferOwnership)
ownedRef = false;
return gstDataQueue;
}
/** the main Gtk struct as a void* */
protected override void* getStruct()
{
return cast(void*)gstDataQueue;
}
protected override void setStruct(GObject* obj)
{
gstDataQueue = cast(GstDataQueue*)obj;
super.setStruct(obj);
}
/**
* Sets our main struct and passes it to the parent class.
*/
public this (GstDataQueue* gstDataQueue, bool ownedRef = false)
{
this.gstDataQueue = gstDataQueue;
super(cast(GObject*)gstDataQueue, ownedRef);
}
/** */
public static GType getType()
{
return gst_data_queue_get_type();
}
/**
* Creates a new #GstDataQueue. If @fullcallback or @emptycallback are supplied, then
* the #GstDataQueue will call the respective callback to signal full or empty condition.
* If the callbacks are NULL the #GstDataQueue will instead emit 'full' and 'empty'
* signals.
*
* Params:
* checkfull = the callback used to tell if the element considers the queue full
* or not.
* fullcallback = the callback which will be called when the queue is considered full.
* emptycallback = the callback which will be called when the queue is considered empty.
* checkdata = a #gpointer that will be passed to the @checkfull, @fullcallback,
* and @emptycallback callbacks.
*
* Returns: a new #GstDataQueue.
*
* Since: 1.2
*
* Throws: ConstructionException GTK+ fails to create the object.
*/
public this(GstDataQueueCheckFullFunction checkfull, GstDataQueueFullCallback fullcallback, GstDataQueueEmptyCallback emptycallback, void* checkdata)
{
auto p = gst_data_queue_new(checkfull, fullcallback, emptycallback, checkdata);
if(p is null)
{
throw new ConstructionException("null returned by new");
}
this(cast(GstDataQueue*) p, true);
}
/**
* Pop and unref the head-most #GstMiniObject with the given #GType.
*
* Params:
* type = The #GType of the item to drop.
*
* Returns: %TRUE if an element was removed.
*
* Since: 1.2
*/
public bool dropHead(GType type)
{
return gst_data_queue_drop_head(gstDataQueue, type) != 0;
}
/**
* Flushes all the contents of the @queue. Any call to #gst_data_queue_push and
* #gst_data_queue_pop will be released.
* MT safe.
*
* Since: 1.2
*/
public void flush()
{
gst_data_queue_flush(gstDataQueue);
}
/**
* Get the current level of the queue.
*
* Params:
* level = the location to store the result
*
* Since: 1.2
*/
public void getLevel(out GstDataQueueSize level)
{
gst_data_queue_get_level(gstDataQueue, &level);
}
/**
* Queries if there are any items in the @queue.
* MT safe.
*
* Returns: %TRUE if @queue is empty.
*
* Since: 1.2
*/
public bool isEmpty()
{
return gst_data_queue_is_empty(gstDataQueue) != 0;
}
/**
* Queries if @queue is full. This check will be done using the
* #GstDataQueueCheckFullFunction registered with @queue.
* MT safe.
*
* Returns: %TRUE if @queue is full.
*
* Since: 1.2
*/
public bool isFull()
{
return gst_data_queue_is_full(gstDataQueue) != 0;
}
/**
* Inform the queue that the limits for the fullness check have changed and that
* any blocking gst_data_queue_push() should be unblocked to recheck the limits.
*
* Since: 1.2
*/
public void limitsChanged()
{
gst_data_queue_limits_changed(gstDataQueue);
}
/**
* Retrieves the first @item available on the @queue without removing it.
* If the queue is currently empty, the call will block until at least
* one item is available, OR the @queue is set to the flushing state.
* MT safe.
*
* Params:
* item = pointer to store the returned #GstDataQueueItem.
*
* Returns: %TRUE if an @item was successfully retrieved from the @queue.
*
* Since: 1.2
*/
public bool peek(out GstDataQueueItem* item)
{
return gst_data_queue_peek(gstDataQueue, &item) != 0;
}
/**
* Retrieves the first @item available on the @queue. If the queue is currently
* empty, the call will block until at least one item is available, OR the
* @queue is set to the flushing state.
* MT safe.
*
* Params:
* item = pointer to store the returned #GstDataQueueItem.
*
* Returns: %TRUE if an @item was successfully retrieved from the @queue.
*
* Since: 1.2
*/
public bool pop(out GstDataQueueItem* item)
{
return gst_data_queue_pop(gstDataQueue, &item) != 0;
}
/**
* Pushes a #GstDataQueueItem (or a structure that begins with the same fields)
* on the @queue. If the @queue is full, the call will block until space is
* available, OR the @queue is set to flushing state.
* MT safe.
*
* Note that this function has slightly different semantics than gst_pad_push()
* and gst_pad_push_event(): this function only takes ownership of @item and
* the #GstMiniObject contained in @item if the push was successful. If %FALSE
* is returned, the caller is responsible for freeing @item and its contents.
*
* Params:
* item = a #GstDataQueueItem.
*
* Returns: %TRUE if the @item was successfully pushed on the @queue.
*
* Since: 1.2
*/
public bool push(GstDataQueueItem* item)
{
return gst_data_queue_push(gstDataQueue, item) != 0;
}
/**
* Pushes a #GstDataQueueItem (or a structure that begins with the same fields)
* on the @queue. It ignores if the @queue is full or not and forces the @item
* to be pushed anyway.
* MT safe.
*
* Note that this function has slightly different semantics than gst_pad_push()
* and gst_pad_push_event(): this function only takes ownership of @item and
* the #GstMiniObject contained in @item if the push was successful. If %FALSE
* is returned, the caller is responsible for freeing @item and its contents.
*
* Params:
* item = a #GstDataQueueItem.
*
* Returns: %TRUE if the @item was successfully pushed on the @queue.
*
* Since: 1.2
*/
public bool pushForce(GstDataQueueItem* item)
{
return gst_data_queue_push_force(gstDataQueue, item) != 0;
}
/**
* Sets the queue to flushing state if @flushing is %TRUE. If set to flushing
* state, any incoming data on the @queue will be discarded. Any call currently
* blocking on #gst_data_queue_push or #gst_data_queue_pop will return straight
* away with a return value of %FALSE. While the @queue is in flushing state,
* all calls to those two functions will return %FALSE.
*
* MT Safe.
*
* Params:
* flushing = a #gboolean stating if the queue will be flushing or not.
*
* Since: 1.2
*/
public void setFlushing(bool flushing)
{
gst_data_queue_set_flushing(gstDataQueue, flushing);
}
protected class OnEmptyDelegateWrapper
{
void delegate(DataQueue) dlg;
gulong handlerId;
this(void delegate(DataQueue) dlg)
{
this.dlg = dlg;
onEmptyListeners ~= this;
}
void remove(OnEmptyDelegateWrapper source)
{
foreach(index, wrapper; onEmptyListeners)
{
if (wrapper.handlerId == source.handlerId)
{
onEmptyListeners[index] = null;
onEmptyListeners = std.algorithm.remove(onEmptyListeners, index);
break;
}
}
}
}
OnEmptyDelegateWrapper[] onEmptyListeners;
/**
* Reports that the queue became empty (empty).
* A queue is empty if the total amount of visible items inside it (num-visible, time,
* size) is lower than the boundary values which can be set through the GObject
* properties.
*/
gulong addOnEmpty(void delegate(DataQueue) dlg, ConnectFlags connectFlags=cast(ConnectFlags)0)
{
auto wrapper = new OnEmptyDelegateWrapper(dlg);
wrapper.handlerId = Signals.connectData(
this,
"empty",
cast(GCallback)&callBackEmpty,
cast(void*)wrapper,
cast(GClosureNotify)&callBackEmptyDestroy,
connectFlags);
return wrapper.handlerId;
}
extern(C) static void callBackEmpty(GstDataQueue* dataqueueStruct, OnEmptyDelegateWrapper wrapper)
{
wrapper.dlg(wrapper.outer);
}
extern(C) static void callBackEmptyDestroy(OnEmptyDelegateWrapper wrapper, GClosure* closure)
{
wrapper.remove(wrapper);
}
protected class OnFullDelegateWrapper
{
void delegate(DataQueue) dlg;
gulong handlerId;
this(void delegate(DataQueue) dlg)
{
this.dlg = dlg;
onFullListeners ~= this;
}
void remove(OnFullDelegateWrapper source)
{
foreach(index, wrapper; onFullListeners)
{
if (wrapper.handlerId == source.handlerId)
{
onFullListeners[index] = null;
onFullListeners = std.algorithm.remove(onFullListeners, index);
break;
}
}
}
}
OnFullDelegateWrapper[] onFullListeners;
/**
* Reports that the queue became full (full).
* A queue is full if the total amount of data inside it (num-visible, time,
* size) is higher than the boundary values which can be set through the GObject
* properties.
*/
gulong addOnFull(void delegate(DataQueue) dlg, ConnectFlags connectFlags=cast(ConnectFlags)0)
{
auto wrapper = new OnFullDelegateWrapper(dlg);
wrapper.handlerId = Signals.connectData(
this,
"full",
cast(GCallback)&callBackFull,
cast(void*)wrapper,
cast(GClosureNotify)&callBackFullDestroy,
connectFlags);
return wrapper.handlerId;
}
extern(C) static void callBackFull(GstDataQueue* dataqueueStruct, OnFullDelegateWrapper wrapper)
{
wrapper.dlg(wrapper.outer);
}
extern(C) static void callBackFullDestroy(OnFullDelegateWrapper wrapper, GClosure* closure)
{
wrapper.remove(wrapper);
}
}
|