package ocsigenserver

You can search for identifiers within the package.

in-package search v0.2.0

ocsigenserver
ocsigenserver.baselib
- Dynlink_wrapper
- Ocsigen_cache
  - Dlist
  - Make
    
    A
    
    cache
- Ocsigen_config_static
- Ocsigen_lib
  - Clist
  - Filename
  - Int
  - Ip_address
  - List
  - Option
    
    Lwt
  - String
    
    Map
    
    Set
    
    Table
  - String_base
  - Tuple3
  - Url
  - Url_base
- Ocsigen_loader
- Ocsigen_stream
  - StringStream
ocsigenserver.baselib.base
- Ocsigen_lib_base
  - Clist
  - Int
  - List
  - Option
    
    Lwt
  - String_base
  - Tuple3
  - Url_base
ocsigenserver.cookies
- Ocsigen_cookie_map
  - Poly
ocsigenserver.ext.accesscontrol
- Accesscontrol
ocsigenserver.ext.authbasic
- Authbasic
ocsigenserver.ext.cors
- Cors
ocsigenserver.ext.deflatemod
- Deflatemod
ocsigenserver.ext.extendconfiguration
- Extendconfiguration
ocsigenserver.ext.outputfilter
- Outputfilter
ocsigenserver.ext.redirectmod
- Redirectmod
ocsigenserver.ext.revproxy
- Revproxy
ocsigenserver.ext.rewritemod
- Rewritemod
ocsigenserver.ext.staticmod
- Staticmod
ocsigenserver.ext.userconf
- Userconf
ocsigenserver.http
- Ocsigen_charset_mime
- Ocsigen_header
ocsigenserver.polytables
- Polytables

Legend:
Library
Module
Module type
Parameter
Class
Class type

Cache. Association tables (from any kind of database) that keep the most recently used values in memory. It is also possible to set a maximum lifetime for data in the cache.

It is based on a structure of doubly linked lists with maximum size, that keeps only the mostly recently used values first, if you call the up function each time you use a value. (Insertion, remove and "up" in time 1). This structure is exported, so that it can be used in other cases.

Not (preemptive) thread safe.

author Vincent Balat

author Raphaël Proust (adding timers)

module Make (A : sig ... end) : sig ... end

val clear_all_caches : unit -> unit

Clear the contents of all the existing caches

module Dlist : sig ... end

Doubly-linked lists with maximum number of entries, and (possibly) limited lifespan for entries.