map.h

/*
 * Copyright regify
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */
#ifndef REGIFY_UTIL_MAP_H
#define REGIFY_UTIL_MAP_H
 
typedef void* ruMap;
 
RUAPI ruMap ruMapNew(ruType keyType, ruType valueType);
 
RUAPI ruMap ruMapFree(ruMap rm);
 
RUAPI int32_t ruMapPutData(ruMap rm, ptr key, ptr val, ptr* exisitingVal);
 
#define ruMapPut(map, key, val) ruMapPutData(map, (ptr)(key), (ptr)(val), NULL)
 
#define ruMapTryPut(map, key, val, existing) ruMapPutData(map, (ptr)(key), (ptr)(val), (ptr*)(existing))
 
RUAPI int32_t ruMapRemoveData(ruMap rm, trans_ptr key, ptr* val);
 
#define ruMapRemove(rm, key, val) ruMapRemoveData(rm, (trans_ptr)(key), (ptr*)(val))
 
RUAPI int32_t ruMapRemoveAll(ruMap rm);
 
RUAPI int32_t ruMapGetValue(ruMap rm, trans_ptr key, ptr* val);
 
#define ruMapGet(rm, key, val) ruMapGetValue(rm, (trans_ptr)(key), (ptr*)(val))
 
RUAPI bool ruMapHasKey(ruMap rm, trans_ptr key, int32_t *code);
 
#define ruMapHas(rm, key, code) ruMapHasKey(rm, (trans_ptr)(key), code)
 
RUAPI int32_t ruMapFirstSet(ruMap rm, ptr* key, ptr* value);
 
#define ruMapFirst(rm, key, value) ruMapFirstSet(rm, (ptr*)(key), (ptr*)(value))
 
RUAPI int32_t ruMapNextSet(ruMap rm, ptr* key, ptr* value);
 
#define ruMapNext(rm, key, value) ruMapNextSet(rm, (ptr*)(key), (ptr*)(value))
 
RUAPI int32_t ruMapKeyList(ruMap rm, ruList* keys);
 
RUAPI uint32_t ruMapSize(ruMap rm, int32_t *code);
typedef void* ruSet;
 
RUAPI ruSet ruSetNew(ruType keyType);
 
RUAPI ruSet ruSetFree(ruSet rs);
 
RUAPI int32_t ruSetPutItem(ruSet rs, ptr item);
 
#define ruSetPut(rs, item) ruSetPutItem(rs, (ptr)(item))
 
RUAPI int32_t ruSetRemoveItem(ruMap rs, ptr item);
 
#define ruSetRemove(rs, item) ruSetRemoveItem(rs, (ptr)(item))
 
RUAPI bool ruSetHasItem(ruSet rs, trans_ptr item, int32_t *code);
 
#define ruSetHas(rs, item, code) ruSetHasItem(rs, (trans_ptr)(item), code)
 
RUAPI int32_t ruSetFirstSet(ruSet rs, ptr* item);
 
#define ruSetFirst(rs, item) ruSetFirstSet(rs, (ptr*)(item))
 
RUAPI int32_t ruSetNextSet(ruSet rs, ptr* item);
 
#define ruSetNext(rs, item) ruSetNextSet(rs, (ptr*)(item))
 
RUAPI int32_t ruSetItemList(ruSet rs, ruList* items);
 
RUAPI int32_t ruSetRemoveAll(ruSet rs);
 
RUAPI uint32_t ruSetSize(ruSet rs, int32_t *code);
#ifdef __cplusplus
}
#endif /* __cplusplus */
#endif //REGIFY_UTIL_MAP_H