Saravanan666/pypi-org huggingface dataset:
Package: eugeroic
EugeroicTools in Python for keeping a computer display awake.eugeroic
:  (adjective) keeping one awake. Of a wakefulness promoting agent.Sometimes you need to perform a task without the screensaver kicking in, or the display being
suspended entirely. This may be because you are capturing the screen, or because you are running
presentation software, or because you are running a long-running task that you want to monitor
without interaction. This module provides a context manager and a decorator that can be used to
keep the display awake while the block or function is running.Installation$ pip install eugeroicExamplesThewakefulnesscontext manager keeps the computer awake while the block is running:# Keep the computer awake while capturing the screen.

from eugeroic import wakefulness

with wakefulness("Capture the screen"):
    capture_screen(seconds=500)Thestay_awakedecorator keeps the computer awake while the decorated function is running:# Keep the computer awake while capturing the screen.

from eugeroic import stay_awake

@stay_awake("Capture the screen")
def capture_screen(seconds):
    ...How it worksOn Windows calls toSetThreadExecutionStateare used.On macOS IOKit Power Management functions are used.On Linux, an attempt is made to communicate with the desktop environment through D-Bus messages.Note that while every attempt is made to keep the computer and display awake, there is no guarantee
that the display will not be suspended. For example, on macOS, the display will be suspended if the
user locks the screen. On Linux, the display will be suspended if the user switches to a different
virtual terminal. On Windows, the display will be suspended if the user locks the screen or switches
to a different user account.  In particular, on Linux, there is no guarantee that the required D-Bus
messages will be handled by the desktop environment.  In practice though,Eugeroicusually works.MIT LicenseCopyright (c) 2023 Sixty North ASPermission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
Package: eui
euieui means easy UI. It is a fast and simple micro-framework for small browser-based applications.
Python and JS communicate through websocket protocol.installpip install euiexampleStep 1:create python file,main.py:importwebbrowserimporteuidefsay_hello(message):print('receive message from js:',message)eui.js('''(msg) => {alert('receive message from py: ' + msg)}''',message)defstartup_callback():webbrowser.open(f'http://localhost:{eui.get_port()}/static/index.html')handlers={'say_hello':say_hello,'exit':eui.exit}eui.start(handlers=handlers,callback=startup_callback)Step 2:create UI fileindex.htmlinstaticfolder:<!DOCTYPE HTML><html><head><metacharset="utf-8"><title>eui test</title><scriptsrc="eui.js"></script><scripttype="text/javascript">functionsendMessage(){varmessage=document.getElementById('message').value;eui.py('say_hello',message);}</script></head><body><inputid="message"><buttononclick="sendMessage()">Send</button></body></html>Step 3:runmain.pysnapshot:
Package: euilee-lee
euilee-leeA left-handed pitcher for the KIA Tigers.USEpip install euilee-leeimport & callPython3.7.16(default,May242023,10:40:17)[GCC9.4.0]onlinuxType"help","copyright","credits"or"license"formoreinformation.>>>fromeuilee_lee.pitcherimportpic>>>pic()....~!7JYYYYJ?7!:.:!J5PYY5Y?5Y5YYPP5J!.^J5PP55555?75JP5PPPPPP5~.Y555555555JYYY5PPPPPPPP5:!5555555555555555PPPPPPPP?.Y55555555PPPPP5555PPPPPPP5.^55555PG#&#PYJ?7?Y5PPPGGGGP:!P55PB#B5J?!~~!!?JJYYY5PGGG~^G55P55?YY7!!~7?!!Y5YPYJ5G&7^~PJ~~~~~^~~~!~7J7!!!!7??JP#5J:!!?!~~^^^~~!~^!JJ!^~~!7?YPGG7:!?7!~~^~~~!!~7?J!^~~!?J5PP^^!7~~~~~~~~!!!777!!!7?J5J^.^!~~~!????7?JY57~!7?Y~^!~~~~~~~~!!77!!7?Y!77!~~~~~~~!!77?J5J!777!~~~~~!!7JY5P?.!!!77?7????JYYYJY7:!!~~!77777?JJ?77?J:^7!7!!~~~!!!!77?7777?YY?:......J7!7!!~~~~!!!!77!!7?JYJJ^:::..............^?7!~~~~~~!!!!!!!77??JJ~.::::::::.................!??7!!~~!!~~~~!777?J!.:..:....::::.................~?JYJ?7!!~~!7?JJ?^..........:::::..................:~7JJJJJJJ?7~:...........:....:.....................:^!~^:..............::...................................................:.>>>refhttps://wikidocs.net/14https://www.text-image.com/
Package: eukcc
EukCCEukCC is a completeness and contamination estimator for metagenomic assembled
microbial eukaryotic genomes.With version 2, EukCC should provide a better experience than
version 1. We aim at creating a stable package with long term support.
Version 2 is currently under development and using it could lead to unexpected issues. We aim to
release EukCC version 2 soon.Note: Version 2 is not compatible with previous versions, most commandline arguments changed.
So version 2 isnota drop in replacement.DocumentationHead over tohttps://eukcc.readthedocs.io/to check out the documentation.QuickstartHere a super fast overview on how to get started using singularity. For more information
please see the documentation.mkdir eukccdb
cd eukccdb
wget http://ftp.ebi.ac.uk/pub/databases/metagenomics/eukcc/eukcc2_db_ver_1.1.tar.gz
tar -xzvf eukcc2_db_ver_1.1.tar.gz
export EUKCC2_DB=$(realpath eukcc2_db_ver_1.1)
singularity pull docker://microbiomeinformatics/eukcc

