# DinarLib #
## What is this? ##
This library simplifies the code
## Intersec ##
A method for finding intersections of an array
def intersec(a,b):
c = []
for element in a:
if element in b:
c.append(element)
return len(c)
## Quick_sort ##
The most optimized array sorting
def partition(sort_nums, begin, end):
part = begin
for i in range(begin+1, end+1):
if int(sort_nums[i][4]) <= int(sort_nums[begin][4]):
part += 1
sort_nums[i], sort_nums[part] = sort_nums[part], sort_nums[i]
sort_nums[part], sort_nums[begin] = sort_nums[begin], sort_nums[part]
return part
def quick_sort(sort_nums, begin=0, end=None):
if end is None:
end = len(sort_nums) - 1
def quick(sort_nums, begin, end):
if begin >= end:
return
part = partition(sort_nums, begin, end)
quick(sort_nums, begin, part-1)
quick(sort_nums, part+1, end)
return quick(sort_nums, begin, end)
## Random_sum ##
The maximum and the sum of the numbers are accepted as input
Allows you to randomly collect numbers in an array that will equal the amount specified in the parameter
def random_sum(n, num_terms = None):
num_terms = (num_terms or random.randint(2, n)) - 1
a = random.sample(range(1, abs(n)), num_terms) + [0, abs(n)]
list.sort(a)
return [a[i+1] - a[i] for i in range(len(a) - 1)]
## Developer ##
https://github.com/ShakhmametovDinar
Raw data
{
"_id": null,
"home_page": "https://github.com/ShakhmametovDinar",
"name": "dinarlib",
"maintainer": null,
"docs_url": null,
"requires_python": ">=3.6",
"maintainer_email": null,
"keywords": "dinar quick_sort intersec",
"author": "FORTUNA287",
"author_email": "shakhmametov1020@gmail.com",
"download_url": "https://files.pythonhosted.org/packages/05/2a/aefc43629c288eeb78b800f919e4c7df8980d1fd4fb70a06807d36e472b1/dinarlib-0.0.2.tar.gz",
"platform": null,
"description": "# DinarLib #\r\n## What is this? ##\r\n\r\nThis library simplifies the code\r\n\r\n## Intersec ##\r\n\r\nA method for finding intersections of an array\r\n\r\n def intersec(a,b):\r\n c = []\r\n for element in a:\r\n if element in b:\r\n c.append(element)\r\n return len(c)\r\n\r\n## Quick_sort ##\r\n\r\nThe most optimized array sorting\r\n\r\n def partition(sort_nums, begin, end):\r\n part = begin\r\n for i in range(begin+1, end+1):\r\n if int(sort_nums[i][4]) <= int(sort_nums[begin][4]):\r\n part += 1\r\n sort_nums[i], sort_nums[part] = sort_nums[part], sort_nums[i]\r\n sort_nums[part], sort_nums[begin] = sort_nums[begin], sort_nums[part]\r\n return part\r\n def quick_sort(sort_nums, begin=0, end=None):\r\n if end is None:\r\n end = len(sort_nums) - 1\r\n def quick(sort_nums, begin, end):\r\n if begin >= end:\r\n return\r\n part = partition(sort_nums, begin, end)\r\n quick(sort_nums, begin, part-1)\r\n quick(sort_nums, part+1, end)\r\n return quick(sort_nums, begin, end)\r\n\r\n## Random_sum ##\r\n\r\nThe maximum and the sum of the numbers are accepted as input\r\nAllows you to randomly collect numbers in an array that will equal the amount specified in the parameter\r\n\r\n def random_sum(n, num_terms = None):\r\n num_terms = (num_terms or random.randint(2, n)) - 1\r\n a = random.sample(range(1, abs(n)), num_terms) + [0, abs(n)]\r\n list.sort(a)\r\n return [a[i+1] - a[i] for i in range(len(a) - 1)]\r\n\r\n## Developer ##\r\n\r\nhttps://github.com/ShakhmametovDinar\r\n\r\n",
"bugtrack_url": null,
"license": null,
"summary": "This library simplifies the code",
"version": "0.0.2",
"project_urls": {
"GitHub": "https://github.com/ShakhmametovDinar",
"Homepage": "https://github.com/ShakhmametovDinar"
},
"split_keywords": [
"dinar",
"quick_sort",
"intersec"
],
"urls": [
{
"comment_text": "",
"digests": {
"blake2b_256": "84c15c2227d66be5c357733de792d3efdd43b549e49fd49e02869b5ca2848eab",
"md5": "b68447eea1c1106ae1f3e6abff034484",
"sha256": "10ada868db01368e6d25fe8b43d6514fd58347500376efa4919ecf5104c0a9b3"
},
"downloads": -1,
"filename": "dinarlib-0.0.2-py3-none-any.whl",
"has_sig": false,
"md5_digest": "b68447eea1c1106ae1f3e6abff034484",
"packagetype": "bdist_wheel",
"python_version": "py3",
"requires_python": ">=3.6",
"size": 3024,
"upload_time": "2024-04-25T20:02:10",
"upload_time_iso_8601": "2024-04-25T20:02:10.085110Z",
"url": "https://files.pythonhosted.org/packages/84/c1/5c2227d66be5c357733de792d3efdd43b549e49fd49e02869b5ca2848eab/dinarlib-0.0.2-py3-none-any.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "052aaefc43629c288eeb78b800f919e4c7df8980d1fd4fb70a06807d36e472b1",
"md5": "21e5fceef514f2832a2e54508a6617f2",
"sha256": "eae0cd7e89deab3c6bfb38b8d5a3655b33500c0c732c1a6558f2a9447628712d"
},
"downloads": -1,
"filename": "dinarlib-0.0.2.tar.gz",
"has_sig": false,
"md5_digest": "21e5fceef514f2832a2e54508a6617f2",
"packagetype": "sdist",
"python_version": "source",
"requires_python": ">=3.6",
"size": 2242,
"upload_time": "2024-04-25T20:02:11",
"upload_time_iso_8601": "2024-04-25T20:02:11.827692Z",
"url": "https://files.pythonhosted.org/packages/05/2a/aefc43629c288eeb78b800f919e4c7df8980d1fd4fb70a06807d36e472b1/dinarlib-0.0.2.tar.gz",
"yanked": false,
"yanked_reason": null
}
],
"upload_time": "2024-04-25 20:02:11",
"github": false,
"gitlab": false,
"bitbucket": false,
"codeberg": false,
"lcname": "dinarlib"
}
JSON