|
CS318 - Pintos
Pintos source browser for JHU CS318 course
|
Go to the documentation of this file.
7 int atoi (
const char *);
8 void qsort (
void *array,
size_t cnt,
size_t size,
9 int (*compare) (
const void *,
const void *));
10 void *
bsearch (
const void *key,
const void *array,
size_t cnt,
11 size_t size,
int (*compare) (
const void *,
const void *));
14 void sort (
void *array,
size_t cnt,
size_t size,
15 int (*compare) (
const void *,
const void *,
void *aux),
17 void *
binary_search (
const void *key,
const void *array,
size_t cnt,
19 int (*compare) (
const void *,
const void *,
void *aux),
void sort(void *array, size_t cnt, size_t size, int(*compare)(const void *, const void *, void *aux), void *aux)
Nonstandard functions.
void qsort(void *array, size_t cnt, size_t size, int(*compare)(const void *, const void *))
Sorts ARRAY, which contains CNT elements of SIZE bytes each, using COMPARE.
void * binary_search(const void *key, const void *array, size_t cnt, size_t size, int(*compare)(const void *, const void *, void *aux), void *aux)
lib/stdlib.h
int atoi(const char *)
Standard functions.
void * bsearch(const void *key, const void *array, size_t cnt, size_t size, int(*compare)(const void *, const void *))
Searches ARRAY, which contains CNT elements of SIZE bytes each, for the given KEY.
