laag-libczmq 4.1.0.0

data/vendor/github.com/zeromq/czmq/bindings/python_cffi/czmq_cffi/Ziflist.py

@@ -0,0 +1,103 @@
+################################################################################
+#  THIS FILE IS 100% GENERATED BY ZPROJECT; DO NOT EDIT EXCEPT EXPERIMENTALLY  #
+#  Read the zproject/README.md for information about making permanent changes. #
+################################################################################
+import utils
+from . import destructors
+libczmq_destructors = destructors.lib
+
+class Ziflist(object):
+    """
+    List of network interfaces available on system
+    """
+
+    def __init__(self):
+        """
+        Get a list of network interfaces currently defined on the system
+        """
+        p = utils.lib.ziflist_new()
+        if p == utils.ffi.NULL:
+            raise MemoryError("Could not allocate person")
+
+        # ffi.gc returns a copy of the cdata object which will have the
+        # destructor called when the Python object is GC'd:
+        # https://cffi.readthedocs.org/en/latest/using.html#ffi-interface
+        self._p = utils.ffi.gc(p, libczmq_destructors.ziflist_destroy_py)
+
+    def reload(self):
+        """
+        Reload network interfaces from system
+        """
+        utils.lib.ziflist_reload(self._p)
+
+    def size(self):
+        """
+        Return the number of network interfaces on system
+        """
+        return utils.lib.ziflist_size(self._p)
+
+    def first(self):
+        """
+        Get first network interface, return NULL if there are none
+        """
+        return utils.lib.ziflist_first(self._p)
+
+    def next(self):
+        """
+        Get next network interface, return NULL if we hit the last one
+        """
+        return utils.lib.ziflist_next(self._p)
+
+    def address(self):
+        """
+        Return the current interface IP address as a printable string
+        """
+        return utils.lib.ziflist_address(self._p)
+
+    def broadcast(self):
+        """
+        Return the current interface broadcast address as a printable string
+        """
+        return utils.lib.ziflist_broadcast(self._p)
+
+    def netmask(self):
+        """
+        Return the current interface network mask as a printable string
+        """
+        return utils.lib.ziflist_netmask(self._p)
+
+    def print_py(self):
+        """
+        Return the list of interfaces.
+        """
+        utils.lib.ziflist_print(self._p)
+
+    def new_ipv6():
+        """
+        Get a list of network interfaces currently defined on the system
+        Includes IPv6 interfaces
+        """
+        return utils.lib.ziflist_new_ipv6()
+
+    def reload_ipv6(self):
+        """
+        Reload network interfaces from system, including IPv6
+        """
+        utils.lib.ziflist_reload_ipv6(self._p)
+
+    def is_ipv6(self):
+        """
+        Return true if the current interface uses IPv6
+        """
+        return utils.lib.ziflist_is_ipv6(self._p)
+
+    def test(verbose):
+        """
+        Self test of this class.
+        """
+        utils.lib.ziflist_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/python_cffi/czmq_cffi/Zlist.py

