Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion CHANGES.rst
Original file line number Diff line number Diff line change
Expand Up @@ -58,7 +58,7 @@ AudioLazy changes history
+ general:

- Tox for testing with CPython 2.7, CPython 3.2~3.6 and PyPy
- Continuous integration wih Travis CI and Coveralls
- Continuous integration with Travis CI and Coveralls
- New ``_internals.py`` module to avoid exposing package internals together
with the API, which also allowed the new simplified ``__init__.py``
- Renewed setup.py in both its internals (e.g. using AST instead of
Expand Down
4 changes: 2 additions & 2 deletions audiolazy/lazy_analysis.py
Original file line number Diff line number Diff line change
Expand Up @@ -529,7 +529,7 @@ def maverage(size):
Moving average

This is the only strategy that uses a ``collections.deque`` object
instead of a ZFilter instance. Fast, but without extra capabilites such
instead of a ZFilter instance. Fast, but without extra capabilities such
as a frequency response plotting method.

Parameters
Expand Down Expand Up @@ -875,7 +875,7 @@ def stft(func=None, **kwparams):
* Directly as a signal processor builder, wrapping a spectrum block/grain
processor function;
* Directly as a decorator to a block processor;
* Called without the ``func`` parameter for a partial evalution style
* Called without the ``func`` parameter for a partial evaluation style
changing the defaults.

See the examples below for more information about these use cases.
Expand Down
10 changes: 5 additions & 5 deletions audiolazy/lazy_core.py
Original file line number Diff line number Diff line change
Expand Up @@ -37,9 +37,9 @@ class OpMethod(object):
"""
Internal class to represent an operator method metadata.

You can acess operator methods directly by using the OpMethod.get() class
You can access operator methods directly by using the OpMethod.get() class
method, which always returns a generator from a query.
This might be helpful if you need to acess the operator module from
This might be helpful if you need to access the operator module from
symbols. Given an instance "op", it has the following data:

========= ===========================================================
Expand Down Expand Up @@ -221,7 +221,7 @@ class AbstractOperatorOverloaderMeta(ABCMeta):
"""
Abstract metaclass for classes with massively overloaded operators.

Dunders dont't appear within "getattr" nor "getattribute", and they should
Dunders don't appear within "getattr" nor "getattribute", and they should
be inside the class dictionary, not the class instance one, otherwise they
won't be found by the usual mechanism. That's why we have to be eager here.
You need a concrete class inherited from this one, and the "abstract"
Expand All @@ -231,7 +231,7 @@ class AbstractOperatorOverloaderMeta(ABCMeta):
query inputs, see that method docstring for more information and examples.
Its a good idea to tell all operators that will be used, including the
ones that should be defined in the instance namespace, since the
metaclass will enforce their existance without overwriting.
metaclass will enforce their existence without overwriting.

These should be overridden by a string or a list with all operator names,
symbols or operator functions (from the `operator` module) to be
Expand Down Expand Up @@ -295,7 +295,7 @@ def __new__(mcls, name, bases, namespace):
return cls

# The 3 methods below should be overloaded, but they shouldn't be
# "abstractmethod" since it's unuseful (and perhaps undesirable)
# "abstractmethod" since it's useless (and perhaps undesirable)
# when there could be only one type of operator being massively overloaded.
def __binary__(cls, op):
"""
Expand Down
2 changes: 1 addition & 1 deletion audiolazy/lazy_lpc.py
Original file line number Diff line number Diff line change
Expand Up @@ -59,7 +59,7 @@ def levinson_durbin(acdata, order=None):

R . a = r

where :math:`R` is a simmetric Toeplitz matrix where each element are lags
where :math:`R` is a symmetric Toeplitz matrix where each element are lags
from the given autocorrelation list. :math:`R` and :math:`r` are defined
(Python indexing starts with zero and slices don't include the last
element):
Expand Down
2 changes: 1 addition & 1 deletion audiolazy/lazy_misc.py
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
"""
Common miscellanous tools and constants for general use
Common miscellaneous tools and constants for general use
"""

from collections import deque
Expand Down
2 changes: 1 addition & 1 deletion audiolazy/lazy_poly.py
Original file line number Diff line number Diff line change
Expand Up @@ -568,7 +568,7 @@ def resample(sig, old=1, new=1, order=3, zero=0.):
Hint
----
The time step can also be time-varying, although that's certainly difficult
to synchonize (one sample is needed for each output sample). Perhaps the
to synchronize (one sample is needed for each output sample). Perhaps the
best approach for this case would be a ControlStream keeping the desired
value at any time.

Expand Down
2 changes: 1 addition & 1 deletion audiolazy/lazy_stream.py
Original file line number Diff line number Diff line change
Expand Up @@ -129,7 +129,7 @@ class Stream(meta(Iterable, metaclass=StreamMeta)):
In that example, after declaring z as function of x and y, you should
not use x and y anymore. Use the thub() or the tee() functions, or
perhaps the x.tee() or x.copy() Stream methods instead, if you need
to use x again otherwhere.
to use x again elsewhere.

"""
__ignored_classes__ = tuple()
Expand Down
6 changes: 3 additions & 3 deletions audiolazy/lazy_synth.py
Original file line number Diff line number Diff line change
Expand Up @@ -43,7 +43,7 @@ def modulo_counter(start=0., modulo=256., step=1.):
Creates a lazy endless counter stream with the given modulo, i.e., its
values ranges from 0. to the given "modulo", somewhat equivalent to:\n
Stream(itertools.count(start, step)) % modulo\n
Yet the given step can be an iterable, and doen't create unneeded big
Yet the given step can be an iterable, and doesn't create unneeded big
ints. All inputs can be float. Input order remembers slice/range inputs.
All inputs can also be iterables. If any of them is an iterable, the end
of this counter happen when there's no more data in one of those inputs.
Expand Down Expand Up @@ -154,7 +154,7 @@ def line(dur, begin=0., end=1., finish=False):
respectively.
finish :
Choose if ``end`` it the last to be yielded or it shouldn't be yield at
all. Defauts to False, which means that ``end`` won't be yield. The last
all. Defaults to False, which means that ``end`` won't be yield. The last
sample won't have "end" amplitude unless finish is True, i.e., without
explicitly saying "finish=True", the "end" input works like a "stop" range
parameter, although it can [should] be a float. This is so to help
Expand All @@ -167,7 +167,7 @@ def line(dur, begin=0., end=1., finish=False):
Examples
--------
With ``finish = True``, it works just like NumPy ``np.linspace``, besides
argument order and lazyness:
argument order and laziness:

>>> import numpy as np # This test needs Numpy
>>> np.linspace(.2, .7, 6)
Expand Down
2 changes: 1 addition & 1 deletion conftest.py
Original file line number Diff line number Diff line change
Expand Up @@ -41,7 +41,7 @@ def find(self, obj, name=None, module=None, **kwargs):
for name, attr in vars(obj).items(): # We know it's a module
if isinstance(attr, StrategyDict):
for st in attr: # Each strategy can have a doctest
if st.__module__ == module_name: # Avoid stuff from otherwhere
if st.__module__ == module_name: # Avoid stuff from elsewhere
sname = ".".join([module_name, name, st.__name__])
tests.extend(old_find(self, st, name=sname, module=obj, **kwargs))
tests.sort()
Expand Down
6 changes: 3 additions & 3 deletions docs/conf.py
Original file line number Diff line number Diff line change
Expand Up @@ -198,7 +198,7 @@ def pre_processor(app, what, name, obj, options, lines,
else:
result.append(" " + el)

else: # Unkown block name, perhaps the starting one (empty)
else: # Unknown block name, perhaps the starting one (empty)
result.extend(blk)

# Skip a line after each block
Expand Down Expand Up @@ -309,7 +309,7 @@ def newest_file(file_iterable):
release = version

# Get "today" using the last file modification date
# WARNING: Be careful with git clone, clonning date will be "today"
# WARNING: Be careful with git clone, cloning date will be "today"
install_path = audiolazy.__path__[0]
installed_nfile = newest_file(file_name_generator_recursive(install_path))
installed_time = os.path.getmtime(installed_nfile)
Expand Down Expand Up @@ -366,7 +366,7 @@ def newest_file(file_iterable):
author,
project, # Dir menu entry
description, # From README.rst
"Miscellanous", # Category
"Miscellaneous", # Category
)]


Expand Down
2 changes: 1 addition & 1 deletion examples/formants.py
Original file line number Diff line number Diff line change
Expand Up @@ -86,5 +86,5 @@
gain.value = 0
sleep(inertia_dur / s + .2) # Divide by s because here it's already
# expecting a value in seconds, and we don't
# want ot give a value in a time-squaed unit
# want to give a value in a time-squaed unit
# like s ** 2
4 changes: 2 additions & 2 deletions math/lowpass_highpass_bilinear.py
Original file line number Diff line number Diff line change
Expand Up @@ -34,8 +34,8 @@ def print_header(msg):

def taylor(f, n=2, **kwargs):
"""
Taylor/Mclaurin polynomial aproximation for the given function.
The ``n`` (default 2) is the amount of aproximation terms for ``f``. Other
Taylor/Mclaurin polynomial approximation for the given function.
The ``n`` (default 2) is the amount of approximation terms for ``f``. Other
arguments are keyword-only and will be passed to the ``f.series`` method.
"""
return sum(Stream(f.series(n=None, **kwargs)).limit(n))
Expand Down