mirror of
https://github.com/UpsilonNumworks/Upsilon.git
synced 2026-03-18 21:30:38 +01:00
Fix spelling (#128)
* Fix spelling in .cpp files * Fix spelling in all files
This commit is contained in:
@@ -762,7 +762,7 @@ STATIC mp_obj_t file_writelines(mp_obj_t o_in, mp_obj_t o_lines) {
|
||||
}
|
||||
|
||||
/*
|
||||
* Simpler read function usef by read and readline.
|
||||
* Simpler read function used by read and readline.
|
||||
*/
|
||||
STATIC mp_obj_t __file_read_backend(file_obj_t* file, mp_int_t size, bool with_line_sep) {
|
||||
size_t file_size = file->record.value().size;
|
||||
|
||||
@@ -4,7 +4,7 @@ extern "C" {
|
||||
|
||||
#include <ion.h>
|
||||
|
||||
/* We cannot use C99-style struct initizalition in C++. As a result, we cannot
|
||||
/* We cannot use C99-style struct initialization in C++. As a result, we cannot
|
||||
* use the macros that micropython recommends, and we have to hand build those
|
||||
* structs. To avoid errors, we drop in a few static_asserts. */
|
||||
|
||||
|
||||
@@ -26,7 +26,7 @@ static size_t extractArgument(mp_obj_t arg, mp_obj_t ** items) {
|
||||
return itemLength;
|
||||
}
|
||||
|
||||
// Extract two scalar or array arguments and check for their strickly equal dimension
|
||||
// Extract two scalar or array arguments and check for their strictly equal dimension
|
||||
|
||||
static size_t extractArgumentsAndCheckEqualSize(mp_obj_t x, mp_obj_t y, mp_obj_t ** xItems, mp_obj_t ** yItems) {
|
||||
size_t xLength = extractArgument(x, xItems);
|
||||
|
||||
@@ -21,7 +21,7 @@ mp_obj_t modtime_monotonic() {
|
||||
}
|
||||
|
||||
//
|
||||
// Omega extensions, based off MicroPython's modutime.c
|
||||
// Upsilon extensions, based off MicroPython's modutime.c
|
||||
//
|
||||
|
||||
// LEAPOCH corresponds to 2000-03-01, which is a mod-400 year, immediately
|
||||
|
||||
@@ -4,14 +4,14 @@ mp_obj_t modtime_sleep(mp_obj_t seconds_o);
|
||||
mp_obj_t modtime_monotonic();
|
||||
|
||||
//
|
||||
// Omega extensions.
|
||||
// Upsilon extensions.
|
||||
//
|
||||
|
||||
mp_obj_t modtime_localtime(size_t n_args, const mp_obj_t *args);
|
||||
mp_obj_t modtime_mktime(mp_obj_t tuple);
|
||||
mp_obj_t modtime_time(void);
|
||||
|
||||
// Omega private extensions.
|
||||
// Upsilon private extensions.
|
||||
|
||||
mp_obj_t modtime_rtcmode(void);
|
||||
mp_obj_t modtime_setrtcmode(mp_obj_t mode);
|
||||
|
||||
@@ -849,7 +849,7 @@ STATIC uint8_t ndarray_init_helper(size_t n_args, const mp_obj_t *pos_args, mp_m
|
||||
if(mp_obj_is_type(args[1].u_obj, &ulab_dtype_type)) {
|
||||
dtype_obj_t *dtype = MP_OBJ_TO_PTR(args[1].u_obj);
|
||||
_dtype = dtype->dtype;
|
||||
} else { // this must be an integer defined as a class constant (ulba.uint8 etc.)
|
||||
} else { // this must be an integer defined as a class constant (ulab.uint8 etc.)
|
||||
_dtype = mp_obj_get_int(args[1].u_obj);
|
||||
}
|
||||
#else
|
||||
|
||||
@@ -55,7 +55,7 @@ MP_DEFINE_CONST_FUN_OBJ_VAR_BETWEEN(fft_fft_obj, 1, 2, fft_fft);
|
||||
//| :param ulab.numpy.ndarray c: An optional 1-dimension array of values whose size is a power of 2, giving the complex part of the value
|
||||
//| :return tuple (r, c): The real and complex parts of the inverse FFT
|
||||
//|
|
||||
//| Perform an Inverse Fast Fourier Transform from the frequeny domain into the time domain"""
|
||||
//| Perform an Inverse Fast Fourier Transform from the frequency domain into the time domain"""
|
||||
//| ...
|
||||
//|
|
||||
|
||||
|
||||
@@ -164,7 +164,7 @@ mp_obj_t poly_polyval(mp_obj_t o_p, mp_obj_t o_x) {
|
||||
|
||||
mp_float_t (*func)(void *) = ndarray_get_float_function(source->dtype);
|
||||
|
||||
// TODO: these loops are really nothing, but the re-impplementation of
|
||||
// TODO: these loops are really nothing, but the re-implementation of
|
||||
// ITERATE_VECTOR from vectorise.c. We could pass a function pointer here
|
||||
#if ULAB_MAX_DIMS > 3
|
||||
size_t i = 0;
|
||||
|
||||
@@ -121,7 +121,7 @@ MP_DEFINE_CONST_FUN_OBJ_KW(optimize_bisect_obj, 3, optimize_bisect);
|
||||
//| Find a minimum of the function ``f(x)`` using the downhill simplex method.
|
||||
//| The located ``x`` is within ``fxtol`` of the actual minimum, and ``f(x)``
|
||||
//| is within ``fatol`` of the actual minimum unless more than ``maxiter``
|
||||
//| steps are requried."""
|
||||
//| steps are required."""
|
||||
//| ...
|
||||
//|
|
||||
|
||||
@@ -344,7 +344,7 @@ MP_DEFINE_CONST_FUN_OBJ_KW(optimize_curve_fit_obj, 2, optimize_curve_fit);
|
||||
//|
|
||||
//| Find a solution (zero) of the function ``f(x)`` using Newton's Method.
|
||||
//| The result is accurate to within ``xtol * rtol * |f(x)|`` unless more than
|
||||
//| ``maxiter`` steps are requried."""
|
||||
//| ``maxiter`` steps are required."""
|
||||
//| ...
|
||||
//|
|
||||
|
||||
|
||||
@@ -74,7 +74,7 @@ static mp_obj_t user_square(mp_obj_t arg) {
|
||||
*rarray++ = (*array) * (*array);
|
||||
}
|
||||
}
|
||||
// at the end, return a micrppython object
|
||||
// at the end, return a micropython object
|
||||
return MP_OBJ_FROM_PTR(results);
|
||||
}
|
||||
|
||||
|
||||
@@ -212,7 +212,7 @@ void MicroPython::collectRootsAtAddress(char * address, int byteLength) {
|
||||
uintptr_t alignedAddress = reinterpret_cast<uintptr_t>(address) & bitMaskZeros;
|
||||
/* Increase the length consequently with the new alignment
|
||||
* (We don't need to increase the byteLength to a sizeof(uintptr_t)-aligned
|
||||
* lenght because no pointer can be stored on less than sizeof(uintptr_t)
|
||||
* length because no pointer can be stored on less than sizeof(uintptr_t)
|
||||
* bytes.) */
|
||||
int alignedByteLength = byteLength;
|
||||
alignedByteLength += reinterpret_cast<uintptr_t>(address) & bitMaskOnes;
|
||||
|
||||
Reference in New Issue
Block a user