ch.ethz.sn.visone3.networks.impl.AsciiDumper Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of netroles-networks-engine Show documentation
Show all versions of netroles-networks-engine Show documentation
Networks engine for netroles library
The newest version!
/*
* This file is part of netroles.
*
* netroles is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* netroles is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with netroles. If not, see toString) {
final StringBuilder sb = new StringBuilder();
// top left cell
sb.append(String.format(CELL_FORMAT, rel.countLeftDomain() + "x" + rel.countRightDomain()));
sb.append(" |");
// top row
for (final int i : rel.getRightDomain()) {
sb.append(String.format(CELL_FORMAT, i));
}
// separator line
final StringBuilder line = new StringBuilder();
for (int i = 0; i < CELL_WIDTH; i++) {
line.append("-");
}
sb.append('\n').append(line).append("-+");
for (final int ignored : rel.getRightDomain()) {
sb.append(line);
}
for (final int r : rel.getLeftDomain()) {
// first column
sb.append('\n').append(String.format(CELL_FORMAT, r)).append(" |");
// cells
for (final int c : rel.getRightDomain()) {
final Relationship v = rel.getRelationship(r, c);
sb.append(String.format(CELL_FORMAT, v != null ? toString.apply(v) : "."));
}
}
return sb.append('\n').toString();
}
/**
* Produces a single-line dump of a relation.
*
* @param rel
* the relation.
* @return the dump string
*/
public static String singleLine(final Relation rel) {
return singleLine(rel, WIDTH_HINT);
}
/**
* Produces a single-line dump of a relation with specified maximum length.
*
* @param rel
* the relation.
* @param widthHint
* the maximum length.
* @return the dump string
*/
public static String singleLine(final Relation rel, final int widthHint) {
final StringBuilder sb = new StringBuilder();
sb.append(String.format("{Relation,I=%s,D=%dx%d,|R|=%d,[", rel.getClass().getSimpleName(),
rel.countLeftDomain(), rel.countRightDomain(), rel.countRelationships()));
limited(sb, rel.getRelationships().iterator(), widthHint);
sb.append("]}");
return sb.toString();
}
/**
* Produces a single-line dump of an undirected graph.
*
* @param graph
* the undirected graph.
* @return the dump string
*/
public static String singleLine(final UndirectedGraph graph) {
return singleLine(graph, WIDTH_HINT);
}
/**
* Produces a single-line dump of an undirected graph with specified maximum length.
*
* @param graph
* the undirected graph.
* @param widthHint
* the maximum length.
* @return the dump string
*/
public static String singleLine(final UndirectedGraph graph, final int widthHint) {
final StringBuilder sb = new StringBuilder();
sb.append(String.format("{UndirectedGraph,I=%s,n=%d,|E|=%d,[", graph.getClass().getSimpleName(),
graph.countVertices(), graph.countEdges()));
limited(sb, graph.getEdges().iterator(), widthHint);
sb.append("]}");
return sb.toString();
}
/**
* Produces a single-line dump of a directed graph.
*
* @param graph
* the directed graph.
* @return the dump string
*/
public static String singleLine(final DirectedGraph graph) {
return singleLine(graph, WIDTH_HINT);
}
/**
* Produces a single-line dump of a directed graph with specified maximum length.
*
* @param graph
* the directed graph.
* @param widthHint
* the maximum length.
* @return the dump string
*/
public static String singleLine(final DirectedGraph graph, final int widthHint) {
final StringBuilder sb = new StringBuilder();
sb.append(String.format("{DirectedGraph,I=%s,n=%d,|E|=%d,[", graph.getClass().getSimpleName(),
graph.countVertices(), graph.countEdges()));
limited(sb, graph.getEdges().iterator(), widthHint);
sb.append("]}");
return sb.toString();
}
/**
* Produces a single-line dump of a mapping.
*
* @param map the mapping.
* @param the mapping type.
* @return the dump string
*/
public static String singleLine(final ConstMapping map) {
return singleLine(map, WIDTH_HINT);
}
/**
* Produces a single-line dump of a mapping with specified maximum length.
*
* @param map the mapping.
* @param widthHint hint for the maximum length of the dump string.
* @param the mapping type.
* @return the dump string
*/
public static String singleLine(final ConstMapping map, final int widthHint) {
final StringBuilder sb = new StringBuilder();
sb.append(String.format("{n=%d,[", map.size()));
limited(sb, map.iterator(), widthHint);
sb.append("]}");
return sb.toString();
}
/**
* Append till {@code sb} is over {@code widthHint} characters long.
*/
private static void limited(final StringBuilder sb, final Iterator itr,
final int widthHint) {
final String fmt = "(... %3s omitted)";
// append as long as it fits
if (itr.hasNext()) {
final String next = saveToString(itr.next());
if (widthHint < 0 || sb.length() + next.length() < widthHint) {
sb.append(next);
}
}
// append as long as it fits
while (itr.hasNext()) {
final String next = saveToString(itr.next());
if (widthHint >= 0 && sb.length() + next.length() >= widthHint) {
break;
}
sb.append(',').append(next);
}
// count rest (but limit to not walk everything)
int count = 0;
final int max = 99;
while (itr.hasNext() && count < max) {
itr.next();
count++;
}
if (count >= max) {
sb.append(String.format(fmt, max + "+"));
} else if (count > 0) {
sb.append(String.format(fmt, count));
}
}
private static String saveToString(final T obj) {
if (obj instanceof Double) {
return String.format("%10.2e", (Double) obj);
}
return obj.toString().replaceAll("\n", "#");
}
}