Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
A
audiowmark
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Stefan Westerfeld
audiowmark
Commits
e10b3b31
Commit
e10b3b31
authored
Jan 05, 2019
by
Stefan Westerfeld
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Move shuffle() function to Random class.
Signed-off-by:
Stefan Westerfeld
<
stefan@space.twc.de
>
parent
e585040c
Changes
3
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
18 additions
and
16 deletions
+18
-16
TODO
src/TODO
+0
-1
audiowmark.cc
src/audiowmark.cc
+5
-15
random.hh
src/random.hh
+13
-0
No files found.
src/TODO
View file @
e10b3b31
key:
- avoid reroll in up_down generation
- move shuffle function to Random class
possible improvements:
- dynamic bit strength
...
...
src/audiowmark.cc
View file @
e10b3b31
...
...
@@ -274,19 +274,6 @@ get_up_down (int f, vector<int>& up, vector<int>& down)
choose_bands
(
down
);
}
template
<
class
T
>
void
gen_shuffle
(
vector
<
T
>&
result
,
int
seed
,
Random
::
Stream
stream
)
{
Random
rng
(
seed
,
stream
);
// Fisher–Yates shuffle
for
(
size_t
i
=
0
;
i
<
result
.
size
()
-
1
;
i
++
)
{
size_t
j
=
i
+
rng
()
%
(
result
.
size
()
-
i
);
std
::
swap
(
result
[
i
],
result
[
j
]);
}
}
template
<
class
T
>
vector
<
T
>
randomize_bit_order
(
const
vector
<
T
>&
bit_vec
,
bool
encode
)
{
...
...
@@ -295,7 +282,8 @@ randomize_bit_order (const vector<T>& bit_vec, bool encode)
for
(
size_t
i
=
0
;
i
<
bit_vec
.
size
();
i
++
)
order
.
push_back
(
i
);
gen_shuffle
(
order
,
/* seed */
0
,
Random
::
Stream
::
bit_order
);
Random
random
(
/* seed */
0
,
Random
::
Stream
::
bit_order
);
random
.
shuffle
(
order
);
vector
<
T
>
out_bits
(
bit_vec
.
size
());
for
(
size_t
i
=
0
;
i
<
bit_vec
.
size
();
i
++
)
...
...
@@ -330,7 +318,9 @@ gen_mix_entries (int block)
for
(
size_t
i
=
0
;
i
<
up
.
size
();
i
++
)
mix_entries
.
push_back
({
f
,
up
[
i
],
down
[
i
]
});
}
gen_shuffle
(
mix_entries
,
/* seed */
block
,
Random
::
Stream
::
mix
);
Random
random
(
/* seed */
block
,
Random
::
Stream
::
mix
);
random
.
shuffle
(
mix_entries
);
return
mix_entries
;
}
...
...
src/random.hh
View file @
e10b3b31
...
...
@@ -37,6 +37,19 @@ public:
}
void
refill_buffer
();
template
<
class
T
>
void
shuffle
(
std
::
vector
<
T
>&
result
)
{
// Fisher–Yates shuffle
for
(
size_t
i
=
0
;
i
<
result
.
size
();
i
++
)
{
const
uint64_t
random_number
=
(
*
this
)();
size_t
j
=
i
+
random_number
%
(
result
.
size
()
-
i
);
std
::
swap
(
result
[
i
],
result
[
j
]);
}
}
static
void
set_global_test_key
(
uint64_t
seed
);
static
void
load_global_key
(
const
std
::
string
&
key_file
);
static
std
::
string
gen_key
();
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment