Skip to main content

Simple toolset with Python type hints made to deserve some needs on some Python projects.

Project description

Python tools

Simple toolset with Python type hints made to deserve my needs on some Python projects.

Both Python anc C++ implementations are in plans:

  • Any Python implementation is cross-platform but achieves less average performance goals
  • C++ implementations are currently supported only for Linux and provided in this repository in two ways:
    • Prebuilt .so files, so in average case you can just "git clone" and use Cxx-implemented classes in Python project
    • Source code (try your luck and build it for Windows)

Have fun!

If you find this code useful, I will be glad if you use it in your GPL3-compatible licensed project.

"Why GPL-3. Author, are you too proud?"

Nope. It's just that I'm fighting for free software, and any possibility that someone else is using my code on a project that people, myself included, will have to pay for is unacceptable. My code is neither perfect nor revolutionary. But the world is crazy, you know

Any help and criticism is greatly appreciated.

Installation

The package is currently presented on TestPyPi.

pip install -i https://test.pypi.org/simple/ easy-pytools

Roadmap

  • SQL shit (Oh God. PYTHON ONLY) see docs
    • Basic Table operations
      • Single table CREATE
      • Single table INSERT
      • Single table SELECT
      • Single table UPDATE
      • GROUP BY expressions
    • Basic Table compositions
      • Automatical INNER JOIN on foreign keys
      • Cartesian product
      • SELECT from table composition
      • Treat Composition as Table
    • Advanced Table operations
      • WHERE selection
      • Ordering
      • Aggregate functions
      • HAVING section with auto-detection inside WHERE
    • Views
    • Other SQL shit
      • Convert JSON-like data mappings to DBase, Table etc
      • Convert DBase, Table to data mappings
  • Pseudo structures
    • Stack (C++)
    • Queue (C++)
    • Prioritized Queue
      • Python
      • C++
  • Basic data structures see docs
    • Plain
      • LinkedList
        • Python
        • C++
      • LinkedList with O(1) index access (C++)
    • Trees
      • Tree of arbitrary objects
        • Python
        • C++
      • Binary tree with post-insertion balance
        • Python
        • C++
      • Prefix tree for sequential search
        • Python
        • C++
      • Red-black tree
        • Python
        • C++
      • AVL tree
        • Python
        • C++
      • B+ tree
        • Python
        • C++
    • Graphs
      • Graph (Python)
      • Oriented graph (Python)
      • Network with flows (Python)
  • Class and object enhancements
    • DataTransferObject class decorator (Python) see docs

Requirements

Python implementations require the following:

  • Python >= 3.10 < 4.0

C++ implementations require the following to be built:

  • Cmake >= 3.20
  • PythonLibs >= 3.10
  • Boost with Python package

SQL shit

Database, Table and Query wrapper for SQLite with syntax inspired by Numpy.

Motivation

Also known as "Why am I going to use your shit instead of SQL shit?"

Just compare theese two equal operations:

SQL shit

SELECT 
        Users.name,Cars.model,Vendors.country 
        FROM (((Users INNER JOIN User_Car ON Users.id = User_Car.user_id) INNER JOIN Cars ON Cars.reg = User_Car.car_reg) INNER JOIN Vendors ON Vendors.id = Cars.vendor_id) WHERE (((Vendors.country = "Russia") OR (Vendors.country = "US")));

My sql shit

(users & user_car & cars & vendors)['name', 'model', 'country'] == ((),(),("Russia", "US"))
# or with equal method-powered syntax:
users.INNER(user_car).INNER(cars).INNER(vendors).SELECT(['name', 'model', 'country']).WHERE_EQ(((),(),("Russia", "US")))

Quick Start

1. Find or create your SQLite dababase file

from easy_pytools.sql import DBase

your_base = DBase("tests/sql_test.sql")

2. Get existing tables names

your_base.tables

3. Create new table

create table schema

Let us imagine that there is already Vendors table with primary key 'id'

schema = {
    "id": "integer primary key autoincrement",
    "name": "varchar(20)",
    "vendor_id": "integer",
    "foreign key(vendor_id)":"references Vendors(id)"
}

create new table

printers = your_base.new_table("Printers", schema)

Now the 'printers' variable references to 'Table' object that provides all the SQL shit for the 'Printers' table of database.

printers
Table<Printers of tests/sql_test.sql>

4. Get existing table from base

vendors = your_base.table("Vendors")

Now the 'vendors' variable references to 'Table' object that provides all the SQL shit for the 'Vendors' table of database.

vendors
Table<Vendors of tests/sql_test.sql, Real>

5. Get information about table

printers.fields
{
    'Printers.id': Field<0, id, INTEGER of Table<Printers of tests/sql_test.sql, Real>>,
    'Printers.name': Field<1, name, varchar(20) of Table<Printers of tests/sql_test.sql, Real>>,
    'Printers.vendor_id': Field<2, vendor_id, INTEGER of Table<Printers of tests/sql_test.sql, Real>>
}

