linear;\n}\n\n[data-widget=\"expandable-table\"][aria-expanded=\"true\"] i.expandable-table-caret[class*=\"right\"] {\n  transform: rotate(90deg);\n}\n\n[data-widget=\"expandable-table\"][aria-expanded=\"true\"] i.expandable-table-caret[class*=\"left\"] {\n  transform: rotate(-90deg);\n}\n\n[aria-expanded=\"true\"] {\n  cursor: pointer;\n}\n\n[aria-expanded=\"true\"] i.expandable-table-caret {\n  transition: transform 0.3s linear;\n}\n\n[aria-expanded=\"true\"] [data-widget=\"expandable-table\"] i.expandable-...

\"v4.5.0\", \"v5\", $ignore-warning);\n}\n","// stylelint-disable declaration-no-important\n\n@each $color, $value in $theme-colors {\n  @include bg-variant(\".bg-#{$color}\", $value, true);\n}\n\n@if $enable-gradients {\n  @each $color, $value in $theme-colors {\n    @include bg-gradient-variant(\".bg-gradient-#{$color}\", $value, true);\n  }\n}\n\n.bg-white {\n  background-color: $white !important;\n}\n\n.bg-transparent {\n  background-color: transparent !important;\n}\n","// stylelint-disable property-disallowed-list,...

pkg syscall (linux-386), const IXANY = 2048
pkg syscall (linux-386), const IXOFF = 4096
pkg syscall (linux-386), const IXON = 1024
pkg syscall (linux-386), const ImplementsGetwd = true
pkg syscall (linux-386), const LINUX_REBOOT_CMD_CAD_OFF = 0
pkg syscall (linux-386), const LINUX_REBOOT_CMD_CAD_ON = 2309737967
pkg syscall (linux-386), const LINUX_REBOOT_CMD_HALT = 3454992675

pkg testing, type TB interface, Skipped() bool
pkg testing, type TB interface, unexported methods
pkg text/template, method (Template) Copy() *parse.Tree
pkg text/template/parse, method (*Tree) Copy() *Tree
pkg time, method (*Time) UnmarshalBinary([]uint8) error
pkg time, method (*Time) UnmarshalText([]uint8) error
pkg time, method (Time) MarshalBinary() ([]uint8, error)

    /**
     * Gets the name of the share this tree is connected to
     * @return the share we are connected to
     */
    String getConnectedShare();

    /**
     * Checks if this tree handle refers to the same tree as another
     * @param th the tree handle to compare with
     * @return whether the handles refer to the same tree
     */
    boolean isSameTree(SmbTreeHandle th);

    /**

        .isEqualTo(2);

    assertThat(PublicSuffixPatterns.TRIE.findSuffixIndex(ImmutableList.of("co", "uk")))
        .isEqualTo(0);
    assertThat(PublicSuffixPatterns.TRIE.findSuffixIndex(ImmutableList.of("google", "co", "uk")))
        .isEqualTo(1);

    assertThat(PublicSuffixPatterns.TRIE.findSuffixIndex(ImmutableList.of("blogspot", "com")))
        .isEqualTo(0);

   */
  public void testCreateFromTreeMultimap() {
    Multimap<Double, Double> tree = TreeMultimap.create(KEY_COMPARATOR, VALUE_COMPARATOR);
    tree.put(1.0, 2.0);
    tree.put(2.0, 3.0);
    tree.put(3.0, 4.0);
    tree.put(4.0, 5.0);

    TreeMultimap<Double, Double> copyFromTree = TreeMultimap.create(tree);
    assertEquals(tree, copyFromTree);
    assertThat(copyFromTree.keyComparator()).isEqualTo(Ordering.natural());

    void unwrap_and_close_interactions() {
        // Arrange
        when(tree.unwrap(SmbTreeInternal.class)).thenReturn(tree);

        // Act
        SmbTree unwrapped = tree.unwrap(SmbTreeInternal.class);
        tree.close();

        // Assert
        assertNotNull(unwrapped);
        verify(tree).unwrap(SmbTreeInternal.class);
        verify(tree).close();
    }

   */
  public void testCreateFromTreeMultimap() {
    Multimap<Double, Double> tree = TreeMultimap.create(KEY_COMPARATOR, VALUE_COMPARATOR);
    tree.put(1.0, 2.0);
    tree.put(2.0, 3.0);
    tree.put(3.0, 4.0);
    tree.put(4.0, 5.0);

    TreeMultimap<Double, Double> copyFromTree = TreeMultimap.create(tree);
    assertEquals(tree, copyFromTree);
    assertThat(copyFromTree.keyComparator()).isEqualTo(Ordering.natural());

    tree.put("tree", 3);
    assertThat(tree.keySet()).containsExactly("tree", "google").inOrder();
    assertThat(tree.get("google")).containsExactly(6, 2).inOrder();

    TreeMultimap<String, Integer> copy = TreeMultimap.create(tree);
    assertEquals(tree, copy);
    assertThat(copy.keySet()).containsExactly("google", "tree").inOrder();
    assertThat(copy.get("google")).containsExactly(2, 6).inOrder();