Hi, thanks for this great python package.

I noticed the follow error when I do this in jupyter on python-3.6.2

import lolviz
lolviz.objviz('1234567890')

---------------------------------------------------------------------------
NameError                                 Traceback (most recent call last)
<ipython-input-4-7a8f0cba785c> in <module>()
      1 import lolviz
----> 2 lolviz.objviz('1234567890')

/usr/lib/python3.6/site-packages/lolviz.py in objviz(o, orientation)
    217 """ % orientation
    218     reachable = closure(o)
--> 219     s += obj_nodes(reachable)
    220     s += obj_edges(reachable)
    221     s += "}\n"

/usr/lib/python3.6/site-packages/lolviz.py in obj_nodes(nodes)
    229     # currently only making subgraph cluster for linked lists
    230     # otherwise it squishes trees.
--> 231     max_edges_for_type,subgraphs = connected_subgraphs(nodes)
    232     c = 1
    233     for g in subgraphs:

/usr/lib/python3.6/site-packages/lolviz.py in connected_subgraphs(reachable, varnames)
    785     of sets containing the id()s of all nodes in a specific subgraph
    786     """
--> 787     max_edges_for_type = max_edges_in_connected_subgraphs(reachable, varnames)
    788 
    789     reachable = closure(reachable, varnames)

/usr/lib/python3.6/site-packages/lolviz.py in max_edges_in_connected_subgraphs(reachable, varnames)
    839     """
    840     max_edges_for_type = defaultdict(int)
--> 841     reachable = closure(reachable, varnames)
    842     reachable = [p for p in reachable if isplainobj(p)]
    843     for p in reachable:

/usr/lib/python3.6/site-packages/lolviz.py in closure(p, varnames)
    706     from but don't include frame objects.
    707     """
--> 708     return closure_(p, varnames, set())
    709 
    710 

/usr/lib/python3.6/site-packages/lolviz.py in closure_(p, varnames, visited)
    710 
    711 def closure_(p, varnames, visited):
--> 712     if p is None or isatom(p):
    713         return []
    714     if id(p) in visited:

/usr/lib/python3.6/site-packages/lolviz.py in isatom(p)
    691 
    692 
--> 693 def isatom(p): return type(p) == int or type(p) == float or type(p) == str or type(p) == unicode
    694 
    695 

NameError: name 'unicode' is not defined

I find table in lolviz can not show values if cell in one row is a list, as:

T = [
    ['11','12','13','14',['a','b','c'],'16']
]
objviz(T)

Only the a, b, c are shown and 11, 12, 13, 14, and 16 are not shown, is this configurable? Thanks!

Contd. from https://github.com/parrt/lolviz/issues/11#issuecomment-326474125

Traceback (most recent call last):

  File "/Users/srid/code/ipython/lib/python3.6/site-packages/IPython/core/interactiveshell.py", line 2862, in run_code
    exec(code_obj, self.user_global_ns, self.user_ns)

  File "<ipython-input-1-ae470ca34f62>", line 1, in <module>
    from lolviz import *

  File "/Users/srid/code/ipython/lib/python3.6/site-packages/lolviz.py", line 442
    print "hashcode =", hashcode(key)
                     ^
SyntaxError: invalid syntax

This package is currently registered as Python 2.7 only in PyPI. This is what happens if you try to install it on Python 3.6:

(venv) $ pip install lolviz
Collecting lolviz
  Using cached lolviz-1.2.tar.gz
lolviz requires Python '<3' but the running Python is 3.6.0

I think it's just a matter of adding the Python 3 classifier in setup.py, because as far as I can see the code is fine for Python 3.

from lolviz import *

dict_tuple_values = dictviz({'a': (1, 2)})
dict_tuple_values.render(view=True, cleanup=True)

Is rendered as:

This only happens with 2-tuples. Any other tuple length is rendered as expected.

This is the offending line: https://github.com/parrt/lolviz/blob/a6fc29b008a16993738416e793de71c3bff4175d/lolviz.py#L159

What is the significance of ... and len(el) == 2 ?

Hi, I was looking for a package to visualize Tree Search Algorithm Recently and I found this repository and really liked it. But for tree visualization, the treeviz function can only support binary tree with child name left and right.

So I made some modification to support multi children and specifying child name. I add 2 new parameters for treeviz(), childfields and show_all_children. The variable name in childfields will be recognized as child node. And if show_all_children=False, it will only visualize the child names exist, else it will show all the names in childfieds.

I know you may be busy and this repository hasn't been updated for a long time. You can check these modification anytime free. I am so glad to receive any suggestions from you.

Hello @parrt! I used your lolviz project a few years ago, and I rediscovered it today. It's awesome!

Could we add a "super" display function that chooses the best one based on the datatype?

When reading the documentation, it shows like 8 different functions, and I don't want to spend my time thinking about the name of one or another function for one or another datatype. What is described in this documentation is almost trivially translated to Python code.

