}
  protected void removeOverlappingTime(List lst){    //Naive algorothm -- simply walk the list and delete any blocks that    //start before the previous one ended... should end up with longest    //time blocks.    if(lst.size()==0)      return;    long lastEndDate = ((TransitData)lst.get(0)).getEndDate();    Iterator i=lst.iterator();    i.next();    while(i.hasNext()){      TransitData td=(TransitData)i.next();      if(td.getStartDate() < lastEndDate)	i.remove();      else	lastEndDate=td.getEndDate();    }  }