printers.foreign_keys
{
    'Printers.vendor_id': TableFK<Field<2, vendor_id, INTEGER of Table<Printers of tests/sql_test.sql, Real>> -> Field<0, id, INTEGER of Table<Vendors of tests/sql_test.sql, Real>>>
}

printers.foreign_tables
{
    Table<Vendors of tests/sql_test.sql, Real>
}

6. Add rows to table

printers << {"name":"Canon L100", "vendor_id": 1}
printers << {"name":"Canon L200", "vendor_id": 1}
# or use instant method call:
printers.INSERT({"name":"Canon L200", "vendor_id": 1})

Foreign Key constraints checked as long as Python sqlite3 checks them.

Also, if your table has no Primary Keys with Autoincrement, you can add rows as tuples:

table << (10, "Hello", 20)

In that case values order must match fields order of table.

7. Select from table

printers[:]()
[
    (1, 'Canon L100', 1),
    (2, 'Canon L200', 1)
]

printers['name']()
# or use instant method call:
printers.SELECT(['name'])()
[
    ('Canon L100',)
    ('Canon L200',)
]

7.1. Ordering

You can order selected rows by fields with following syntax:

printers[:] / ('name',)
# or with instant method call:
printers[:].ORDERBY(('name',))

7.2. Grouping

You can group selected rows by fields with following syntaxL

printers[:] % ('country',)
# or with instant method call:
printers[:].GROUPBY(('country',))

8. Table compositioning

Any table composition result is 'Table' object with some restrictions.

So you can, f.ex., select from table composition just as from real table.

Cartesian product

printers_vendors = printers * vendors
# or with instant method call:
printers_vendors = printers.AND(vendors)

printers_vendors
Table<Printers_x_Vendors of tests/sql_test.sql, Composition>
printers_vendors[:]()
[(1, 'Canon L100', 1, 1, 'Tayouta', 'Japan'),
 (1, 'Canon L100', 1, 2, 'Lada', 'Russia'),
 (1, 'Canon L100', 1, 3, 'KAMAZ', 'Russia'),
 (2, 'Canon L200', 1, 1, 'Tayouta', 'Japan'),
 (2, 'Canon L200', 1, 2, 'Lada', 'Russia'),
 (2, 'Canon L200', 1, 3, 'KAMAZ', 'Russia')]

JOIN tables

Joining tables may be done two ways:

  • automatical join on foreign key with cute syntax
  • join on any keys equalities with method

INNER JOIN

# Foreign key to composite tables will be automatically detected
# Otherwise exception will be thrown:
printers_vendors = printers & vendors
# or use instant method call:
printers_vendors = printers.INNER(vendors)
# ...you can even manually specify keys to join table:
printers_vendors = printers.join(vendors, 'INNER', printers.f_vendor_id, vendors.f_id)

printers_vendors
Table<Printers_INNER_Vendors of tests/sql_test.sql, Composition>
printers_vendors.fields
{'Printers.id': Field<0, id, INTEGER of Table<Printers of tests/sql_test.sql, Real>>,
 'Printers.name': Field<1, name, varchar(20) of Table<Printers of tests/sql_test.sql, Real>>,
 'Printers.vendor_id': Field<2, vendor_id, INTEGER of Table<Printers of tests/sql_test.sql, Real>>,
 'Vendors.id': Field<0, id, INTEGER of Table<Vendors of tests/sql_test.sql, Real>>,
 'Vendors.name': Field<1, name, varchar(20) of Table<Vendors of tests/sql_test.sql, Real>>,
 'Vendors.country': Field<2, country, varchar(20) of Table<Vendors of tests/sql_test.sql, Real>>}
printers_vendors[:]()
[
    (1, 'Canon L100', 1, 1, 'Tayouta', 'Japan'),
    (2, 'Canon L200', 1, 1, 'Tayouta', 'Japan')
]

LEFT JOIN

# Foreign key to composite tables will be automatically detected
# Otherwise exception will be thrown:
printers_vendors = vendors - printers
# or use instant method call:
printers_vendors = printers.LEFT(vendors)
# ...or you can manually specify keys to join table:
printers_vendors = vendors.join(printers, 'LEFT', printers.f_id, printers.f_vendor_id)

printers_vendors
Table<Printers_LEFT_Vendors of tests/sql_test.sql, Composition>
printers_vendors.fields
{'Printers.id': Field<0, id, INTEGER of Table<Printers of tests/sql_test.sql, Real>>,
 'Printers.name': Field<1, name, varchar(20) of Table<Printers of tests/sql_test.sql, Real>>,
 'Printers.vendor_id': Field<2, vendor_id, INTEGER of Table<Printers of tests/sql_test.sql, Real>>,
 'Vendors.id': Field<0, id, INTEGER of Table<Vendors of tests/sql_test.sql, Real>>,
 'Vendors.name': Field<1, name, varchar(20) of Table<Vendors of tests/sql_test.sql, Real>>,
 'Vendors.country': Field<2, country, varchar(20) of Table<Vendors of tests/sql_test.sql, Real>>}
