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 DCA - Official Python implementation of Delaunay Component Analysis algorithm Delaunay Component Analysis (DCA) Official Python implementation of the Delaunay 9 Sep 06, 2022 Weighted K Nearest Neighbors (kNN) algorithm implemented on python from scratch. kNN_From_Scratch I implemented the k nearest neighbors (kNN) classification algorithm on python. This algorithm is used to predict the classes of new 1 Dec 14, 2021 Official repository of OFA. Paper: Unifying Architectures, Tasks, and Modalities Through a Simple Sequence-to-Sequence Learning Framework Paper | Blog OFA is a unified multimodal pretrained model that unifies modalities (i.e., cross-modality, vision, language) and tasks (e.g., image gene 1.4k Jan 08, 2023 PyTorch implementation of Densely Connected Time Delay Neural Network Densely Connected Time Delay Neural Network PyTorch implementation of Densely Connected Time Delay Neural Network (D-TDNN) in our paper "Densely Conne 64 Oct 11, 2022 Fast and simple implementation of RL algorithms, designed to run fully on GPU. RSL RL Fast and simple implementation of RL algorithms, designed to run fully on GPU. This code is an evolution of rl-pytorch provided with NVIDIA's I 68 Dec 29, 2022 HistoSeg : Quick attention with multi-loss function for multi-structure segmentation in digital histology images HistoSeg : Quick attention with multi-loss function for multi-structure segmentation in digital histology images Histological Image Segmentation This 11 Dec 16, 2022 Multi-Person Extreme Motion Prediction Multi-Person Extreme Motion Prediction Implementation for paper Wen Guo, Xiaoyu Bie, Xavier Alameda-Pineda, Francesc Moreno-Noguer, Multi-Person Extre 38 Nov 15, 2022 This repository holds the code for the paper "Deep Conditional Gaussian Mixture Model forConstrained Clustering". Deep Conditional Gaussian Mixture Model for Constrained Clustering. This repository holds the code for the paper Deep Conditional Gaussian Mixture Mod 17 Oct 30, 2022 Tooling for GANs in TensorFlow TensorFlow-GAN (TF-GAN) TF-GAN is a lightweight library for training and evaluating Generative Adversarial Networks (GANs). Can be installed with pip 803 Dec 24, 2022 [ECCV 2020] Reimplementation of 3DDFAv2, including face mesh, head pose, landmarks, and more. Stable Head Pose Estimation and Landmark Regression via 3D Dense Face Reconstruction Reimplementation of (ECCV 2020) Towards Fast, Accurate and Stable 221 Dec 30, 2022 Custom IMDB Dataset is extracted between 2020-2021 and custom distilBERT model is trained for movie success probability prediction IMDB Success Predictor Project involves Web Scraping custom IMDB data between 2020 and 2021 of 10000 movies and shows sorted by number of votes ,fine 1 Jan 18, 2022 An implementation for the ICCV 2021 paper Deep Permutation Equivariant Structure from Motion. Deep Permutation Equivariant Structure from Motion Paper | Poster This repository contains an implementation for the ICCV 2021 paper Deep Permutation 72 Dec 27, 2022 Prometheus exporter for Cisco Unified Computing System (UCS) Manager prometheus-ucs-exporter Overview Use metrics from the UCS API to export relevant metrics to Prometheus This repository is a fork of Drew Stinnett's or 6 Nov 07, 2022 The official re-implementation of the Neurips 2021 paper, "Targeted Neural Dynamical Modeling". Targeted Neural Dynamical Modeling Note: This is a re-implementation (in Tensorflow2) of the original TNDM model. We do not plan to further update the 6 Oct 05, 2022 Cascaded Pyramid Network (CPN) based on Keras (Tensorflow backend) ML2 Takehome Project Reimplementing the paper: Cascaded Pyramid Network for Multi-Person Pose Estimation Dataset The model uses the COCO dataset which 1 Nov 22, 2021 wmctrl ported to Python Ctypes work in progress wmctrl is a command that can be used to interact with an X Window manager that is compatible with the EWMH/NetWM specification. wmctr 22 Dec 31, 2022 Vit-ImageClassification - Pytorch ViT for Image classification on the CIFAR10 dataset Vit-ImageClassification Introduction This project uses ViT to perform image clas 4 Jun 01, 2022 Deep Text Search is an AI-powered multilingual text search and recommendation engine with state-of-the-art transformer-based multilingual text embedding (50+ languages). Deep Text Search - AI Based Text Search & Recommendation System Deep Text Search is an AI-powered multilingual text search and recommendation engine w 19 Sep 29, 2022 This is the repository for the AAAI 21 paper [Contrastive and Generative Graph Convolutional Networks for Graph-based Semi-Supervised Learning]. CG3 This is the repository for the AAAI 21 paper [Contrastive and Generative Graph Convolutional Networks for Graph-based Semi-Supervised Learning]. R 12 Oct 28, 2022 Training Confidence-Calibrated Classifier for Detecting Out-of-Distribution Samples / ICLR 2018 Training Confidence-Calibrated Classifier for Detecting Out-of-Distribution Samples This project is for the paper "Training Confidence-Calibrated Clas 168 Nov 29, 2022