From 1b65a0f53478a73aa370e220b4d8c20a4b68db85 Mon Sep 17 00:00:00 2001 From: Abhishek Singh Date: Thu, 26 Oct 2017 20:46:15 -0700 Subject: [PATCH] Changed the version and description for PyPi --- README.md | 3 ++- setup.py | 4 ++-- 2 files changed, 4 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index 4dffa13..4c8c28a 100644 --- a/README.md +++ b/README.md @@ -1,5 +1,6 @@ ![Logo](https://github.com/aosingh/lexpy/blob/master/images/lexpylogo.png) +[![PyPI version](https://badge.fury.io/py/lexpy.svg)](https://pypi.python.org/pypi/lexpy) [![Travis](https://travis-ci.org/aosingh/lexpy.svg?branch=master)](https://travis-ci.org/aosingh/lexpy) [![Coverage Status](https://coveralls.io/repos/github/aosingh/lexpy/badge.svg?branch=master)](https://coveralls.io/github/aosingh/lexpy?branch=master) [![Maintainability](https://api.codeclimate.com/v1/badges/60626f81c0db0c5d8dcd/maintainability)](https://codeclimate.com/github/aosingh/lexpy/maintainability) @@ -8,7 +9,7 @@ a dictionary and a lexicon is that in a lexicon there are no values associated with the words. A lexicon is similar to a list of words or a set, but the internal representation is different and optimized for faster searches(of words, prefixes and wildcard patterns). Precisely the search time is O(W) where W is the length of the word. -2 important Lexicon datastructures are: +2 important Lexicon data-structures are: 1. Trie. 3. Directed Acyclic Word Graph(DAWG). diff --git a/setup.py b/setup.py index 1f3cf54..8e600d9 100644 --- a/setup.py +++ b/setup.py @@ -5,10 +5,10 @@ AUTHOR = 'Abhishek Singh' MAINTAINER = 'Abhishek Singh' MAINTAINER_EMAIL = 'aosingh@asu.edu' -DESCRIPTION = ('Python package for lexicons.') +DESCRIPTION = ('Python package for lexicon.') LICENSE = 'GNU GPLv3' URL = 'https://github.com/aosingh/lexpy' -VERSION = '0.1.1' +VERSION = '0.8' PACKAGES = ['lexpy']