@@ -0,0 +1,176 @@
+################################################################################
+#  THIS FILE IS 100% GENERATED BY ZPROJECT; DO NOT EDIT EXCEPT EXPERIMENTALLY  #
+#  Read the zproject/README.md for information about making permanent changes. #
+################################################################################
+import utils
+from . import destructors
+libczmq_destructors = destructors.lib
+
+class Zlist(object):
+    """
+    simple generic list container
+    """
+
+    def __init__(self):
+        """
+        Create a new list container
+        """
+        p = utils.lib.zlist_new()
+        if p == utils.ffi.NULL:
+            raise MemoryError("Could not allocate person")
+
+        # ffi.gc returns a copy of the cdata object which will have the
+        # destructor called when the Python object is GC'd:
+        # https://cffi.readthedocs.org/en/latest/using.html#ffi-interface
+        self._p = utils.ffi.gc(p, libczmq_destructors.zlist_destroy_py)
+
+    def first(self):
+        """
+        Return the item at the head of list. If the list is empty, returns NULL.
+        Leaves cursor pointing at the head item, or NULL if the list is empty.
+        """
+        return utils.lib.zlist_first(self._p)
+
+    def next(self):
+        """
+        Return the next item. If the list is empty, returns NULL. To move to
+        the start of the list call zlist_first (). Advances the cursor.
+        """
+        return utils.lib.zlist_next(self._p)
+
+    def last(self):
+        """
+        Return the item at the tail of list. If the list is empty, returns NULL.
+        Leaves cursor pointing at the tail item, or NULL if the list is empty.
+        """
+        return utils.lib.zlist_last(self._p)
+
+    def head(self):
+        """
+        Return first item in the list, or null, leaves the cursor
+        """
+        return utils.lib.zlist_head(self._p)
+
+    def tail(self):
+        """
+        Return last item in the list, or null, leaves the cursor
+        """
+        return utils.lib.zlist_tail(self._p)
+
+    def item(self):
+        """
+        Return the current item of list. If the list is empty, returns NULL.
+        Leaves cursor pointing at the current item, or NULL if the list is empty.
+        """
+        return utils.lib.zlist_item(self._p)
+
+    def append(self, item):
+        """
+        Append an item to the end of the list, return 0 if OK or -1 if this
+        failed for some reason (out of memory). Note that if a duplicator has
+        been set, this method will also duplicate the item.
+        """
+        return utils.lib.zlist_append(self._p, item._p)
+
+    def push(self, item):
+        """
+        Push an item to the start of the list, return 0 if OK or -1 if this
+        failed for some reason (out of memory). Note that if a duplicator has
+        been set, this method will also duplicate the item.
+        """
+        return utils.lib.zlist_push(self._p, item._p)
+
+    def pop(self):
+        """
+        Pop the item off the start of the list, if any
+        """
+        return utils.lib.zlist_pop(self._p)
+
+    def exists(self, item):
+        """
+        Checks if an item already is present. Uses compare method to determine if
+        items are equal. If the compare method is NULL the check will only compare
+        pointers. Returns true if item is present else false.
+        """
+        return utils.lib.zlist_exists(self._p, item._p)
+
+    def remove(self, item):
+        """
+        Remove the specified item from the list if present
+        """
+        utils.lib.zlist_remove(self._p, item._p)
+
+    def dup(self):
+        """
+        Make a copy of list. If the list has autofree set, the copied list will
+        duplicate all items, which must be strings. Otherwise, the list will hold
+        pointers back to the items in the original list. If list is null, returns
+        NULL.
+        """
+        return utils.lib.zlist_dup(self._p)
+
+    def purge(self):
+        """
+        Purge all items from list
+        """
+        utils.lib.zlist_purge(self._p)
+
+    def size(self):
+        """
+        Return number of items in the list
+        """
+        return utils.lib.zlist_size(self._p)
+
+    def sort(self, compare):
+        """
+        Sort the list. If the compare function is null, sorts the list by
+        ascending key value using a straight ASCII comparison. If you specify
+        a compare function, this decides how items are sorted. The sort is not
+        stable, so may reorder items with the same keys. The algorithm used is
+        combsort, a compromise between performance and simplicity.
+        """
+        utils.lib.zlist_sort(self._p, compare)
+
+    def autofree(self):
+        """
+        Set list for automatic item destruction; item values MUST be strings.
+        By default a list item refers to a value held elsewhere. When you set
+        this, each time you append or push a list item, zlist will take a copy
+        of the string value. Then, when you destroy the list, it will free all
+        item values automatically. If you use any other technique to allocate
+        list values, you must free them explicitly before destroying the list.
+        The usual technique is to pop list items and destroy them, until the
+        list is empty.
+        """
+        utils.lib.zlist_autofree(self._p)
+
+    def comparefn(self, fn):
+        """
+        Sets a compare function for this list. The function compares two items.
+        It returns an integer less than, equal to, or greater than zero if the
+        first item is found, respectively, to be less than, to match, or be
+        greater than the second item.
+        This function is used for sorting, removal and exists checking.
+        """
+        utils.lib.zlist_comparefn(self._p, fn)
+
+    def freefn(self, item, fn, at_tail):
+        """
+        Set a free function for the specified list item. When the item is
+        destroyed, the free function, if any, is called on that item.
+        Use this when list 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.
+        """
+        return utils.lib.zlist_freefn(self._p, item._p, fn, at_tail)
+
+    def test(verbose):
+        """
+        Self test of this class.
+        """
+        utils.lib.zlist_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/python_cffi/czmq_cffi/Zlistx.py

