Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP
a python library to easily handle data structure, with a GTK binding
Python Makefile
Branch: master

Adjust apply_filter to correctly handle parameters

In this commit, I have re-factored refreshing of applied filters when
parameters are given. Moreover, I am also adding a unit test, to cover the
cases and ensure that my changes did on one hand meet the goal and neither made
some other parts of code fail.

Fixes #16
latest commit ebd05dde26
@jakubbrindza jakubbrindza authored izidormatusov committed
Failed to load latest commit information.
debian Build requires pyversions included in python2
examples Fix pep8 and pyflakes errors
liblarch Adjust apply_filter to correctly handle parameters
liblarch_gtk
tests Adjust apply_filter to correctly handle parameters
.gitignore
.travis.yml Fix pep8 and pyflakes errors
AUTHORS Switch text color to white when dark background
CHANGELOG 2.1.0 not 2.1.1 in the changelog
LICENSE Licensing under LGPLv3
MANIFEST.in Include AUTHORS and LICENSE in packages
Makefile Fix pep8 and pyflakes errors
README.md Link to github profiles instead of emails
main.py Fix pep8 and pyflakes errors
requirements.txt Remove duplicate pyflakes
run-tests Use nose for running tests
setup.py Fix pep8 and pyflakes errors

README.md

Liblarch

Build Status

If you find Gtk.Treeview and Gtk.Treemodel hard to use, then liblarch is probably for you.

Liblarch is a python library built to easily handle data structure such are lists, trees and acyclic graphs (tree where nodes can have multiple parents). There's also a liblarch-gtk binding that will allow you to use your data structure into a Gtk.Treeview.

Liblarch support multiple views of one data structure and complex filtering. That way, you have a clear separation between your data themselves (Model) and how they are displayed (View).

Links

Credits

Liblarch is published under the LGPLv3 license.

Authors:

Something went wrong with that request. Please try again.