large scale symbol renaming in C codecolm-barracuda-v3

using _ conventions for C, camelCase of C++

1 files changed, 32 insertions, 32 deletions

diff --git a/src/map.h b/src/map.h
index b3a23671..737a4de7 100644
--- a/src/map.h
+++ b/src/map.h
@@ -30,45 +30,45 @@ extern "C" {
 #include <colm/struct.h>
 #include "internal.h"
 
-void mapListAbandon( map_t *map );
+void map_list_abandon( map_t *map );
 
-void mapListAddBefore( map_t *map, map_el_t *next_el, map_el_t *new_el );
-void mapListAddAfter( map_t *map, map_el_t *prev_el, map_el_t *new_el );
-map_el_t *mapListDetach( map_t *map, map_el_t *el );
-void mapAttachRebal( map_t *map, map_el_t *element, map_el_t *parentEl, map_el_t *lastLess );
-void mapDeleteChildrenOf( map_t *map, map_el_t *element );
-void mapEmpty( map_t *map );
-map_el_t *mapRebalance( map_t *map, map_el_t *n );
-void mapRecalcHeights( map_t *map, map_el_t *element );
+void map_list_add_before( map_t *map, map_el_t *next_el, map_el_t *new_el );
+void map_list_add_after( map_t *map, map_el_t *prev_el, map_el_t *new_el );
+map_el_t *map_list_detach( map_t *map, map_el_t *el );
+void map_attach_rebal( map_t *map, map_el_t *element, map_el_t *parent_el, map_el_t *last_less );
+void map_delete_children_of( map_t *map, map_el_t *element );
+void map_empty( map_t *map );
+map_el_t *map_rebalance( map_t *map, map_el_t *n );
+void map_recalc_heights( map_t *map, map_el_t *element );
 map_el_t *mapFindFirstUnbalGP( map_t *map, map_el_t *element );
-map_el_t *mapFindFirstUnbalEl( map_t *map, map_el_t *element );
-void mapRemoveEl( map_t *map, map_el_t *element, map_el_t *filler );
-void mapReplaceEl( map_t *map, map_el_t *element, map_el_t *replacement );
-map_el_t *mapInsertEl( program_t *prg, map_t *map, map_el_t *element, map_el_t **lastFound );
-map_el_t *mapInsertKey( program_t *prg, map_t *map, tree_t *key, map_el_t **lastFound );
-map_el_t *mapImplFind( program_t *prg, map_t *map, tree_t *key );
-map_el_t *mapDetachByKey( program_t *prg, map_t *map, tree_t *key );
-map_el_t *mapDetach( program_t *prg, map_t *map, map_el_t *element );
-map_el_t *mapCopyBranch( program_t *prg, map_t *map, map_el_t *el,
-		kid_t *oldNextDown, kid_t **newNextDown );
+map_el_t *map_find_first_unbal_el( map_t *map, map_el_t *element );
+void map_remove_el( map_t *map, map_el_t *element, map_el_t *filler );
+void map_replace_el( map_t *map, map_el_t *element, map_el_t *replacement );
+map_el_t *map_insert_el( program_t *prg, map_t *map, map_el_t *element, map_el_t **last_found );
+map_el_t *map_insert_key( program_t *prg, map_t *map, tree_t *key, map_el_t **last_found );
+map_el_t *map_impl_find( program_t *prg, map_t *map, tree_t *key );
+map_el_t *map_detach_by_key( program_t *prg, map_t *map, tree_t *key );
+map_el_t *map_detach( program_t *prg, map_t *map, map_el_t *element );
+map_el_t *map_copy_branch( program_t *prg, map_t *map, map_el_t *el,
+		kid_t *old_next_down, kid_t **new_next_down );
 
-struct tree_pair mapRemove( program_t *prg, map_t *map, tree_t *key );
+struct tree_pair map_remove( program_t *prg, map_t *map, tree_t *key );
 
-long cmpTree( program_t *prg, const tree_t *tree1, const tree_t *tree2 );
+long cmp_tree( program_t *prg, const tree_t *tree1, const tree_t *tree2 );
 
-void mapImplRemoveEl( program_t *prg, map_t *map, map_el_t *element );
-int mapImplRemoveKey( program_t *prg, map_t *map, tree_t *key );
+void map_impl_remove_el( program_t *prg, map_t *map, map_el_t *element );
+int map_impl_remove_key( program_t *prg, map_t *map, tree_t *key );
 
-tree_t *mapFind( program_t *prg, map_t *map, tree_t *key );
-long mapLength( map_t *map );
-tree_t *mapUnstore( program_t *prg, map_t *map, tree_t *key, tree_t *existing );
-int mapInsert( program_t *prg, map_t *map, tree_t *key, tree_t *element );
-void mapUnremove( program_t *prg, map_t *map, tree_t *key, tree_t *element );
-tree_t *mapUninsert( program_t *prg, map_t *map, tree_t *key );
-tree_t *mapStore( program_t *prg, map_t *map, tree_t *key, tree_t *element );
+tree_t *map_find( program_t *prg, map_t *map, tree_t *key );
+long map_length( map_t *map );
+tree_t *map_unstore( program_t *prg, map_t *map, tree_t *key, tree_t *existing );
+int map_insert( program_t *prg, map_t *map, tree_t *key, tree_t *element );
+void map_unremove( program_t *prg, map_t *map, tree_t *key, tree_t *element );
+tree_t *map_uninsert( program_t *prg, map_t *map, tree_t *key );
+tree_t *map_store( program_t *prg, map_t *map, tree_t *key, tree_t *element );
 
-map_el_t *colm_map_insert( program_t *prg, map_t *map, map_el_t *mapEl );
-void colm_map_detach( program_t *prg, map_t *map, map_el_t *mapEl );
+map_el_t *colm_map_insert( program_t *prg, map_t *map, map_el_t *map_el );
+void colm_map_detach( program_t *prg, map_t *map, map_el_t *map_el );
 map_el_t *colm_map_find( program_t *prg, map_t *map, tree_t *key );
 
 map_el_t *colm_vmap_insert( program_t *prg, map_t *map, struct_t *key, struct_t *value );