SkTSearch.cpp File Reference

#include "src/base/SkTSearch.h"
#include "include/private/base/SkMalloc.h"
#include <cstring>
#include <ctype.h>

Go to the source code of this file.

Functions
static const char *	index_into_base (const char *const *base, int index, size_t elemSize)
int	SkStrSearch (const char *const *base, int count, const char target[], size_t target_len, size_t elemSize)
int	SkStrSearch (const char *const *base, int count, const char target[], size_t elemSize)
int	SkStrLCSearch (const char *const *base, int count, const char target[], size_t len, size_t elemSize)
int	SkStrLCSearch (const char *const *base, int count, const char target[], size_t elemSize)

Function Documentation

index_into_base()

static const char * index_into_base ( const char *const *  base, int  index, size_t  elemSize  )

inlinestatic

Definition at line 16 of file SkTSearch.cpp.

{
    return *(const char*const*)((const char*)base + index * elemSize);
}

SkStrLCSearch() [1/2]

int SkStrLCSearch	(	const char *const *	base,
		int	count,
		const char	target[],
		size_t	elemSize
	)

Definition at line 74 of file SkTSearch.cpp.

{
    return SkStrLCSearch(base, count, target, strlen(target), elemSize);
}

SkStrLCSearch() [2/2]

int SkStrLCSearch	(	const char *const *	base,
		int	count,
		const char	target[],
		size_t	target_len,
		size_t	elemSize
	)

Like SkStrSearch, but treats target as if it were all lower-case. Assumes that base points to a table of lower-case strings.

Definition at line 64 of file SkTSearch.cpp.

{
    SkASSERT(target);
 
    SkAutoAsciiToLC tolc(target, len);
 
    return SkStrSearch(base, count, tolc.lc(), len, elemSize);
}

SkStrSearch() [1/2]

int SkStrSearch	(	const char *const *	base,
		int	count,
		const char	target[],
		size_t	elemSize
	)

Definition at line 58 of file SkTSearch.cpp.

{
    return SkStrSearch(base, count, target, strlen(target), elemSize);
}

SkStrSearch() [2/2]

int SkStrSearch	(	const char *const *	base,
		int	count,
		const char	target[],
		size_t	target_len,
		size_t	elemSize
	)

Definition at line 22 of file SkTSearch.cpp.

{
    if (count <= 0)
        return ~0;
 
    SkASSERT(base != nullptr);
 
    int lo = 0;
    int hi = count - 1;
 
    while (lo < hi)
    {
        int mid = (hi + lo) >> 1;
        const char* elem = index_into_base(base, mid, elemSize);
 
        int cmp = strncmp(elem, target, target_len);
        if (cmp < 0)
            lo = mid + 1;
        else if (cmp > 0 || strlen(elem) > target_len)
            hi = mid;
        else
            return mid;
    }
 
    const char* elem = index_into_base(base, hi, elemSize);
    int cmp = strncmp(elem, target, target_len);
    if (cmp || strlen(elem) > target_len)
    {
        if (cmp < 0)
            hi += 1;
        hi = ~hi;
    }
    return hi;
}