singularity exec eukcc2_latest.sif eukcc single -hGet the containerGet EukCC quickly by fetching the container [Container repro will change soon]docker pull microbiomeinformatics/eukcc
singularity pull docker://microbiomeinformatics/eukccIf you installed version 2: make sure to also fetch the database for version 2:http://ftp.ebi.ac.uk/pub/databases/metagenomics/eukcc/Don't use EukCC on already pubished dataOr at least not without thinking about it:You should not use EukCC on already published genomes, if they have used during training of the marker
gene sets. If you want to make sure, you can see all used accessions in the database filedb_base/backbone/base_taxinfo.csv.CiteIf you use EukCC make sure to cite:Saary, Paul, Alex L. Mitchell, and Robert D. Finn. 
"Estimating the quality of eukaryotic genomes recovered from metagenomic analysis with EukCC." 
Genome biology 21.1 (2020): 1-21.EukCC also uses metaEUK, hmmer, pplacer, ete3 and epa-ng.Changed compared to EukCC 1Users can set the prevalence threshold  for marker sets. In EukCC 1
this was fixed to 98% single copy prevalence.  Now users could change that to be more strict.
We find that often 100% single copy prevalence can be found.Issues and bugsPlease report any bugs and issues here on GitHub. Make sure to
include the debug log (run eukcc using--debugflag).used exit codes200: File not found201: No Marker gene set could be defined202: No database provided203: Corrupted file222: Invalid settings
Package: eukfindertest2
Eukfinderproject_descriptionExplore the docs »View Demo·Report Bug·Request FeatureTable of ContentsAbout The ProjectBuilt WithGetting StartedPrerequisitesInstallationUsageRoadmapContributingLicenseContactAcknowledgmentsAbout The ProjectGetting StartedThis is an example of how you may give instructions on setting up your project locally.
To get a local copy up and running follow these simple example steps.PrerequisitesThis is an example of how to list things you need to use the software and how to install them.npmnpminstallnpm@latest-gInstallation(back to top)UsageEukfinder read_prepusage: Eukfinder read_prep [-h] --r1 R1 --r2 R2 -n THREADS -i ILLUMINA_CLIP
--hcrop HCROP -l LEADING_TRIM -t TRAIL_TRIM --wsize
WSIZE --qscore QSCORE --mlen MLEN --hg HG -o
OUT_NAME --cdb CDBoptional arguments:
-h, --help            show this help message and exitRequired arguments:
Description--r1 R1, --reads-r1 R1    left reads--r2 R2, --reads-r2 R2    right reads-n THREADS, --threads THREADS     number of threads-i ILLUMINA_CLIP, --illumina-clip ILLUMINA_CLIP     adaptor file--hcrop HCROP, --head-crop HCROP    head trim-l LEADING_TRIM, --leading-trim LEADING_TRIM    leading trim-t TRAIL_TRIM, --trail-trim TRAIL_TRIM    trail trim--wsize WSIZE, --window-size WSIZE    sliding window size--qscore QSCORE, --quality-score QSCORE     quality score for trimming--mlen MLEN, --min-length MLEN    minimum length--hg HG, --host-genome HG     host genome to get map out-o OUT_NAME, --out_name OUT_NAME    out name--cdb CDB, --centrifuge-database CDB    path to centrifuge databaseRoadmap(back to top)ContributingContributions are what make the open source community such an amazing place to learn, inspire, and create. Any contributions you make aregreatly appreciated.If you have a suggestion that would make this better, please fork the repo and create a pull request. You can also simply open an issue with the tag "enhancement".
Don't forget to give the project a star! Thanks again!(back to top)LicenseDistributed under the MIT License. SeeLICENSE.txtfor more information.(back to top)ContactAcknowledgments(back to top)
Package: euklid
# Euklid [2D and 3D vector operations][![PyPI version](https://badge.fury.io/py/euklid.svg)](https://badge.fury.io/py/euklid)A c++ library with bindings for python to help dealing with common CAD-like operations:[Vectors](./src/vector/README.md)[PolyLines](./src/polyline/README.md)[Spline Curves](./src/spline/README.md)## Installation### install via pip:pip install euklid### Compile from source:` bash git clonehttps://github.com/airgproducts/euklidcd euklid git submodule init git submodule update pip install . `
Package: eulcommon
packagedocumentationcodeEULcommon is aPythonmodule with a few
small utilities that might be useful to others, but were not large or
significant enough to warrant splitting out into their own
repositories at this time.  These components may be broken out at a
later date.eulcommon.binfileprovides the capability to map arbitrary binary
data into a read-only python object.eulcommon.djangoextrasconsists of a small number of extensions
and add-ons for use withDjango,
such as custom auth decorators, additional form fields, and additional
HTTP responses.Contact Informationeulcommonwas created by the Digital Programs and Systems Software
Team ofEmory University Libraries.libsysdev-l@listserv.cc.emory.eduLicenseeulcommonis distributed under the Apache 2.0 License.Developer NotesTo install dependencies for your local check out of the code, runpip installin theeulcommondirectory (the use ofvirtualenvis recommended):pip install -e .If you want to run unit tests or build sphinx documentation, you should also
install development dependencies:pip install -e . "eulfedora[dev]"Unit TestsUnit tests can be run withpy.test, and include options for
generating xml and coverage reports for continuous integration:py.test --junitxml=unittests.xml --cov=eulcommonDevelopment HistoryFor instructions on how to see and interact with the full development
history ofeulcommon, seeeulcore-history.
Package: eule
Euler's diagrams are non-empty Venn's diagrams. For further information about:the library: on URLhttps://eule.readthedocs.io;Euler diagrams: on wikipedia articlehttps://en.wikipedia.org/wiki/Euler_diagramMotivationHow to installWe run the command on desired installation environment:pip install euleMinimal exampleClick to unfold usageWe run commandpython example.pyon the folder with fileexample.pyand following content:#!/usr/bin/env python
from eule import euler, euler_keys, euler_boundaries, Euler

