Hello community, here is the log from the commit of package python-PyTrie for openSUSE:Factory checked in at 2019-04-18 09:57:23 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/python-PyTrie (Old) and /work/SRC/openSUSE:Factory/.python-PyTrie.new.17052 (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Package is "python-PyTrie" Thu Apr 18 09:57:23 2019 rev:2 rq:695336 version:0.3.1 Changes: -------- --- /work/SRC/openSUSE:Factory/python-PyTrie/python-PyTrie.changes 2019-03-29 20:42:47.458678015 +0100 +++ /work/SRC/openSUSE:Factory/.python-PyTrie.new.17052/python-PyTrie.changes 2019-04-18 09:57:23.985378071 +0200 @@ -1,0 +2,5 @@ +Fri Mar 29 08:49:43 UTC 2019 - Jan Engelhardt <[email protected]> + +- Drop duplicated word. + +------------------------------------------------------------------- ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ python-PyTrie.spec ++++++ --- /var/tmp/diff_new_pack.Ivtgtc/_old 2019-04-18 09:57:24.433378350 +0200 +++ /var/tmp/diff_new_pack.Ivtgtc/_new 2019-04-18 09:57:24.433378350 +0200 @@ -41,9 +41,9 @@ %python_subpackages %description -pytrie is a a pure Python (2 and 3) implementation of the trie data structure. +pytrie is a pure Python (2 and 3) implementation of the trie data structure. -A _trie_ is an ordered tree data structure that is used to store a mapping +A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