modes = [ "str", "matrix", "call", "calls", "obj", "tree", "lol", "list" ]

def unified_lolviz(obj, mode=None):
    """ Unified function to display `obj` with lolviz, in Jupyter notebook only."""
    if mode == "str" or isinstance(obj):
        return strviz(obj)
    if mode == "matrix" or "<class 'numpy.ndarray'>" == str(type(obj)):
        # can't use isinstance(obj, np.ndarray) without import numpy!
        return matrixviz(obj)
    if mode == "call": return callviz()
    if mode == "calls": return callviz()
    if mode == "lol" or isinstance(obj, list) and obj and isinstance(obj[0], list):
        # obj is a list, is non empty, and obj[0] is a list!
        return lolviz(obj)
    if mode == "list" or isinstance(obj, list):
        return listviz(obj)
    return objviz(obj)  # default

So I'm opening this ticket: if you think this could be added to the library, can we discuss it here, and then I can take care of writing it, testing it, sending a pull-request, and you can merge, and then update on Pypi! What do you think?

Regards from France, @Naereen

This isn't a bug, but a question for help / hints.

I would like to use lolviz to create a graph of my python class structure. Every class-attribute is type annotated, so it should be possible to like their interactions without creating class instances. Here is a minimal example:

from copy import deepcopy
from lolviz import *
class Workout:
    def __init__(
        self,
        date: dt.date,
        name: str = "",
        duration: int = 0
    ):
        # assert isinstance(tss, (np.number, int))
        self.date: dt.date = date
        self.name: str = name
        self.duration: int = duration  # in seconds
        self.done: boolean = False

class Athlete:
    def __init__(
        self,
        name: str,
        birthday: dt.date,
        sports: List[str]
    ):
        self.name: str = name
        self.birthday: dt.date = birthday
        self.sports: List[str] = sports


class DataContainer:
    def __init__(self, 
                 athlete: Athlete, 
                 tasks: List[Workout] = [], 
                 fulfilled: List[Workout] = []):
        self.athelete: Athlete = athlete
        self.tasks: List[Workout] = [w for w in tasks if isinstance(w, Workout)]
        self.fulfilled: List[Workout] = [w for w in fulfilled if isinstance(w, Workout)]

me = Athlete("nico", dt(1990,3,1).date(), sports=["running","climbing"])
t1 = Workout(date=dt(2020,1,1).date(), name="5k Run")
f1 = deepcopy(t1)
f1.done = True
dc1 = DataContainer(me, tasks=[t1], fulfilled=[f1])

Now I can use objviz(dc1) to create the following diagram:

What I actually would like to achieve is a command like classviz(DataContainer) which will give me a similar chart, but not with the actual attribute values but their types. For sure there will be other small changes, but that's the basic idea.

What I already can do is something like:

def get_types(annotated_class):
    return (annotated_class.__name__, {k: v.__name__ for k,v in annotated_class.__init__.__annotations__.items()})

get_types(Workout)

which gives me something like: ('Workout', {'date': 'date', 'name': 'str', 'duration': 'int'}). How ever I don't find a proper way to create similar table-elements which contain Workout in the header and the name-attribute mapping in it's body.

Can someone give me a hint, how to create such tables manually? I am also happy for any additional advices

from lolviz import objviz a={"hello":"<"} objviz(a).render() Error: Source.gv: syntax error in line 16 scanning a HTML string (missing '>'? bad nesting? longer than 16384?) String starting:<

