notwa/resynth
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

fix typos

Browse source
This commit is contained in:
Connor Olding 2017-04-01 02:49:05 +00:00
parent 823b7a5008
commit aad28da6a4
2 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
README.md
View file

@ -58,7 +58,7 @@ usage:
offsets are sorted in ascending distance from the center (the 0,0 point). offsets are sorted in ascending distance from the center (the 0,0 point).
the order of equal distances is undefined. the order of equal distances is undefined.
this probably doesn't matter matter, this doesn't matter much in practice,
considering the algorithm handles non-circular considering the algorithm handles non-circular
neighborhoods just fine — more on that later. neighborhoods just fine — more on that later.

2
resynth.c
View file

@ -305,7 +305,7 @@ static void run(Resynth_state *s, Parameters parameters) {
const int data_area = sb_count(s->data_points); const int data_area = sb_count(s->data_points);
// shuffle data points in-place // shuffle the data points in-place.
for (int i = 0; i < data_area; i++) { for (int i = 0; i < data_area; i++) {
// (we could use a better random function here) // (we could use a better random function here)
int j = rand() % data_area; int j = rand() % data_area;