Geforce File Manager

NAME	SIZE	ACTIONS
📄 aes.h	1,080 B	[ EDIT ] \| [ DEL ]
📄 app.h	10,478 B	[ EDIT ] \| [ DEL ]
📄 assertions.h	2,907 B	[ EDIT ] \| [ DEL ]
📄 atomic.h	4,168 B	[ EDIT ] \| [ DEL ]
📄 backtrace.h	3,891 B	[ EDIT ] \| [ DEL ]
📄 base32.h	4,453 B	[ EDIT ] \| [ DEL ]
📄 base64.h	2,866 B	[ EDIT ] \| [ DEL ]
📄 bind9.h	830 B	[ EDIT ] \| [ DEL ]
📄 boolean.h	594 B	[ EDIT ] \| [ DEL ]
📄 buffer.h	26,268 B	[ EDIT ] \| [ DEL ]
📄 bufferlist.h	1,452 B	[ EDIT ] \| [ DEL ]
📄 cmocka.h	1,383 B	[ EDIT ] \| [ DEL ]
📄 commandline.h	1,713 B	[ EDIT ] \| [ DEL ]
📄 condition.h	1,478 B	[ EDIT ] \| [ DEL ]
📄 counter.h	1,926 B	[ EDIT ] \| [ DEL ]
📄 crc64.h	998 B	[ EDIT ] \| [ DEL ]
📄 deprecated.h	623 B	[ EDIT ] \| [ DEL ]
📄 dir.h	1,598 B	[ EDIT ] \| [ DEL ]
📄 endian.h	4,778 B	[ EDIT ] \| [ DEL ]
📄 entropy.h	10,373 B	[ EDIT ] \| [ DEL ]
📄 errno.h	659 B	[ EDIT ] \| [ DEL ]
📄 errno2result.h	902 B	[ EDIT ] \| [ DEL ]
📄 error.h	1,430 B	[ EDIT ] \| [ DEL ]
📄 event.h	3,053 B	[ EDIT ] \| [ DEL ]
📄 eventclass.h	1,381 B	[ EDIT ] \| [ DEL ]
📄 file.h	11,667 B	[ EDIT ] \| [ DEL ]
📄 formatcheck.h	893 B	[ EDIT ] \| [ DEL ]
📄 fsaccess.h	7,442 B	[ EDIT ] \| [ DEL ]
📄 hash.h	7,662 B	[ EDIT ] \| [ DEL ]
📄 heap.h	5,264 B	[ EDIT ] \| [ DEL ]
📄 hex.h	2,806 B	[ EDIT ] \| [ DEL ]
📄 hmacmd5.h	1,787 B	[ EDIT ] \| [ DEL ]
📄 hmacsha.h	4,511 B	[ EDIT ] \| [ DEL ]
📄 ht.h	4,396 B	[ EDIT ] \| [ DEL ]
📄 httpd.h	2,318 B	[ EDIT ] \| [ DEL ]
📄 int.h	1,088 B	[ EDIT ] \| [ DEL ]
📄 interfaceiter.h	3,120 B	[ EDIT ] \| [ DEL ]
📄 iterated_hash.h	1,046 B	[ EDIT ] \| [ DEL ]
📄 json.h	1,459 B	[ EDIT ] \| [ DEL ]
📄 keyboard.h	989 B	[ EDIT ] \| [ DEL ]
📄 lang.h	637 B	[ EDIT ] \| [ DEL ]
📄 lex.h	9,771 B	[ EDIT ] \| [ DEL ]
📄 lfsr.h	2,958 B	[ EDIT ] \| [ DEL ]
📄 lib.h	1,068 B	[ EDIT ] \| [ DEL ]
📄 likely.h	818 B	[ EDIT ] \| [ DEL ]
📄 list.h	5,751 B	[ EDIT ] \| [ DEL ]
📄 log.h	28,734 B	[ EDIT ] \| [ DEL ]
📄 magic.h	994 B	[ EDIT ] \| [ DEL ]
📄 md5.h	2,380 B	[ EDIT ] \| [ DEL ]
📄 mem.h	21,110 B	[ EDIT ] \| [ DEL ]
📄 meminfo.h	710 B	[ EDIT ] \| [ DEL ]
📄 msgcat.h	2,726 B	[ EDIT ] \| [ DEL ]
📄 msgs.h	8,422 B	[ EDIT ] \| [ DEL ]
📄 mutex.h	3,524 B	[ EDIT ] \| [ DEL ]
📄 mutexblock.h	1,375 B	[ EDIT ] \| [ DEL ]
📄 net.h	10,534 B	[ EDIT ] \| [ DEL ]
📄 netaddr.h	4,590 B	[ EDIT ] \| [ DEL ]
📄 netdb.h	863 B	[ EDIT ] \| [ DEL ]
📄 netscope.h	967 B	[ EDIT ] \| [ DEL ]
📄 offset.h	700 B	[ EDIT ] \| [ DEL ]
📄 once.h	983 B	[ EDIT ] \| [ DEL ]
📄 ondestroy.h	2,799 B	[ EDIT ] \| [ DEL ]
📄 os.h	671 B	[ EDIT ] \| [ DEL ]
📄 parseint.h	1,542 B	[ EDIT ] \| [ DEL ]
📄 platform.h	9,717 B	[ EDIT ] \| [ DEL ]
📄 pool.h	3,502 B	[ EDIT ] \| [ DEL ]
📄 portset.h	3,295 B	[ EDIT ] \| [ DEL ]
📄 print.h	2,475 B	[ EDIT ] \| [ DEL ]
📄 queue.h	5,204 B	[ EDIT ] \| [ DEL ]
📄 quota.h	2,440 B	[ EDIT ] \| [ DEL ]
📄 radix.h	6,491 B	[ EDIT ] \| [ DEL ]
📄 random.h	3,582 B	[ EDIT ] \| [ DEL ]
📄 ratelimiter.h	3,497 B	[ EDIT ] \| [ DEL ]
📄 refcount.h	8,193 B	[ EDIT ] \| [ DEL ]
📄 regex.h	767 B	[ EDIT ] \| [ DEL ]
📄 region.h	2,034 B	[ EDIT ] \| [ DEL ]
📄 resource.h	2,862 B	[ EDIT ] \| [ DEL ]
📄 result.h	4,982 B	[ EDIT ] \| [ DEL ]
📄 resultclass.h	1,599 B	[ EDIT ] \| [ DEL ]
📄 rwlock.h	3,807 B	[ EDIT ] \| [ DEL ]
📄 safe.h	1,352 B	[ EDIT ] \| [ DEL ]
📄 serial.h	1,368 B	[ EDIT ] \| [ DEL ]
📄 sha1.h	1,556 B	[ EDIT ] \| [ DEL ]
📄 sha2.h	5,733 B	[ EDIT ] \| [ DEL ]
📄 siphash.h	734 B	[ EDIT ] \| [ DEL ]
📄 sockaddr.h	6,039 B	[ EDIT ] \| [ DEL ]
📄 socket.h	36,655 B	[ EDIT ] \| [ DEL ]
📄 stat.h	806 B	[ EDIT ] \| [ DEL ]
📄 stats.h	3,709 B	[ EDIT ] \| [ DEL ]
📄 stdatomic.h	5,250 B	[ EDIT ] \| [ DEL ]
📄 stdio.h	1,787 B	[ EDIT ] \| [ DEL ]
📄 stdlib.h	704 B	[ EDIT ] \| [ DEL ]
📄 stdtime.h	1,065 B	[ EDIT ] \| [ DEL ]
📄 strerror.h	777 B	[ EDIT ] \| [ DEL ]
📄 string.h	6,019 B	[ EDIT ] \| [ DEL ]
📄 symtab.h	4,326 B	[ EDIT ] \| [ DEL ]
📄 syslog.h	844 B	[ EDIT ] \| [ DEL ]
📄 task.h	21,544 B	[ EDIT ] \| [ DEL ]
📄 taskpool.h	3,709 B	[ EDIT ] \| [ DEL ]
📄 thread.h	1,506 B	[ EDIT ] \| [ DEL ]
📄 time.h	8,876 B	[ EDIT ] \| [ DEL ]
📄 timer.h	10,795 B	[ EDIT ] \| [ DEL ]
📄 tm.h	895 B	[ EDIT ] \| [ DEL ]
📄 types.h	5,780 B	[ EDIT ] \| [ DEL ]
📄 utf8.h	928 B	[ EDIT ] \| [ DEL ]
📄 util.h	10,537 B	[ EDIT ] \| [ DEL ]
📄 version.h	689 B	[ EDIT ] \| [ DEL ]
📄 xml.h	1,094 B	[ EDIT ] \| [ DEL ]

