Back to Questions
629
views1
comment
given this code, is there a way to sort a list based on compare without using the List<T> object
f#

let IsDigit c = System.Char.IsDigit(c)

let getStrNums (s:string) (idx:int) : string =

let rec getStrNums (idx:int) (ss:string) =

if IsDigit s.[idx] then

getStrNums (idx + 1) (ss + s.[idx].ToString())

else

ss

getStrNums idx ""

let getNumInStr (s:string) (idx:int) : int =

printf "%s ,^ " s

Convert.ToInt32(s.Substring(idx))

let rec compare (str1:string) (str2:string) (idx:int) :int =

if str1.Length < idx + 1 && str2.Length < idx + 1 then

0

elif str1.Length < idx + 1 then

1

elif str2.Length < idx + 1 then

-1

elif str1.[idx] = ' ' && str2.[idx] = ' ' then

compare str1 str2 (idx + 1)

elif str1.[idx] =' ' then

1

elif str2.[idx] = ' ' then

-1

elif IsDigit(str1.[idx]) && not(IsDigit (str2.[idx])) then

-1

elif IsDigit(str2.[idx]) && not(IsDigit (str1.[idx])) then

1

elif IsDigit(str2.[idx]) && (IsDigit (str1.[idx])) then

if getNumInStr str1 idx < getNumInStr str2 idx then

1

else

-1

else

if str1.[idx] < str2.[idx] then

1

elif str2.[idx] < str1.[idx] then

-1

else

printf "%s %s %i ,^ " str1 str2 idx

compare str1 str2 (idx + 1)

let Do() =

printfn "%i" (compare mylist.[2] mylist.[3] 0)

.

You should check out [link:cs.hubfs.net]

Anyway, see

[link:msdn.microsoft.com]

and similar functions for Seq. Maybe you want to rewrite the 'compare' function to not take the index param, just two objects, and use Array/Seq.sortWith to use a custom compare function? Note that a string is-a seq<char>. I didn't look at your function's logic carefully, since the current formatting makes it inscrutable.

By on 6/11/2010 10:28 AM ()

    Topic tags

    IntelliFactory Offices Copyright (c) 2011-2012 IntelliFactory. All rights reserved.
    Home | Products | Consulting | Trainings | Blogs | Jobs | Contact Us | Terms of Use | Privacy Policy | Cookie Policy     		Built with WebSharper