dtools.circular-array 3.9.0__tar.gz

Sign up to get free protection for your applications and to get access to all the features.
@@ -0,0 +1,192 @@
1
+ # CHANGELOG
2
+
3
+ PyPI grscheller.circular-array project.
4
+
5
+ #### Semantic Versioning
6
+
7
+ * first digit - major event, epoch, or paradigm shift
8
+ * second digit - breaking API changes, major changes
9
+ * third digit - bug fixes, API additions, breaking API in dev env
10
+ * forth digit - commit count changes/regressions (dev environment only)
11
+
12
+ ## Releases and Important Milestones
13
+
14
+ ### Version 3.9.0 - PyPI release date 2025-10-??
15
+ * Final release as dtools.circular-array
16
+ * was previously grscheller.circular-array
17
+
18
+ ### Version 3.8.0 - PyPI release date 2025-01-03
19
+
20
+ * now circular-array indexing methods fully support slicing
21
+ * `__getitem__`
22
+ * `__setitem__`
23
+ * `__delitem__`
24
+ * added rotL(n) and rotR(n) methods
25
+
26
+ ### Version 3.7.1 - PyPI release date 2024-11-18
27
+
28
+ * for internal changes
29
+ * mostly for consistency across PyPI namespace projects
30
+
31
+ ### Version 3.7.0 - PyPI release date 2024-10-26
32
+
33
+ * regenerated docs for PyPI release
34
+
35
+ ### Version 3.6.3.2 - Commit date 2024-10-20
36
+
37
+ * preparing for a 3.7.0 PyPI release
38
+ * renamed class ca -> CA
39
+ * ca now takes 0 or 1 iterables
40
+ * created factory function for original constructor use case
41
+ * CA[D](*ds: D) -> ca[D]
42
+ * generated docs in docs repo - 2024-10-23
43
+
44
+ ### Version 3.6.2 - PyPI release date 2024-10-20
45
+
46
+ * removed docs from repo
47
+ * docs for all grscheller namespace projects maintained here
48
+ * https://grscheller.github.io/grscheller-pypi-namespace-docs/
49
+
50
+ ### Version 3.6.1 - PyPI release date 2024-10-18
51
+
52
+ * infrastructure and minor docstring changes
53
+ * should be compatible with version 3.6.0
54
+
55
+ ### Version 3.6.0 - PyPI release date 2024-09-21
56
+
57
+ * no future changes planned for the foreseeable future
58
+ * feature complete
59
+ * no external dependencies
60
+ * well tested with other grscheller namespace packages
61
+ * final API tweaks made
62
+ * several more pytest tests added
63
+ * made the `compact` method private
64
+ * now called `_compact_storage_capacity`
65
+
66
+ ### Version 3.5.0 - PyPI release date 2024-09-21
67
+
68
+ * made the `double` method private
69
+ * now called `_double_storage_capacity`
70
+ * major docstring improvements
71
+ * improved indentation and code alignment
72
+ * now much more Pythonic
73
+
74
+ ### Version 3.4.1 - PyPI release date 2024-08-17
75
+
76
+ * updated README.md to reflect name changes of CA methods
77
+ * docstring improvements
78
+
79
+ ### Version 3.4.0 - PyPI release date 2024-08-15
80
+
81
+ * updated `__eq__` comparisons
82
+ * first compare elements by identity before equality
83
+ * noticed that is what Python builtins do
84
+ * makes dealing with grscheller.fp.nada module easier
85
+ * standardizing docstrings across grscheller PyPI projects
86
+
87
+ ### Version 3.3.0.1 - commit date 2024-08-05
88
+
89
+ * made a paradigm "regression", preparing for a 3.4.0 release
90
+ * felt CA was becoming way too complicated
91
+ * grscheller.datastructures needed it to fully embrace type annotations
92
+ * but I was shifting too many features back into grscheller.circular-array
93
+ * want ca to be useful for non-functional applications
94
+ * changes made
95
+ * removed grscheller.fp dependency
96
+ * remove _sentinel & _storable slots from CA class
97
+ * remove copy method, just use ca2 = CA(*ca1) to make a shallow copy
98
+ * adjust __repr__ and __str__ methods
99
+ * experimenting with Spinx syntax in docstrings (still using pdoc3)
100
+ * changed nomenclature from "left/right" to "front/rear"
101
+ * unsafe and safe versions of pop & fold functionality
102
+ * left and right folds improvements
103
+ * consolidated `foldL, foldL1, foldR, foldR1` into `foldL` & `foldR`
104
+ * TODO: rename `foldL` to `fold_forward` & `foldR` to `fold_backward`
105
+ * tests working
106
+ * basically I changed pops to unsafe pops and added `try except` blocks
107
+ * safe versions tests needed
108
+ * safe pops return multiple values in tuples
109
+ * will take a `default` value to return
110
+ * if only asked to return 1 value and CA is empty
111
+ * seems to work properly from iPython
112
+
113
+ ### Version 3.2.0 - PyPI release date 2024-07-26
114
+
115
+ * class name changed CircularArray -> CA
116
+ * Now takes a "sentinel" or "fallback" value in its initializer
117
+ * formally used None for this
118
+
119
+ ### Version 3.1.0 - PyPI release date 2024-07-11
120
+
121
+ * generic typing now being used
122
+ * first PyPI release where mult values can be pushed on CircularArray
123
+
124
+ ### Version 3.0.0 - commit date 2024-06-28
125
+
126
+ * CircularArray class now using Generic Type Parameter
127
+
128
+ * new epoch in development, start of 3.0 series
129
+ * now using TypeVars
130
+ * API changes
131
+ * foldL(self, f: Callable[[T, T], T]) -> T|None
132
+ * foldR(self, f: Callable[[T, T], T]) -> T|None
133
+ * foldL1(self, f: Callable[[S, T], S], initial: S) -> S
134
+ * foldR1(self, f: Callable[[T, S], S], initial: S) -> S
135
+
136
+ ### Version 2.0.0 - PyPI release date 2024-03-08
137
+
138
+ * new epoch due to resizing bug fixed on previous commit
139
+ * much improved and cleaned up
140
+ * much better test suite
141
+ * method _double() made "public" and renamed double()
142
+ * resize(new_size) now resizes to at least new_size
143
+
144
+ ### Version 1.1.0.0 - commit date 2024-03-08
145
+
146
+ * NEXT PyPI RELEASE WILL BE 2.0.0 !!!!!!!!!!!
147
+ * BUGFIX: Fixed a subtle resizing bug
148
+ * bug probably present in all previous versions
149
+ * not previously identified due to inadequate test coverage
150
+ * test coverage improved vastly
151
+ * made some major code API changes
152
+ * upon initialization minimizing size of the CircularArray
153
+ * have some ideas on how to to improve API for resizing CircularArrays
154
+ * need to test my other 2 PyPI projects
155
+ * both use circular-array as a dependency
156
+
157
+ ### Version 1.0.1 - PyPI release date 2024-03-01
158
+
159
+ * docstring updates to match other grscheller PyPI repos
160
+
161
+ ### Version 1.0.0 - PyPI release date 2024-02-10
162
+
163
+ * first stable release
164
+ * dropped minimum Python requirement to 3.10
165
+
166
+ ### Version 0.1.1 - PyPI release date 2024-01-30
167
+
168
+ * changed circular-array from a package to just a module
169
+ * actually breaking API change
170
+ * version number should have been 0.2.0
171
+ * gave CircularArray class foldL & foldR methods
172
+
173
+ ### Version 0.1.0 - PyPI release date 2024-01-28
174
+
175
+ * initial PyPI grscheller.circular-array release
176
+ * migrated Circulararray class from grscheller.datastructutes
177
+ * update docstrings to reflect current nomenclature
178
+
179
+ ### Version 0.0.3 - commit date 2024-01-28
180
+
181
+ * got gh-pages working for the repo
182
+
183
+ ### Version 0.0.2 - commit date 2024-01-28
184
+
185
+ * pushed repo up to GitHub
186
+ * created README.md file for project
187
+
188
+ ### Version 0.0.1 - commit date 2024-01-28
189
+
190
+ * decided to split Circulararray class out of datastructures
191
+ * will make it its own PyPI project
192
+ * got working with datastructures locally
@@ -0,0 +1,190 @@
1
+ Apache License
2
+ Version 2.0, January 2004
3
+ http://www.apache.org/licenses/
4
+
5
+ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
6
+
7
+ 1. Definitions.
8
+
9
+ "License" shall mean the terms and conditions for use, reproduction,
10
+ and distribution as defined by Sections 1 through 9 of this document.
11
+
12
+ "Licensor" shall mean the copyright owner or entity authorized by
13
+ the copyright owner that is granting the License.
14
+
15
+ "Legal Entity" shall mean the union of the acting entity and all
16
+ other entities that control, are controlled by, or are under common
17
+ control with that entity. For the purposes of this definition,
18
+ "control" means (i) the power, direct or indirect, to cause the
19
+ direction or management of such entity, whether by contract or
20
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
21
+ outstanding shares, or (iii) beneficial ownership of such entity.
22
+
23
+ "You" (or "Your") shall mean an individual or Legal Entity
24
+ exercising permissions granted by this License.
25
+
26
+ "Source" form shall mean the preferred form for making modifications,
27
+ including but not limited to software source code, documentation
28
+ source, and configuration files.
29
+
30
+ "Object" form shall mean any form resulting from mechanical
31
+ transformation or translation of a Source form, including but
32
+ not limited to compiled object code, generated documentation,
33
+ and conversions to other media types.
34
+
35
+ "Work" shall mean the work of authorship, whether in Source or
36
+ Object form, made available under the License, as indicated by a
37
+ copyright notice that is included in or attached to the work
38
+ (an example is provided in the Appendix below).
39
+
40
+ "Derivative Works" shall mean any work, whether in Source or Object
41
+ form, that is based on (or derived from) the Work and for which the
42
+ editorial revisions, annotations, elaborations, or other modifications
43
+ represent, as a whole, an original work of authorship. For the purposes
44
+ of this License, Derivative Works shall not include works that remain
45
+ separable from, or merely link (or bind by name) to the interfaces of,
46
+ the Work and Derivative Works thereof.
47
+
48
+ "Contribution" shall mean any work of authorship, including
49
+ the original version of the Work and any modifications or additions
50
+ to that Work or Derivative Works thereof, that is intentionally
51
+ submitted to Licensor for inclusion in the Work by the copyright owner
52
+ or by an individual or Legal Entity authorized to submit on behalf of
53
+ the copyright owner. For the purposes of this definition, "submitted"
54
+ means any form of electronic, verbal, or written communication sent
55
+ to the Licensor or its representatives, including but not limited to
56
+ communication on electronic mailing lists, source code control systems,
57
+ and issue tracking systems that are managed by, or on behalf of, the
58
+ Licensor for the purpose of discussing and improving the Work, but
59
+ excluding communication that is conspicuously marked or otherwise
60
+ designated in writing by the copyright owner as "Not a Contribution."
61
+
62
+ "Contributor" shall mean Licensor and any individual or Legal Entity
63
+ on behalf of whom a Contribution has been received by Licensor and
64
+ subsequently incorporated within the Work.
65
+
66
+ 2. Grant of Copyright License. Subject to the terms and conditions of
67
+ this License, each Contributor hereby grants to You a perpetual,
68
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
69
+ copyright license to reproduce, prepare Derivative Works of,
70
+ publicly display, publicly perform, sublicense, and distribute the
71
+ Work and such Derivative Works in Source or Object form.
72
+
73
+ 3. Grant of Patent License. Subject to the terms and conditions of
74
+ this License, each Contributor hereby grants to You a perpetual,
75
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
76
+ (except as stated in this section) patent license to make, have made,
77
+ use, offer to sell, sell, import, and otherwise transfer the Work,
78
+ where such license applies only to those patent claims licensable
79
+ by such Contributor that are necessarily infringed by their
80
+ Contribution(s) alone or by combination of their Contribution(s)
81
+ with the Work to which such Contribution(s) was submitted. If You
82
+ institute patent litigation against any entity (including a
83
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
84
+ or a Contribution incorporated within the Work constitutes direct
85
+ or contributory patent infringement, then any patent licenses
86
+ granted to You under this License for that Work shall terminate
87
+ as of the date such litigation is filed.
88
+
89
+ 4. Redistribution. You may reproduce and distribute copies of the
90
+ Work or Derivative Works thereof in any medium, with or without
91
+ modifications, and in Source or Object form, provided that You
92
+ meet the following conditions:
93
+
94
+ (a) You must give any other recipients of the Work or
95
+ Derivative Works a copy of this License; and
96
+
97
+ (b) You must cause any modified files to carry prominent notices
98
+ stating that You changed the files; and
99
+
100
+ (c) You must retain, in the Source form of any Derivative Works
101
+ that You distribute, all copyright, patent, trademark, and
102
+ attribution notices from the Source form of the Work,
103
+ excluding those notices that do not pertain to any part of
104
+ the Derivative Works; and
105
+
106
+ (d) If the Work includes a "NOTICE" text file as part of its
107
+ distribution, then any Derivative Works that You distribute must
108
+ include a readable copy of the attribution notices contained
109
+ within such NOTICE file, excluding those notices that do not
110
+ pertain to any part of the Derivative Works, in at least one
111
+ of the following places: within a NOTICE text file distributed
112
+ as part of the Derivative Works; within the Source form or
113
+ documentation, if provided along with the Derivative Works; or,
114
+ within a display generated by the Derivative Works, if and
115
+ wherever such third-party notices normally appear. The contents
116
+ of the NOTICE file are for informational purposes only and
117
+ do not modify the License. You may add Your own attribution
118
+ notices within Derivative Works that You distribute, alongside
119
+ or as an addendum to the NOTICE text from the Work, provided
120
+ that such additional attribution notices cannot be construed
121
+ as modifying the License.
122
+
123
+ You may add Your own copyright statement to Your modifications and
124
+ may provide additional or different license terms and conditions
125
+ for use, reproduction, or distribution of Your modifications, or
126
+ for any such Derivative Works as a whole, provided Your use,
127
+ reproduction, and distribution of the Work otherwise complies with
128
+ the conditions stated in this License.
129
+
130
+ 5. Submission of Contributions. Unless You explicitly state otherwise,
131
+ any Contribution intentionally submitted for inclusion in the Work
132
+ by You to the Licensor shall be under the terms and conditions of
133
+ this License, without any additional terms or conditions.
134
+ Notwithstanding the above, nothing herein shall supersede or modify
135
+ the terms of any separate license agreement you may have executed
136
+ with Licensor regarding such Contributions.
137
+
138
+ 6. Trademarks. This License does not grant permission to use the trade
139
+ names, trademarks, service marks, or product names of the Licensor,
140
+ except as required for reasonable and customary use in describing the
141
+ origin of the Work and reproducing the content of the NOTICE file.
142
+
143
+ 7. Disclaimer of Warranty. Unless required by applicable law or
144
+ agreed to in writing, Licensor provides the Work (and each
145
+ Contributor provides its Contributions) on an "AS IS" BASIS,
146
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
147
+ implied, including, without limitation, any warranties or conditions
148
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
149
+ PARTICULAR PURPOSE. You are solely responsible for determining the
150
+ appropriateness of using or redistributing the Work and assume any
151
+ risks associated with Your exercise of permissions under this License.
152
+
153
+ 8. Limitation of Liability. In no event and under no legal theory,
154
+ whether in tort (including negligence), contract, or otherwise,
155
+ unless required by applicable law (such as deliberate and grossly
156
+ negligent acts) or agreed to in writing, shall any Contributor be
157
+ liable to You for damages, including any direct, indirect, special,
158
+ incidental, or consequential damages of any character arising as a
159
+ result of this License or out of the use or inability to use the
160
+ Work (including but not limited to damages for loss of goodwill,
161
+ work stoppage, computer failure or malfunction, or any and all
162
+ other commercial damages or losses), even if such Contributor
163
+ has been advised of the possibility of such damages.
164
+
165
+ 9. Accepting Warranty or Additional Liability. While redistributing
166
+ the Work or Derivative Works thereof, You may choose to offer,
167
+ and charge a fee for, acceptance of support, warranty, indemnity,
168
+ or other liability obligations and/or rights consistent with this
169
+ License. However, in accepting such obligations, You may act only
170
+ on Your own behalf and on Your sole responsibility, not on behalf
171
+ of any other Contributor, and only if You agree to indemnify,
172
+ defend, and hold each Contributor harmless for any liability
173
+ incurred by, or claims asserted against, such Contributor by reason
174
+ of your accepting any such warranty or additional liability.
175
+
176
+ END OF TERMS AND CONDITIONS
177
+
178
+ Copyright (c) 2023-2024 Geoffrey R. Scheller
179
+
180
+ Licensed under the Apache License, Version 2.0 (the "License");
181
+ you may not use this file except in compliance with the License.
182
+ You may obtain a copy of the License at
183
+
184
+ http://www.apache.org/licenses/LICENSE-2.0
185
+
186
+ Unless required by applicable law or agreed to in writing, software
187
+ distributed under the License is distributed on an "AS IS" BASIS,
188
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
189
+ See the License for the specific language governing permissions and
190
+ limitations under the License.
@@ -0,0 +1,85 @@
1
+ Metadata-Version: 2.3
2
+ Name: dtools.circular-array
3
+ Version: 3.9.0
4
+ Summary: ### Circular Array
5
+ Keywords: circular array,circle array,CA,double ended queue,dequeue,dqueue,pop,push,popL,popR,pushL,pushR,indexable,auto-resizing,auto resizing,resizing
6
+ Author-email: "Geoffrey R. Scheller" <geoffrey@scheller.com>
7
+ Requires-Python: >=3.12
8
+ Description-Content-Type: text/markdown
9
+ Classifier: Development Status :: 5 - Production/Stable
10
+ Classifier: Framework :: Pytest
11
+ Classifier: Intended Audience :: Developers
12
+ Classifier: License :: OSI Approved :: Apache Software License
13
+ Classifier: Operating System :: OS Independent
14
+ Classifier: Programming Language :: Python :: 3.13
15
+ Classifier: Typing :: Typed
16
+ Requires-Dist: pytest >=8.3.2 ; extra == "test"
17
+ Project-URL: Changelog, https://github.com/grscheller/dtools-circular-array/blob/main/CHANGELOG.md
18
+ Project-URL: Documentation, https://grscheller.github.io/dtools-docs/circular-array
19
+ Project-URL: Source, https://github.com/grscheller/dtools-circular-array
20
+ Provides-Extra: test
21
+
22
+ # Python Circular Array Implementation
23
+
24
+ Python module implementing an indexable, double sided,
25
+ auto-resizing queue data structure.
26
+
27
+ * **Repositories**
28
+ * [dtools.circular-array][1] project on *PyPI*
29
+ * [Source code][2] on *GitHub*
30
+ * **Detailed documentation**
31
+ * [Detailed API documentation][3] on *GH-Pages*
32
+
33
+ ### Overview
34
+
35
+ Useful if used directly as an improved version of a Python List or in
36
+ a "has-a" relationship when implementing other data structures.
37
+
38
+ * O(1) pushes and pops either end.
39
+ * O(1) indexing
40
+ * now fully supports slicing!
41
+
42
+ ### Usage
43
+
44
+ ```python
45
+ from dtools.circular_array.ca import CA
46
+
47
+ ca = CA(1, 2, 3)
48
+ assert ca.popL() == 1
49
+ assert ca.popR() == 3
50
+ ca.pushR(42, 0)
51
+ ca.pushL(0, 1)
52
+ assert repr(ca) == 'CA(1, 0, 2, 42, 0)'
53
+ assert str(ca) == '(|1, 0, 2, 42, 0|)'
54
+
55
+ ca = CA(*range(1,11))
56
+ assert repr(ca) == 'CA(1, 2, 3, 4, 5, 6, 7, 8, 9, 10)'
57
+ assert str(ca) == '(|1, 2, 3, 4, 5, 6, 7, 8, 9, 10|)'
58
+ assert len(ca) == 10
59
+ tup3 = ca.popLT(3)
60
+ tup4 = ca.popRT(4)
61
+ assert tup3 == (1, 2, 3)
62
+ assert tup4 == (10, 9, 8, 7)
63
+
64
+ assert ca == CA(4, 5, 6)
65
+ four, *rest = ca.popFT(1000)
66
+ assert four == 4
67
+ assert rest == [5, 6]
68
+ assert len(ca) == 0
69
+
70
+ ca = CA(1, 2, 3)
71
+ assert ca.popLD(42) == 1
72
+ assert ca.popRD(42) == 3
73
+ assert ca.popLD(42) == 2
74
+ assert ca.popRD(42) == 42
75
+ assert ca.popLD(42) == 42
76
+ assert len(ca) == 0
77
+ ```
78
+
79
+ ---
80
+
81
+ [1]: https://pypi.org/project/dtools.circular-array
82
+ [2]: https://github.com/grscheller/dtools-circular-array
83
+ [3]: https://grscheller.github.io/dtools-namespace-docs/circular-array/
84
+
85
+
@@ -0,0 +1,63 @@
1
+ # Python Circular Array Implementation
2
+
3
+ Python module implementing an indexable, double sided,
4
+ auto-resizing queue data structure.
5
+
6
+ * **Repositories**
7
+ * [dtools.circular-array][1] project on *PyPI*
8
+ * [Source code][2] on *GitHub*
9
+ * **Detailed documentation**
10
+ * [Detailed API documentation][3] on *GH-Pages*
11
+
12
+ ### Overview
13
+
14
+ Useful if used directly as an improved version of a Python List or in
15
+ a "has-a" relationship when implementing other data structures.
16
+
17
+ * O(1) pushes and pops either end.
18
+ * O(1) indexing
19
+ * now fully supports slicing!
20
+
21
+ ### Usage
22
+
23
+ ```python
24
+ from dtools.circular_array.ca import CA
25
+
26
+ ca = CA(1, 2, 3)
27
+ assert ca.popL() == 1
28
+ assert ca.popR() == 3
29
+ ca.pushR(42, 0)
30
+ ca.pushL(0, 1)
31
+ assert repr(ca) == 'CA(1, 0, 2, 42, 0)'
32
+ assert str(ca) == '(|1, 0, 2, 42, 0|)'
33
+
34
+ ca = CA(*range(1,11))
35
+ assert repr(ca) == 'CA(1, 2, 3, 4, 5, 6, 7, 8, 9, 10)'
36
+ assert str(ca) == '(|1, 2, 3, 4, 5, 6, 7, 8, 9, 10|)'
37
+ assert len(ca) == 10
38
+ tup3 = ca.popLT(3)
39
+ tup4 = ca.popRT(4)
40
+ assert tup3 == (1, 2, 3)
41
+ assert tup4 == (10, 9, 8, 7)
42
+
43
+ assert ca == CA(4, 5, 6)
44
+ four, *rest = ca.popFT(1000)
45
+ assert four == 4
46
+ assert rest == [5, 6]
47
+ assert len(ca) == 0
48
+
49
+ ca = CA(1, 2, 3)
50
+ assert ca.popLD(42) == 1
51
+ assert ca.popRD(42) == 3
52
+ assert ca.popLD(42) == 2
53
+ assert ca.popRD(42) == 42
54
+ assert ca.popLD(42) == 42
55
+ assert len(ca) == 0
56
+ ```
57
+
58
+ ---
59
+
60
+ [1]: https://pypi.org/project/dtools.circular-array
61
+ [2]: https://github.com/grscheller/dtools-circular-array
62
+ [3]: https://grscheller.github.io/dtools-namespace-docs/circular-array/
63
+
@@ -0,0 +1,65 @@
1
+ [build-system]
2
+ requires = ["flit_core>=3.4,<4"]
3
+ build-backend = "flit_core.buildapi"
4
+
5
+ [project]
6
+ name = "dtools.circular-array"
7
+ authors = [
8
+ { name = "Geoffrey R. Scheller", email = "geoffrey@scheller.com" },
9
+ ]
10
+ license = { file = "LICENSE" }
11
+ readme = "README.md"
12
+ requires-python = ">=3.12"
13
+ classifiers = [
14
+ "Development Status :: 5 - Production/Stable",
15
+ "Framework :: Pytest",
16
+ "Intended Audience :: Developers",
17
+ "License :: OSI Approved :: Apache Software License",
18
+ "Operating System :: OS Independent",
19
+ "Programming Language :: Python :: 3.13",
20
+ "Typing :: Typed"
21
+ ]
22
+ dependencies = []
23
+ dynamic = ["version", "description"]
24
+ keywords = [
25
+ "circular array", "circle array", "CA",
26
+ "double ended queue", "dequeue", "dqueue",
27
+ "pop", "push", "popL", "popR", "pushL", "pushR", "indexable",
28
+ "auto-resizing", "auto resizing", "resizing"
29
+ ]
30
+
31
+ [project.optional-dependencies]
32
+ test = ["pytest >=8.3.2"]
33
+
34
+ [project.urls]
35
+ Source = "https://github.com/grscheller/dtools-circular-array"
36
+ Changelog = "https://github.com/grscheller/dtools-circular-array/blob/main/CHANGELOG.md"
37
+ Documentation = "https://grscheller.github.io/dtools-docs/circular-array"
38
+
39
+ [tool.flit.sdist]
40
+ exclude = ["dist", "docs", ".gitignore", ".mypy_cache"]
41
+
42
+ [tool.pylsp-mypy]
43
+ enabled = true
44
+ live-mode = true
45
+ strict = true
46
+ report_progress = true
47
+
48
+ [tool.mypy]
49
+ enable_incomplete_feature = ["NewGenericSyntax"]
50
+
51
+ [tool.pytest.ini_options]
52
+ testpaths = ["tests"]
53
+ consider_namespace_packages = true
54
+
55
+ [tool.ruff]
56
+ target-version = "py313"
57
+
58
+ [tool.ruff.lint.per-file-ignores]
59
+ "__init__.py" = ["F401"]
60
+
61
+ [tool.ruff.format]
62
+ quote-style = "single"
63
+
64
+ [tool.ruff.lint.flake8-quotes]
65
+ docstring-quotes = "double"
@@ -0,0 +1,27 @@
1
+ # Copyright 2016-2025 Geoffrey R. Scheller
2
+ #
3
+ # Licensed under the Apache License, Version 2.0 (the "License");
4
+ # you may not use this file except in compliance with the License.
5
+ # You may obtain a copy of the License at
6
+ #
7
+ # http://www.apache.org/licenses/LICENSE-2.0
8
+ #
9
+ # Unless required by applicable law or agreed to in writing, software
10
+ # distributed under the License is distributed on an "AS IS" BASIS,
11
+ # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12
+ # See the License for the specific language governing permissions and
13
+ # limitations under the License.
14
+
15
+ """### Circular Array
16
+
17
+ Package for an indexable circular array data structure.
18
+
19
+ #### Modules
20
+
21
+ * module dtools.circular_array.ca: circular array Python data structure
22
+
23
+ """
24
+ __version__ = "3.9.0"
25
+ __author__ = "Geoffrey R. Scheller"
26
+ __copyright__ = "Copyright (c) 2023-2025 Geoffrey R. Scheller"
27
+ __license__ = "Apache License 2.0"