[ CLOSE ]

EDIT: heap.h

/*
 * Copyright (C) Internet Systems Consortium, Inc. ("ISC")
 *
 * This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, you can obtain one at https://mozilla.org/MPL/2.0/.
 *
 * See the COPYRIGHT file distributed with this work for additional
 * information regarding copyright ownership.
 */

#ifndef ISC_HEAP_H
#define ISC_HEAP_H 1

/*! \file isc/heap.h */

#include <stdbool.h>

#include <isc/lang.h>
#include <isc/types.h>

ISC_LANG_BEGINDECLS

/*%
 * The comparison function returns true if the first argument has
 * higher priority than the second argument, and false otherwise.
 */
typedef bool (*isc_heapcompare_t)(void *, void *);

/*%
 * The index function allows the client of the heap to receive a callback
 * when an item's index number changes.  This allows it to maintain
 * sync with its external state, but still delete itself, since deletions
 * from the heap require the index be provided.
 */
typedef void (*isc_heapindex_t)(void *, unsigned int);

/*%
 * The heapaction function is used when iterating over the heap.
 *
 * NOTE:  The heap structure CANNOT BE MODIFIED during the call to
 * isc_heap_foreach().
 */
typedef void (*isc_heapaction_t)(void *, void *);

typedef struct isc_heap isc_heap_t;

