BrychanD/159.341_A3_ImprecisionFinder
1
0
Fork 0
Code Issues Pull Requests Projects Releases 1 Wiki Activity

Compare commits

base: BrychanD:Initial-Release
Branches Tags
BrychanD:master
BrychanD:Initial-Release
..
compare: BrychanD:master
Branches Tags
BrychanD:master
BrychanD:Initial-Release

4 Commits
Initial-Re ... master

Author SHA1 Message Date
Brychan Dempsey
ae585a7449 Made DP counting more logical (now reports the last correct figure, instead of the first incorrect) 2021-05-21 19:48:08 +12:00
Brychan Dempsey
53c5f8a968 Update 'README.md' 2021-05-21 19:37:29 +12:00
Brychan Dempsey
162466b162 Update 'Sample Data/output - sequential 5000.dat' 2021-05-21 19:36:26 +12:00
Brychan Dempsey
43834b4f15 Uploaded a sample data file for a sequential run on 5000 items 2021-05-21 19:36:08 +12:00
3 changed files with 5008 additions and 8 deletions
Show Stats Expand all files Collapse all files

2
README.md
View File

@ -11,6 +11,8 @@ Output is saved as imprecision.txt, where the exe is run from.
See [Releases](/BrychanD/159.341_A3_ImprecisionFinder/releases) for a compiled version See [Releases](/BrychanD/159.341_A3_ImprecisionFinder/releases) for a compiled version
The Sample Data folder contains output data from the sequential run
``` ```
Sample output: Sample output:
7 dp 4 dp (.000001 .000005) 7 dp 4 dp (.000001 .000005)

5000
Sample Data/output - sequential 5000.dat Normal file
View File

File diff suppressed because it is too large Load Diff

14
TextImprecision/Program.cs
View File

@ -52,10 +52,9 @@ namespace TextImprecision
{ {
decimalPos1 = i; decimalPos1 = i;
} }
if (strDbl1[i < strDbl1.Length ? i : strDbl1.Length-1] != strDbl3[i < strDbl3.Length ? i : strDbl3.Length - 1]) if (nonMatchIndex1 == -1 && strDbl1[i < strDbl1.Length ? i : strDbl1.Length-1] != strDbl3[i < strDbl3.Length ? i : strDbl3.Length - 1] )
{ {
nonMatchIndex1 = i; nonMatchIndex1 = i;
break;
} }
} }
@ -66,10 +65,9 @@ namespace TextImprecision
{ {
decimalPos2 = i; decimalPos2 = i;
} }
if (strDbl2[i < strDbl2.Length ? i : strDbl2.Length - 1] != strDbl4[i < strDbl4.Length ? i : strDbl4.Length - 1]) if (nonMatchIndex2 == -1 && strDbl2[i < strDbl2.Length ? i : strDbl2.Length - 1] != strDbl4[i < strDbl4.Length ? i : strDbl4.Length - 1])
{ {
nonMatchIndex2 = i; nonMatchIndex2 = i;
break;
} }
} }
@ -78,11 +76,11 @@ namespace TextImprecision
{ {
if (decimalPos1 > -1) if (decimalPos1 > -1)
{ {
output.Write("{0} dp", nonMatchIndex1 - decimalPos1, strDbl1.Length < strDbl3.Length ? strDbl1.Length : strDbl3.Length); output.Write("{0} dp", nonMatchIndex1 - decimalPos1 -1, strDbl1.Length < strDbl3.Length ? strDbl1.Length : strDbl3.Length);
} }
else else
{ {
output.Write("{0} sf", nonMatchIndex1); output.Write("{0} sf", decimalPos1);
} }
} }
@ -95,11 +93,11 @@ namespace TextImprecision
{ {
if (decimalPos2 > -1) if (decimalPos2 > -1)
{ {
output.Write("{0} dp", nonMatchIndex2 - decimalPos2, strDbl2.Length < strDbl4.Length ? strDbl2.Length : strDbl4.Length); output.Write("{0} dp", nonMatchIndex2 - decimalPos2 -1, strDbl2.Length < strDbl4.Length ? strDbl2.Length : strDbl4.Length);
} }
else else
{ {
output.Write("{0} sf", nonMatchIndex2); output.Write("{0} sf", decimalPos2);
} }
} }