owen/pebble
1
0
Fork 0
mirror of https://github.com/google/pebble.git synced 2025-11-16 12:30:55 -05:00
Code Issues Packages Projects Releases Wiki Activity

spelling: exponential

Browse Source 
Signed-off-by: Josh Soref <2119212+jsoref@users.noreply.github.com>
This commit is contained in:
Josh Soref
2025-01-28 14:41:21 -05:00
parent f5e9b300f2
commit ecb5dae4ef
3 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
platform/robert/boot/src/util/math.h
View File

@@ -64,7 +64,7 @@ int ceil_log_two(uint32_t n);
)
/**
* Compute the next backoff interval using a bounded binary expoential backoff formula.
* Compute the next backoff interval using a bounded binary exponential backoff formula.
*
* @param[in,out] attempt The number of retries performed so far. This count will be incremented
* by the function.

2
platform/snowy/boot/src/util/misc.h
View File

@@ -79,7 +79,7 @@ const char *bool_to_str(bool b);
bool convert_bt_addr_hex_str_to_bd_addr(const char *hex_str, uint8_t *bd_addr, const unsigned int bd_addr_size);
/**
* Compute the next backoff interval using a bounded binary expoential backoff formula.
* Compute the next backoff interval using a bounded binary exponential backoff formula.
*
* @param[in,out] attempt The number of retries performed so far. This count will be incremented by
* the function.

2
src/libutil/includes/util/math.h
View File

@@ -88,7 +88,7 @@ static inline int distance_to_mod_boundary(int32_t i, uint16_t n) {
}
/**
* Compute the next backoff interval using a bounded binary expoential backoff formula.
* Compute the next backoff interval using a bounded binary exponential backoff formula.
*
* @param[in,out] attempt The number of retries performed so far. This count will be incremented by the function.
* @param[in] initial_value The inital backoff interval. Subsequent backoff attempts will be this number multiplied by a power of 2.