sets = {
    'a': [1, 2, 3],
    'b': [2, 3, 4],
    'c': [3, 4, 5],
    'd': [3, 5, 6]
}

euler_diagram = euler(sets)
euler_keys = euler_keys(sets)
euler_boundaries = euler_boundaries(sets)
euler_instance=Euler(sets)

# Euler dictionary:
# {'a,b': [2], 'b,c': [4], 'a,b,c,d': [3], 'c,d': [5], 'd': [6], 'a': [1]}
print(euler_diagram)
print(euler_instance.as_dict())

print('\n')

# Euler keys list:
# ['a,b', 'b,c', 'a,b,c,d', 'c,d', 'd', 'a']
print(euler_keys)
print(euler_instance.euler_keys())

print('\n')

# Euler boundaries dictionary:
# {
#   'a': ['b', 'c', 'd'],
#   'b': ['a', 'c', 'd'],
#   'c': ['a', 'b', 'd'],
#   'd': ['a', 'b', 'c']
# }
print(euler_boundaries)
print(euler_instance.euler_boundaries())

print('\n')

# Euler instance match:
# {'a'}
# {'a', 'b'}
# {'c', 'a', 'b'}

print(euler_instance.match({1,2,3}))
print(euler_instance.match({1,2,3,4}))
print(euler_instance.match({1,2,3,4,5}))

print('\n')

# Euler instance getitem dunder:
# [1, 2, 3]
# [1, 2, 3]
# [1, 2, 3, 4]
# [1, 2, 3, 4, 5]
print(euler_instance['a'])
print(euler_instance[('a', )])
print(euler_instance[('a', 'b', )])
print(euler_instance[('a', 'b', 'c',)])

print('\n')

