public int size ( ) { int result = 0 ; // sum over all inner maps for ( Iterator < K1 > keys1 = maps . keySet ( ) . iterator ( ) ; keys1 . hasNext ( ) ; ) { Map2 < K2 , K3 , V > inner_map = maps . get ( keys1 . next ( ) ) ; result += inner_map . size ( ) ; } return result ; }
Returns the accumulated size of all the bottom level maps .