//public BTreeMap<Word, UInt32> globalWordCount;
public IndexRoot(ushort nodeSize, SessionBase session)
{
hashCodeComparer = new HashCodeComparer<Word>();
lexicon = new Lexicon(nodeSize, hashCodeComparer, session);
lexicon.Persist(session, lexicon);
repository = new Repository(nodeSize, session);
repository.Persist(session, repository, true);
//globalWordCount = new BTreeMap<Word, uint>(null, session);
}