printers_vendors[:]()
[
    (1, 'Canon L100', 1, 1, 'Tayouta', 'Japan'),
    (2, 'Canon L200', 1, 1, 'Tayouta', 'Japan'),
    (None, None, None, 2, 'Lada', 'Russia'),
    (None, None, None, 3, 'KAMAZ', 'Russia')
]

FULL OUTER JOIN

Is supported by my lib, but not supported by Python sqlite3. When Python's sqlite3 achieves this support, my lib will work out-of-the-box with that.

printers_vendors = printers ^ vendors
printers_vendors = printers.FULL(vendors)

9. Field access

You can access fields from tables. It is useful, f.ex, if you want to use join method, which requires TableField object as ref, not string field name.

Any field within table can be accessed as TableField reference with that syntax:

table.f_<field_name>

F.ex:

printers.f_name
Field<1, name, varchar(20) of Table<Printers of tests/sql_test.sql, Real>>

If your field name is, f.ex, "f_count", access it this way:

table.f_f_count

10. Selection coditions

There are two ways to combine and specify selection conditions:

  • AND combination of conditions is a list of conditions;
  • OR combinations is a tuple of conditions;

To limit rows with field value, you have to specify conditions for all fields mentioned in selection.

Empty tuple means no limitation ob field.

There are several condition types:

  • Greater -- ">" operator (or WHERE_GT method)
  • Equals -- "==" operator (or WHERE_EQ method)
  • Lesser -- "<" operator (or WHERE_LT metho)

To limit selection, use one of theese operators with selection on left and limitation on right:

# Selection with 'country' from vendors without limitations:
vendors['country']
# Selection with 'country' and value limitations
vendors['country'] == ("Russia",)
vendors['country'].WHERE_EQ(("Russia",))
# or even such:
vendors.SELECT(['country']).WHERE_EQ(("Russia",))

# Select country, id from vendors where country = "Russia" or id = 2:
vendors['country', 'id'] == ("Russia", 2)
vendors['country', 'id'].WHERE_EQ(("Russia", 2))

# Select country, id from vendors where country = "Russia" and id = 2:
vendors['country', 'id'] == ['Russia', 2]
vendors['country', 'id'].WHERE_EQ(["Russia", 2])

# Select id, country from vendors where country = "Russia" or country = "Japan":
vendors['id', 'country'] == [(), ("Russia","Japan"),]
vendors['id', 'country'].WHERE_EQ([(), ("Russia","Japan"),])

# Select id, country, name from vendors where (country = "Russia" or country = "Japan") or (id = 10)
vendors['id', 'country'] == (10, ("Russia","Japan"),)
vendors['id', 'country'].WHERE_EQ((10, ("Russia","Japan"),))

# Select id, country, name from vendors where (country = "Russia" or country = "Japan") and (id = 10 or id = 20)
vendors['id', 'country'] == [(10, 20), ("Russia","Japan"),]
vendors['id', 'country'].WHERE_EQ([(10, 20), ("Russia","Japan"),])

You can also combine different comparisons with AND operator:

# select id, country from vandors where (id = 10 or country = "Japan") AND (id < 20):
(vendors['id'] == (10, "Japan")) < (20,)
# these two are equal to each other and to the previous one
vendors['id'].WHERE_EQ((10, "Japan")).WHERE_LT((20,))
vendors['id'].WHERE_EQ((10, "Japan")).AND.WHERE_LT((20,))

To combine different comparisons with OR, use special property:

# select id, country from vandors where (id = 10 or country = "Japan") OR (id < 20):
(vendors['id'] == (10, "Japan")).OR < (20,)
vendors['id'].WHERE_EQ((10, "JAPAN")).OR.WHERE_LT((20,))

Note, that every selection is a SelectQuery object. To select values from database, call selection:

vendors[:]
SELECT 
        Vendors.id,Vendors.name,Vendors.country 
        FROM Vendors ;

vendors[:]()
[(1, 'Tayouta', 'Japan'), (2, 'Lada', 'Russia'), (3, 'KAMAZ', 'Russia')]

q = vendors['id', 'name'] > (1,)
# or use a method:
q = vendors['id', 'name'].WHERE_GT((1,))

q
SELECT 
        Vendors.id, Vendors.name 
        FROM Vendors WHERE ((Vendors.id > 1));
q()
[(2, 'Lada'), (3, 'KAMAZ')]

11. Update values in table

As for now, UPDATE operation is very similar to SELECT: you have to select rows to update and specify fields to update in selected rows.

So, update syntax is very similar to insert syntax, just for SelectQuery instead of Table:

# Update values with tuple. You must specify all values in same order as they are in selection:
(vendors['name'] == ("Tayouta",)) << ("Tamoyo",)
(vendors['name'].WHERE_EQ(("Tayouta",))) << ("Tamoyo",) # etc..

# Wrong assignment type, throws exception:
vendors['id'] == (10,)) << ("Tamoyo",) # Exception
# Wrong assignment shape, throws exception:
vendors['id', 'name'] == ((10, 2),)) << ("Tamoyo",) # Exception
# Gaps are NOT SUPPORTED due to a logical deviation of operation:
vendors['id', 'name'] == ((10, 2),)) << ((), "Tamoyo",) # Excption

