Test whether node names are properly sorted and IDs are correctly assigned (sequentially, strictly monotonically increasing, no gaps)

{@inheritDoc}

@param countHosts if true count the number of hosts per domain

{@inheritDoc}

@return the count how often the last integer (returned by {@link nextInt()}) was seen in the input iterators

Reverse host name, eg. <code>www.example.com</code> is reversed to <code>com.example.www</code>. Can also be used to "unreverse" a reversed host name.

@param include if true map host names equal to any multi-part public suffix (the suffix contains a dot) (eg. <code>gov.uk</code> or

{@inheritDoc} @deprecated Please use {@link nextInt()} instead.

@param stripWww if true the www. prefix is stripped

@param privateDomains if true map host to domain names using also the suffixes from the <a href= "https://

Count strings in a stream. Sort the resulting string-count pairs by decreasing count (frequency) and secondarily by string in lexicographic order. @p

Intersection of two sorted lists

Print the current working node / vertex.

Reverse or "unreverse" a host/domain name: <code>com.example.www</code> is reversed to <code>www.example.com</code> and vice versa. @param domainName

Get the registered domain for a host name based on the ICANN section of the <a href="https://www.publicsuffix.org/">public suffix list</a>. @see Effe

Whether the domain is safe to output given the reversed domain name seen next. @param nextDomainRevName next name in lexicographically sorted list of

Add the domain name to the queue if it is not already queued. Flush the queue, assuming properly sorted input. @param sb domains which are sa

{@inheritDoc}

Check preference vector whether values sum up to 1.0, see <a href= "https://law.di.unimi.it/software/law-docs/it/unimi/dsi/law/rank/SpectralRanking.ht

@param iterators input iterators

Change the current working node / vertex. @param vertexLabel vertex label (node name)

Difference of two sorted lists: a \ b