Jonny007-MKD/NB6_Hazards
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

Bericht!

Browse source
This commit is contained in:
gaeltp3 2014-01-18 20:23:56 +01:00
parent 87a5312cd2
commit 1e296172e8
2 changed files with 3 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

BIN
Dokumentation/Hazard_Bericht.docx
View file

Binary file not shown.

6
Hazard/Hazard/Tools.cpp
View file

@ -71,12 +71,12 @@ uint Tools::ConvertGrayToBinary(uint x)
char r = 0; // r shall contain the position of the first positive bit + 1 in x char r = 0; // r shall contain the position of the first positive bit + 1 in x
do // do while --> ceil. while do --> floor. do // do while --> ceil. while do --> floor.
r++; r++;
while (x1 >>= 1); // r = ceil(ld(x)) while (x1 >>= 1); // r = ceil(ld(x)) for odd number;ld(x)=ln(x)/ln(2)
// r = 0 | x = 3 r = 0 | x = 5 // r = 0 | x = 3 r = 0 | x = 5
// 1 | 011 1 | 101 // 1 | 011 1 | 101
// 2 | 001 2 | 010 // 2 | 001 2 | 010
// 3 | 000 3 | 001 // 2 | 000 3 | 001
// 4 | 000 // 3 | 000
if ((r & (r-1)) != 0) // if r is no multiple of 2 <-- 100 & 011 = 000 == 0 101 & 100 = 100 != 0 if ((r & (r-1)) != 0) // if r is no multiple of 2 <-- 100 & 011 = 000 == 0 101 & 100 = 100 != 0
{ // we need to round r up to the next multiple of 2. Let's use same algorithm as above. { // we need to round r up to the next multiple of 2. Let's use same algorithm as above.