# Update values with dict. You can specify any field assignment:
(vendors['id'] == ((2, 3),)) << {"name": "Tamoyo"}
(vendors['id', 'name'] == ((2, 3),)) << {"name": "Tamoyo"}

12. Aggregate functions

Aggregate functions are available in separate submodule:

from easy_pytools.sql.aggregate import *

Use aggregates instead of regular field names in selection query:

(printers & vendors)[COUNT('Vendors.name')]

# or you can use group by expressions as well:
(printers & vendors)[COUNT('Vendors.name'), 'country'] % ('country',)
(printers & vendors)[COUNT('Vendors.name'), 'country'].GROUPBY(('country',))

12.1. Aggregate function selection conditions

Just set conditions like to regular fields, selection object would automatically detect calculated fields and put them to HAVING section of query:

((printers & vendors)[COUNT('Vendors.name'), 'country'] % ('country',)) == [2, ("Japan", "Russia")]
(printers & vendors)[COUNT('Vendors.name'), 'country'].GROUPBY(('country',)).WHERE_EQ([2, ("Japan", "Russia")])
SELECT 
        COUNT(Vendors.name),Vendors.country 
        FROM (Printers INNER JOIN Vendors ON Vendors.id = Printers.vendor_id) WHERE (((Vendors.country = "Japan") OR (Vendors.country = "Russia"))) GROUP BY Vendors.country HAVING ((COUNT(Vendors.name) = 2));

Advanced stuff

Convert your data mapping to a DBase or Table

You can automatically create Table or even a DBase from existing JSON-like data with parsing submodule.

Available conversions:

  • Convert Python type to SQL type with python_to_sql_type function
  • Convert data map to Table schema with map_to_schema function
  • Convert Sequence of data maps to Table schema with seq_to_schema function
  • Convert Sequence of data maps to Table with seq_to_table function
  • Convert Map of Sequences of data maps to DBase with map_to_base function

let me show you some examples:

from easy_pytools.sql.parsing import python_to_sql_type, map_to_schema, seq_to_schema, seq_to_table, map_to_base

Type parsing:

python_to_sql_type(12.4), python_to_sql_type("Hello")
"REAL", "TEXT"

Map to table schema:

data = {'name': "Vasya", 'age': 12.5}
map_to_schema(data)
{'name': 'TEXT', 'age': 'REAL'}

Sequence to schema:

data = [
    {'name': "Vasya", 'age': 12.5},
    {'name': "Markus", 'age': 12.5, 'sex':"M"},
    {'name': "Jane", 'age': 12.5, 'email':"v@om"}
]
seq_to_schema(data)
{'id': 'INTEGER PRIMARY KEY AUTOINCREMENT',
 'name': 'TEXT',
 'age': 'REAL',
 'sex': 'TEXT',
 'email': 'TEXT'}
data = [
    {'pass':10298, 'name': "Vasya", 'age': 12.5},
    {'pass':2839, 'name': "Markus", 'age': 12.5, 'sex':"M"},
    {'pass':819279, 'name': "Jane", 'age': 12.5, 'email':"v@om"}
]
seq_to_schema(data, primary_field='pass')
{'pass': 'INTEGER PRIMARY KEY',
 'name': 'TEXT',
 'age': 'REAL',
 'sex': 'TEXT',
 'email': 'TEXT'}

Data to Table:

Let us imagine that 'db' is a instance of existing DBase

data = [
    {'pass':10298, 'name': "Vasya", 'age': 12.5},
    {'pass':2839, 'name': "Markus", 'age': 12.5, 'sex':"M"},
    {'pass':819279, 'name': "Jane", 'age': 12.5, 'email':"v@om"}
]

table = seq_to_table(db, 'Users', data)

table
table.fields
Table<Users of d.sb, Real>

{'Users.id': Field<0, id, INTEGER of Table<Users of d.sb, Real>>,
 'Users.pass': Field<1, pass, INTEGER of Table<Users of d.sb, Real>>,
 'Users.name': Field<2, name, TEXT of Table<Users of d.sb, Real>>,
 'Users.age': Field<3, age, REAL of Table<Users of d.sb, Real>>,
 'Users.sex': Field<4, sex, TEXT of Table<Users of d.sb, Real>>,
 'Users.email': Field<5, email, TEXT of Table<Users of d.sb, Real>>}

Data to Dbase:

data = {"Users": [{"name": "Vasya", "age": 30, "email": "vasyan@com"},
                  {"name": "Petya", 'age': 42},],
        "Cars": [{'model': 'Lada v1'},
                 {'model': 'KAMAZ'},
                 {'model': 'Logan x590'}],
        }

db = map_to_base("mybase.sql", data)

db
db.tables
DBase<test.sql>

{'Cars', 'Users', 'sqlite_sequence'}

Convert Table of DBase to data mapping

