From 68660a88682ffe2707493f76ca234850667d73db91c6095ccb7cef0f31d33ed9 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Tom=C3=A1=C5=A1=20Chv=C3=A1tal?= Date: Fri, 29 Mar 2019 09:22:37 +0000 Subject: [PATCH] Accepting request 689748 from home:jengelh:branches:devel:languages:python - Drop duplicated word. OBS-URL: https://build.opensuse.org/request/show/689748 OBS-URL: https://build.opensuse.org/package/show/devel:languages:python/python-PyTrie?expand=0&rev=4 --- python-PyTrie.changes | 5 +++++ python-PyTrie.spec | 4 ++-- 2 files changed, 7 insertions(+), 2 deletions(-) diff --git a/python-PyTrie.changes b/python-PyTrie.changes index f748e78..46cf7f8 100644 --- a/python-PyTrie.changes +++ b/python-PyTrie.changes @@ -1,3 +1,8 @@ +------------------------------------------------------------------- +Fri Mar 29 08:49:43 UTC 2019 - Jan Engelhardt + +- Drop duplicated word. + ------------------------------------------------------------------- Thu Mar 28 08:20:50 UTC 2019 - Tomáš Chvátal diff --git a/python-PyTrie.spec b/python-PyTrie.spec index 0650d30..b97eb9b 100644 --- a/python-PyTrie.spec +++ b/python-PyTrie.spec @@ -41,9 +41,9 @@ BuildArch: noarch %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.