this.view = traversal.view(topology.createTree(size, rng).get(), VIEWER);
  }

  @Benchmark
  int traversal(int reps) {
    int tmp = 0;

    for (int i = 0; i < reps; i++) {
      for (BinaryNode node : view) {
        tmp += node.x;
      }
    }
    return tmp;
  }

fomos
foram
fora
fôramos
seja
sejamos
sejam
fosse
fôssemos
fossem
for
formos
forem
serei
será
seremos
serão
seria
seríamos
seriam
tenho
tem
temos
tém
tinha
tínhamos
tinham
tive
teve
tivemos
tiveram
tivera
tivéramos
tenha
tenhamos
tenham
tivesse
tivéssemos
tivessem
tiver
tivermos
tiverem

    }

    @Override
    int writeBodyWireFormat(final byte[] dst, final int dstIndex) {
        final int tmp = this.questionName.hexCode;
        this.questionName.hexCode = 0x00; // type has to be 0x00 for node status
        final int result = writeQuestionSectionWireFormat(dst, dstIndex);
        this.questionName.hexCode = tmp;
        return result;
    }

    @Override

        ContentCache cache = new ContentCache(data);

        assertNotNull(cache);
    }

    @Test
    public void testFileBasedCacheConstructor() throws IOException {
        tempFile = File.createTempFile("test", ".tmp", Curl.tmpDir);
        ContentCache cache = new ContentCache(tempFile);

        assertNotNull(cache);
    }

    @Test
    public void testMemoryBasedCacheGetInputStream() throws IOException {

  }

  public ImmutableSortedSet<E> headSet(E toElement, boolean inclusive) {
    checkNotNull(toElement);
    if (inclusive) {
      E tmp = higher(toElement);
      if (tmp == null) {
        return this;
      }
      toElement = tmp;
    }
    return headSet(toElement);
  }

  @Override
  public E last() {
    return sortedDelegate.last();
  }

  @Override

      int extras = numGoodQueries % size;

      for (int i = 0; i < minCopiesOfEachGoodQuery; i++) {
        queryList.addAll(elementsInSet);
      }
      List<Element> tmp = new ArrayList<>(elementsInSet);
      shuffle(tmp, random);
      queryList.addAll(tmp.subList(0, extras));
    }

    // now add bad queries
    while (queryList.size() < numQueries) {
      Element candidate = newElement();

  @Benchmark
  int copyPreSizedArrayList(int reps) {
    int size = this.size;
    int tmp = 0;
    for (int rep = 0; rep < reps; rep++) {
      List<Object> builder = Lists.newArrayListWithCapacity(size);
      for (int i = 0; i < size; i++) {
        builder.add(OBJECT);
      }
      tmp += ImmutableList.copyOf(builder).size();
    }
    return tmp;
  }

labels.crawling_info_CrawlerExecTime=Tempo di esecuzione crawler
labels.crawling_info_CrawlerStatus=Stato crawler
labels.crawling_info_WebFsCrawlExecTime=Tempo di esecuzione scansione (Web/File)
labels.crawling_info_WebFsCrawlStartTime=Ora di inizio scansione (Web/File)
labels.crawling_info_WebFsCrawlEndTime=Ora di fine scansione (Web/File)
labels.crawling_info_WebFsIndexExecTime=Tempo di esecuzione indicizzazione (Web/File)

    return sortedDelegate.lastKey();
  }

  @Nullable K higher(K k) {
    Iterator<K> iterator = keySet().tailSet(k).iterator();
    while (iterator.hasNext()) {
      K tmp = iterator.next();
      if (comparator().compare(k, tmp) < 0) {
        return tmp;
      }
    }
    return null;
  }

  @Override
  public ImmutableSortedMap<K, V> headMap(K toKey) {
    checkNotNull(toKey);

    }

    @Override
    int writeBodyWireFormat(final byte[] dst, final int dstIndex) {
        final int tmp = questionName.hexCode;
        questionName.hexCode = 0x00; // type has to be 0x00 for node status
        final int result = writeQuestionSectionWireFormat(dst, dstIndex);
        questionName.hexCode = tmp;
        return result;
    }

    @Override
    int readBodyWireFormat(final byte[] src, final int srcIndex) {