42 lines
1.3 KiB
OCaml
42 lines
1.3 KiB
OCaml
|
(**************************************************************************)
|
||
|
|
(* *)
|
||
|
|
(* Copyright (c) 2014 - 2016. *)
|
||
|
|
(* Dynamic Ledger Solutions, Inc. <contact@tezos.com> *)
|
||
|
|
(* *)
|
||
|
|
(* All rights reserved. No warranty, explicit or implicit, provided. *)
|
||
|
|
(* *)
|
||
|
|
(**************************************************************************)
|
||
|
|
|
||
|
|
type t = int32
|
||
|
|
type cycle = t
|
||
|
|
|
||
|
|
let encoding = Data_encoding.int32
|
||
|
|
let arg =
|
||
|
|
let construct = Int32.to_string in
|
||
|
|
let destruct str =
|
||
|
|
match Int32.of_string str with
|
||
|
|
| exception _ -> Error "Cannot parse cycle"
|
||
|
|
| cycle -> Ok cycle in
|
||
|
|
RPC.Arg.make
|
||
|
|
~descr:"A cycle integer"
|
||
|
|
~name: "block_cycle"
|
||
|
|
~construct
|
||
|
|
~destruct
|
||
|
|
|
||
|
|
let pp ppf cycle = Format.fprintf ppf "%ld" cycle
|
||
|
|
|
||
|
|
include (Compare.Int32 : Compare.S with type t := t)
|
||
|
|
|
||
|
|
let root = 0l
|
||
|
|
let succ = Int32.succ
|
||
|
|
let pred = function
|
||
|
|
| 0l -> None
|
||
|
|
| i -> Some (Int32.pred i)
|
||
|
|
|
||
|
|
let to_int32 i = i
|
||
|
|
|
||
|
|
let of_int32_exn l =
|
||
|
|
if Compare.Int32.(l >= 0l)
|
||
|
|
then l
|
||
|
|
else invalid_arg "Level_repr.Cycle.of_int32"
|