btree

Not on Stackage, so not searched. B-Tree on Unmanaged Heap

Binary trees with data at internal nodes.

Finite map from text to token organized as binary search tree.

Not on Stackage, so not searched. A backend agnostic, concurrent BTree

Type for the callback on the (unwrapped) C side.

Type for the callback on the (unwrapped) C side.

Type for the callback on the (unwrapped) C side.

The type of the dispatch function in DBusSubtreeVTable. Subtrees are flat. node, if non-Nothing, is always exactly one segment of the object path (ie: it never contains a slash). Since: 2.26

The type of the dispatch function in DBusSubtreeVTable. Subtrees are flat. node, if non-Nothing, is always exactly one segment of the object path (ie: it never contains a slash). Since: 2.26

The type of the enumerate function in DBusSubtreeVTable. This function is called when generating introspection data and also when preparing to dispatch incoming messages in the event that the DBusSubtreeFlagsDispatchToUnenumeratedNodes flag is not specified (ie: to verify that the object path is valid). Hierarchies are not supported; the items that you return should not contain the / character. The return value will be freed with strfreev. Since: 2.26

The type of the enumerate function in DBusSubtreeVTable. This function is called when generating introspection data and also when preparing to dispatch incoming messages in the event that the DBusSubtreeFlagsDispatchToUnenumeratedNodes flag is not specified (ie: to verify that the object path is valid). Hierarchies are not supported; the items that you return should not contain the / character. The return value will be freed with strfreev. Since: 2.26

The type of the introspect function in DBusSubtreeVTable. Subtrees are flat. node, if non-Nothing, is always exactly one segment of the object path (ie: it never contains a slash). This function should return Nothing to indicate that there is no object at this node. If this function returns non-Nothing, the return value is expected to be a Nothing-terminated array of pointers to DBusInterfaceInfo structures describing the interfaces implemented by node. This array will have dBusInterfaceInfoUnref called on each item before being freed with free. The difference between returning Nothing and an array containing zero items is that the standard DBus interfaces will returned to the remote introspector in the empty array case, but not in the Nothing case. Since: 2.26

The type of the introspect function in DBusSubtreeVTable. Subtrees are flat. node, if non-Nothing, is always exactly one segment of the object path (ie: it never contains a slash). This function should return Nothing to indicate that there is no object at this node. If this function returns non-Nothing, the return value is expected to be a Nothing-terminated array of pointers to DBusInterfaceInfo structures describing the interfaces implemented by node. This array will have dBusInterfaceInfoUnref called on each item before being freed with free. The difference between returning Nothing and an array containing zero items is that the standard DBus interfaces will returned to the remote introspector in the empty array case, but not in the Nothing case. Since: 2.26

A simple wrapper that ignores the closure arguments.

A simple wrapper that ignores the closure arguments.

A simple wrapper that ignores the closure arguments.

Given a pointer to a foreign C function, wrap it into a function callable from Haskell.

Given a pointer to a foreign C function, wrap it into a function callable from Haskell.

Given a pointer to a foreign C function, wrap it into a function callable from Haskell.

Wrap the callback into a GClosure.