File: cyclic_buffer.ml

package info (click to toggle)
hlins 0.39-5
  • links: PTS
  • area: main
  • in suites: sarge
  • size: 372 kB
  • ctags: 176
  • sloc: ml: 1,213; makefile: 165; sh: 51
file content (105 lines) | stat: -rw-r--r-- 2,258 bytes parent folder | download | duplicates (11)
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
(*
    HLins: insert http-links into HTML documents.
    See http://www.lri.fr/~treinen/hlins

    Copyright (C) 1999 Ralf Treinen <treinen@lri.fr>

    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation; either version 2 of the License, or
    (at your option) any later version.

    This program 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 General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program; if not, write to the Free Software
    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

*)

open String;;

type buffer = 
    { buf: string;         (* stores the contents *)
      len: int;            (* length of buf *)
      mutable sta: int;    (* position of the first char *)
      mutable uno: int     (* first unoccupied position *)
    }
;;

let fresh n =
    { buf = create n;
      len = n;
      sta = 0;
      uno = 0
    };;

let is_empty {sta=s;uno=e} = ( s = e );;

let addc b c =
  b.buf.[b.uno] <- c;
  b.uno <- (b.uno + 1) mod b.len
;;

let getc b =
  let res = b.buf.[b.sta]
  in
    b.sta <- (b.sta + 1) mod b.len;
    res
;;

let gets b n =
  let oldsta = b.sta
  and oldstan= b.sta+n
  in
    if oldstan < b.len
    then
      begin
	b.sta <- oldstan;
	sub b.buf oldsta n
      end
    else
      begin
	b.sta <- oldstan mod b.len;
	(sub b.buf oldsta (b.len - oldsta)) ^
	(sub b.buf 0 b.sta)
      end
;;

let getall b =
  let olduno = b.uno
  in
    begin
      b.uno <- b.sta;
      if olduno >= b.sta
      then (String.sub b.buf b.sta (olduno-b.sta))
      else (String.sub b.buf b.sta (b.len-b.sta))^
	(String.sub b.buf 0 olduno);
    end
;;

let push b s =
  let l = String.length s
  in
    if l <= b.sta
    then
      begin
	String.blit s 0 b.buf (b.sta-l) l;
	b.sta <- b.sta - l
      end
    else
      begin
	String.blit s (l-b.sta) b.buf 0 b.sta;
	String.blit s 0 b.buf (b.len-l+b.sta) (l-b.sta);
	b.sta <- b.len-l+b.sta
      end
;;