Get schema of table

from easy_pytools.sql.parsing import table_to_schema

table_to_schema(printers)
{
    'id': 'INTEGER NOT NULL PRIMARY KEY',
    'name': 'varchar(20) NOT NULL ',
    'vendor_id': 'INTEGER NOT NULL ',
    'foreign key(vendor_id)': 'references Vendors(id)'
}

Extract data from Table

from easy_pytools.sql.parsing import table_to_list

table_to_list(printers)
[
    {'id': 1, 'name': 'Canon L100', 'vendor_id': 1},
    {'id': 2, 'name': 'Canon L200', 'vendor_id': 1}
]

Extract data from DBase

from easy_pytools.sql.parsing import base_to_dict

base_to_dict(db)
{
  'sqlite_sequence': [
    {'name': 'Vendors','seq': 4},
    {'name': 'Users','seq': 4},
    {'name': 'Printers','seq': 2}
  ],
  'Printers': [
    {'id': 1,'name': 'Canon L100','vendor_id': 1},
    {'id': 2,'name': 'Canon L200','vendor_id': 1}
  ],
  'Cars': [
    {'reg': 10001,'vendor_id': 1,'model': 'Rangerover'},
    {'reg': 10003,'vendor_id': 1,'model': 'Rangerover'},
    {'reg': 10004,'vendor_id': 1,'model': 'Rangerover'},
    {'reg': 10005,'vendor_id': 1,'model': 'Rangerover'},
    {'reg': 10011,'vendor_id': 1,'model': 'Raf4'},
    {'reg': 10012,'vendor_id': 1,'model': 'Raf4'},
    {'reg': 10013,'vendor_id': 1,'model': 'Raf4'},
    {'reg': 10021,'vendor_id': 1,'model': 'Cruiser'},
    {'reg': 10022,'vendor_id': 1,'model': 'Cruiser'},
    {'reg': 20011,'vendor_id': 2,'model': 'Priora'},
    {'reg': 20012,'vendor_id': 2,'model': 'Priora'},
    {'reg': 20021,'vendor_id': 2,'model': 'Vesta'},
    {'reg': 20022,'vendor_id': 2,'model': 'Vesta'},
    {'reg': 20023,'vendor_id': 2,'model': 'Vesta'},
    {'reg': 20031,'vendor_id': 2,'model': 'Kalina'},
    {'reg': 20032,'vendor_id': 2,'model': 'Kalina'},
    {'reg': 20033,'vendor_id': 2,'model': 'Kalina'},
    {'reg': 20034,'vendor_id': 2,'model': 'Kalina'},
    {'reg': 20035,'vendor_id': 2,'model': 'Kalina'}
  ],
  'User_Car': [
    {'user_id': 1,'car_reg': 10001},
    {'user_id': 1,'car_reg': 10003},
    {'user_id': 1,'car_reg': 10012},
    {'user_id': 1,'car_reg': 10013},
    {'user_id': 1,'car_reg': 10021},
    {'user_id': 2,'car_reg': 10021},
    {'user_id': 2,'car_reg': 20011},
    {'user_id': 2,'car_reg': 20021},
    {'user_id': 3,'car_reg': 20022},
    {'user_id': 3,'car_reg': 20034},
    {'user_id': 3,'car_reg': 10005},
    {'user_id': 4,'car_reg': 10011},
    {'user_id': 4,'car_reg': 19911}
  ],
  'Users': [
    {'id': 1,'name': 'Vasily','email': 'v@mail.ru','card': 101010},
    {'id': 2,'name': 'Dmitry','email': 'd@mail.ru','card': 10123798},
    {'id': 3,'name': 'Michael','email': 'm@gmail.com','card': 9827798},
    {'id': 4,'name': 'John','email': 'j@gmail.com','card': 623898}
  ],
  'Vendors': [
    {'id': 1,'name': 'Tamoyo','country': 'Japan'},
    {'id': 2,'name': 'Lada','country': 'Russia'},
    {'id': 3,'name': 'KAMAZ','country': 'Russia'},
    {'id': 4,'name': 'Haviko','country': 'Japan'}
  ]
}

DataTransferObject class enhancement

Motivation

DTO pattern is great, but sometimes a bit annoying to implement.

In this part of easy_tools I try to implement some useful autimatizations for building DTO classes.

Features

  • Class fields with metadata and constraints.
  • "Data contracts" -- descriptional dictionary with metadata, useful for building auto-generated UI
  • Type checking

Quick Start

import transfer_object decorator and create meta-class with default values:

from easy_pytools.dto import transfer_object

@transfer_object
class Person:
    name = "Noname"
    sex = "M"
    age = 0

The value you set is the default value. It is required to extract field type. Do not set 'None' - this is NoneType.

Lets check some information about our class:

p1 = Person()
p1.get_contract()
[
    {'field': 'name', 'name': 'name', 'type': <class 'str'>, 'default': 'Noname', 'value': 'Noname', 'allowed': ()},
    {'field': 'sex', 'name': 'sex', 'type': <class 'str'>, 'default': 'M', 'value': 'M', 'allowed': ()},
    {'field': 'age', 'name': 'age', 'type': <class 'int'>, 'default': 0, 'value': 0, 'allowed': ()}]

