* according to when the first occurrence of the element was added. When the multiset contains
 * multiple instances of an element, those instances are consecutive in the iteration order. If all
 * occurrences of an element are removed, after which that element is added to the multiset, the
 * element will appear at the end of the iteration.
 *

                // Expected
            }
        }

        // Still closed
        assertEquals(SimpleCircuitBreaker.State.CLOSED, circuitBreaker.getState());

        // Success resets consecutive failures
        circuitBreaker.call(() -> "success");

        SimpleCircuitBreaker.Statistics stats = circuitBreaker.getStatistics();
        assertEquals(0, stats.consecutiveFailures);

        assertEquals(TransPeekNamedPipeResponse.STATUS_LISTENING, response.getStatus());
        // Middle bytes were read but not used
    }

    @Test
    @DisplayName("Test consecutive reads update state correctly")
    void testConsecutiveReads() {
        // First read
        byte[] buffer1 = new byte[10];
        SMBUtil.writeInt2(100, buffer1, 0);
        SMBUtil.writeInt2(0, buffer1, 2);

 */
@GwtCompatible
public class Joiner {
  /** Returns a joiner which automatically places {@code separator} between consecutive elements. */
  public static Joiner on(String separator) {
    return new Joiner(separator);
  }

  /** Returns a joiner which automatically places {@code separator} between consecutive elements. */
  public static Joiner on(char separator) {
    return new Joiner(String.valueOf(separator));
  }

   * defer that to Range, since it's ContiguousSet.create() that's used to create the sets. However,
   * that gets messy here, and we already have null tests for Range.
   */

  /*
   * These generators also rely on consecutive integer inputs (not necessarily in order, but no
   * holes).
   */

  // SetCreationTester has some tests that pass in duplicates. Dedup them.

                return true;
            }

            // Check if transport is failed
            if (transport.isFailed()) {
                return true;
            }

            // Check for consecutive failures
            String key = getConnectionKey(transport);
            AtomicInteger failures = consecutiveFailures.get(key);
            if (failures != null && failures.get() >= MAX_CONSECUTIVE_FAILURES) {

            normalized[i] = parts[i].replaceFirst("^0+(?!$)", "");
            if (normalized[i].isEmpty()) {
                normalized[i] = "0";
            }
        }

        // Find longest sequence of consecutive zeros
        int longestStart = -1;
        int longestLength = 0;
        int currentStart = -1;
        int currentLength = 0;

        for (int i = 0; i < 8; i++) {

                            currentDirective = new Directive(userAgent);
                            robotsTxt.addDirective(currentDirective);
                        }
                        // Add to current list - multiple consecutive User-agent lines
                        // form a group and subsequent rules apply to all of them
                        currentDirectiveList.add(currentDirective);
                        continue;
                    }

    }

    /**
     * Get failure count for a handle
     *
     * @param handle notification handle
     * @return number of consecutive failures
     */
    private int getFailureCount(ChangeNotificationHandle handle) {
        return failureCounts.getOrDefault(handle.getDirectoryPath(), 0);
    }

    /**

   * int)}, and are subject to all the usual caveats about modification as explained in that API.
   *
   * @param list the list to return consecutive sublists of
   * @param size the desired size of each sublist (the last may be smaller)
   * @return a list of consecutive sublists
   * @throws IllegalArgumentException if {@code partitionSize} is nonpositive
   */