laag-libczmq 4.1.0.0

data/vendor/github.com/zeromq/czmq/bindings/qt/src/qzframe.h

@@ -0,0 +1,118 @@
+/*
+################################################################################
+#  THIS FILE IS 100% GENERATED BY ZPROJECT; DO NOT EDIT EXCEPT EXPERIMENTALLY  #
+#  Read the zproject/README.md for information about making permanent changes. #
+################################################################################
+*/
+#ifndef Q_ZFRAME_H
+#define Q_ZFRAME_H
+
+#include "qczmq.h"
+
+class QT_CZMQ_EXPORT QZframe : public QObject
+{
+    Q_OBJECT
+public:
+
+    //  Copy-construct to return the proper wrapped c types
+    QZframe (zframe_t *self, QObject *qObjParent = 0);
+
+    //  Create a new frame. If size is not null, allocates the frame data
+    //  to the specified size. If additionally, data is not null, copies
+    //  size octets from the specified data into the frame body.
+    explicit QZframe (const void *data, size_t size, QObject *qObjParent = 0);
+
+    //  Create an empty (zero-sized) frame
+    static QZframe* newEmpty (QObject *qObjParent = 0);
+
+    //  Create a frame with a specified string content.
+    static QZframe* from (const QString &string, QObject *qObjParent = 0);
+
+    //  Receive frame from socket, returns zframe_t object or NULL if the recv
+    //  was interrupted. Does a blocking recv, if you want to not block then use
+    //  zpoller or zloop.
+    static QZframe* recv (void *source, QObject *qObjParent = 0);
+
+    //  Destroy a frame
+    ~QZframe ();
+
+    //  Send a frame to a socket, destroy frame after sending.
+    //  Return -1 on error, 0 on success.
+    int send (void *dest, int flags);
+
+    //  Return number of bytes in frame data
+    size_t size ();
+
+    //  Return address of frame data
+    byte * data ();
+
+    //  Return meta data property for frame
+    //  The caller shall not modify or free the returned value, which shall be
+    //  owned by the message.
+    const QString meta (const QString &property);
+
+    //  Create a new frame that duplicates an existing frame. If frame is null,
+    //  or memory was exhausted, returns null.
+    QZframe * dup ();
+
+    //  Return frame data encoded as printable hex string, useful for 0MQ UUIDs.
+    //  Caller must free string when finished with it.
+    QString strhex ();
+
+    //  Return frame data copied into freshly allocated string
+    //  Caller must free string when finished with it.
+    QString strdup ();
+
+    //  Return TRUE if frame body is equal to string, excluding terminator
+    bool streqNoConflict (const QString &string);
+
+    //  Return frame MORE indicator (1 or 0), set when reading frame from socket
+    //  or by the zframe_set_more() method
+    int more ();
+
+    //  Set frame MORE indicator (1 or 0). Note this is NOT used when sending
+    //  frame to socket, you have to specify flag explicitly.
+    void setMore (int more);
+
+    //  Return frame routing ID, if the frame came from a ZMQ_SERVER socket.
+    //  Else returns zero.
+    quint32 routingId ();
+
+    //  Set routing ID on frame. This is used if/when the frame is sent to a
+    //  ZMQ_SERVER socket.
+    void setRoutingId (quint32 routingId);
+
+    //  Return frame group of radio-dish pattern.
+    const QString group ();
+
+    //  Set group on frame. This is used if/when the frame is sent to a
+    //  ZMQ_RADIO socket.
+    //  Return -1 on error, 0 on success.
+    int setGroup (const QString &group);
+
+    //  Return TRUE if two frames have identical size and data
+    //  If either frame is NULL, equality is always false.
+    bool eq (QZframe *other);
+
+    //  Set new contents for frame
+    void reset (const void *data, size_t size);
+
+    //  Send message to zsys log sink (may be stdout, or system facility as
+    //  configured by zsys_set_logstream). Prefix shows before frame, if not null.
+    void print (const QString &prefix);
+
+    //  Probe the supplied object, and report if it looks like a zframe_t.
+    static bool is (void *self);
+
+    //  Self test of this class.
+    static void test (bool verbose);
+
+    zframe_t *self;
+};
+#endif //  Q_ZFRAME_H
+/*
+################################################################################
+#  THIS FILE IS 100% GENERATED BY ZPROJECT; DO NOT EDIT EXCEPT EXPERIMENTALLY  #
+#  Read the zproject/README.md for information about making permanent changes. #
+################################################################################
+*/

data/vendor/github.com/zeromq/czmq/bindings/qt/src/qzhash.cpp

