zos.putNextEntry(entry);
                        final long len = Files.copy(filePath, zos);
                        if (logger.isDebugEnabled()) {
                            logger.debug("Log file: name={}, size={}", filePath.getFileName(), len);
                        }
                    } catch (final IOException e) {
                        logger.warn("Failed to access {}", filePath, e);
                    }

                public Collection<Phase> phases() {
                    List<String> names = lifecycle.getPhases();
                    List<Phase> phases = new ArrayList<>();
                    for (int i = 0; i < names.size(); i++) {
                        String name = names.get(i);
                        String prev = i > 0 ? names.get(i - 1) : null;
                        phases.add(new Phase() {
                            @Override

 * dataset contains no finite values).
 *
 * <h3>Performance</h3>
 *
 * <p>The average time complexity of the computation is O(N) in the size of the dataset. There is a
 * worst case time complexity of O(N^2). You are extremely unlikely to hit this quadratic case on
 * randomly ordered data (the probability decreases faster than exponentially in N), but if you are

        ServerData server2 = new ServerData();
        server2.oemDomainName = "SERVER2";

        serverList.add(server1);
        serverList.add(server2);

        // Then
        assertEquals(2, serverList.size());
        assertEquals("SERVER1", serverList.get(0).oemDomainName);
        assertEquals("SERVER2", serverList.get(1).oemDomainName);
    }

    /**
     * Test field types match expected types
     */

        }
    }

    @Override
    protected void decodeWitnessParameters(NdrBuffer buf) throws NdrException {
        // Decode output parameters for WitnessAsyncNotify

        // Response buffer size
        int responseLength = buf.dec_ndr_long();

        if (responseLength > 0) {
            // Decode notification array
            int notificationCount = buf.dec_ndr_long();

    // they may be reordered). We only do this for one index rather than for all indexes, as it is
    // quite expensive (quadratic in the size of PSEUDORANDOM_DATASET).
    double[] dataset = Doubles.toArray(PSEUDORANDOM_DATASET);
    @SuppressWarnings("unused")
    double actual = percentiles().index(33).computeInPlace(dataset);

          @SuppressWarnings("unchecked")
          V value = (V) v;
          builder.add(mapEntry(key, value));
        }
      }
      checkArgument(keySet.size() == elements.length, "Duplicate keys");
      return multimapGenerator.create(builder.toArray()).asMap();
    }

    @SuppressWarnings("unchecked")
    @Override

    // they may be reordered). We only do this for one index rather than for all indexes, as it is
    // quite expensive (quadratic in the size of PSEUDORANDOM_DATASET).
    double[] dataset = Doubles.toArray(PSEUDORANDOM_DATASET);
    @SuppressWarnings("unused")
    double actual = percentiles().index(33).computeInPlace(dataset);

   * per second has a stable interval of 200ms.
   */
  double stableIntervalMicros;

  /**
   * The time when the next request (no matter its size) will be granted. After granting a request,
   * this is pushed further in the future. Large requests push this further than small requests.
   */
  private long nextFreeTicketMicros = 0L; // could be either in the past or future

                    });
                })) {

            lmhosts.populate(new StringReader(content), mockContext);

            // Verify include was attempted
            assertTrue(mockedConstruction.constructed().size() > 0);

            // Access the internal table to verify main entry was added
            Field tableField = Lmhosts.class.getDeclaredField("table");
            tableField.setAccessible(true);