c_hash_table.cpp File Reference

#include <unordered_map>
#include <iostream>
#include <vector>

Go to the source code of this file.

Macros
#define	_FCALL

Functions
void	c_new_hash_ (int *map_id, int *count)
void	c_delete_hash_ (int *map)
void	c_hash_find_ (int *map_id, int *key, int *val)
void	c_hash_insert_ (int *map_id, int *key, int *val)
void	c_hash_replace_ (int *map_id, int *key, int *val)
void _FCALL	C_NEW_HASH (int *map, int *count)
void	c_new_hash__ (int *map, int *count)
void	c_new_hash (int *map, int *count)
void _FCALL	C_DELETE_HASH (int *map)
void	c_delete_hash__ (int *map)
void	c_delete_hash (int *map)
void _FCALL	C_HASH_FIND (int *map, int *key, int *val)
void	c_hash_find__ (int *map, int *key, int *val)
void	c_hash_find (int *map, int *key, int *val)
void _FCALL	C_HASH_INSERT (int *map, int *key, int *val)
void	c_hash_insert__ (int *map, int *key, int *val)
void	c_hash_insert (int *map, int *key, int *val)
void _FCALL	C_HASH_REPLACE (int *map, int *key, int *val)
void	c_hash_replace__ (int *map, int *key, int *val)
void	c_hash_replace (int *map, int *key, int *val)

Variables
std::vector< std::unordered_map< int, int > >	umaps

Macro Definition Documentation

_FCALL

#define _FCALL

Definition at line 27 of file c_hash_table.cpp.

Function Documentation

C_DELETE_HASH()

void _FCALL C_DELETE_HASH

(

int *

map

)

Definition at line 108 of file c_hash_table.cpp.

    {
       c_delete_hash_(map);
    }

c_delete_hash()

void c_delete_hash

(

int *

map

)

Definition at line 116 of file c_hash_table.cpp.

    {
       c_delete_hash_(map);
    }

c_delete_hash_()

void c_delete_hash_

(

int *

map

)

Definition at line 40 of file c_hash_table.cpp.

    {
     if(*map >= umaps.size() || *map < 0)
     {
 
     } else
     {
       umaps[*map].clear(); 
     } 
    }

c_delete_hash__()

void c_delete_hash__

(

int *

map

)

Definition at line 112 of file c_hash_table.cpp.

    {
       c_delete_hash_(map);
    }

C_HASH_FIND()

void _FCALL C_HASH_FIND	(	int *	map,
		int *	key,
		int *	val )

Definition at line 121 of file c_hash_table.cpp.

    {
        c_hash_find_(map, key, val);
    }

c_hash_find()

void c_hash_find	(	int *	map,
		int *	key,
		int *	val )

Definition at line 129 of file c_hash_table.cpp.

    {
        c_hash_find_(map, key, val);
    }

c_hash_find_()

void c_hash_find_	(	int *	map_id,
		int *	key,
		int *	val )

Definition at line 52 of file c_hash_table.cpp.

    {
      if(*map_id >= 0 && *map_id < umaps.size())
      {
        int s = umaps[*map_id].size();
        int keyloc = *key;
        std::unordered_map<int,int>::const_iterator got = umaps[*map_id].find(keyloc);
        if( got == umaps[*map_id].end() )
        {  
          // not found, val is not changed
        } else
        {
          (*val) = got->second;
        }
      }
    }

c_hash_find__()

void c_hash_find__	(	int *	map,
		int *	key,
		int *	val )

Definition at line 125 of file c_hash_table.cpp.

    {
        c_hash_find_(map, key, val);
    }

C_HASH_INSERT()

void _FCALL C_HASH_INSERT	(	int *	map,
		int *	key,
		int *	val )

Definition at line 134 of file c_hash_table.cpp.

    {
        c_hash_insert_(map,  key,  val);
    }

c_hash_insert()

void c_hash_insert	(	int *	map,
		int *	key,
		int *	val )

Definition at line 142 of file c_hash_table.cpp.

    {
        c_hash_insert_(map,  key,  val);
    }

c_hash_insert_()

void c_hash_insert_	(	int *	map_id,
		int *	key,
		int *	val )

Definition at line 68 of file c_hash_table.cpp.

    {
      int ival = *val;
      int imap_id = *map_id;
      int ikey = *key;
      if(*map_id >= 0 && *map_id < umaps.size())
      {
        std::unordered_map<int,int>::const_iterator got = umaps[imap_id].find(ikey);
        if( got == umaps[imap_id].end() )
        {  
          umaps[imap_id][ikey] = ival;                  
        } else
        {
       
        }
      }
    }

c_hash_insert__()

void c_hash_insert__	(	int *	map,
		int *	key,
		int *	val )

Definition at line 138 of file c_hash_table.cpp.

    {
        c_hash_insert_(map,  key,  val);
    }

C_HASH_REPLACE()

void _FCALL C_HASH_REPLACE	(	int *	map,
		int *	key,
		int *	val )

Definition at line 147 of file c_hash_table.cpp.

    {
        c_hash_replace_(map,  key,  val);
    }

c_hash_replace()

void c_hash_replace	(	int *	map,
		int *	key,
		int *	val )

Definition at line 155 of file c_hash_table.cpp.

    {
        c_hash_replace_(map,  key,  val);
    }

c_hash_replace_()

void c_hash_replace_	(	int *	map_id,
		int *	key,
		int *	val )

Definition at line 85 of file c_hash_table.cpp.

    {
      if(*map_id >= 0 && *map_id < umaps.size())
      {
        std::unordered_map<int,int>::const_iterator got = umaps[*map_id].find(*key);
        umaps[*map_id][*key] = *val;                  
      }
    }

c_hash_replace__()

void c_hash_replace__	(	int *	map,
		int *	key,
		int *	val )

Definition at line 151 of file c_hash_table.cpp.

    {
        c_hash_replace_(map,  key,  val);
    }

C_NEW_HASH()

void _FCALL C_NEW_HASH	(	int *	map,
		int *	count )

Definition at line 95 of file c_hash_table.cpp.

    {
       c_new_hash_(map,count);
    }

c_new_hash()

void c_new_hash	(	int *	map,
		int *	count )

Definition at line 103 of file c_hash_table.cpp.

    {
       c_new_hash_(map,count);
    }

c_new_hash_()

void c_new_hash_	(	int *	map_id,
		int *	count )

Definition at line 34 of file c_hash_table.cpp.

    {
       umaps.push_back(std::unordered_map<int,int>());
// c++11 add reserve of size count here
      (*map_id) = umaps.size()-1;
    }

c_new_hash__()

void c_new_hash__	(	int *	map,
		int *	count )

Definition at line 99 of file c_hash_table.cpp.

    {
       c_new_hash_(map,count);
    }

Variable Documentation

umaps

std::vector<std::unordered_map<int,int> > umaps

Definition at line 31 of file c_hash_table.cpp.