27,
      28,
      27,
      27,
      27,
      27,
      27,
      26,
    )

  private val root = Node()

  init {
    for (i in CODE_BIT_COUNTS.indices) {
      addCode(i, CODES[i], CODE_BIT_COUNTS[i].toInt())
    }
  }

  @Throws(IOException::class)
  fun encode(
    source: ByteString,
    sink: BufferedSink,
  ) {
    var accumulator = 0L

  StandardMutableNetwork(NetworkBuilder<? super N, ? super E> builder) {
    super(builder);
  }

  @Override
  @CanIgnoreReturnValue
  public boolean addNode(N node) {
    checkNotNull(node, "node");

    if (containsNode(node)) {
      return false;
    }

    addNodeInternal(node);
    return true;
  }

  /**

      }
    };
  }

  private static ImmutableGraph<Character> createSingleRootGraph() {
    MutableGraph<Character> graph = GraphBuilder.directed().build();
    graph.addNode('a');
    return ImmutableGraph.copyOf(graph);
  }

  private static void assertEqualCharNodes(Iterable<Character> result, String expectedCharacters) {
    assertThat(result)

HSPLokhttp3/internal/http2/Huffman$Node;-><init>()V
HSPLokhttp3/internal/http2/Huffman$Node;-><init>(II)V
HSPLokhttp3/internal/http2/Huffman;-><clinit>()V
HSPLokhttp3/internal/http2/Huffman;-><init>()V
HSPLokhttp3/internal/http2/Huffman;->addCode(III)V
HSPLokhttp3/internal/http2/PushObserver$Companion$PushObserverCancel;-><init>()V
HSPLokhttp3/internal/http2/PushObserver;-><clinit>()V
HSPLokhttp3/internal/http2/Settings;-><init>()V