Hi Liu,
unluckily I don't understand what you want to do. Could you explain a
bit more details, please?
Sorting means for me very much simplified that smaller elements appear
before larger ones. However, there is no "before" or "after" for sets.
You can't say something like "a appears before b in set s". Therefore, I
don't understand what you mean with ordering a set. Do you want an
operation that returns according to some partial order the smallest or
largest element of the set (if one exists)? Or do you want refer to some
implementation of finite sets that use an order of the elements (like RB
trees)? Or are you talking about something completely different?
Best
Thomas
On 28.03.2017 09:29, Liu Gengyang wrote:
> Hi,
> Recently I need to sort a series of data, but these data from a
> set.So I don't know how to implement it.I find all of methods about
> sorting whose datatype is list,but my datatype is set,the datatype as
> fellow:
> Datatype `ch = <|j: num; length: (real list -> real)|>`;
> val _= type_abbrev("pop",``: ch set``);
> Where j means identifier,length means a function from real list to
> real,and pop is a set of ch.Now I want to sort the chs in pop
> according to length.I don't know how to do it, could anyone help me?
> Or whether I use pop as a list only?
> Thanks!
>
>
> ------------------------------------------------------------------------------
> Check out the vibrant tech community on one of the world's most
> engaging tech sites, Slashdot.org! http://sdm.link/slashdot
>
>
> _______________________________________________
> hol-info mailing list
> hol-info@lists.sourceforge.net
> https://lists.sourceforge.net/lists/listinfo/hol-info
------------------------------------------------------------------------------
Check out the vibrant tech community on one of the world's most
engaging tech sites, Slashdot.org! http://sdm.link/slashdot
_______________________________________________
hol-info mailing list
hol-info@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/hol-info
