- Timestamp:
- Feb 28, 2007, 10:31:42 PM (18 years ago)
- Branches:
- master, barnowl_perlaim, debian, release-1.10, release-1.4, release-1.5, release-1.6, release-1.7, release-1.8, release-1.9
- Children:
- 2d1feac
- Parents:
- 50622a5
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
obarray.c
r124aebc rdb90f03 3 3 #include "owl.h" 4 4 5 // Lookup a key in the obarray. If the key exists, return its index, 6 // and the interned value in *val. Otherwise, return the index it 7 // should be inserted at. 5 /* 6 * At the moment, the obarray is represented as a sorted list of 7 * strings. I judge this a reasonable tradeoff between simplicity and 8 * reasonable efficient lookup (insertion should be comparatively 9 * rare) 10 */ 11 12 // Helper method: Lookup a key in the obarray. If the key exists, 13 // return its index, and the interned value in *val. Otherwise, return 14 // the index it should be inserted at. 8 15 int owl_obarray_lookup(owl_obarray *oa, char * key, char ** val) /*noproto*/ 9 16 {
Note: See TracChangeset
for help on using the changeset viewer.