opened by ami-navon 1 Releases(1.4) 1.4(Jul 11, 2018) Added numpy 1D, 2D array support Source code(tar.gz) Source code(zip) 1.3.3(Jul 4, 2018) Fixed bug that prevented dictionaries from being displayed as such. Source code(tar.gz) Source code(zip) 1.3.1(Sep 19, 2017) Source code(tar.gz) Source code(zip) 1.3(Sep 13, 2017) Source code(tar.gz) Source code(zip) 1.2.2(Sep 1, 2017) Source code(tar.gz) Source code(zip) 1.2.1(Sep 1, 2017) Source code(tar.gz) Source code(zip) 1.2(Aug 29, 2017) Source code(tar.gz) Source code(zip) 1.1.1(Aug 28, 2017) Source code(tar.gz) Source code(zip) 1.1(Aug 27, 2017) Source code(tar.gz) Source code(zip) 1.0.2(Aug 26, 2017) Source code(tar.gz) Source code(zip) 1.0.1(Aug 26, 2017) Source code(tar.gz) Source code(zip) 1.0(Aug 26, 2017) Source code(tar.gz) Source code(zip) Owner Terence Parr Creator of the ANTLR parser generator. Professor at Univ of San Francisco, computer science and data science. Working mostly on machine learning stuff now. GitHub Repository Semi-Supervised Learning for Fine-Grained Classification Semi-Supervised Learning for Fine-Grained Classification This repo contains the code of: A Realistic Evaluation of Semi-Supervised Learning for Fine-G 25 Nov 08, 2022 Companion repository to the paper accepted at the 4th ACM SIGSPATIAL International Workshop on Advances in Resilient and Intelligent Cities Transfer learning approach to bicycle sharing systems station location planning using OpenStreetMap Companion repository to the paper accepted at the 4 Oct 24, 2022 In this work, we will implement some basic but important algorithm of machine learning step by step. WoRkS continued English 中文 Français Probability Density Estimation-Non-Parametric Methods(概率密度估计-非参数方法) 1. Kernel / k-Nearest Neighborhood Density Est 1 Dec 30, 2021 Code for the paper "Benchmarking and Analyzing Point Cloud Classification under Corruptions" ModelNet-C Code for the paper "Benchmarking and Analyzing Point Cloud Classification under Corruptions". For the latest updates, see: sites.google.com 45 Dec 28, 2022 ThunderGBM: Fast GBDTs and Random Forests on GPUs Documentations | Installation | Parameters | Python (scikit-learn) interface What's new? ThunderGBM won 2019 Best Paper Award from IEEE Transactions o 647 Jan 04, 2023 DAFNe: A One-Stage Anchor-Free Deep Model for Oriented Object Detection DAFNe: A One-Stage Anchor-Free Deep Model for Oriented Object Detection Code for our Paper DAFNe: A One-Stage Anchor-Free Deep Model for Oriented Obje 58 Dec 19, 2022 The repo contains the code to train and evaluate a system which extracts relations and explanations from dialogue. The repo contains the code to train and evaluate a system which extracts relations and explanations from dialogue. How do I cite D-REX? For now, cite 6 Mar 31, 2022 CasualHealthcare's Pneumonia detection with Artificial Intelligence (Convolutional Neural Network) CasualHealthcare's Pneumonia detection with Artificial Intelligence (Convolutional Neural Network) This is PneumoniaDiagnose, an artificially intellig 2 Jan 03, 2022 PyTorch implementation of Off-policy Learning in Two-stage Recommender Systems Off-Policy-2-Stage This repo provides a PyTorch implementation of the MovieLens experiments for the following paper: Off-policy Learning in Two-stage 25 Dec 12, 2022 Object detection on multiple datasets with an automatically learned unified label space. Simple multi-dataset detection An object detector trained on multiple large-scale datasets with a unified label space; Winning solution of E 407 Dec 30, 2022 Objective of the repository is to learn and build machine learning models using Pytorch. 30DaysofML Using Pytorch 30 Days Of Machine Learning Using Pytorch Objective of the repository is to learn and build machine learning models using Pytorch. List of Algorithms 119 Nov 24, 2022 Project Tugas Besar pertama Pengenalan Komputasi Institut Teknologi Bandung Vending_Machine_(Mesin_Penjual_Minuman) Project Tugas Besar pertama Pengenalan Komputasi Institut Teknologi Bandung Raw Sketch untuk Essay Ringkasan P 1 Nov 08, 2021 Experiments and code to generate the GINC small-scale in-context learning dataset from "An Explanation for In-context Learning as Implicit Bayesian Inference" GINC small-scale in-context learning dataset GINC (Generative In-Context learning Dataset) is a small-scale synthetic dataset for studying in-context 29 Dec 19, 2022 A PyTorch implementation of ViTGAN based on paper ViTGAN: Training GANs with Vision Transformers. ViTGAN: Training GANs with Vision Transformers A PyTorch implementation of ViTGAN based on paper ViTGAN: Training GANs with Vision Transformers. Refer 127 Dec 23, 2022 The FIRST GANs-based omics-to-omics translation framework OmiTrans Please also have a look at our multi-omics multi-task DL freamwork 👀 : OmiEmbed The FIRST GANs-based omics-to-omics translation framework Xi 6 Dec 14, 2022 Roadmap to becoming a machine learning engineer in 2020 Roadmap to becoming a machine learning engineer in 2020, inspired by web-developer-roadmap. 1.7k Dec 29, 2022 (AAAI 2021) Progressive One-shot Human Parsing End-to-end One-shot Human Parsing This is the official repository for our two papers: Progressive One-shot Human Parsing (AAAI 2021) End-to-end One-sh 54 Dec 30, 2022 Efficient Online Bayesian Inference for Neural Bandits Efficient Online Bayesian Inference for Neural Bandits By Gerardo Durán-Martín, Aleyna Kara, and Kevin Murphy AISTATS 2022. 49 Dec 27, 2022 Deep Learning Algorithms for Hedging with Frictions Deep Learning Algorithms for Hedging with Frictions This repository contains the Forward-Backward Stochastic Differential Equation (FBSDE) solver and 3 Dec 22, 2022 Julia and Matlab codes to simulated all problems in El-Hachem, McCue and Simpson (2021) Substrate_Mediated_Invasion Julia and Matlab codes to simulated all problems in El-Hachem, McCue and Simpson (2021) 2DSolver.jl reproduces the simulat 0 Nov 09, 2021