adamc@5: (* Copyright (c) 2008, Adam Chlipala
adamc@5:  * All rights reserved.
adamc@5:  *
adamc@5:  * Redistribution and use in source and binary forms, with or without
adamc@5:  * modification, are permitted provided that the following conditions are met:
adamc@5:  *
adamc@5:  * - Redistributions of source code must retain the above copyright notice,
adamc@5:  *   this list of conditions and the following disclaimer.
adamc@5:  * - Redistributions in binary form must reproduce the above copyright notice,
adamc@5:  *   this list of conditions and the following disclaimer in the documentation
adamc@5:  *   and/or other materials provided with the distribution.
adamc@5:  * - The names of contributors may not be used to endorse or promote products
adamc@5:  *   derived from this software without specific prior written permission.
adamc@5:  *
adamc@5:  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@5:  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@5:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@5:  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@5:  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 
adamc@5:  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@5:  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@5:  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@5:  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@5:  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@5:  * POSSIBILITY OF SUCH DAMAGE.
adamc@5:  *)
adamc@5: 
adamc@5: signature LIST_UTIL = sig
adamc@5: 
adamc@110:     val mapConcat : ('a -> 'b list) -> 'a list -> 'b list
adamc@110: 
adamc@6:     val mapfold : ('data, 'state, 'abort) Search.mapfolder
adamc@6:                   -> ('data list, 'state, 'abort) Search.mapfolder
adamc@34:     val mapfoldB : ('context * 'data -> 'context * ('state -> ('data * 'state, 'abort) Search.result))
adamc@34:                    -> ('context, 'data list, 'state, 'abort) Search.mapfolderB
adamc@6: 
adamc@26:     val foldlMap : ('data1 * 'state -> 'data2 * 'state) -> 'state -> 'data1 list -> 'data2 list * 'state
adamc@39:     val foldlMapPartial : ('data1 * 'state -> 'data2 option * 'state) -> 'state -> 'data1 list -> 'data2 list * 'state
adamc@849:     val foldlMapiPartial : (int * 'data1 * 'state -> 'data2 option * 'state)
adamc@849:                            -> 'state -> 'data1 list -> 'data2 list * 'state
adamc@39:     val foldlMapConcat : ('data1 * 'state -> 'data2 list * 'state) -> 'state -> 'data1 list -> 'data2 list * 'state
adamc@847:     val foldlMapAbort : ('data1 * 'state -> ('data2 * 'state) option)
adamc@847:                         -> 'state -> 'data1 list -> ('data2 list * 'state) option
adamc@26: 
adamc@23:     val search : ('a -> 'b option) -> 'a list -> 'b option
adamc@839:     val searchi : (int * 'a -> 'b option) -> 'a list -> 'b option
adamc@23: 
adamc@120:     val mapi : (int * 'a -> 'b) -> 'a list -> 'b list
adamc@849:     val mapiPartial : (int * 'a -> 'b option) -> 'a list -> 'b list
adamc@191:     val foldli : (int * 'a * 'b -> 'b) -> 'b -> 'a list -> 'b
adamc@275:     val foldri : (int * 'a * 'b -> 'b) -> 'b -> 'a list -> 'b
adamc@120: 
adamc@313:     val foldliMap : (int * 'data1 * 'state -> 'data2 * 'state) -> 'state -> 'data1 list -> 'data2 list * 'state
adamc@313: 
adamc@792:     val appi : (int * 'a -> unit) -> 'a list -> unit
adamc@792: 
adamc@792:     val appn : (int -> unit) -> int -> unit
adamc@792: 
adamc@5: end