assertThat(graph.predecessors(node)).isEqualTo(asGraph.predecessors(node));
      assertThat(graph.successors(node)).isEqualTo(asGraph.successors(node));
      assertThat(graph.degree(node)).isEqualTo(asGraph.degree(node));
      assertThat(graph.inDegree(node)).isEqualTo(asGraph.inDegree(node));
      assertThat(graph.outDegree(node)).isEqualTo(asGraph.outDegree(node));

      for (Integer otherNode : graph.nodes()) {

  // We could make this a Map<E, EndpointPair<N>>. It would make incidentNodes(edge) slightly
  // faster, but also make Networks consume 5 to 20+% (increasing with average degree) more memory.
  final MapIteratorCache<E, N> edgeToReferenceNode; // referenceNode == source if directed

  /** Constructs a graph with the properties specified in {@code builder}. */

  // We could make this a Map<E, EndpointPair<N>>. It would make incidentNodes(edge) slightly
  // faster, but also make Networks consume 5 to 20+% (increasing with average degree) more memory.
  final MapIteratorCache<E, N> edgeToReferenceNode; // referenceNode == source if directed

  /** Constructs a graph with the properties specified in {@code builder}. */

 *   <li><b>collision-averse:</b> while it can't be helped that a hash function will sometimes
 *       produce the same hash code for distinct inputs (a "collision"), every hash function strives
 *       to <i>some</i> degree to make this unlikely. (Without this condition, a function that
 *       always returns zero could be called a hash function. It is not.)
 * </ul>
 *

 *   <li><b>collision-averse:</b> while it can't be helped that a hash function will sometimes
 *       produce the same hash code for distinct inputs (a "collision"), every hash function strives
 *       to <i>some</i> degree to make this unlikely. (Without this condition, a function that
 *       always returns zero could be called a hash function. It is not.)
 * </ul>
 *

// https://www.iana.org/domains/root/db/dealer.html
dealer

// deals : Binky Moon, LLC
// https://www.iana.org/domains/root/db/deals.html
deals

// degree : Dog Beach, LLC
// https://www.iana.org/domains/root/db/degree.html
degree

// delivery : Binky Moon, LLC
// https://www.iana.org/domains/root/db/delivery.html
delivery

// dell : Dell Inc.

de.cool
de.eu.org
de.trendhosting.cloud
de.us
deal
dealer
deals
deatnu.no
debian.net
deca.jp
deci.jp
dedibox.fr
dedyn.io
def.br
definima.io
definima.net
degree
delhi.in
delivery
dell
dell-ogliastra.it
dellogliastra.it
deloitte
delta
demo.datacenter.fi
demo.datadetect.com
demo.jelastic.com
democracia.bo
democrat
demon.nl

sin
dem
oss
opp
man
kan
hans
hvor
eller
hva
skal
selv
sjøl
her
alle
vil
bli
ble
blei
blitt
kunne
inn
når
være
kom
noen
noe
ville
dere
som
deres
kun
ja
etter
ned
skulle
denne
for
deg
si
sine
sitt
mot
å
meget
hvorfor
dette
disse
uten
hvordan
ingen
din
ditt
blir
samme
hvilken

labels.user_info_enabled=Kullanıcı Günlüğü
labels.user_favorite_enabled=Favori Günlüğü
labels.web_api_json_enabled=JSON Yanıtı
labels.app_value=Sistem Özelliği
labels.default_label_value=Varsayılan Etiket Değeri
labels.default_sort_value=Varsayılan Sıralama Değeri
labels.virtual_host_value=Sanal Ana Bilgisayar
labels.append_query_param_enabled=Arama Parametrelerini Ekle
labels.login_required=Oturum Açma Gerekli

00AE          ; valid                  ;      ; NV8    # 1.1  REGISTERED SIGN
00AF          ; disallowed_STD3_mapped ; 0020 0304     # 1.1  MACRON
00B0..00B1    ; valid                  ;      ; NV8    # 1.1  DEGREE SIGN..PLUS-MINUS SIGN
00B2          ; mapped                 ; 0032          # 1.1  SUPERSCRIPT TWO
00B3          ; mapped                 ; 0033          # 1.1  SUPERSCRIPT THREE