# Euler instance remove_key:
euler_instance.remove_key('a')
print(euler_instance.as_dict())
Package: eulerdg
#本程序由高端设计编写，需要引用或者有建议请联系邮箱1481407566@qq.com#本程序模拟二代测序后的DNA碎片拼接过程，使用通常的暴风(brute force)算法耗费较多计算机算力
#本程序使用欧拉回路算法加以个人改进，意图提供有竞争力的运算速度
Package: euler-helper
Some useful functions that are helpful in completing Project Euler (projecteuler.net) problems.# DescriptionThis package contains 10 modules
* divisors(n): returns a list of divisors of net
* prime_factors(n): returns a list of the prime factors of net
* is_prime(n): check if n is prime
* sieve_of_eratosthenes(n): returns a list of all prime numbers < n
* is_palindrome(n): checks if n is a palindromic numbers
* is_pandigital(n): n is a m-digit pandigital number if it contains all digits 1-m exactly once
* is permutation(a, b): checks if a and b are permutations of each other
* coprime(a, b): check if a and b are coprime
* totient(n): returns Euler’s totient functions
* generalized_hamming(x, n): Checks if integer x has no prime factors larger than n# Installation`bash pip install euler_helper `
Package: eulerlib
eulerlibis a library of recreational mathematics and number theory related
functions inspired byProject Euler. Available functions include:Prime number generationDivisor functions (sigma functions)Euler’s totient functionGreatest Common Divisor (GCD) using Euclid’s algorithmLeast Common Multiple (LCM)Integer square rootFibonacci numbersPandigital numbersPalindrome numbersPythagorean triplesFunctions from this library can be used to solve recreational mathematics and
programming problems such as problems in Project Euler.Installationeulerlibis avalaible through Python Package Index (PyPI) usingpip.>>> pip install --upgrade eulerlibTo uninstall usingpip.>>> pip uninstall eulerlibUsageIn Python console you can import functions/classes from eulerlib as needed.>>> from eulerlib import primes
>>> p10 = primes(10)
>>> print(p10)
[2, 3, 5, 7]TheDivisorsclass implements functions related to prime factorization,
sigma functions etc.>>> from eulerlib import Divisors
>>> mydiv = Divisors(10000)
>>> div84 = mydiv.divisors(84) #divisors of 84
>>> print(div84)
[1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84]
>>> pf840 = mydiv.prime_factors(840) # prime factors of 840
>>> print(pf840)
[(2, 3), (3, 1), (5, 1), (7, 1)]Example: SolvedProject Eulerproblem 3.from eulerlib import is_square, primes
#get approximate square root of number since
#largest prime factor < sq. root
(is_sq, sqroot) = is_square(600851475143L)
#get a list of primes less than the approx. square root.
test_primes = primes(sqroot + 1L)
#test the primes from the list to find the largest factor
len_p = len(test_primes)
for i in range(1,len_p+1):
    j = 0 - i
    test_fact = test_primes[j]
    if 600851475143L%test_fact == 0:
        break