^^ This is a contract. Let us explore contract item:

{
    'field': 'name',  # Name of the class instance field
    'name': 'name',  # Associated 'friendly' name for the field
    'type': <class 'str'>,  # Type of data for the field
    'default': 'Noname',  # Default value
    'value': 'Noname',  # Current value
    'allowed': ()  # Tuple of allowed value variants
}

You should know smth about fields before we go forward:

  • type is hard-constrained: you would not be able to set value of other type, but you can set value of child-type
  • allowed tuple is the hardest constraint: you can set only values, that are in this tuple. If this tuple is empty, any value of specified type could be set
  • field is a real property name as it is in your instance
  • name is an associated name, useful for, fex, UI or just understanding about what is stored in this instance field

Lets try to violate type constraint:

p1.name = "Vasyan"  # Works good
p1.age = None  # Exception will be thrown:
TypeError: <class 'NoneType'> is not a vaild type for age in <class '__main__.Person'> contract. Use <class 'int'>

How to set values

You can set value two ways:

p1.age = 20
p1.set_value('age', 20)

Playing with field metadata

Field associated names

You can associate any name for the field, just give not only default value on class definition, but associative name as well:

@transfer_object
class Person:
    name = "Person's name", "Noname"
    sex = "Person's Sex", "M"
    age = "Person's Age", 0

p1 = Person()
p1.get_contract()
[
    {'field': 'name', 'name': "Person's name", 'type': <class 'str'>, 'default': 'Noname', 'value': 'Noname', 'allowed': ()},
    {'field': 'sex', 'name': "Person's Sex", 'type': <class 'str'>, 'default': 'M', 'value': 'M', 'allowed': ()},
    {'field': 'age', 'name': "Person's Age", 'type': <class 'int'>, 'default': 0, 'value': 0, 'allowed': ()}
]

As you can see, the first given value -- is field associated name, and the second is default value.

Allowed values constraints

Lets specify allowed values for SEX field:

@transfer_object
class Person:
    name = "Person's name", "Noname"
    sex = "Person's Sex", "M", ("M", "F")  # Here you are
    age = "Person's Age", 0

p1 = Person()
p1.get_contract()
[
    {'field': 'name', 'name': "Person's name", 'type': <class 'str'>, 'default': 'Noname', 'value': 'Noname', 'allowed': ()},
    {'field': 'sex', 'name': "Person's Sex", 'type': <class 'str'>, 'default': 'M', 'value': 'M', 'allowed': ('M', 'F')},
    {'field': 'age', 'name': "Person's Age", 'type': <class 'int'>, 'default': 0, 'value': 0, 'allowed': ()}
]

Now let us try to set different values to sex field:

p1.sex = "M"  # Good
p1.sex = "F"  # Good
p1.sex = 10  # TypeError
p1.sex = "Other"  # Type if OK, but 'Other' is not allowed value, so TypeError:
ValueError: 'Other' in not allowed for sex in <class '__main__.Person'> contract. Allowed: ('M', 'F')

Manual metadata setup

You can set metadata manually by including protected attributes:

@transfer_object
class Person:
    name = "Noname"
    _name_contract_name = "Person's name"
    _name_contract_type = str
    sex = "M"
    _sex_contract_name = "Person's sex"
    _sex_contract_type = str
    _sex_contract_allowed = ("M", "F", "Other")
    age = 0
    _age_contract_name = "Person's age"
    _age_contract_type = float

As you can see, I am a bit noughty this time: default value for age is Integer, but contract type set to Float.

Let us see, what happens when I try to set Age value:

p1 = Person()
p1.age = 10  # Exception:
TypeError: <class 'int'> is not a vaild type for age in <class '__main__.Person'> contract. Use <class 'float'>

This is right way:

p1 = Person()
p1.age = 10.0  # Good

Structures

Quick start

Submodule structure:

easy_pytools.structures

  • trees
    • BinaryTree (C++, Linux)
    • PyBinaryTree (Python)
    • PrefixTree (C++, Linux)
    • PyPrefixTree (Python)
  • primitives
    • Queue (C++, Linux)
    • Stack (C++, Linux)
  • graphs
    • PyGraph (Python)
    • PyOrientedGraph (Python)

BinaryTree

BinaryTree and PyBinaryTree are similar in behavour.

from easy_pytools.structures.trees import BinaryTree

tree = BinaryTree()

Add value to tree

All values have to be comparable with each other with standad Python lt, gt, eq magic methods.

tree.add(20)   # Now all added values have to be comparable with int
tree.add(15)   # Good
tree.add(7)    # Good
tree.add(17.5) # Good
tree.add("h")  # Exception

Using fulfilled tree

# Useful properties with "talking" names:
tree.depth  # Depth of the tree. I try to keep it near to log2
tree.is_empty()

# Check containment
tree.contains(15)
15 in tree

