Jump to content

  • Log In with Google      Sign In   
  • Create Account


#Actualpatishi

Posted 04 July 2013 - 01:15 PM

thx, this is exactly what i needed!     But how can i know when is the best time to start replacing entries from the table?    regardless of the replacement scheme i use, how should i technically remove old entries from the table?   should i iterate over the whole array and start deleting items?   

EDIT:  I was getting out of memory errors!  so now  my implementation includes one array in size 500009, each index contains a LinkedList (for chaining when collision occurs) 

 so right now when a linked list has over 2 items in it i just clear them from the list.   but i don't know if my approach is good or not.   

 


#8patishi

Posted 04 July 2013 - 01:15 PM

thx, this is exactly what i needed!     But how can i know when is the best time to start replacing entries from the table?    regardless of the replacement scheme i use, how should i technically remove old entries from the table?   should i iterate over the whole array and start deleting items?   

EDIT:  I am getting out of memory errors!    my implementation includes one array in size 500009, each index contains a LinkedList (for chaining when collision occurs) 

 so right now when a linked list has over 2 items in it i just clear them from the list.   but i don't know if my approach is good or not.   

 


#7patishi

Posted 04 July 2013 - 11:54 AM

thx, this is exactly what i needed!     But how can i know when is the best time to start replacing entries from the table?    regardless of the replacement scheme i use, how should i technically remove old entries from the table?   should i iterate over the whole array and start deleting items?   

EDIT:  I am getting out of memory errors!  right now i don't do any deletion of old entries


 


#6patishi

Posted 04 July 2013 - 10:05 AM

thx, this is exactly what i needed!     But how can i know when is the best time to start replacing entries from the table?    regardless of the replacement scheme i use, how should i technically remove old entries from the table?   should i iterate over the whole array and start deleting items?   

EDIT:  as a side note,  until now i used my own hashtable implementation based on array of linked Lists (each index in the array is a linked list, mainly for dealing with collisions, e.g "chaining").  but now i am trying to wrk with the java hashMap interface.      I am just entering the zobrist key together with An Entry object into the table as a key/value pair.    I think that java also uses some kind of linked list structure inside an array for their implementation.

so i am interested to know what should i suppose to do when i need to start overwrite old entries.       An explanation not related to java's hashMap will also suffice.
 


#5patishi

Posted 04 July 2013 - 09:57 AM

thx, this is exactly what i needed!     But how can i know when is the best time to start replacing entries from the table?    regardless of the replacement scheme i use, how should i technically remove old entries from the table?   should i iterate over the whole array and start deleting items?   

EDIT:  as a side note,  until now i used my own hashtable implementation based on array of linked Lists (each index in the array is a linked list, mainly for dealing with collisions, e.g "chaining").  but now i am trying to wrk with the java hashMap interface.      I am just entering the zobrist key together with An Entry object into the table as a key/value pair.    I think that java also uses some kind of linked list structure inside an array for their implementation, but this time i don't have access to the linked lists.  

so i am interested to know what should i suppose to do when i need to start overwrite old entries.       An explanation not related to java's hashMap will also suffice.
 


#4patishi

Posted 04 July 2013 - 09:56 AM

thx, this is exactly what i needed!     But how can i know when is the best time to start replacing entries from the table?    regardless of the replacement scheme i use, how should i technically remove old entries from the table?   should i iterate over the whole array and start deleting items?   

EDIT:  as a side note,  until now i used my own hashtable implementation based on array of linked Lists (each index in the array is a linked list, mainly for dealing with collisions, e.g "chaining").  but now i am trying to wrk with the java hashMap interface.      I am just entering the zobrist key together with An Entry object into the table as a key/value pair.    I think that java also uses some kind of linked lisy structure inside an array for their implementation, but this time i don't have access to the linked lists.  

so i am interested to know what should i suppose to do when i need to start overwrite old entries.       An explanation not related to java's hashMap will also suffice.
 


PARTNERS