}
        sum -= segments[i].modCount;
      }
      return sum == 0L;
    }
    return true;
  }

  @Override
  public int size() {
    Segment<K, V, E, S>[] segments = this.segments;
    long sum = 0;
    for (int i = 0; i < segments.length; ++i) {
      sum += segments[i].count;
    }
    return Ints.saturatedCast(sum);
  }

  @Override

      }
      return super.equals(obj);
    }

    @Override
    public int hashCode() {
      /*
       * The sum of the sums of the hash codes in each subset is just the sum of
       * each input element's hash code times the number of sets that element
       * appears in. Each element appears in exactly half of the 2^n sets, so:
       */

dem?e&sab,uc?yg??f&ehc?orp??g&ba?ne?ro?tkm??hcet?jol?l&a&g?iciffo,s??im?ut??m&da?oc?se??n&gd?if?o&m?rga???o&csid?fni?i&r?u??rp??pprr?qisp?r&ab?bi?tn?ut??t&al?e&n?v??n&ed?o&c?do???of?qra?ra??ude?vog?xxx??beuq?n?smoc??fdh?i&lohtac?n&agro?ilc?osanap??sum?tic??l!.&gro?moc?oc?ten?ude?vog?yo,?l??m!.&mt?ossa??p1akcq--nx??n!.&mon?ossa??i?p??relcel?s!.&gro?moc?ten?ude?vog???t!s?w??v!.&gro?lim?moc?sndym,ten?ude?v&g:.d,,og????wp?yn??d&2urzc--nx?3&1wrpk--nx?c&4b11--nx?9jrcpf--nx???5xq55--nx?697uto--nx?75yrp...

    val afterRemoveFileContents = if (windows) "a1234" else null

    set("a", "a1234", "a1234")
    val a = cache.edit("a")!!
    a.setString(0, "a123")
    cache.maxSize = 8 // Smaller than the sum of active edits!
    cache.flush() // Force trimToSize().
    assertThat(cache.size()).isEqualTo(expectedByteCount)
    assertThat(readFileOrNull(getCleanFile("a", 0))).isEqualTo(afterRemoveFileContents)

            assertEquals(initial + append, content, "Content should include both initial and appended");
        }

        assertEquals(initial.length() + append.length(), file.length(), "File size should be sum of both contents");
    }

    @Test
    void testEmptyDirectory() throws Exception {
        // Test operations on empty directories
        long timestamp = System.currentTimeMillis();