Deletion is not currently supported

Prefix Tree

Also known as "Bor".

PrefixTree and PyPrefixTree are similar in behavour.

from easy_pytools.structures.trees import PrefixTree

tree = PrefixTree()

Enroll sequence into tree

Any iterable and ordered sequence can be enrolled into the tree:

tree.add([10, 20, 30])
tree.add([10, 30, 40])
tree.add("Hello")
tree.add("Helluva")
tree.add("Hello")

Using fulfilled tree

# Count how much times sequence was enrolled:
tree.count("Hello")      # Returns 2
tree.count("Helluva")    # Returns 1
tree.count([10, 20, 30]) # Returns 1
tree.count("Hell")       # Returns 0
tree.count([10])         # Returns 0

# Check if tree contains sequence:
tree.contains("Hello")   # True
tree.contains("Hell")    # False

Deletion and "in" operators are not supported.

Stack, Queue

These are pseudo-structures as they do not affect the way data is organized in memory.

from easy_pytools.structures.primitives import Stack, Queue

s = Stack()
q = Queue()

s.push(None)
s.push(20)
s.top         # 20, top element still remains in the stack
s.top         # 20
s.size        # 2
s.is_empty()  # Returns False
s.pop()       # Returns 20
s.pop()       # Returns None
s.pop()       # Stack is empty, returns None
s.is_empty()  # Returns True


q.add(None)
q.add(10)
q.add(20)
q.first       # None
q.last        # 20
q.size        # 3
q.is_epmty()  # Returns False
q.next()      # Returns None
q.next()      # Returns 10
q.next()      # Returns 20
q.is_empty()  # Returns True
q.size        # 0
q.next()      # Queue is empty, returns None

Graph, OrientedGraph

The difference between them is that when adding an edge in a regular graph, the order of the vertices does not matter, but in an oriented graph it does. Accordingly, the check and search for the path is carried out on the basis of this.

from easy_pytools.structures.graphs import PyGraph, PyOrientedGraph

g = PyGraph()
og = PyOrientedGraph()

Add vertex:

g.add_vertex(0)
g.add_vertex(1)
og.add_vertex(0)
og.add_vertex(1)

Add Edge:

# You can set edge between existing vertexes:
g.add_edge(0, 1)
og.add_edge(0, 1)

# Or vertexes can be added automatically:
g.add_edge(10, 20)
g.add_edge(10, 30)
g.add_edge(20, 30)
g.add_edge(30, 40)
og.add_edge(10, 20)
og.add_edge(10, 30)
og.add_edge(20, 30)
og.add_edge(30, 40)

Vertexes checks:

1 in g       # True
1 in og      # True
30 in g      # False
30 in og     # False

Edges checks:

# You can check if vertexes has edge:
g.are_adjacent(1, 0)    # True
g.are_adjacent(0, 1)    # True
og.are_adjecent(1, 0)   # True
og.are_adjecent(0, 1)   # False. Orientations is 1 -> 0, so they are not adjecent!

# You can see all vertexes that can be directly reached from some:
g.adjacents(10)         # {20,}
g.adjacents(20)         # {10,} 
og.adjecents(10)        # {20,}
og.adjecents(20)        # set() -- empty set

# You can travel through vertexes from start point:
list(g.travel(10))      # [10,20,30,30,40,40]
list(g.travel(30))      # [30,40,10,20,20]
list(og.travel(10))     # [10,20,30,30,40,40]
list(og.travel(30))     # [30,40]

# And you can travel through vertexes by levels:
list(g.travel_levels(20))
"""
[(20, {10, 30}),
 (10, {20, 30}),
 (30, {10, 20, 40}),
 (30, {10, 20, 40}),
 (40, {30}),
 (40, {30})]
"""
list(og.travel_levels(20))
"""
[(20, {30}),
 (30, {40}),
 (40, set())]
"""

Find minimal path from one to other:

g.minimal_path_deikstra(10, 40)   # {'path': [10, 30, 40], 'weight': 2}
g.minimal_path_deikstra(40, 10)   # {'path': [40, 30, 10], 'weight': 2}

og.minimal_path_deikstra(10, 40)   # {'path': [10, 30, 40], 'weight': 2}
og.minimal_path_deikstra(40, 10)   # {'path': [], 'weight': inf}

Weights (Yep, edges can have weights)

g.add_edge(10, 1, 40)  # weight of edge is 40
og.add_edge(10, 1, 40) # weight of edge is 40

And minimal path is calculated not by adges count, but by edges weight. Default weight is 1. 'inf' means no edge, or infinite edge weight (similar).

g.edge_weight(10, 30)   # 1
g.edge_weight(30, 10)   # 1
g.edge_weight(10, 40)   # inf

og.edge_weight(10, 30)  # 1
og.edge_weight(30, 10)  # inf
og.edge_weight(10, 40)  # inf

CHANGELOG

current version is pre-publish, no changelog.

                GNU GENERAL PUBLIC LICENSE
                   Version 3, 29 June 2007