isc_result_t
isc_heap_create(isc_mem_t *mctx, isc_heapcompare_t compare,
		isc_heapindex_t index, unsigned int size_increment,
		isc_heap_t **heapp);
/*!<
 * \brief Create a new heap.  The heap is implemented using a space-efficient
 * storage method.  When the heap elements are deleted space is not freed
 * but will be reused when new elements are inserted.
 *
 * Heap elements are indexed from 1.
 *
 * Requires:
 *\li	"mctx" is valid.
 *\li	"compare" is a function which takes two void * arguments and
 *	returns true if the first argument has a higher priority than
 *	the second, and false otherwise.
 *\li	"index" is a function which takes a void *, and an unsigned int
 *	argument.  This function will be called whenever an element's
 *	index value changes, so it may continue to delete itself from the
 *	heap.  This option may be NULL if this functionality is unneeded.
 *\li	"size_increment" is a hint about how large the heap should grow
 *	when resizing is needed.  If this is 0, a default size will be
 *	used, which is currently 1024, allowing space for an additional 1024
 *	heap elements to be inserted before adding more space.
 *\li	"heapp" is not NULL, and "*heap" is NULL.
 *
 * Returns:
 *\li	ISC_R_SUCCESS		- success
 *\li	ISC_R_NOMEMORY		- insufficient memory
 */

void
isc_heap_destroy(isc_heap_t **heapp);
/*!<
 * \brief Destroys a heap.
 *
 * Requires:
 *\li	"heapp" is not NULL and "*heap" points to a valid isc_heap_t.
 */

isc_result_t
isc_heap_insert(isc_heap_t *heap, void *elt);
/*!<
 * \brief Inserts a new element into a heap.
 *
 * Requires:
 *\li	"heapp" is not NULL and "*heap" points to a valid isc_heap_t.
 */

void
isc_heap_delete(isc_heap_t *heap, unsigned int index);
/*!<
 * \brief Deletes an element from a heap, by element index.
 *
 * Requires:
 *\li	"heapp" is not NULL and "*heap" points to a valid isc_heap_t.
 *\li	"index" is a valid element index, as provided by the "index" callback
 *	provided during heap creation.
 */

void
isc_heap_increased(isc_heap_t *heap, unsigned int index);
/*!<
 * \brief Indicates to the heap that an element's priority has increased.
 * This function MUST be called whenever an element has increased in priority.
 *
 * Requires:
 *\li	"heapp" is not NULL and "*heap" points to a valid isc_heap_t.
 *\li	"index" is a valid element index, as provided by the "index" callback
 *	provided during heap creation.
 */

void
isc_heap_decreased(isc_heap_t *heap, unsigned int index);
/*!<
 * \brief Indicates to the heap that an element's priority has decreased.
 * This function MUST be called whenever an element has decreased in priority.
 *
 * Requires:
 *\li	"heapp" is not NULL and "*heap" points to a valid isc_heap_t.
 *\li	"index" is a valid element index, as provided by the "index" callback
 *	provided during heap creation.
 */

void *
isc_heap_element(isc_heap_t *heap, unsigned int index);
/*!<
 * \brief Returns the element for a specific element index.
 *
 * Requires:
 *\li	"heapp" is not NULL and "*heap" points to a valid isc_heap_t.
 *\li	"index" is a valid element index, as provided by the "index" callback
 *	provided during heap creation.
 *
 * Returns:
 *\li	A pointer to the element for the element index.
 */

void
isc_heap_foreach(isc_heap_t *heap, isc_heapaction_t action, void *uap);
/*!<
 * \brief Iterate over the heap, calling an action for each element.  The
 * order of iteration is not sorted.
 *
 * Requires:
 *\li	"heapp" is not NULL and "*heap" points to a valid isc_heap_t.
 *\li	"action" is not NULL, and is a function which takes two arguments.
 *	The first is a void *, representing the element, and the second is
 *	"uap" as provided to isc_heap_foreach.
 *\li	"uap" is a caller-provided argument, and may be NULL.
 *
 * Note:
 *\li	The heap structure CANNOT be modified during this iteration.  The only
 *	safe function to call while iterating the heap is isc_heap_element().
 */

ISC_LANG_ENDDECLS

#endif /* ISC_HEAP_H */