Gecko [ www.finalhopeacademy.com ]

Name	Size	Permission
argv.h	4.11 KB	-rw-r--r--
header.h	13.37 KB	-rw-r--r--
rpmbase64.h	1023 B	-rw-r--r--
rpmbuild.h	3.28 KB	-rw-r--r--
rpmcallback.h	1.38 KB	-rw-r--r--
rpmcli.h	12.45 KB	-rw-r--r--
rpmdb.h	6.15 KB	-rw-r--r--
rpmds.h	11.61 KB	-rw-r--r--
rpmfc.h	2.44 KB	-rw-r--r--
rpmfi.h	13.02 KB	-rw-r--r--
rpmfileutil.h	5.04 KB	-rw-r--r--
rpmio.h	2.21 KB	-rw-r--r--
rpmkeyring.h	2.59 KB	-rw-r--r--
rpmlegacy.h	7.5 KB	-rw-r--r--
rpmlib.h	5.34 KB	-rw-r--r--
rpmlog.h	8.48 KB	-rw-r--r--
rpmmacro.h	4.21 KB	-rw-r--r--
rpmpgp.h	46.34 KB	-rw-r--r--
rpmpol.h	388 B	-rw-r--r--
rpmprob.h	4.67 KB	-rw-r--r--
rpmps.h	2.29 KB	-rw-r--r--
rpmsign.h	740 B	-rw-r--r--
rpmspec.h	2.21 KB	-rw-r--r--
rpmsq.h	1.34 KB	-rw-r--r--
rpmstring.h	4.08 KB	-rw-r--r--
rpmstrpool.h	3.83 KB	-rw-r--r--
rpmsw.h	2.09 KB	-rw-r--r--
rpmtag.h	20.22 KB	-rw-r--r--
rpmtd.h	12.21 KB	-rw-r--r--
rpmte.h	6.45 KB	-rw-r--r--
rpmts.h	16.8 KB	-rw-r--r--
rpmtypes.h	2.49 KB	-rw-r--r--
rpmurl.h	1.11 KB	-rw-r--r--
rpmutil.h	4.68 KB	-rw-r--r--
rpmvf.h	3.98 KB	-rw-r--r--

Code Editor : rpmstrpool.h

#ifndef _RPMSTRPOOL_H
#define _RPMSTRPOOL_H

#include <rpm/rpmtypes.h>

#ifdef __cplusplus
extern "C" {
#endif

/** \ingroup rpmstrpool
 * Create a new, empty string pool.
 * @return		new string pool
 */
rpmstrPool rpmstrPoolCreate(void);

/** \ingroup rpmstrpool
 * Free a string pool and its contents. While other references exist,
 * this only decrements the reference count.
 * @param pool		string pool
 * @return		NULL always
 */
rpmstrPool rpmstrPoolFree(rpmstrPool pool);

/** \ingroup rpmstrpool
 * Reference a string pool
 * @param pool		string pool
 * @return		new string pool reference
 */
rpmstrPool rpmstrPoolLink(rpmstrPool pool);

/** \ingroup rpmstrpool
 * Freeze a string pool: new strings cannot be added to a frozen pool.
 * If keephash is 0, memory usage is minimized but string -> id lookups
 * are no longer possible and unfreezing is an expensive operation.
 * Id -> string lookups are always possible on a frozen pool too.
 * @param pool		string pool
 * @param keephash	should string -> id hash be kept around?
 */
void rpmstrPoolFreeze(rpmstrPool pool, int keephash);

/** \ingroup rpmstrpool
 * Unfreeze a string pool to allow new additions again.
 * If keephash was not specified on freezing, this requires rehashing
 * the entire pool contents.
 * @param pool		string pool
 */
void rpmstrPoolUnfreeze(rpmstrPool pool);

/** \ingroup rpmstrpool
 * Look up the id of a string. If create is specified the string is
 * added to the pool if it does not already exist. Creation can only
 * fail if the pool is in frozen state.
 * @param pool		string pool
 * @param s		\0-terminated string to look up
 * @param create	should an id be created if not already present?
 * @return		id of the string or 0 for not found
 */
rpmsid rpmstrPoolId(rpmstrPool pool, const char *s, int create);

/** \ingroup rpmstrpool
 * Look up the id of a string with predetermined length. The string does
 * not have to be \0-terminated. If create is specified the string is
 * added to the pool if it does not already exist. Creation can only
 * fail if the pool is in frozen state. 
 * @param pool		string pool
 * @param s		string to look up
 * @param slen		number of characters from s to consider
 * @param create	should an id be created if not already present?
 * @return		id of the string or 0 for not found
 */
rpmsid rpmstrPoolIdn(rpmstrPool pool, const char *s, size_t slen, int create);

/** \ingroup rpmstrpool
 * Look up a string by its pool id.
 * @param pool		string pool
 * @param sid		pool id of a string
 * @return		pointer to the string or NULL for invalid id
 */
const char * rpmstrPoolStr(rpmstrPool pool, rpmsid sid);

/** \ingroup rpmstrpool
 * Return length of a string by its pool id. The result is equal to
 * calling strlen() on a string retrieved through rpmstrPoolStr(), but
 * the pool might be able to optimize the calculation.
 * @param pool		string pool
 * @param sid		pool id of a string
 * @return		length of the string, 0 for invalid pool or id
 */
size_t rpmstrPoolStrlen(rpmstrPool pool, rpmsid sid);

/** \ingroup rpmstrpool
 * Compare two strings for equality by their ids. The result is equal to
 * calling rstreq() on two strings retrieved through rpmstrPoolStr() but
 * when the id's are within the same pool, this runs in constant time.
 * @param poolA		string pool of the first string
 * @param sidA		pool id of the first string
 * @param poolB		string pool of the second string
 * @param sidB		pool id of the second string
 * @return		1 if strings are equal, 0 otherwise
 */
int rpmstrPoolStreq(rpmstrPool poolA, rpmsid sidA,
                    rpmstrPool poolB, rpmsid sidB);

/** \ingroup rpmstrpool
 * Return the number of strings stored in the pool. This number is
 * also the highest legal id for the pool.
 * @param pool		string pool
 * @return		number of strings in the pool
 */
rpmsid rpmstrPoolNumStr(rpmstrPool pool);

#ifdef __cplusplus
}
#endif

#endif /* _RPMSIDPOOL_H */

${this.title}

Code Editor : rpmstrpool.h