Searched refs:pts (Results 1 - 14 of 14) sorted by relevance

/seL4-l4v-10.1.1/isabelle/lib/browser/GraphBrowser/
H A DSpline.java65 public Spline(Vector pts) { argument
71 start=(Point)(pts.firstElement());
72 end=(Point)(pts.lastElement());
75 for (i=1;i<=pts.size()-4;i+=3) {
76 p0=(Point)(pts.elementAt(i));
77 p1=(Point)(pts.elementAt(i+1));
78 p2=(Point)(pts.elementAt(i+2));
94 points=pts;
H A DGraph.java772 Vector pts=new Vector(10,10);
777 pts.addElement(new Point(x1,y1)); /** edge starting point **/
810 pts.addElement(ps.p);
811 pts.addElement(p2);
812 pts.addElement(ps.q);
818 pts.addElement(ps.p);
819 pts.addElement(p2);
820 pts.addElement(ps.q);
824 pts.addElement(ps.p);
825 pts
[all...]
/seL4-l4v-10.1.1/l4v/isabelle/lib/browser/GraphBrowser/
H A DSpline.java65 public Spline(Vector pts) { argument
71 start=(Point)(pts.firstElement());
72 end=(Point)(pts.lastElement());
75 for (i=1;i<=pts.size()-4;i+=3) {
76 p0=(Point)(pts.elementAt(i));
77 p1=(Point)(pts.elementAt(i+1));
78 p2=(Point)(pts.elementAt(i+2));
94 points=pts;
H A DGraph.java772 Vector pts=new Vector(10,10);
777 pts.addElement(new Point(x1,y1)); /** edge starting point **/
810 pts.addElement(ps.p);
811 pts.addElement(p2);
812 pts.addElement(ps.q);
818 pts.addElement(ps.p);
819 pts.addElement(p2);
820 pts.addElement(ps.q);
824 pts.addElement(ps.p);
825 pts
[all...]
/seL4-l4v-10.1.1/HOL4/polyml/mlsource/extra/Win/
H A DLine.sml100 fun PolyBezier (h, pts) =
102 val (ptarr, count) = ptList pts
108 and PolyBezierTo (h, pts) =
110 val (ptarr, count) = ptList pts
126 and Polyline (h, pts: POINT list) =
128 val (ptarr, count) = ptList pts
134 and PolylineTo (h, pts: POINT list) =
136 val (ptarr, count) = ptList pts
H A DTransform.sml205 fun mapPts call pts =
207 val count = List.length pts
211 val _ = List.foldl (fn (p,n) => (ignore(toPt(n, p)); n ++ sizePt)) mem pts
218 fun DPtoLP(h,pts) = mapPts(fn (mem, count) => dPtoLP(h, mem, count)) pts
219 and LPtoDP(h,pts) = mapPts(fn (mem, count) => lPtoDP(h, mem, count)) pts
220 and MapWindowPoints (h1,h2,pts) = mapPts(fn (mem, count) => mapWindowPoints(h1, h2, mem, count)) pts
H A DShape.sml77 fun Polygon (h,pts: POINT list) =
79 val (ptarr, count) = ptList pts
H A DRegion.sml131 fun CreatePolygonRgn (pts: POINT list, fmode) =
133 val (ptarr, count) = ptList pts
/seL4-l4v-10.1.1/HOL4/src/pattern_matches/
H A DparsePMATCH.sml117 fun mk_ptlist pts =
118 case pts of
257 Some(ptyE', pts) => (pts, ptyE')
H A DpatternMatchesLib.sml1593 val pts = pairSyntax.strip_pair pt value
1594 val cols = length pts
1597 val l = last pts
/seL4-l4v-10.1.1/HOL4/examples/formal-languages/context-free/
H A DgrammarScript.sml375 rename [`Nd ntl pts`] >> Cases_on `ntl` >> rename [`Nd (rootnt,l) pts`] >>
379 qspecl_then [`Nd (rootnt,l) pts`, `pfx`, `NT nt`, `sfx`]
/seL4-l4v-10.1.1/HOL4/src/parse/
H A DPreterm.sml94 fun plist_mk_rbinop opn pts =
95 case pts of
99 val pts' = List.rev pts
104 List.foldl foldthis (hd pts') (tl pts')
/seL4-l4v-10.1.1/HOL4/src/tfl/src/
H A DDefn.sml1745 fun construct_final_term pts =
1749 pts
1758 (fn pts =>
1760 val all_frees = op_U Preterm.eq (map ptdefn_freevars pts)
1763 construct_final_term pts
/seL4-l4v-10.1.1/HOL4/src/HolSmt/
H A DZ3_ProofReplay.sml999 (pt :: pts : proofterm list, concl : Term.term)
1004 list_prems state_proof name z3_rule_fn (pts, concl) continuation

Completed in 119 milliseconds