Sort webliste and use nicks

bahner · Mar 9, 2024 · 1fc6a2d · 1fc6a2d
1 parent 0cfe4c4
commit 1fc6a2d
Show file tree

Hide file tree

Showing 2 changed files with 13 additions and 8 deletions.
diff --git a/mode/actor/web.go b/mode/actor/web.go
@@ -81,11 +81,11 @@ func (d *WebHandlerDocument) String() string {
 	// Info leak? Not really important anyways.
 	// // Addresses
 	if len(d.Addrs) > 0 {
-		html += "<h2>Addresses</h2>\n<ul>"
+		html += "<h2>Addresses</h2>\n<ul>\n"
 		for _, addr := range d.Addrs {
-			html += "<li>" + addr.String() + "</li>"
+			html += "<li>" + addr.String() + "</li>\n"
 		}
-		html += "</ul>"
+		html += "</ul>\n"
 	}
 
 	// Peers with Same Rendezvous

diff --git a/mode/mode.go b/mode/mode.go
@@ -11,7 +11,12 @@ func UnorderedListFromPeerIDSlice(peers p2peer.IDSlice) string {
 	peersMap := make(map[string]string)
 	for _, p := range peers {
 		id := p.String()
-		peersMap[id] = peer.Lookup(id)
+		nick, err := peer.LookupNick(id)
+		if err != nil {
+			peersMap[id] = id
+		} else {
+			peersMap[id] = nick
+		}
 	}
 
 	var keys []string
@@ -20,14 +25,14 @@ func UnorderedListFromPeerIDSlice(peers p2peer.IDSlice) string {
 	}
 	sort.Strings(keys)
 
-	list := "<ul>"
+	list := "<ul>\n"
 	for _, v := range keys {
 		if peersMap[v] == v {
-			list += "<li>" + v + "</li>"
+			list += "<li>" + v + "</li>\n"
 		} else {
-			list += "<li>" + v + "(" + peersMap[v] + ")</li>"
+			list += "<li>" + v + "(" + peersMap[v] + ")</li>\n"
 		}
 	}
-	list += "</ul>"
+	list += "</ul>\n"
 	return list
 }