I'm not sure exactly what your problem is, but I don't think it is related to the tree. On Thu, Aug 14, 2014 at 3:42 PM, Vic Beckley <vic.beckley3@xxxxxxxxx> wrote: > Brandon, > > This is only partially fixed. The problem with jumping back to the top is > fixed, but it is still much, much too sluggish and is hogging resources. > The > larger the document is, the slower it is. It didn't used to be this slow. > Try downloading the file from the link below and arrowing through the tree. > It takes a matter of seconds to move from one heading to the next. I have a > 3.4GHz quad-core processor and my CPU usage shows 25% if I have one > document > open and 50% if I have two. My fan revs up as fast as it will go. As soon > as > I kill the Java process, then things go back to normal. This shouldn't be. > > https://www.dropbox.com/s/ysll4quwpec0qyf/cl_E.epub > > > Best regards from Ohio, > > Vic > > -----Original Message----- > From: brailleblaster-bounce@xxxxxxxxxxxxx > [mailto:brailleblaster-bounce@xxxxxxxxxxxxx] On Behalf Of > brailleblaster@xxxxxxxxxxxxxx > Sent: Thursday, August 14, 2014 1:47 PM > To: brailleblaster@xxxxxxxxxxxxx > Subject: [brailleblaster] push by brandon....@xxxxxxxxx - Fixed bug that > occurs when manuevering through tree on 2014-08-14 17:46 GMT > > Revision: 5886fe999ade > Branch: default > Author: Brandon Roller<brandon.r.roller@xxxxxxxxx> > Date: Thu Aug 14 17:44:46 2014 UTC > Log: Fixed bug that occurs when manuevering through tree > http://code.google.com/p/brailleblaster/source/detail?r=5886fe999ade > > Modified: > > /src/main/org/brailleblaster/perspectives/braille/views/tree/BookTree.java > > ======================================= > --- > /src/main/org/brailleblaster/perspectives/braille/views/tree/BookTree.java > > Tue Aug 5 17:27:05 2014 UTC > +++ > /src/main/org/brailleblaster/perspectives/braille/views/tree/BookTree.java > > Thu Aug 14 17:44:46 2014 UTC > @@ -193,7 +193,7 @@ > if(range != null && range.start != -1){ > item.setData(new TreeItemData(e, range.section, > range.start)); > if(previousItem != null){ > - if(getItemData(previousItem).startRange > > range.start) > + if(getItemData(previousItem).startRange >= > range.start) > > ((TreeItemData)previousItem.getData()).endRange = > manager.getSectionSize(getItemData(previousItem).sectionIndex) - 1; > else > > ((TreeItemData)previousItem.getData()).endRange = range.start - 1; > @@ -448,6 +448,11 @@ > if(newItem != null) > return newItem; > } > + else if(items[i].getItemCount() > 0){ > + TreeItem newItem = > searchTree(items[i], section, index); > + if(newItem != null) > + return newItem; > + } > } > else if(i == items.length - 1 && index > > getStartRange(items[i]) && > items[i].getItemCount() > 0) { > return searchTree(items[i], section, > index); > > >