Copyright (C) 2007 Free Software Foundation, Inc. https://fsf.org/ Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed.

                        Preamble

The GNU General Public License is a free, copyleft license for software and other kinds of works.

The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too.

When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs, and that you know you can do these things.

To protect your rights, we need to prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others.

For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights.

Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it.

For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions.

Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users.

Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free.

The precise terms and conditions for copying, distribution and modification follow.

                   TERMS AND CONDITIONS
  1. Definitions.

"This License" refers to version 3 of the GNU General Public License.

"Copyright" also means copyright-like laws that apply to other kinds of works, such as semiconductor masks.

"The Program" refers to any copyrightable work licensed under this License. Each licensee is addressed as "you". "Licensees" and "recipients" may be individuals or organizations.

To "modify" a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a "modified version" of the earlier work or a work "based on" the earlier work.

A "covered work" means either the unmodified Program or a work based on the Program.

To "propagate" a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well.

To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying.

An interactive user interface displays "Appropriate Legal Notices" to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion.

  1. Source Code.

The "source code" for a work means the preferred form of the work for making modifications to it. "Object code" means any non-source form of a work.

A "Standard Interface" means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language.

The "System Libraries" of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A "Major Component", in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it.

The "Corresponding Source" for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work.

The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source.

The Corresponding Source for a work in source code form is that same work.

  1. Basic Permissions.

All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law.

You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you.

Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary.

  1. Protecting Users' Legal Rights From Anti-Circumvention Law.

No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures.

When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures.

  1. Conveying Verbatim Copies.

You may convey verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program.

You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee.

  1. Conveying Modified Source Versions.

You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions:

a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.

b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7.  This requirement modifies the requirement in section 4 to
"keep intact all notices".

c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy.  This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged.  This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.

d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.

A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an "aggregate" if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate.

  1. Conveying Non-Source Forms.

You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways:

a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.

b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.

c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source.  This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.

d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge.  You need not require recipients to copy the
Corresponding Source along with the object code.  If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source.  Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.

e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.

A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work.

A "User Product" is either (1) a "consumer product", which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, "normally used" refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product.

"Installation Information" for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made.

If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM).

The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network.

Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying.

  1. Additional Terms.

"Additional permissions" are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions.

When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission.

Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms:

a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or

b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or

c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or

d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or

e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or

f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.

All other non-permissive additional terms are considered "further restrictions" within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying.

If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms.

Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way.

  1. Termination.

You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11).

However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation.

Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice.

Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10.

  1. Acceptance Not Required for Having Copies.

You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so.

  1. Automatic Licensing of Downstream Recipients.

Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License.

An "entity transaction" is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts.

You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it.

  1. Patents.

A "contributor" is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's "contributor version".

A contributor's "essential patent claims" are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, "control" includes the right to grant patent sublicenses in a manner consistent with the requirements of this License.

Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version.

In the following three paragraphs, a "patent license" is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To "grant" such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party.

If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. "Knowingly relying" means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid.

If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it.

A patent license is "discriminatory" if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007.

Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law.

  1. No Surrender of Others' Freedom.

If conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program.

  1. Use with the GNU Affero General Public License.

Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such.

  1. Revised Versions of this License.

The Free Software Foundation may publish revised and/or new versions of the GNU General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns.

Each version is given a distinguishing version number. If the Program specifies that a certain numbered version of the GNU General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation.

If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program.

Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version.

  1. Disclaimer of Warranty.

THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.

  1. Limitation of Liability.

IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.

  1. Interpretation of Sections 15 and 16.

If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee.

                 END OF TERMS AND CONDITIONS

        How to Apply These Terms to Your New Programs

If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms.

To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively state the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found.

<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year>  <name of author>

This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program.  If not, see <https://www.gnu.org/licenses/>.

Also add information on how to contact you by electronic and paper mail.

If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode:

<program>  Copyright (C) <year>  <name of author>
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.

The hypothetical commands show w' and show c' should show the appropriate parts of the General Public License. Of course, your program's commands might be different; for a GUI interface, you would use an "about box".

You should also get your employer (if you work as a programmer) or school, if any, to sign a "copyright disclaimer" for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see https://www.gnu.org/licenses/.

The GNU General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. But first, please read https://www.gnu.org/licenses/why-not-lgpl.html.

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

easy_pytools-1.0.tar.gz (137.6 kB view hashes)

Uploaded source

Built Distribution

easy_pytools-1.0-py3-none-any.whl (125.1 kB view hashes)

Uploaded py3

Supported by

AWS AWS Cloud computing Datadog Datadog Monitoring Facebook / Instagram Facebook / Instagram PSF Sponsor Fastly Fastly CDN Google Google Object Storage and Download Analytics Huawei Huawei PSF Sponsor Microsoft Microsoft PSF Sponsor NVIDIA NVIDIA PSF Sponsor Pingdom Pingdom Monitoring Salesforce Salesforce PSF Sponsor Sentry Sentry Error logging StatusPage StatusPage Status page