Lines Matching refs:function
43 Object.prototype.inheritsFrom = function (shuper) {
44 function Inheriter() { }
50 function OrderedCollection() {
54 OrderedCollection.prototype.add = function (elm) {
58 OrderedCollection.prototype.at = function (index) {
62 OrderedCollection.prototype.size = function () {
66 OrderedCollection.prototype.removeFirst = function () {
70 OrderedCollection.prototype.remove = function (elm) {
95 function Strength(strengthValue, name) {
100 Strength.stronger = function (s1, s2) {
104 Strength.weaker = function (s1, s2) {
108 Strength.weakestOf = function (s1, s2) {
112 Strength.strongest = function (s1, s2) {
116 Strength.prototype.nextWeaker = function () {
147 function Constraint(strength) {
154 Constraint.prototype.addConstraint = function () {
166 Constraint.prototype.satisfy = function (mark) {
184 Constraint.prototype.destroyConstraint = function () {
194 Constraint.prototype.isInput = function () {
206 function UnaryConstraint(v, strength) {
218 UnaryConstraint.prototype.addToGraph = function () {
227 UnaryConstraint.prototype.chooseMethod = function (mark) {
235 UnaryConstraint.prototype.isSatisfied = function () {
239 UnaryConstraint.prototype.markInputs = function (mark) {
246 UnaryConstraint.prototype.output = function () {
255 UnaryConstraint.prototype.recalculate = function () {
264 UnaryConstraint.prototype.markUnsatisfied = function () {
268 UnaryConstraint.prototype.inputsKnown = function () {
272 UnaryConstraint.prototype.removeFromGraph = function () {
287 function StayConstraint(v, str) {
293 StayConstraint.prototype.execute = function () {
305 function EditConstraint(v, str) {
314 EditConstraint.prototype.isInput = function () {
318 EditConstraint.prototype.execute = function () {
335 function BinaryConstraint(var1, var2, strength) {
350 BinaryConstraint.prototype.chooseMethod = function (mark) {
375 BinaryConstraint.prototype.addToGraph = function () {
384 BinaryConstraint.prototype.isSatisfied = function () {
391 BinaryConstraint.prototype.markInputs = function (mark) {
398 BinaryConstraint.prototype.input = function () {
405 BinaryConstraint.prototype.output = function () {
414 BinaryConstraint.prototype.recalculate = function () {
424 BinaryConstraint.prototype.markUnsatisfied = function () {
428 BinaryConstraint.prototype.inputsKnown = function (mark) {
433 BinaryConstraint.prototype.removeFromGraph = function () {
449 function ScaleConstraint(src, scale, offset, dest, strength) {
461 ScaleConstraint.prototype.addToGraph = function () {
467 ScaleConstraint.prototype.removeFromGraph = function () {
473 ScaleConstraint.prototype.markInputs = function (mark) {
481 ScaleConstraint.prototype.execute = function () {
494 ScaleConstraint.prototype.recalculate = function () {
508 function EqualityConstraint(var1, var2, strength) {
517 EqualityConstraint.prototype.execute = function () {
531 function Variable(name, initialValue) {
545 Variable.prototype.addConstraint = function (c) {
552 Variable.prototype.removeConstraint = function (c) {
564 function Planner() {
582 Planner.prototype.incrementalAdd = function (c) {
600 Planner.prototype.incrementalRemove = function (c) {
619 Planner.prototype.newMark = function () {
642 Planner.prototype.makePlan = function (sources) {
661 Planner.prototype.extractPlanFromConstraints = function (constraints) {
685 Planner.prototype.addPropagate = function (c, mark) {
706 Planner.prototype.removePropagateFrom = function (out) {
732 Planner.prototype.addConstraintsConsumingTo = function (v, coll) {
751 function Plan() {
755 Plan.prototype.addConstraint = function (c) {
759 Plan.prototype.size = function () {
763 Plan.prototype.constraintAt = function (index) {
767 Plan.prototype.execute = function () {
791 function chainTest(n) {
825 function projectionTest(n) {
856 function change(v, newValue) {
871 function deltaBlue() {
