/**
     * Flag indicating whether this handle is currently being reconnected
     */
    private volatile boolean reconnecting;

    // Not serialized - will be null after deserialization
    private transient Object file; // Reference to SmbFile (avoid circular dependencies)

    /**
     * Create new handle information
     * @param path the file path
     * @param guid the create GUID

 *
 * @author Hayward Chan
 */
@GwtCompatible
@SuppressWarnings("serial") // uses writeReplace(), not default serialization
final class SingletonImmutableList<E> extends ImmutableList<E> {

  final transient E element;

  SingletonImmutableList(E element) {
    this.element = checkNotNull(element);
  }

  @Override
  public E get(int index) {
    Preconditions.checkElementIndex(index, 1);
    return element;

 */
@SuppressWarnings("serial") // uses writeReplace, not default serialization
@GwtIncompatible
final class DescendingImmutableSortedMultiset<E> extends ImmutableSortedMultiset<E> {
  private final transient ImmutableSortedMultiset<E> forward;

  DescendingImmutableSortedMultiset(ImmutableSortedMultiset<E> forward) {
    this.forward = forward;
  }

  @Override
  public int count(@Nullable Object element) {

        valuesBuilder.add(entries.get(i).getValue());
      }
      return new ImmutableRangeMap<>(rangesBuilder.build(), valuesBuilder.build());
    }
  }

  private final transient ImmutableList<Range<K>> ranges;
  private final transient ImmutableList<V> values;

  ImmutableRangeMap(ImmutableList<Range<K>> ranges, ImmutableList<V> values) {
    this.ranges = ranges;
    this.values = values;
  }

  @Override

      ImmutableList<Range<C>> ranges, @Nullable ImmutableRangeSet<C> complement) {
    this.ranges = ranges;
    this.complement = complement;
  }

  private final transient ImmutableList<Range<C>> ranges;
  private final transient @Nullable ImmutableRangeSet<C> complement;

  @Override
  public boolean intersects(Range<C> otherRange) {
    int ceilingIndex =
        SortedLists.binarySearch(

    /** The rule ID. */
    protected String ruleId;

    /** The response processor. */
    protected ResponseProcessor responseProcessor;

    /** The crawler container. */
    @Resource
    protected transient CrawlerContainer crawlerContainer;

    /**
     * Constructs a new AbstractRule.
     */
    public AbstractRule() {
        // NOP
    }

    /**
     * Registers this rule with the {@link RuleManager}.

    final Multimap<K, V> delegate;
    @LazyInit transient @Nullable Collection<Entry<K, V>> entries;
    @LazyInit transient @Nullable Multiset<K> keys;
    @LazyInit transient @Nullable Set<K> keySet;
    @LazyInit transient @Nullable Collection<V> values;
    @LazyInit transient @Nullable Map<K, Collection<V>> map;

    UnmodifiableMultimap(Multimap<K, V> delegate) {

    final Multimap<K, V> delegate;
    @LazyInit transient @Nullable Collection<Entry<K, V>> entries;
    @LazyInit transient @Nullable Multiset<K> keys;
    @LazyInit transient @Nullable Set<K> keySet;
    @LazyInit transient @Nullable Collection<V> values;
    @LazyInit transient @Nullable Map<K, Collection<V>> map;

    UnmodifiableMultimap(Multimap<K, V> delegate) {

    extends AbstractListMultimap<K, V> {
  // Default from ArrayList
  private static final int DEFAULT_VALUES_PER_KEY = 3;

  @VisibleForTesting transient int expectedValuesPerKey;

  /**
   * Creates a new, empty {@code ArrayListMultimap} with the default initial capacities.
   *
   * <p>You may also consider the equivalent {@code

  @Override
  public abstract UnmodifiableIterator<E> iterator();

  abstract static class CachingAsList<E> extends ImmutableSet<E> {
    @LazyInit private transient ImmutableList<E> asList;

    @Override
    public ImmutableList<E> asList() {
      ImmutableList<E> result = asList;
      if (result == null) {
        return asList = createAsList();
      } else {