semvec/pypi-packages huggingface dataset:
autorok 0.1
Automate sigrok with python-based sigrok-cli wrapper and more!
Requires Python: >=3.8

# Autorok

## Brief overview

Autorok is a python wrapper around sigrok-cli and libsigrok/libsigrok4DSL, which provides all common functionalities
from those binaries/executables.

Allows for easier sigrok automation using Python language, for tasks such as HW testing.

## Supported interfaces

Currently supported interfaces are

- SigrokCLI

Planned interfaces to support are:

- Libsigrok
- Libsigrok4DSL

## Used methodology to create this project

This project is made with technique called "AMDD", which a short form of term 'Agile Model Driven Development'

In summary:

1. Model a thing you want to code

2. Write a test to this model

3. Write implementation against written test which was based on a model

This is basically extension of TDD (Test Driven Development) with architecture/modelling SW stuff. My modelling skills still sucks, but I will get better soon (I hope :) )

Link to AMDD: [Agile Model Driven Development (AMDD): The Key to Scaling Agile Software Development](http://www.agilemodeling.com/essays/amdd.htm)

Corresponding Models folder is available [here](https://git.sr.ht/~khazakar/KhazAkar-AMDD-models)

## Wingware donation

I'm thankful to Wingware for generous donation of their great Wing IDE Pro license for such small project.

Those guys really works their hats off to provide really great experience :)

I highly recommend checking them out!

[Wingware](https://wingware.com)
prajil 0.0.20
this project helps us to calculate square root ,cube root, emrip number,prime number etc
Requires Python: >=3.7

def add(*k):
  s=0
  for i in k:
    s+=i
  return s
#function to add
def iroot(a):
  x=list(map(int,input('enter 1/2 for sqrt, 1/3 for cube root,1/4 for 4th root etc=').replace('/',' ').split()))
  
  v=x[0]/x[1]
  
  
  return a**v
# function for roots
def prime(a):
 if a>1:
   for i in range(2,a//2+1):
     if a%i==0:
       return 'not prime'
       
   else:
    return 'prime'
 else:
   return 'not prime'
# prime
def armstrong(a):
 
  p=len(str(a))
  s=0
  for i in str(a):
    s+=int(i)**p
  if a==s:
    return 'armstrong'
  else:
    return 'not armstrong'
# disarm
def disarm(a):
  
  p=1
  s=0
  for i in str(a):
    s+=int(i)**p
    p+=1
  if a==s:
    return 'disarm'
  else:
    return 'not disarm'

def strongnumber(a):
  x=0
  for i in range(1,a//2+1):
    if a%i==0:
      x+=i
  if x==a:
    return 'strongnumber'
  else:
    return 'not strong'
#strong
      
def special(a):
  sum=0
  for i in str(a):
    fact=1
    
    for k in range(1,int(i)+1):
      fact*=k
      
    sum+=fact
    
  if sum==a:
    return 'special'
  return'not special'



def emrip(a):
  b=a
  a=str(a)
  a=a[::-1]
  if int(a)!=b:
    if prime(int(a))==prime(b):
      if prime(int(a))=='prime':
        return 'emrip'
      return 'not emrip'
    return 'not emrip'
  return 'not emrip'

def spy(a):
  s=0
  m=1
  for i in str(a):
    m*=int(i)
    s+=int(i)
  if m==s:
    return 'spynumber'
  return 'not spynumber'

def help():
  print('''This module is made by prajil,using it u can find emrip number,spynumber,special number,strong number,disarm number,armstrong ,ith root of a number
        import prajil
        prajil.(spy(),emrip(),special(),strongnumber(),disarm(),iroot())''')