123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186(******************************************************************************
* capnp-ocaml
*
* Copyright (c) 2013-2014, Paul Pelzl
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
******************************************************************************)typero=Message.rotyperw=Message.rwtype('cap,'a,'arr)t=('cap,'a,'arr)InnerArray.tletlength=InnerArray.lengthletget=InnerArray.getletset=InnerArray.setletinit=InnerArray.initletfoldia~init~f=letlen=lengthainlet()=assert(len>=0)inletrecloopacci=ifi=lenthenaccelseletx=getaiinloop(fiaccx)(i+1)inloopinit0letfoldi_righta~f~init=letrecloopacci=ifi<0thenaccelseletx=getaiinloop(fixacc)(i-1)inletlen=lengthainloopinit(len-1)letfolda~init~f=foldia~init~f:(fun_iaccx->faccx)letfold_righta~f~init=foldi_righta~f:(fun_ixacc->fxacc)~initletmem?equalax=letlen=lengthainlet()=assert(len>=0)inletreal_equal=matchequalwith|Someuser_equal->user_equal|None->(=)inletrecloopi=ifi=lenthenfalseelseifreal_equalx(getai)thentrueelseloop(i+1)inloop0letis_emptya=(lengtha)=0letitera~f=folda~init:()~f:(fun()x->fx)letiteria~f=foldia~init:()~f:(funi()x->fix)letexistsa~f=letlen=lengthainlet()=assert(len>=0)inletrecloopi=ifi=lenthenfalseelseiff(getai)thentrueelseloop(i+1)inloop0letforalla~f=letlen=lengthainlet()=assert(len>=0)inletrecloopi=ifi=lenthentrueelseiff(getai)thenloop(i+1)elsefalseinloop0letcounta~f=letfold_faccx=iffxthenacc+1elseaccinfolda~init:0~f:fold_fletfinda~f=letlen=lengthainlet()=assert(len>=0)inletrecloopi=ifi=lenthenNoneelseletx=getaiiniffxthenSomexelseloop(i+1)inloop0letfind_mapa~f=letlen=lengthainlet()=assert(len>=0)inletrecloopi=ifi=lenthenNoneelseletr=f(getai)inmatchrwith|Some_->r|None->loop(i+1)inloop0letlist_initlen~f=letrecauxacc=function|0->acc|i->leti=i-1inaux(fi::acc)iinaux[]lenletto_lista=list_init(lengtha)~f:(funi->getai)letto_arraya=Array.init(lengtha)(geta)letset_listalst=let()=inita(List.lengthlst)inListLabels.iterilst~f:(funix->setaix)letset_arrayaarr=let()=inita(Array.lengtharr)inArrayLabels.iteriarr~f:(funix->setaix)letmap_arraya~f=Array.init(lengtha)(funi->f(getai))letmap_lista~f=list_init(lengtha)~f:(funi->f(getai))