1"use strict";(globalThis.webpackChunk=globalThis.webpackChunk||[]).push([[6872],{8082(e,n,t){t.r(n),t.d(n,{assets:()=>c,contentTitle:()=>a,default:()=>u,frontMatter:()=>i,metadata:()=>r,toc:()=>l});const r=JSON.parse('{"id":"internal-API","title":"Infer Internal OCaml Modules API","description":"Browse the generated documentation for Infer\'s OCaml code here.","source":"@site/versioned_docs/version-1.3.0/04-internal-API.md","sourceDirName":".","slug":"/internal-API","permalink":"/docs/internal-API","draft":false,"unlisted":false,"tags":[],"version":"1.3.0","sidebarPosition":4,"frontMatter":{"id":"internal-API","title":"Infer Internal OCaml Modules API"},"sidebar":"docs","previous":{"title":"Building checkers with the Infer.AI framework","permalink":"/docs/absint-framework"},"next":{"title":"Documentation Versions","permalink":"/docs/versions"}}');var o=t(4848),s=t(8453);const i={id:"internal-API",title:"Infer Internal OCaml Modules API"},a=void 0,c={},l=[];function d(e){const n={a:"a",code:"code",p:"p",...(0,s.R)(),...e.components};return(0,o.jsxs)(o.Fragment,{children:[(0,o.jsxs)(n.p,{children:["Browse the generated documentation for Infer's OCaml code ",(0,o.jsx)(n.a,{href:"pathname:///odoc/1.3.0/infer/infer.html",children:"here"}),"."]}),"\n",(0,o.jsxs)(n.p,{children:["You can also generate these pages from within an Infer repository with ",(0,o.jsx)(n.code,{children:"make doc"}),"."]})]})}function u(e={}){const{wrapper:n}={...(0,s.R)(),...e.components};return n?(0,o.jsx)(n,{...e,children:(0,o.jsx)(d,{...e})}):d(e)}},8453(e,n,t){t.d(n,{R:()=>i,x:()=>a});var r=t(6540);const o={},s=r.createContext(o);function i(e){const n=r.useContext(s);return r.useMemo(function(){return"function"==typeof e?e(n):{...n,...e}},[n,e])}function a(e){let n;return n=e.disableParentContext?"function"==typeof e.components?e.components(o):e.components||o:i(e.components),r.createElement(s.Provider,{value:n},e.children)}}}]);
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.