Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update KTrie.csproj #19

Merged
merged 1 commit into from
Mar 30, 2024
Merged

Update KTrie.csproj #19

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/KTrie/KTrie.csproj
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,7 +4,7 @@
<Authors>Kirill Polishchuk</Authors>
<Description>Trie (a.k.a. prefix tree) is an ordered tree data structure that is used to store an associative array where the keys are usually strings. All the descendants of a node have a common prefix of the string associated with that node, and the root is associated with the empty string.</Description>
<Copyright>Kirill Polishchuk</Copyright>
<Version>2.3.0</Version>
<Version>2.4.0</Version>
<RepositoryUrl>https://github.com/kpol/trie</RepositoryUrl>
<PackageProjectUrl>https://github.com/kpol/trie</PackageProjectUrl>
<PackageTags>trie, prefix-tree, data-structure</PackageTags>
Expand Down
Loading