answer = test_fact #Set the answerSee completedocumentation.Modulesprime_numbers.pyFunctions to generate lists of primes.numtheory.pyEuler’s divisor functions (sigma funtions)Euler’s totient function (phi function)Prime factors of a numberDivisors of a numberGreatest Common Divisor (GCD)Least Common Multiple (LCM)Digital root and digital sum of a numberfibonacci.pyFunctions related to the Fibonacci sequence.pythagoras.pyFunctions related to Pythagorean triples.etc.pyMiscellaneous functions:Pandigital numbersConversion from decimal to base n (2-36)Number to lists and vice versaPalindrome numbersDevelopmentSource code repositories (GitHub,BitBucket) are available.Bug reportsand suggestions are most welcome.Licenseeulerlib is licensed underApache License 2.0.
Package: euler-maths
Euler MathsDescriptionA collection of useful functions for mathematical calculations, mostly concerned with prime numbers and basic algebra on natural numbers.Key featuresPrime number sievePrimality testPrime factors sieveEuler's totient functionMobius functionModular inverseMotivationThe functions contained here are commonly used in solvingProject Eulerproblems.Note: These are NOT solutions to any particular problem.Module DependenciesTo improve execution speed and memory usage, many of the functions take advantage of either:NumpyBitarrayContentsprimes(N)- Performs prime sieve and returns an array of primes <N.primes_iter(N)- Rerforms prime sieve and returns bitarray iterator of primes <N.prime_factors(N)- Returns array of unique prime factors for each number < N.is_prime(n)- Determines if n is prime (utilising the Miller-Rabin test for large values).euler_totients(N)- Returns an array with value of Euler's totient function for numbers <N.euler_totient(n, prime_factors)- Calculates Euler's totient function of n given a list of its prime factors.mobius_array(N)- Returns an array with value of the Mobius function for numbers <N.square_free(N)- Counts of the number of square-free values <N.modular_inverse(a, n)- Computes the inverse of a modulo n.isqrt2- Integer square-root function compatible with Numba.InstallationThe package can be installed from PyPI by running:pipinstalleuler-mathsUsageOnce installed, simply import the module and use the functions it provides.importeuler_mathseuler_maths.primes(10)# array([2, 3, 5, 7])euler_maths.euler_totients(10)# [0, 0, 1, 2, 2, 4, 2, 6, 4, 6]Improving Performance at RuntimeThe functions using native Python and Numpy are designed to be compatible with theNumba's JIT compiler. The only exception isprimes_iter, which uses the Bitarray module and is not compatible with Numba.When dealing with large enough values, Numba can significantly improve execution speed compared to vanilla Python. To take advantage of this in your script, use thenumba.njitdecorator on the desired function.
Package: eulerpi
Eulerian Parameter Inference (EPI) is a powerful and novel method for inverse model parameter inference. The eulerpi package provides an implementation of the EPI algorithm, which takes observed data and a model as input and returns a parameter distribution consistent with the observed data by solving the inverse problem directly. In case the model describes a one-to-one mapping between parameters and simulation results, the inferred parameter distribution is the true underlying distribution.DocumentationThe full documentation of this software, including a detailed tutorial on how to use EPI and the api documentation, can be found underDocumentation.FeaturesEPI supportsSBML ode modelsUser provided modelsModels with automatic differentiation using jaxInstallationThe package is available on pypi and can be installed with:pipinstalleulerpiorpipinstalleulerpi[sbml]for the support of sbml models.Make sure that you have the following C++ libraries installedsudoaptinstall-yswiglibblas-devlibatlas-base-devlibhdf5-devYou can also build the library from the latest source code by following theDevelopment Quickstart Guide.Using the libraryTo use EPI, derive your model from theModelclass and implement the abstract functions. Here's an example code snippet:# my_model.pyimportjax.numpyasjnpfromeulerpi.core.modelimportModelclassMyModel(Model):param_dim=N# The dimension of a parameter pointdata_dim=M# The dimension of a data pointdefforward(self,param):returnjnp.array(...)defjacobian(self,param):returnjnp.array(...)To evaluate the model and infer the parameter distribution, call:fromeulerpi.samplingimportinferencefrommy_modelimportMyModel# This line is needed for multiprocessing in pythonif__name__=="__main__":central_param=np.array([0.5,-1.5,...])param_limits=np.array([[0.0,1.0],[-3.0,0.0],...])model=MyModel(central_param,param_limits)inference(model=model,data="my_data.csv")Thedataargument can be a numpy-2d-array or a PathLike object that points to a CSV file. In the example shown above, the CSV filemy_data.csvshould contain the data in the following format:datapoint_dim1, datapoint_dim2, datapoint_dim3, ..., datapoint_dimN
datapoint_dim1, datapoint_dim2, datapoint_dim3, ..., datapoint_dimN
datapoint_dim1, datapoint_dim2, datapoint_dim3, ..., datapoint_dimN
...
datapoint_dim1, datapoint_dim2, datapoint_dim3, ..., datapoint_dimNThis corresponds to a matrix with the shapenSamples x data_dim. For more available options and parameters for theinferencemethod, please refer to theapi documentation. Note that the inference can be done with grid-based methods (dense grids, sparse grids) or sampling methods (mcmc).The results are stored in the following location:./Applications/<ModelName>/.../OverallParams.csv./Applications/<ModelName>/.../OverallSimResults.csv./Applications/<ModelName>/.../OverallDensityEvals.csvThese files contain the sampled parameters, the corresponding data points obtained from the model forward pass, and the corresponding density evaluation.
Package: eulertools
eulertools: Multilanguage competitive coding toolboxeulertoolsoffers a tool to run/test/compare problems in for
competitive programming, or interview preparation, for example fromProject Euler,leetcode,topcoderand others.Featureseulertoolsprovides a cli command calledeulerto run, test, and time your solutions.eulertoolshave miminal requirements on the project stucture, and is able to compare
the timings between solutions in different languages.For the required project structure, installation instructions, and usage,
please view the detailedDocumentation.LinksDocumentationChangelog