C# Online Compiler | .NET Fiddle

<no name> by Anonymous

using System;
using System.Globalization;
					
public class Program
{
	public static void Main()
	{
		double dblValue = 0.0;
        double divideBy = 1.0;
        long digitCount = 0;
        bool punctFound = false;
        double amount = 0.0;
        string FormattedText = "";

        string fieldText = "123456789.123446789";

        foreach (char c in fieldText)
        {
            switch (c)
            {
                // check for digit
                case '0':
                case '1':
                case '2':
                case '3':
                case '4':
                case '5':
                case '6':
                case '7':
                case '8':
                case '9':
                    digitCount += 1;
			        dblValue = (dblValue * 10.0) + (c - '0');
					//Console.WriteLine(dblValue);
                    if (punctFound)
                    {
                        divideBy = divideBy * 10.0;
                    }

                    break;
                case '.':
                    punctFound = true;
                    divideBy = 1.0;
                    break;
                default:
                    break;
            }
        }

        amount = dblValue / divideBy;
		//amount = 123456789.123456789;
        amount = Math.Round(amount, 4, MidpointRounding.AwayFromZero);
        FormattedText = string.Format(CultureInfo.CurrentCulture, "{0:0.0000}", amount);
		Console.WriteLine(FormattedText);
    }
}

​x
 
using System;
using System.Globalization;
                    
public class Program
{
    public static void Main()
    {
        double dblValue = 0.0;
        double divideBy = 1.0;
        long digitCount = 0;
        bool punctFound = false;
        double amount = 0.0;
        string FormattedText = "";
​
        string fieldText = "123456789.123446789";
​
        foreach (char c in fieldText)
        {
            switch (c)
            {
                // check for digit
                case '0':
                case '1':
                case '2':
                case '3':
                case '4':
                case '5':
                case '6':
                case '7':
                case '8':
                case '9':
                    digitCount += 1;
                    dblValue = (dblValue * 10.0) + (c - '0');
                    //Console.WriteLine(dblValue);
                    if (punctFound)
                    {
                        divideBy = divideBy * 10.0;
                    }
​
                    break;
                case '.':
                    punctFound = true;
                    divideBy = 1.0;
                    break;
                default:
                    break;
            }
        }
​
        amount = dblValue / divideBy;
        //amount = 123456789.123456789;
        amount = Math.Round(amount, 4, MidpointRounding.AwayFromZero);
        FormattedText = string.Format(CultureInfo.CurrentCulture, "{0:0.0000}", amount);
        Console.WriteLine(FormattedText);
    }
}

The linked list values:
the fox jumps over the dog

sentence.Contains("jumps") = True
Test 1: Add 'today' to beginning of the list:
today the fox jumps over the dog

Test 2: Move first node to be last node:
the fox jumps over the dog today

Test 3: Change the last node to 'yesterday':
the fox jumps over the dog yesterday

Test 4: Move last node to be first node:
yesterday the fox jumps over the dog

Test 5: Indicate last occurence of 'the':
the fox jumps over (the) dog

Test 6: Add 'lazy' and 'old' after 'the':
the fox jumps over (the) lazy old dog

Test 7: Indicate the 'fox' node:
the (fox) jumps over the lazy old dog

Test 8: Add 'quick' and 'brown' before 'fox':
the quick brown (fox) jumps over the lazy old dog

Test 9: Indicate the 'dog' node:
the quick brown fox jumps over the lazy old (dog)

Test 10: Throw exception by adding node (fox) already in the list:
Exception message: The LinkedList node already belongs to a LinkedList.

Test 11: Move a referenced node (fox) before the current node (dog):
the quick brown jumps over the lazy old fox (dog)

Test 12: Remove current node (dog) and attempt to indicate it:
Node 'dog' is not in the list.

Test 13: Add node removed in test 11 after a referenced node (brown):
the quick brown (dog) jumps over the lazy old fox

Test 14: Remove node that has the value 'old':
the quick brown dog jumps over the lazy fox

Test 15: Remove last node, cast to ICollection, and add 'rhinoceros':
the quick brown dog jumps over the lazy rhinoceros

Test 16: Copy the list to an array:
the
quick
brown
dog
jumps
over
the
lazy
rhinoceros

Test 17: Clear linked list. Contains 'jumps' = False

Cached Result
Last Run:	6:13:44 pm
Compile:	0.12s
Execute:	0.018s
Memory:	72kb
CPU:	0.016s

View IL Code