@@ -0,0 +1,250 @@
+/*
+################################################################################
+#  THIS FILE IS 100% GENERATED BY ZPROJECT; DO NOT EDIT EXCEPT EXPERIMENTALLY  #
+#  Read the zproject/README.md for information about making permanent changes. #
+################################################################################
+*/
+
+#include "qczmq.h"
+
+///
+//  Copy-construct to return the proper wrapped c types
+QZhash::QZhash (zhash_t *self, QObject *qObjParent) : QObject (qObjParent)
+{
+    this->self = self;
+}
+
+
+///
+//  Create a new, empty hash container
+QZhash::QZhash (QObject *qObjParent) : QObject (qObjParent)
+{
+    this->self = zhash_new ();
+}
+
+///
+//  Unpack binary frame into a new hash table. Packed data must follow format
+//  defined by zhash_pack. Hash table is set to autofree. An empty frame
+//  unpacks to an empty hash table.
+QZhash* QZhash::unpack (QZframe *frame, QObject *qObjParent)
+{
+    return new QZhash (zhash_unpack (frame->self), qObjParent);
+}
+
+///
+//  Destroy a hash container and all items in it
+QZhash::~QZhash ()
+{
+    zhash_destroy (&self);
+}
+
+///
+//  Insert item into hash table with specified key and item.
+//  If key is already present returns -1 and leaves existing item unchanged
+//  Returns 0 on success.
+int QZhash::insert (const QString &key, void *item)
+{
+    int rv = zhash_insert (self, key.toUtf8().data(), item);
+    return rv;
+}
+
+///
+//  Update item into hash table with specified key and item.
+//  If key is already present, destroys old item and inserts new one.
+//  Use free_fn method to ensure deallocator is properly called on item.
+void QZhash::update (const QString &key, void *item)
+{
+    zhash_update (self, key.toUtf8().data(), item);
+
+}
+
+///
+//  Remove an item specified by key from the hash table. If there was no such
+//  item, this function does nothing.
+void QZhash::deleteNoConflict (const QString &key)
+{
+    zhash_delete (self, key.toUtf8().data());
+
+}
+
+///
+//  Return the item at the specified key, or null
+void * QZhash::lookup (const QString &key)
+{
+    void * rv = zhash_lookup (self, key.toUtf8().data());
+    return rv;
+}
+
+///
+//  Reindexes an item from an old key to a new key. If there was no such
+//  item, does nothing. Returns 0 if successful, else -1.
+int QZhash::rename (const QString &oldKey, const QString &newKey)
+{
+    int rv = zhash_rename (self, oldKey.toUtf8().data(), newKey.toUtf8().data());
+    return rv;
+}
+
+///
+//  Set a free function for the specified hash table item. When the item is
+//  destroyed, the free function, if any, is called on that item.
+//  Use this when hash items are dynamically allocated, to ensure that
+//  you don't have memory leaks. You can pass 'free' or NULL as a free_fn.
+//  Returns the item, or NULL if there is no such item.
+void * QZhash::freefn (const QString &key, zhash_free_fn freeFn)
+{
+    void * rv = zhash_freefn (self, key.toUtf8().data(), freeFn);
+    return rv;
+}
+
+///
+//  Return the number of keys/items in the hash table
+size_t QZhash::size ()
+{
+    size_t rv = zhash_size (self);
+    return rv;
+}
+
+///
+//  Make copy of hash table; if supplied table is null, returns null.
+//  Does not copy items themselves. Rebuilds new table so may be slow on
+//  very large tables. NOTE: only works with item values that are strings
+//  since there's no other way to know how to duplicate the item value.
+QZhash * QZhash::dup ()
+{
+    QZhash *rv = new QZhash (zhash_dup (self));
+    return rv;
+}
+
+///
+//  Return keys for items in table
+QZlist * QZhash::keys ()
+{
+    QZlist *rv = new QZlist (zhash_keys (self));
+    return rv;
+}
+
+///
+//  Simple iterator; returns first item in hash table, in no given order,
+//  or NULL if the table is empty. This method is simpler to use than the
+//  foreach() method, which is deprecated. To access the key for this item
+//  use zhash_cursor(). NOTE: do NOT modify the table while iterating.
+void * QZhash::first ()
+{
+    void * rv = zhash_first (self);
+    return rv;
+}
+
+///
+//  Simple iterator; returns next item in hash table, in no given order,
+//  or NULL if the last item was already returned. Use this together with
+//  zhash_first() to process all items in a hash table. If you need the
+//  items in sorted order, use zhash_keys() and then zlist_sort(). To
+//  access the key for this item use zhash_cursor(). NOTE: do NOT modify
+//  the table while iterating.
+void * QZhash::next ()
+{
+    void * rv = zhash_next (self);
+    return rv;
+}
+
+///
+//  After a successful first/next method, returns the key for the item that
+//  was returned. This is a constant string that you may not modify or
+//  deallocate, and which lasts as long as the item in the hash. After an
+//  unsuccessful first/next, returns NULL.
+const QString QZhash::cursor ()
+{
+    const QString rv = QString (zhash_cursor (self));
+    return rv;
+}
+
+///
+//  Add a comment to hash table before saving to disk. You can add as many
+//  comment lines as you like. These comment lines are discarded when loading
+//  the file. If you use a null format, all comments are deleted.
+void QZhash::comment (const QString &param)
+{
+    zhash_comment (self, "%s", param.toUtf8().data());
+
+}
+
+///
+//  Serialize hash table to a binary frame that can be sent in a message.
+//  The packed format is compatible with the 'dictionary' type defined in
+//  http://rfc.zeromq.org/spec:35/FILEMQ, and implemented by zproto:
+//
+//     ; A list of name/value pairs
+//     dictionary      = dict-count *( dict-name dict-value )
+//     dict-count      = number-4
+//     dict-value      = longstr
+//     dict-name       = string
+//
+//     ; Strings are always length + text contents
+//     longstr         = number-4 *VCHAR
+//     string          = number-1 *VCHAR
+//
+//     ; Numbers are unsigned integers in network byte order
+//     number-1        = 1OCTET
+//     number-4        = 4OCTET
+//
+//  Comments are not included in the packed data. Item values MUST be
+//  strings.
+QZframe * QZhash::pack ()
+{
+    QZframe *rv = new QZframe (zhash_pack (self));
+    return rv;
+}
+
+///
+//  Save hash table to a text file in name=value format. Hash values must be
+//  printable strings; keys may not contain '=' character. Returns 0 if OK,
+//  else -1 if a file error occurred.
+int QZhash::save (const QString &filename)
+{
+    int rv = zhash_save (self, filename.toUtf8().data());
+    return rv;
+}
+
+///
+//  Load hash table from a text file in name=value format; hash table must
+//  already exist. Hash values must printable strings; keys may not contain
+//  '=' character. Returns 0 if OK, else -1 if a file was not readable.
+int QZhash::load (const QString &filename)
+{
+    int rv = zhash_load (self, filename.toUtf8().data());
+    return rv;
+}
+
+///
+//  When a hash table was loaded from a file by zhash_load, this method will
+//  reload the file if it has been modified since, and is "stable", i.e. not
+//  still changing. Returns 0 if OK, -1 if there was an error reloading the
+//  file.
+int QZhash::refresh ()
+{
+    int rv = zhash_refresh (self);
+    return rv;
+}
+
+///
+//  Set hash for automatic value destruction. Note that this assumes that
+//  values are NULL-terminated strings. Do not use with different types.
+void QZhash::autofree ()
+{
+    zhash_autofree (self);
+
+}
+
+///
+//  Self test of this class.
+void QZhash::test (bool verbose)
+{
+    zhash_test (verbose);
+
+}
+/*
+################################################################################
+#  THIS FILE IS 100% GENERATED BY ZPROJECT; DO NOT EDIT EXCEPT EXPERIMENTALLY  #
+#  Read the zproject/README.md for information about making permanent changes. #
+################################################################################
+*/

