File: StringCvt.sml

package info (click to toggle)
polyml 5.6-8
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 31,892 kB
  • ctags: 34,453
  • sloc: cpp: 44,983; ansic: 24,520; asm: 14,850; sh: 11,730; makefile: 551; exp: 484; python: 253; awk: 91; sed: 9
file content (195 lines) | stat: -rw-r--r-- 6,936 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
(*
    Title:      Standard Basis Library: StringCvt Structure
    Author:     David Matthews
    Copyright   David Matthews 1999

    This library is free software; you can redistribute it and/or
    modify it under the terms of the GNU Lesser General Public
    License as published by the Free Software Foundation; either
    version 2.1 of the License, or (at your option) any later version.
    
    This library is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
    Lesser General Public License for more details.
    
    You should have received a copy of the GNU Lesser General Public
    License along with this library; if not, write to the Free Software
    Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
*)

(* G&R 2004 status: checked, no change required. *)

signature STRING_CVT =
  sig
    datatype radix = BIN | OCT | DEC | HEX

    datatype realfmt
      = SCI of int option
      | FIX of int option
      | GEN of int option
      | EXACT

    type  ('a, 'b) reader = 'b -> ('a * 'b) option    

    val padLeft : char -> int -> string -> string
    val padRight : char -> int -> string -> string
    val splitl : (char -> bool) -> (char, 'a) reader ->'a -> (string * 'a)
    val takel : (char -> bool) -> (char, 'a) reader ->'a -> string
    val dropl : (char -> bool) -> (char, 'a) reader ->'a -> 'a
    val skipWS : (char, 'a) reader -> 'a -> 'a
    type  cs
    val scanString : ((char, cs) reader -> ('a, cs) reader) -> string -> 'a option

  end;

structure StringCvt : STRING_CVT =
    struct
    (* Note: Both the String and Char structures use StringCvt.reader .
       This means that they depend on this structure so we have to
       put declarations we need for both in LibrarySupport. *)
    open RuntimeCalls; (* for POLY_SYS and EXC numbers *)
    open LibrarySupport

    val chToString: char->string = RunCall.unsafeCast
    and stringToCh: string->char = RunCall.unsafeCast

    val System_lock: string -> unit   = RunCall.run_call1 POLY_SYS_lockseg;
    val System_setb: string * word * char -> unit   = RunCall.run_call3 POLY_SYS_assign_byte;
    val mem_move: string*word*string*word*word -> unit = 
                RunCall.run_call5 POLY_SYS_move_bytes

    datatype radix = BIN | OCT | DEC | HEX

    datatype realfmt
      = SCI of int option
      | FIX of int option
      | GEN of int option
      | EXACT
      
    type  ('a, 'b) reader = 'b -> ('a * 'b) option        

    fun padLeft c i s =
    if i <= 0 (* unsignedShortOrRaiseSize raises Size if i < 0 which isn't right here. *)
    then s
    else
    let
        val len: word = sizeAsWord s
        val iW = unsignedShortOrRaiseSize i (* checks that i is a short. *)
    in
        if len >= iW then s
        else if iW = 0w1 (* and therefore size s = 0 *)
        then chToString c (* return single character string. *)
        else 
        let
            val extra = iW - len
            val str = allocString iW
            fun setCh n =
                if n = extra then ()
                (* Set the character part of the string. *)
                else ( System_setb(str, n+wordSize, c); setCh(n+0w1) )
        in
            setCh 0w0;
            (* Copy the character part of the string over. *)
            if len = 0w1
            then System_setb(str, extra + wordSize, stringToCh s)
            else mem_move(s, wordSize, str, extra + wordSize, len);
            System_lock str;
            str
        end
    end
    
    fun padRight c i s =
    if i <= 0 (* unsignedShortOrRaiseSize raises Size if i < 0 which isn't right here. *)
    then s
    else
    let
        val len = sizeAsWord s
        val iW = unsignedShortOrRaiseSize i (* checks that i is a short. *)
    in
        if len >= iW then s
        else if iW = 0w1 (* and therefore size s = 0 *)
        then chToString c (* return single character string. *)
        else 
        let
            val str = allocString iW
            fun setCh n =
                if n = iW then ()
                (* Set the character part of the string. *)
                else ( System_setb(str, n+wordSize, c); setCh(n+0w1) )
        in
            (* Copy the character part of the string over. *)
            if len = 0w1
            then System_setb(str, wordSize, stringToCh s)
            else mem_move(s, wordSize, str, wordSize, len);
            setCh len;
            System_lock str;
            str
        end
    end

    (* p is described as a predicate.  That implies that it is
       side-effect free.  If it is we could use it e.g. twice, once to work out
       the length of the string and then to create the string itself. 
       Assume that it may have side-effects and that we can only execute it
       once. *)

    local
        (* We have to define rev here because it isn't defined until
           we compile List. *)
        fun rev l [] = l
          | rev l (a::b) = rev (a::l) b

        fun split' p f res src =
            case f src of
                NONE => (stringImplode(rev [] res), src) (* Not available. *)
              | SOME (ch, src') => (* Char available *)
                    if p ch
                    then (* It matches - include in the result *)
                        split' p f (ch :: res) src'
                    else (stringImplode(rev [] res), src) (* No match *)
    in
        fun splitl p f src = split' p f [] src
    end

    (* It may be worth defining takel independently but it doesn't add
       much overhead by contrast with dropl *)
    fun takel p f s = #1(splitl p f s)
    (* fun dropl p f s = #2(splitl p f s) *)
    
    (* This is probably as efficient as it can be. *)
    fun dropl p f src =
        case f src of
            NONE => src (* Not available. *)
          | SOME (ch, src') => (* Char available *)
                if p ch
                then dropl p f src'
                else src (* No match *)

    (* Copied isSpace from Char structure to avoid circular dependency. *)
    fun skipWS f src =
        case f src of
            NONE => src (* Not available. *)
          | SOME (ch, src') => (* Char available *)
                if (#"\t" <= ch andalso ch <= #"\r") orelse ch = #" "
                then skipWS f src'
                else src (* No match *)

    datatype cs = Index of word
    
    (* Index into the string. *)
    fun scanString cvt s =
        let
        val len = sizeAsWord s
        fun rdr (Index i) =
            if i = len then NONE
            (* Since we know the index is between 0 and len-1 we can use
               the unsafe subscript function here. *)
            else SOME(LibrarySupport.unsafeStringSub(s, i), Index(i+0w1))
        in
        case cvt rdr (Index 0w0) of
            NONE => NONE
          | SOME(res, _) => SOME res
        end

    end;