@@ -0,0 +1,235 @@
+################################################################################
+#  THIS FILE IS 100% GENERATED BY ZPROJECT; DO NOT EDIT EXCEPT EXPERIMENTALLY  #
+#  Read the zproject/README.md for information about making permanent changes. #
+################################################################################
+import utils
+from . import destructors
+libczmq_destructors = destructors.lib
+
+class Zlistx(object):
+    """
+    extended generic list container
+    """
+
+    def __init__(self):
+        """
+        Create a new, empty list.
+        """
+        p = utils.lib.zlistx_new()
+        if p == utils.ffi.NULL:
+            raise MemoryError("Could not allocate person")
+
+        # ffi.gc returns a copy of the cdata object which will have the
+        # destructor called when the Python object is GC'd:
+        # https://cffi.readthedocs.org/en/latest/using.html#ffi-interface
+        self._p = utils.ffi.gc(p, libczmq_destructors.zlistx_destroy_py)
+
+    def add_start(self, item):
+        """
+        Add an item to the head of the list. Calls the item duplicator, if any,
+        on the item. Resets cursor to list head. Returns an item handle on
+        success, NULL if memory was exhausted.
+        """
+        return utils.lib.zlistx_add_start(self._p, item._p)
+
+    def add_end(self, item):
+        """
+        Add an item to the tail of the list. Calls the item duplicator, if any,
+        on the item. Resets cursor to list head. Returns an item handle on
+        success, NULL if memory was exhausted.
+        """
+        return utils.lib.zlistx_add_end(self._p, item._p)
+
+    def size(self):
+        """
+        Return the number of items in the list
+        """
+        return utils.lib.zlistx_size(self._p)
+
+    def head(self):
+        """
+        Return first item in the list, or null, leaves the cursor
+        """
+        return utils.lib.zlistx_head(self._p)
+
+    def tail(self):
+        """
+        Return last item in the list, or null, leaves the cursor
+        """
+        return utils.lib.zlistx_tail(self._p)
+
+    def first(self):
+        """
+        Return the item at the head of list. If the list is empty, returns NULL.
+        Leaves cursor pointing at the head item, or NULL if the list is empty.
+        """
+        return utils.lib.zlistx_first(self._p)
+
+    def next(self):
+        """
+        Return the next item. At the end of the list (or in an empty list),
+        returns NULL. Use repeated zlistx_next () calls to work through the list
+        from zlistx_first (). First time, acts as zlistx_first().
+        """
+        return utils.lib.zlistx_next(self._p)
+
+    def prev(self):
+        """
+        Return the previous item. At the start of the list (or in an empty list),
+        returns NULL. Use repeated zlistx_prev () calls to work through the list
+        backwards from zlistx_last (). First time, acts as zlistx_last().
+        """
+        return utils.lib.zlistx_prev(self._p)
+
+    def last(self):
+        """
+        Return the item at the tail of list. If the list is empty, returns NULL.
+        Leaves cursor pointing at the tail item, or NULL if the list is empty.
+        """
+        return utils.lib.zlistx_last(self._p)
+
+    def item(self):
+        """
+        Returns the value of the item at the cursor, or NULL if the cursor is
+        not pointing to an item.
+        """
+        return utils.lib.zlistx_item(self._p)
+
+    def cursor(self):
+        """
+        Returns the handle of the item at the cursor, or NULL if the cursor is
+        not pointing to an item.
+        """
+        return utils.lib.zlistx_cursor(self._p)
+
+    def handle_item(handle):
+        """
+        Returns the item associated with the given list handle, or NULL if passed
+        in handle is NULL. Asserts that the passed in handle points to a list element.
+        """
+        return utils.lib.zlistx_handle_item(handle._p)
+
+    def find(self, item):
+        """
+        Find an item in the list, searching from the start. Uses the item
+        comparator, if any, else compares item values directly. Returns the
+        item handle found, or NULL. Sets the cursor to the found item, if any.
+        """
+        return utils.lib.zlistx_find(self._p, item._p)
+
+    def detach(self, handle):
+        """
+        Detach an item from the list, using its handle. The item is not modified,
+        and the caller is responsible for destroying it if necessary. If handle is
+        null, detaches the first item on the list. Returns item that was detached,
+        or null if none was. If cursor was at item, moves cursor to previous item,
+        so you can detach items while iterating forwards through a list.
+        """
+        return utils.lib.zlistx_detach(self._p, handle._p)
+
+    def detach_cur(self):
+        """
+        Detach item at the cursor, if any, from the list. The item is not modified,
+        and the caller is responsible for destroying it as necessary. Returns item
+        that was detached, or null if none was. Moves cursor to previous item, so
+        you can detach items while iterating forwards through a list.
+        """
+        return utils.lib.zlistx_detach_cur(self._p)
+
+    def delete(self, handle):
+        """
+        Delete an item, using its handle. Calls the item destructor is any is
+        set. If handle is null, deletes the first item on the list. Returns 0
+        if an item was deleted, -1 if not. If cursor was at item, moves cursor
+        to previous item, so you can delete items while iterating forwards
+        through a list.
+        """
+        return utils.lib.zlistx_delete(self._p, handle._p)
+
+    def move_start(self, handle):
+        """
+        Move an item to the start of the list, via its handle.
+        """
+        utils.lib.zlistx_move_start(self._p, handle._p)
+
+    def move_end(self, handle):
+        """
+        Move an item to the end of the list, via its handle.
+        """
+        utils.lib.zlistx_move_end(self._p, handle._p)
+
+    def purge(self):
+        """
+        Remove all items from the list, and destroy them if the item destructor
+        is set.
+        """
+        utils.lib.zlistx_purge(self._p)
+
+    def sort(self):
+        """
+        Sort the list. If an item comparator was set, calls that to compare
+        items, otherwise compares on item value. The sort is not stable, so may
+        reorder equal items.
+        """
+        utils.lib.zlistx_sort(self._p)
+
+    def insert(self, item, low_value):
+        """
+        Create a new node and insert it into a sorted list. Calls the item
+        duplicator, if any, on the item. If low_value is true, starts searching
+        from the start of the list, otherwise searches from the end. Use the item
+        comparator, if any, to find where to place the new node. Returns a handle
+        to the new node, or NULL if memory was exhausted. Resets the cursor to the
+        list head.
+        """
+        return utils.lib.zlistx_insert(self._p, item._p, low_value)
+
+    def reorder(self, handle, low_value):
+        """
+        Move an item, specified by handle, into position in a sorted list. Uses
+        the item comparator, if any, to determine the new location. If low_value
+        is true, starts searching from the start of the list, otherwise searches
+        from the end.
+        """
+        utils.lib.zlistx_reorder(self._p, handle._p, low_value)
+
+    def dup(self):
+        """
+        Make a copy of the list; items are duplicated if you set a duplicator
+        for the list, otherwise not. Copying a null reference returns a null
+        reference.
+        """
+        return utils.lib.zlistx_dup(self._p)
+
+    def set_destructor(self, destructor):
+        """
+        Set a user-defined deallocator for list items; by default items are not
+        freed when the list is destroyed.
+        """
+        utils.lib.zlistx_set_destructor(self._p, destructor)
+
+    def set_duplicator(self, duplicator):
+        """
+        Set a user-defined duplicator for list items; by default items are not
+        copied when the list is duplicated.
+        """
+        utils.lib.zlistx_set_duplicator(self._p, duplicator)
+
+    def set_comparator(self, comparator):
+        """
+        Set a user-defined comparator for zlistx_find and zlistx_sort; the method
+        must return -1, 0, or 1 depending on whether item1 is less than, equal to,
+        or greater than, item2.
+        """
+        utils.lib.zlistx_set_comparator(self._p, comparator)
+
+    def test(verbose):
+        """
+        Self test of this class.
+        """
+        utils.lib.zlistx_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. #
+################################################################################