data/vendor/github.com/zeromq/czmq/bindings/qt/src/qzhash.h

@@ -0,0 +1,149 @@
+/*
+################################################################################
+#  THIS FILE IS 100% GENERATED BY ZPROJECT; DO NOT EDIT EXCEPT EXPERIMENTALLY  #
+#  Read the zproject/README.md for information about making permanent changes. #
+################################################################################
+*/
+#ifndef Q_ZHASH_H
+#define Q_ZHASH_H
+
+#include "qczmq.h"
+
+class QT_CZMQ_EXPORT QZhash : public QObject
+{
+    Q_OBJECT
+public:
+
+    //  Copy-construct to return the proper wrapped c types
+    QZhash (zhash_t *self, QObject *qObjParent = 0);
+
+    //  Create a new, empty hash container
+    explicit QZhash (QObject *qObjParent = 0);
+
+    //  Unpack binary frame into a new hash table. Packed data must follow format
+    //  defined by zhash_pack. Hash table is set to autofree. An empty frame
+    //  unpacks to an empty hash table.
+    static QZhash* unpack (QZframe *frame, QObject *qObjParent = 0);
+
+    //  Destroy a hash container and all items in it
+    ~QZhash ();
+
+    //  Insert item into hash table with specified key and item.
+    //  If key is already present returns -1 and leaves existing item unchanged
+    //  Returns 0 on success.
+    int insert (const QString &key, void *item);
+
+    //  Update item into hash table with specified key and item.
+    //  If key is already present, destroys old item and inserts new one.
+    //  Use free_fn method to ensure deallocator is properly called on item.
+    void update (const QString &key, void *item);
+
+    //  Remove an item specified by key from the hash table. If there was no such
+    //  item, this function does nothing.
+    void deleteNoConflict (const QString &key);
+
+    //  Return the item at the specified key, or null
+    void * lookup (const QString &key);
+
+    //  Reindexes an item from an old key to a new key. If there was no such
+    //  item, does nothing. Returns 0 if successful, else -1.
+    int rename (const QString &oldKey, const QString &newKey);
+
+    //  Set a free function for the specified hash table item. When the item is
+    //  destroyed, the free function, if any, is called on that item.
+    //  Use this when hash items are dynamically allocated, to ensure that
+    //  you don't have memory leaks. You can pass 'free' or NULL as a free_fn.
+    //  Returns the item, or NULL if there is no such item.
+    void * freefn (const QString &key, zhash_free_fn freeFn);
+
+    //  Return the number of keys/items in the hash table
+    size_t size ();
+
+    //  Make copy of hash table; if supplied table is null, returns null.
+    //  Does not copy items themselves. Rebuilds new table so may be slow on
+    //  very large tables. NOTE: only works with item values that are strings
+    //  since there's no other way to know how to duplicate the item value.
+    QZhash * dup ();
+
+    //  Return keys for items in table
+    QZlist * keys ();
+
+    //  Simple iterator; returns first item in hash table, in no given order,
+    //  or NULL if the table is empty. This method is simpler to use than the
+    //  foreach() method, which is deprecated. To access the key for this item
+    //  use zhash_cursor(). NOTE: do NOT modify the table while iterating.
+    void * first ();
+
+    //  Simple iterator; returns next item in hash table, in no given order,
+    //  or NULL if the last item was already returned. Use this together with
+    //  zhash_first() to process all items in a hash table. If you need the
+    //  items in sorted order, use zhash_keys() and then zlist_sort(). To
+    //  access the key for this item use zhash_cursor(). NOTE: do NOT modify
+    //  the table while iterating.
+    void * next ();
+
+    //  After a successful first/next method, returns the key for the item that
+    //  was returned. This is a constant string that you may not modify or
+    //  deallocate, and which lasts as long as the item in the hash. After an
+    //  unsuccessful first/next, returns NULL.
+    const QString cursor ();
+
+    //  Add a comment to hash table before saving to disk. You can add as many
+    //  comment lines as you like. These comment lines are discarded when loading
+    //  the file. If you use a null format, all comments are deleted.
+    void comment (const QString &param);
+
+    //  Serialize hash table to a binary frame that can be sent in a message.
+    //  The packed format is compatible with the 'dictionary' type defined in
+    //  http://rfc.zeromq.org/spec:35/FILEMQ, and implemented by zproto:
+    //
+    //     ; A list of name/value pairs
+    //     dictionary      = dict-count *( dict-name dict-value )
+    //     dict-count      = number-4
+    //     dict-value      = longstr
+    //     dict-name       = string
+    //
+    //     ; Strings are always length + text contents
+    //     longstr         = number-4 *VCHAR
+    //     string          = number-1 *VCHAR
+    //
+    //     ; Numbers are unsigned integers in network byte order
+    //     number-1        = 1OCTET
+    //     number-4        = 4OCTET
+    //
+    //  Comments are not included in the packed data. Item values MUST be
+    //  strings.
+    QZframe * pack ();
+
+    //  Save hash table to a text file in name=value format. Hash values must be
+    //  printable strings; keys may not contain '=' character. Returns 0 if OK,
+    //  else -1 if a file error occurred.
+    int save (const QString &filename);
+
+    //  Load hash table from a text file in name=value format; hash table must
+    //  already exist. Hash values must printable strings; keys may not contain
+    //  '=' character. Returns 0 if OK, else -1 if a file was not readable.
+    int load (const QString &filename);
+
+    //  When a hash table was loaded from a file by zhash_load, this method will
+    //  reload the file if it has been modified since, and is "stable", i.e. not
+    //  still changing. Returns 0 if OK, -1 if there was an error reloading the
+    //  file.
+    int refresh ();
+
+    //  Set hash for automatic value destruction. Note that this assumes that
+    //  values are NULL-terminated strings. Do not use with different types.
+    void autofree ();
+
+    //  Self test of this class.
+    static void test (bool verbose);
+
+    zhash_t *self;
+};
+#endif //  Q_ZHASH_H
+/*
+################################################################################
+#  THIS FILE IS 100% GENERATED BY ZPROJECT; DO NOT EDIT EXCEPT EXPERIMENTALLY  #
+#  Read the zproject/README.md for information about making permanent changes. #
+################################################################################
+*/