Lines Matching refs:function
49 Object.prototype.inheritsFrom = function (shuper) {
50 function Inheriter() { }
56 function OrderedCollection() {
60 OrderedCollection.prototype.add = function (elm) {
64 OrderedCollection.prototype.at = function (index) {
68 OrderedCollection.prototype.size = function () {
72 OrderedCollection.prototype.removeFirst = function () {
76 OrderedCollection.prototype.remove = function (elm) {
101 function Strength(strengthValue, name) {
106 Strength.stronger = function (s1, s2) {
110 Strength.weaker = function (s1, s2) {
114 Strength.weakestOf = function (s1, s2) {
118 Strength.strongest = function (s1, s2) {
122 Strength.prototype.nextWeaker = function () {
153 function Constraint(strength) {
160 Constraint.prototype.addConstraint = function () {
172 Constraint.prototype.satisfy = function (mark) {
190 Constraint.prototype.destroyConstraint = function () {
200 Constraint.prototype.isInput = function () {
212 function UnaryConstraint(v, strength) {
224 UnaryConstraint.prototype.addToGraph = function () {
233 UnaryConstraint.prototype.chooseMethod = function (mark) {
241 UnaryConstraint.prototype.isSatisfied = function () {
245 UnaryConstraint.prototype.markInputs = function (mark) {
252 UnaryConstraint.prototype.output = function () {
261 UnaryConstraint.prototype.recalculate = function () {
270 UnaryConstraint.prototype.markUnsatisfied = function () {
274 UnaryConstraint.prototype.inputsKnown = function () {
278 UnaryConstraint.prototype.removeFromGraph = function () {
293 function StayConstraint(v, str) {
299 StayConstraint.prototype.execute = function () {
311 function EditConstraint(v, str) {
320 EditConstraint.prototype.isInput = function () {
324 EditConstraint.prototype.execute = function () {
341 function BinaryConstraint(var1, var2, strength) {
356 BinaryConstraint.prototype.chooseMethod = function (mark) {
381 BinaryConstraint.prototype.addToGraph = function () {
390 BinaryConstraint.prototype.isSatisfied = function () {
397 BinaryConstraint.prototype.markInputs = function (mark) {
404 BinaryConstraint.prototype.input = function () {
411 BinaryConstraint.prototype.output = function () {
420 BinaryConstraint.prototype.recalculate = function () {
430 BinaryConstraint.prototype.markUnsatisfied = function () {
434 BinaryConstraint.prototype.inputsKnown = function (mark) {
439 BinaryConstraint.prototype.removeFromGraph = function () {
455 function ScaleConstraint(src, scale, offset, dest, strength) {
467 ScaleConstraint.prototype.addToGraph = function () {
473 ScaleConstraint.prototype.removeFromGraph = function () {
479 ScaleConstraint.prototype.markInputs = function (mark) {
487 ScaleConstraint.prototype.execute = function () {
500 ScaleConstraint.prototype.recalculate = function () {
514 function EqualityConstraint(var1, var2, strength) {
523 EqualityConstraint.prototype.execute = function () {
537 function Variable(name, initialValue) {
551 Variable.prototype.addConstraint = function (c) {
558 Variable.prototype.removeConstraint = function (c) {
570 function Planner() {
588 Planner.prototype.incrementalAdd = function (c) {
606 Planner.prototype.incrementalRemove = function (c) {
625 Planner.prototype.newMark = function () {
648 Planner.prototype.makePlan = function (sources) {
667 Planner.prototype.extractPlanFromConstraints = function (constraints) {
691 Planner.prototype.addPropagate = function (c, mark) {
712 Planner.prototype.removePropagateFrom = function (out) {
738 Planner.prototype.addConstraintsConsumingTo = function (v, coll) {
757 function Plan() {
761 Plan.prototype.addConstraint = function (c) {
765 Plan.prototype.size = function () {
769 Plan.prototype.constraintAt = function (index) {
773 Plan.prototype.execute = function () {
797 function chainTest(n) {
831 function projectionTest(n) {
862 function change(v, newValue) {
877 function deltaBlue() {
