Index

Symbols

#/% is understood by Integer>>#/% #/%~ is understood by Integer>>#/%~ #\/ is understood by Fraction>>#\/ Integer>>#\/ #a:b: is understood by QuoRemComplementary class>>#a:b: #add:atHeight: is understood by CTSkipList>>#add:atHeight:, [1] #add:atHeight:predecessors: is understood by CTSkipList>>#add:atHeight:predecessors:, [1] #allocateOrReuseLink is understood by CTLinkedStoragePool>>#allocateOrReuseLink #anyAssociation is understood by Dictionary>>#anyAssociation #asBinaryTree is understood by Collection>>#asBinaryTree, [1] #asBinaryTree: is understood by ArrayedCollection>>#asBinaryTree:, [1] Collection>>#asBinaryTree:, [1] #asBinomialHeap is understood by Collection>>#asBinomialHeap, [1] #asInteger is understood by SkewBinaryCanonicalNumber>>#asInteger #asLeftistHeap is understood by Collection>>#asLeftistHeap, [1] #asLinkedList is understood by UndefinedObject>>#asLinkedList, [1] ValueLink>>#asLinkedList, [1] #asShapeBinaryDots:walker: is understood by Integer>>#asShapeBinaryDots:walker: #asShapeBRGCDots: is understood by Integer>>#asShapeBRGCDots: #asSkewBinaryCanonicalSparse is understood by Integer>>#asSkewBinaryCanonicalSparse #asSplayHeap is understood by Collection>>#asSplayHeap, [1] #asUnbalancedSet is understood by Collection>>#asUnbalancedSet, [1] #asValueLink is understood by SequenceableCollection>>#asValueLink, [1] #atRandom: is understood by SequenceableCollection>>#atRandom: #bisect:baseBlock: is understood by SequenceableCollection>>#bisect:baseBlock:, [1] #bisect:from:to:baseBlock: is understood by SequenceableCollection>>#bisect:from:to:baseBlock:, [1] #bitAverage: is understood by Integer>>#bitAverage: #bitBRGC is understood by Integer>>#bitBRGC #bitToggle:do: is understood by Integer>>#bitToggle:do: #decrementCountIfZero:forTopologicalSortAlgorithm: is understood by Association>>#decrementCountIfZero:forTopologicalSortAlgorithm: #do: is understood by Link>>#do:, [1] #empty is understood by CTBinaryTreeAbstract class>>#empty, [1] CTBinomialHeap class>>#empty, [1] #estrin: is understood by SequenceableCollection>>#estrin: #estrin:init: is understood by SequenceableCollection>>#estrin:init: #factorialRecursive is understood by Integer>>#factorialRecursive #fairCoin is understood by Random>>#fairCoin #fibonacciNumbers is understood by Integer>>#fibonacciNumbers #foldr:init: is understood by SequenceableCollection>>#foldr:init:, [1] #gibonacciNumbersFirst:second:do: is understood by Integer>>#gibonacciNumbersFirst:second:do: #goldenRatiosLower is understood by Integer>>#goldenRatiosLower #halves:at:digits:base: is understood by Integer>>#halves:at:digits:base: #halves:base: is understood by Integer>>#halves:base: #handleCycleInValueLinksTable:do: is understood by TopologicalSortAlgorithm>>#handleCycleInValueLinksTable:do: #horner:init: is understood by SequenceableCollection>>#horner:init: #ifSink:otherwise:forTopologicalSortAlgorithm: is understood by Association>>#ifSink:otherwise:forTopologicalSortAlgorithm: #includes:equalityBlock: is understood by CTSkipList>>#includes:equalityBlock:, [1] #initialize is understood by QuoRemComplementary>>#initialize QuoRemStandard>>#initialize #initializeValueLinksTable: is understood by TopologicalSortAlgorithm>>#initializeValueLinksTable: #inject:into: is understood by Collection>>#inject:into:, [1] #insert:left:right:inBinaryTree: is understood by CTBinaryTreeNodeLeftistHeap>>#insert:left:right:inBinaryTree:, [1] #isAcyclicWithRespectToAssociations: is understood by SequenceableCollection>>#isAcyclicWithRespectToAssociations: #karatsuba:base: is understood by Integer>>#karatsuba:base: #kissingFractionLink: is understood by Fraction>>#kissingFractionLink: Integer>>#kissingFractionLink: #kissingFractions is understood by BlockClosure>>#kissingFractions Fraction>>#kissingFractions #kth:ranking:atRandom: is understood by SequenceableCollection>>#kth:ranking:atRandom: #lineDeCasteljauLineClosedControlPoints is understood by RSBasicShapeExamples>>#lineDeCasteljauLineClosedControlPoints #lineDeCasteljauLineNoteBox is understood by RSBasicShapeExamples>>#lineDeCasteljauLineNoteBox #lineParametricHypotrochoid is understood by RSTParametricXYLines>>#lineParametricHypotrochoid #lineParametricLissajous is understood by RSTParametricXYLines>>#lineParametricLissajous #lineParametricNeil is understood by RSTParametricXYLines>>#lineParametricNeil #lineParametricNeil2 is understood by RSTParametricXYLines>>#lineParametricNeil2 #lineParametricTrochoid is understood by RSTParametricXYLines>>#lineParametricTrochoid #lineParametricUnitCircle is understood by RSTParametricXYLines>>#lineParametricUnitCircle #linesDeCasteljauLineDegreeElevation is understood by RSBasicShapeExamples>>#linesDeCasteljauLineDegreeElevation #linkBinomialTree: is understood by CTBinomialTree>>#linkBinomialTree:, [1] #lucasNumbers is understood by Integer>>#lucasNumbers #makeValueLinksTable is understood by TopologicalSortAlgorithm>>#makeValueLinksTable #mediantFraction: is understood by Fraction>>#mediantFraction: Integer>>#mediantFraction: #mediantInteger: is understood by Fraction>>#mediantInteger: Integer>>#mediantInteger:

#merge:with: is understood by CTBinomialHeap>>#merge:with:, [1] #mergeBinaryTreeElement:inBinaryTree: is understood by CTBinaryTreeEmpty>>#mergeBinaryTreeElement:inBinaryTree:, [1] CTBinaryTreeNode>>#mergeBinaryTreeElement:inBinaryTree:, [1] CTBinaryTreeNodeLeftistHeap>>#mergeBinaryTreeElement:inBinaryTree:, [1] CTBinaryTreeNodeSplayHeap>>#mergeBinaryTreeElement:inBinaryTree:, [1] CTBinaryTreeNodeUnbalanced>>#mergeBinaryTreeElement:inBinaryTree:, [1] #newLink is understood by CTLinkedStoragePool>>#newLink #next is understood by Random>>#next RandomBernoulli>>#next RandomBinomial>>#next RandomBoxMullerBivariateGaussian>>#next RandomExponential>>#next RandomGaussian>>#next RandomGeometric>>#next #next: is understood by Link>>#next: #nextEven is understood by Integer>>#nextEven #nextEvenOrSelf is understood by Integer>>#nextEvenOrSelf #nextFromLink: is understood by Integer>>#nextFromLink: Link>>#nextFromLink: #nextInteger: is understood by Link>>#nextInteger: #nextLink: is understood by Link>>#nextLink: #nextOdd is understood by Integer>>#nextOdd #nextOddOrSelf is understood by Integer>>#nextOddOrSelf #noteInteger is understood by RSBasicShapeExamples>>#noteInteger #noteLoremIpsum is understood by RSBasicShapeExamples>>#noteLoremIpsum #onSortedCollection:lowerBound:upperBound: is understood by CTSkipList class>>#onSortedCollection:lowerBound:upperBound:, [1] #onSortedCollection:lowerBound:upperBound:atRandom: is understood by CTSkipList class>>#onSortedCollection:lowerBound:upperBound:atRandom:, [1] #overlappingPairsDo: is understood by SequenceableCollection>>#overlappingPairsDo: #parametricXYlineButterfly is understood by RSTParametricXYLines>>#parametricXYlineButterfly #partition:inSplayHeap:do: is understood by CTBinaryTreeEmptySplayHeap>>#partition:inSplayHeap:do:, [1] CTBinaryTreeNodeSplayHeap>>#partition:inSplayHeap:do:, [1] #partitionGreaterThanOrEqualTo:inSplayHeap:do: is understood by CTBinaryTreeNodeSplayHeap>>#partitionGreaterThanOrEqualTo:inSplayHeap:do:, [1] #partitionLessThan:inSplayHeap:do: is understood by CTBinaryTreeNodeSplayHeap>>#partitionLessThan:inSplayHeap:do:, [1] #predecessors: is understood by CTSkipList>>#predecessors:, [1] #previousEven is understood by Integer>>#previousEven #previousEvenOrSelf is understood by Integer>>#previousEvenOrSelf #previousOdd is understood by Integer>>#previousOdd #previousOddOrSelf is understood by Integer>>#previousOddOrSelf #privateNextSeed is understood by Random>>#privateNextSeed #privateNextValue is understood by Random>>#privateNextValue #productTo: is understood by Integer>>#productTo: #push: is understood by CTBinaryTreeAbstract>>#push:, [1] CTBinomialHeap>>#push:, [1] CTSplayHeap>>#push:, [1] CTUnbalancedSet>>#push:, [1] #push:witness:continuation:inSet: is understood by CTBinaryTreeEmptyUnbalanced>>#push:witness:continuation:inSet:, [1] CTBinaryTreeNodeUnbalanced>>#push:witness:continuation:inSet:, [1] #pushingAlreadyIncluded:continuation: is understood by CTUnbalancedSet>>#pushingAlreadyIncluded:continuation:, [1] #pushTree:onTrees: is understood by CTBinomialHeap>>#pushTree:onTrees:, [1] #quoRemComplementaryInteger: is understood by Integer>>#quoRemComplementaryInteger: #quoRemInteger: is understood by Integer>>#quoRemInteger: #releaseLink: is understood by CTLinkedStoragePool>>#releaseLink: #removeAll is understood by CTLinkedStoragePoolQueue>>#removeAll CTLinkedStoragePoolStack>>#removeAll #sinksOfValueLinksTable: is understood by TopologicalSortAlgorithm>>#sinksOfValueLinksTable: #slowFibonacci is understood by Integer>>#slowFibonacci #slowFibonacci:tail: is understood by Integer>>#slowFibonacci:tail: #slowFibonacciMemo: is understood by Integer>>#slowFibonacciMemo: #sortOn:sinksValueLink:valueLinksTable: is understood by TopologicalSortAlgorithm>>#sortOn:sinksValueLink:valueLinksTable: #sutBaricentricCoordinates: is understood by RSParametricCurveTest>>#sutBaricentricCoordinates: #sutBaricentricCoordinatesTriangle: is understood by RSParametricCurveTest>>#sutBaricentricCoordinatesTriangle: #sutCrescenzi is understood by CTSkipListTest>>#sutCrescenzi, [1] #to:by: is understood by Number>>#to:by:, [1] #topologicalSortByAssociations:acyclicDo: is understood by SequenceableCollection>>#topologicalSortByAssociations:acyclicDo: #topologicalSortByAssociations:onCycleDo: is understood by SequenceableCollection>>#topologicalSortByAssociations:onCycleDo: #tree: is understood by CTBinaryTreeAbstractTest>>#tree:, [1] CTBinomialHeapTest>>#tree:, [1] CTLeftistHeapTest>>#tree:, [1] CTSplayHeapTest>>#tree:, [1] CTUnbalancedSetTest>>#tree:, [1] #unitAffine:at: is understood by Point>>#unitAffine:at: #unitAffine:at:and:at: is understood by Point>>#unitAffine:at:and:at: #value:onCycleDo: is understood by TopologicalSortAlgorithm>>#value:onCycleDo: #valueWithArgumentedExit is understood by BlockClosure>>#valueWithArgumentedExit, [1] #withArrayedCollection: is understood by CTBinaryTreeAbstract class>>#withArrayedCollection:, [1] CTBinomialHeap class>>#withArrayedCollection:, [1] #withCollection: is understood by CTBinaryTreeAbstract class>>#withCollection:, [1] CTBinomialHeap class>>#withCollection:, [1] #yourself: is understood by Object>>#yourself: #~~> is understood by Object>>#~~>

A

a ArrayedCollection understands #asBinaryTree:, [1] a Association understands #decrementCountIfZero:forTopologicalSortAlgorithm: #ifSink:otherwise:forTopologicalSortAlgorithm: a BlockClosure understands #kissingFractions #valueWithArgumentedExit, [1] a Collection understands #asBinaryTree, [1] #asBinaryTree:, [1] #asBinomialHeap, [1] #asLeftistHeap, [1] #asSplayHeap, [1] #asUnbalancedSet, [1] #inject:into:, [1] a CollectionTest understands #testTopologicalSortOnCycleDo #testTopologicalSortOnCycleDo1 #testTopologicalSortOnCycleDo2 #testTopologicalSortOnCycleDo3 a CTBinaryTreeAbstract class understands #empty, [1] #withArrayedCollection:, [1] #withCollection:, [1] a CTBinaryTreeAbstract understands #push:, [1] a CTBinaryTreeAbstractTest understands #testCreation, [1] #testPushOrderedCollection, [1] #testPushOrderedInterval, [1] #testPushShuffledCollection, [1] #testPushShuffledInterval, [1] #tree:, [1] a CTBinaryTreeEmpty understands #mergeBinaryTreeElement:inBinaryTree:, [1] a CTBinaryTreeEmptySplayHeap understands #partition:inSplayHeap:do:, [1] a CTBinaryTreeEmptyUnbalanced understands #push:witness:continuation:inSet:, [1] a CTBinaryTreeNode understands #mergeBinaryTreeElement:inBinaryTree:, [1] a CTBinaryTreeNodeLeftistHeap understands #insert:left:right:inBinaryTree:, [1] #mergeBinaryTreeElement:inBinaryTree:, [1] a CTBinaryTreeNodeSplayHeap understands #mergeBinaryTreeElement:inBinaryTree:, [1] #partition:inSplayHeap:do:, [1] #partitionGreaterThanOrEqualTo:inSplayHeap:do:, [1] #partitionLessThan:inSplayHeap:do:, [1] a CTBinaryTreeNodeUnbalanced understands #mergeBinaryTreeElement:inBinaryTree:, [1] #push:witness:continuation:inSet:, [1] a CTBinomialHeap class understands #empty, [1] #withArrayedCollection:, [1] #withCollection:, [1] a CTBinomialHeap understands #merge:with:, [1] #push:, [1] #pushTree:onTrees:, [1] a CTBinomialHeapTest understands #tree:, [1] a CTBinomialTree understands #linkBinomialTree:, [1] a CTLeftistHeapTest understands #tree:, [1] a CTLinkedStoragePool understands #allocateOrReuseLink #newLink #releaseLink: a CTLinkedStoragePoolQueue understands #removeAll a CTLinkedStoragePoolStack understands #removeAll a CTLinkedStoragePoolTest understands #testEmptyCircularList #testEmptyQueue #testEmptyStack #testPolynomialAdditionFromKnuthTextbook #testPopFromEmptyCircular #testPopFromEmptyQueue #testPopFromEmptyStack #testRemoveAllFromQueue #testRemoveAllFromStack #testSomePushesThenPopsOnCircular #testSomePushesThenPopsOnQueue #testSomePushesThenPopsOnStack a CTLinksLinkTest understands #testEmptyLink #testLinkNext3 #testLinkReferencingAnotherLink #testLinkReferencingItself #testThreeLinksReferencingEachOther #testThreeLinksTooMuchSkipping a CTLinksValueLinkTest understands #test11ValueLinksLoop #test21ValueLinks #test321ValueLinks #test43214ValueLinks #test4321ValueLinks #test4321ValueLinksNested #testAsLinkedList, [1] #testAsLinkedList4321, [1] #testAsLinkedListFromInterval, [1] #testAsValueLink, [1] #testAsValueLinkInjectInto, [1] #testNilAsLinkedList, [1] #testSimpleValueLink a CTSkipList class understands #onSortedCollection:lowerBound:upperBound:, [1] #onSortedCollection:lowerBound:upperBound:atRandom:, [1] a CTSkipList understands #add:atHeight:, [1] #add:atHeight:predecessors:, [1] #includes:equalityBlock:, [1] #predecessors:, [1] a CTSkipListTest understands #sutCrescenzi, [1] a CTSplayHeap understands #push:, [1] a CTSplayHeapTest understands #tree:, [1] a CTUnbalancedSet understands #push:, [1] #pushingAlreadyIncluded:continuation:, [1] a CTUnbalancedSetTest understands #testPushDoubledObject, [1] #tree:, [1] a Dictionary understands #anyAssociation a EssentialsObjectTest understands #testByteArrayInteger #testByteArrayLiteral #testByteArrayLoremIpsum #testCollectionSubclasses #testInspect10GoldenRatios #testInspect10GoldenRectangles #testInspect10GoldenRectanglesNested #testInspect20CatalanNumbers #testInspect20FibonacciNumbers #testInspect20LucasNumbers #testInspectAssociation #testInspectBag #testInspectBRGCodes #testInspectCatalanArray #testInspectCharacterPi #testInspectColorGray #testInspectContext #testInspectDatetimeNow #testInspectDictionary #testInspectFalse #testInspectFloatPi #testInspectFraction #testInspectFractionForKisses #testInspectFractionKissing #testInspectFractionKissingEnumeration #testInspectFractionReciprocalKissing #testInspectGoldenRatio #testInspectHeap #testInspectIceRepositoryCommitsGraph #testInspectInteger13 #testInspectInteger13Detailed #testInspectNil #testInspectObject #testInspectObjectModel #testInspectOneToMany #testInspectPascalArray #testInspectPoint #testInspectProbabilisticMedianRatioWithSorting #testInspectRBNodesQuine #testInspectRSPolygon #testInspectSet #testInspectSkewBinaryCanonicalSparse #testInspectString #testInspectTrue #testLinkSubclasses #testMagnitudeSubclasses #testMagnitudeSubclassesSlotsGraph #testRandomSubclasses #testRBNodeSubclasses

a Fraction understands #\/ #kissingFractionLink: #kissingFractions #mediantFraction: #mediantInteger: a Integer understands #/% #/%~ #\/ #asShapeBinaryDots:walker: #asShapeBRGCDots: #asSkewBinaryCanonicalSparse #bitAverage: #bitBRGC #bitToggle:do: #factorialRecursive #fibonacciNumbers #gibonacciNumbersFirst:second:do: #goldenRatiosLower #halves:at:digits:base: #halves:base: #karatsuba:base: #kissingFractionLink: #lucasNumbers #mediantFraction: #mediantInteger: #nextEven #nextEvenOrSelf #nextFromLink: #nextOdd #nextOddOrSelf #previousEven #previousEvenOrSelf #previousOdd #previousOddOrSelf #productTo: #quoRemComplementaryInteger: #quoRemInteger: #slowFibonacci #slowFibonacci:tail: #slowFibonacciMemo: a IntegerTest understands #testBitAverage #testBitToggleDo #testBitToggleDo1 #testNextEven #testNextEvenOrSelf #testNextOdd #testNextOddOrSelf #testPreviousEven #testPreviousEvenOrSelf #testPreviousOdd #testPreviousOddOrSelf a Link understands #do:, [1] #next: #nextFromLink: #nextInteger: #nextLink: a MTVisualizationsTest understands #testProfileSlowFibonacciMemoingWithAdd #testProfileSlowFibonacciTailWithAdd #testProfileSlowFibonacciWithAdd #testSequenceableCollectionEstrinInit #testSequenceableCollectionHornerInit a Number understands #to:by:, [1] a Object understands #yourself: #~~> a Point understands #unitAffine:at: #unitAffine:at:and:at: a QuoRemComplementary class understands #a:b: a QuoRemComplementary understands #initialize a QuoRemStandard understands #initialize a Random understands #fairCoin #next #privateNextSeed #privateNextValue a RandomBernoulli understands #next a RandomBinomial understands #next a RandomBoxMullerBivariateGaussian understands #next a RandomExponential understands #next a RandomGaussian understands #next a RandomGeometric understands #next a RandomTestDistributions understands #testBernoulli #testBinomial #testExponential #testGaussian #testGaussianBoxMuller #testGeometric #testUniform a RSBasicShapeExamples understands #lineDeCasteljauLineClosedControlPoints #lineDeCasteljauLineNoteBox #linesDeCasteljauLineDegreeElevation #noteInteger #noteLoremIpsum a RSParametricCurveTest understands #sutBaricentricCoordinates: #sutBaricentricCoordinatesTriangle: a RSTParametricXYLines understands #lineParametricHypotrochoid #lineParametricLissajous #lineParametricNeil #lineParametricNeil2 #lineParametricTrochoid #lineParametricUnitCircle #parametricXYlineButterfly a SequenceableCollection understands #asValueLink, [1] #atRandom: #bisect:baseBlock:, [1] #bisect:from:to:baseBlock:, [1] #estrin: #estrin:init: #foldr:init:, [1] #horner:init: #isAcyclicWithRespectToAssociations: #kth:ranking:atRandom: #overlappingPairsDo: #topologicalSortByAssociations:acyclicDo: #topologicalSortByAssociations:onCycleDo: a SkewBinaryCanonicalNumber understands #asInteger a SymbolicIntegerTest understands #testComplementaryQuoRem21Over9 #testComplementaryQuoRem9Over21 #testGCDof12and21 #testGCDof83and71 #testGCDof9and21 #testGCDofAdjacentFibonacciNumbers #testGCDofMultiplicativeInversesInZ17 #testGCDofZ17 #testQuoRem9Over21 #testQuoRemMinimal9Over21 #testStandardQuoRem21Over9 a TopologicalSortAlgorithm understands #handleCycleInValueLinksTable:do: #initializeValueLinksTable: #makeValueLinksTable #sinksOfValueLinksTable: #sortOn:sinksValueLink:valueLinksTable: #value:onCycleDo: a UndefinedObject understands #asLinkedList, [1] a ValueLink understands #asLinkedList, [1]

D

Divide and Conquer Estrin's method Factorial, fast Karatsuba's method

G

GitHub Pull Requests 7457 - Topological sort

P

Package Collections-Abstract-Tests-Base contains CollectionRootTest Package Collections-Sequenceable-Base contains Interval, [1] LinkedList, [1] Package Collections-Support-Links contains Link ValueLink Package Containers-BinaryTreeAbstract contains CTBinaryTreeAbstract, [1] CTBinaryTreeElement, [1] CTBinaryTreeEmpty, [1] CTBinaryTreeNode, [1] Package Containers-BinomialHeap contains CTBinomialHeap, [1] CTBinomialTree, [1] Package Containers-Essentials-Numbers contains QuoRemComplementary Package Containers-Essentials-Random contains RandomGeometric Package Containers-LeftistHeap contains CTLeftistHeap, [1] Package Containers-LinkedStoragePool contains CTLinkedStoragePool Package Containers-RedBlackSet contains CTRedBlackSet, [1] CTUnbalancedSet, [1] Package Containers-SplayHeap contains CTSplayHeap, [1] Protocol *Collections-Sequenceable Number>>#to:by:, [1] Protocol *Containers-BinaryTreeAbstract ArrayedCollection>>#asBinaryTree:, [1] Collection>>#asBinaryTree:, [1] Protocol *Containers-BinomialHeap Collection>>#asBinomialHeap, [1] Protocol *Containers-Essentials BlockClosure>>#kissingFractions BlockClosure>>#valueWithArgumentedExit, [1] Dictionary>>#anyAssociation Fraction>>#\/ Fraction>>#kissingFractionLink: Fraction>>#kissingFractions Fraction>>#mediantFraction: Fraction>>#mediantInteger: Integer>>#/% Integer>>#/%~ Integer>>#\/ Integer>>#asSkewBinaryCanonicalSparse Integer>>#bitAverage: Integer>>#bitBRGC Integer>>#bitToggle:do: Integer>>#factorialRecursive Integer>>#fibonacciNumbers Integer>>#gibonacciNumbersFirst:second:do: Integer>>#goldenRatiosLower Integer>>#halves:at:digits:base: Integer>>#halves:base: Integer>>#karatsuba:base: Integer>>#kissingFractionLink: Integer>>#lucasNumbers Integer>>#mediantFraction: Integer>>#mediantInteger: Integer>>#nextEven Integer>>#nextEvenOrSelf Integer>>#nextFromLink: Integer>>#nextOdd Integer>>#nextOddOrSelf Integer>>#previousEven Integer>>#previousEvenOrSelf Integer>>#previousOdd Integer>>#previousOddOrSelf Integer>>#productTo: Integer>>#quoRemComplementaryInteger: Integer>>#quoRemInteger: Integer>>#slowFibonacci Integer>>#slowFibonacci:tail: Integer>>#slowFibonacciMemo: Link>>#do:, [1] Link>>#next: Link>>#nextFromLink: Link>>#nextInteger: Object>>#yourself: Point>>#unitAffine:at: Point>>#unitAffine:at:and:at: Random>>#fairCoin SequenceableCollection>>#asValueLink, [1] SequenceableCollection>>#bisect:baseBlock:, [1] SequenceableCollection>>#bisect:from:to:baseBlock:, [1] SequenceableCollection>>#estrin: SequenceableCollection>>#estrin:init: SequenceableCollection>>#foldr:init:, [1] SequenceableCollection>>#horner:init: SequenceableCollection>>#kth:ranking:atRandom: UndefinedObject>>#asLinkedList, [1] ValueLink>>#asLinkedList, [1] Protocol *Containers-Essentials-Tests IntegerTest>>#testBitAverage IntegerTest>>#testBitToggleDo IntegerTest>>#testBitToggleDo1 IntegerTest>>#testNextEven IntegerTest>>#testNextEvenOrSelf IntegerTest>>#testNextOdd IntegerTest>>#testNextOddOrSelf IntegerTest>>#testPreviousEven IntegerTest>>#testPreviousEvenOrSelf IntegerTest>>#testPreviousOdd IntegerTest>>#testPreviousOddOrSelf RandomTestDistributions>>#testBernoulli RandomTestDistributions>>#testBinomial RandomTestDistributions>>#testExponential RandomTestDistributions>>#testGaussian RandomTestDistributions>>#testGaussianBoxMuller RandomTestDistributions>>#testGeometric RandomTestDistributions>>#testUniform Protocol *Containers-Essentials-Visualizations Integer>>#asShapeBinaryDots:walker: Integer>>#asShapeBRGCDots: Protocol *Containers-LeftistHeap Collection>>#asLeftistHeap, [1] Protocol *Containers-Links Association>>#decrementCountIfZero:forTopologicalSortAlgorithm: Association>>#ifSink:otherwise:forTopologicalSortAlgorithm: SequenceableCollection>>#isAcyclicWithRespectToAssociations: SequenceableCollection>>#topologicalSortByAssociations:acyclicDo: SequenceableCollection>>#topologicalSortByAssociations:onCycleDo: Protocol *Containers-Links-Tests CollectionTest>>#testTopologicalSortOnCycleDo CollectionTest>>#testTopologicalSortOnCycleDo1 CollectionTest>>#testTopologicalSortOnCycleDo2 CollectionTest>>#testTopologicalSortOnCycleDo3 Protocol *Containers-RedBlackSet Collection>>#asBinaryTree, [1] Collection>>#asUnbalancedSet, [1] Protocol *Containers-SplayHeap Collection>>#asSplayHeap, [1] Protocol *Random-Core SequenceableCollection>>#atRandom: Protocol accessing CTSkipList>>#add:atHeight:, [1] CTSkipList>>#add:atHeight:predecessors:, [1] CTSkipList>>#predecessors:, [1] Link>>#nextLink: QuoRemComplementary>>#initialize QuoRemStandard>>#initialize Random>>#next RandomBernoulli>>#next RandomBinomial>>#next RandomBoxMullerBivariateGaussian>>#next RandomExponential>>#next RandomGaussian>>#next RandomGeometric>>#next Protocol actions CTBinaryTreeEmpty>>#mergeBinaryTreeElement:inBinaryTree:, [1] CTBinaryTreeNode>>#mergeBinaryTreeElement:inBinaryTree:, [1] CTBinaryTreeNodeLeftistHeap>>#insert:left:right:inBinaryTree:, [1] CTBinaryTreeNodeLeftistHeap>>#mergeBinaryTreeElement:inBinaryTree:, [1] CTBinaryTreeNodeSplayHeap>>#mergeBinaryTreeElement:inBinaryTree:, [1] CTBinaryTreeNodeUnbalanced>>#mergeBinaryTreeElement:inBinaryTree:, [1] Protocol adding CTBinaryTreeAbstract>>#push:, [1] CTBinaryTreeNodeUnbalanced>>#push:witness:continuation:inSet:, [1] CTBinomialHeap>>#merge:with:, [1] CTBinomialHeap>>#push:, [1] CTBinomialHeap>>#pushTree:onTrees:, [1] CTSplayHeap>>#push:, [1] CTUnbalancedSet>>#push:, [1] Protocol as yet unclassified CTBinaryTreeEmptyUnbalanced>>#push:witness:continuation:inSet:, [1] CTBinomialTree>>#linkBinomialTree:, [1] CTUnbalancedSet>>#pushingAlreadyIncluded:continuation:, [1] QuoRemComplementary class>>#a:b:

Protocol associating Object>>#~~> Protocol converting SkewBinaryCanonicalNumber>>#asInteger Protocol creation CTSkipList class>>#onSortedCollection:lowerBound:upperBound:, [1] CTSkipList class>>#onSortedCollection:lowerBound:upperBound:atRandom:, [1] Protocol enumerating Collection>>#inject:into:, [1] SequenceableCollection>>#overlappingPairsDo: TopologicalSortAlgorithm>>#handleCycleInValueLinksTable:do: TopologicalSortAlgorithm>>#initializeValueLinksTable: TopologicalSortAlgorithm>>#makeValueLinksTable TopologicalSortAlgorithm>>#sinksOfValueLinksTable: TopologicalSortAlgorithm>>#sortOn:sinksValueLink:valueLinksTable: TopologicalSortAlgorithm>>#value:onCycleDo: Protocol initialization CTLinkedStoragePool>>#allocateOrReuseLink CTLinkedStoragePool>>#newLink CTLinkedStoragePool>>#releaseLink: Protocol instance creation CTBinaryTreeAbstract class>>#withArrayedCollection:, [1] CTBinaryTreeAbstract class>>#withCollection:, [1] CTBinomialHeap class>>#withArrayedCollection:, [1] CTBinomialHeap class>>#withCollection:, [1] Protocol lines RSBasicShapeExamples>>#lineDeCasteljauLineClosedControlPoints RSBasicShapeExamples>>#lineDeCasteljauLineNoteBox RSBasicShapeExamples>>#linesDeCasteljauLineDegreeElevation RSBasicShapeExamples>>#noteInteger RSBasicShapeExamples>>#noteLoremIpsum RSTParametricXYLines>>#lineParametricHypotrochoid RSTParametricXYLines>>#lineParametricLissajous RSTParametricXYLines>>#lineParametricNeil RSTParametricXYLines>>#lineParametricNeil2 RSTParametricXYLines>>#lineParametricTrochoid RSTParametricXYLines>>#lineParametricUnitCircle RSTParametricXYLines>>#parametricXYlineButterfly Protocol partitioning CTBinaryTreeEmptySplayHeap>>#partition:inSplayHeap:do:, [1] CTBinaryTreeNodeSplayHeap>>#partition:inSplayHeap:do:, [1] CTBinaryTreeNodeSplayHeap>>#partitionGreaterThanOrEqualTo:inSplayHeap:do:, [1] CTBinaryTreeNodeSplayHeap>>#partitionLessThan:inSplayHeap:do:, [1] Protocol private Random>>#privateNextSeed Random>>#privateNextValue Protocol removing CTLinkedStoragePoolQueue>>#removeAll CTLinkedStoragePoolStack>>#removeAll Protocol requirements CTBinaryTreeAbstract class>>#empty, [1] CTBinomialHeap class>>#empty, [1] Protocol systems under tests RSParametricCurveTest>>#sutBaricentricCoordinates: RSParametricCurveTest>>#sutBaricentricCoordinatesTriangle: Protocol testing CTSkipList>>#includes:equalityBlock:, [1] Protocol tests CTBinaryTreeAbstractTest>>#testCreation, [1] CTBinaryTreeAbstractTest>>#testPushOrderedCollection, [1] CTBinaryTreeAbstractTest>>#testPushOrderedInterval, [1] CTBinaryTreeAbstractTest>>#testPushShuffledCollection, [1] CTBinaryTreeAbstractTest>>#testPushShuffledInterval, [1] CTBinaryTreeAbstractTest>>#tree:, [1] CTBinomialHeapTest>>#tree:, [1] CTLeftistHeapTest>>#tree:, [1] CTLinkedStoragePoolTest>>#testEmptyCircularList CTLinkedStoragePoolTest>>#testEmptyQueue CTLinkedStoragePoolTest>>#testEmptyStack CTLinkedStoragePoolTest>>#testPolynomialAdditionFromKnuthTextbook CTLinkedStoragePoolTest>>#testPopFromEmptyCircular CTLinkedStoragePoolTest>>#testPopFromEmptyQueue CTLinkedStoragePoolTest>>#testPopFromEmptyStack CTLinkedStoragePoolTest>>#testRemoveAllFromQueue CTLinkedStoragePoolTest>>#testRemoveAllFromStack CTLinkedStoragePoolTest>>#testSomePushesThenPopsOnCircular CTLinkedStoragePoolTest>>#testSomePushesThenPopsOnQueue CTLinkedStoragePoolTest>>#testSomePushesThenPopsOnStack CTLinksLinkTest>>#testEmptyLink CTLinksLinkTest>>#testLinkNext3 CTLinksLinkTest>>#testLinkReferencingAnotherLink CTLinksLinkTest>>#testLinkReferencingItself CTLinksLinkTest>>#testThreeLinksReferencingEachOther CTLinksLinkTest>>#testThreeLinksTooMuchSkipping CTLinksValueLinkTest>>#test11ValueLinksLoop CTLinksValueLinkTest>>#test21ValueLinks CTLinksValueLinkTest>>#test321ValueLinks CTLinksValueLinkTest>>#test43214ValueLinks CTLinksValueLinkTest>>#test4321ValueLinks CTLinksValueLinkTest>>#test4321ValueLinksNested CTLinksValueLinkTest>>#testAsLinkedList, [1] CTLinksValueLinkTest>>#testAsLinkedList4321, [1] CTLinksValueLinkTest>>#testAsLinkedListFromInterval, [1] CTLinksValueLinkTest>>#testAsValueLink, [1] CTLinksValueLinkTest>>#testAsValueLinkInjectInto, [1] CTLinksValueLinkTest>>#testNilAsLinkedList, [1] CTLinksValueLinkTest>>#testSimpleValueLink CTSkipListTest>>#sutCrescenzi, [1] CTSplayHeapTest>>#tree:, [1] CTUnbalancedSetTest>>#testPushDoubledObject, [1] CTUnbalancedSetTest>>#tree:, [1] EssentialsObjectTest>>#testByteArrayInteger EssentialsObjectTest>>#testByteArrayLiteral EssentialsObjectTest>>#testByteArrayLoremIpsum EssentialsObjectTest>>#testCollectionSubclasses EssentialsObjectTest>>#testInspect10GoldenRatios EssentialsObjectTest>>#testInspect10GoldenRectangles EssentialsObjectTest>>#testInspect10GoldenRectanglesNested EssentialsObjectTest>>#testInspect20CatalanNumbers EssentialsObjectTest>>#testInspect20FibonacciNumbers EssentialsObjectTest>>#testInspect20LucasNumbers EssentialsObjectTest>>#testInspectAssociation EssentialsObjectTest>>#testInspectBag EssentialsObjectTest>>#testInspectBRGCodes EssentialsObjectTest>>#testInspectCatalanArray EssentialsObjectTest>>#testInspectCharacterPi EssentialsObjectTest>>#testInspectColorGray EssentialsObjectTest>>#testInspectContext EssentialsObjectTest>>#testInspectDatetimeNow EssentialsObjectTest>>#testInspectDictionary EssentialsObjectTest>>#testInspectFalse EssentialsObjectTest>>#testInspectFloatPi EssentialsObjectTest>>#testInspectFraction EssentialsObjectTest>>#testInspectFractionForKisses EssentialsObjectTest>>#testInspectFractionKissing EssentialsObjectTest>>#testInspectFractionKissingEnumeration EssentialsObjectTest>>#testInspectFractionReciprocalKissing EssentialsObjectTest>>#testInspectGoldenRatio EssentialsObjectTest>>#testInspectHeap EssentialsObjectTest>>#testInspectIceRepositoryCommitsGraph EssentialsObjectTest>>#testInspectInteger13 EssentialsObjectTest>>#testInspectInteger13Detailed EssentialsObjectTest>>#testInspectNil EssentialsObjectTest>>#testInspectObject EssentialsObjectTest>>#testInspectObjectModel EssentialsObjectTest>>#testInspectOneToMany EssentialsObjectTest>>#testInspectPascalArray EssentialsObjectTest>>#testInspectPoint EssentialsObjectTest>>#testInspectProbabilisticMedianRatioWithSorting EssentialsObjectTest>>#testInspectRBNodesQuine EssentialsObjectTest>>#testInspectRSPolygon EssentialsObjectTest>>#testInspectSet EssentialsObjectTest>>#testInspectSkewBinaryCanonicalSparse EssentialsObjectTest>>#testInspectString EssentialsObjectTest>>#testInspectTrue EssentialsObjectTest>>#testLinkSubclasses EssentialsObjectTest>>#testMagnitudeSubclasses EssentialsObjectTest>>#testMagnitudeSubclassesSlotsGraph EssentialsObjectTest>>#testRandomSubclasses EssentialsObjectTest>>#testRBNodeSubclasses MTVisualizationsTest>>#testProfileSlowFibonacciMemoingWithAdd MTVisualizationsTest>>#testProfileSlowFibonacciTailWithAdd MTVisualizationsTest>>#testProfileSlowFibonacciWithAdd MTVisualizationsTest>>#testSequenceableCollectionEstrinInit MTVisualizationsTest>>#testSequenceableCollectionHornerInit SymbolicIntegerTest>>#testComplementaryQuoRem21Over9 SymbolicIntegerTest>>#testComplementaryQuoRem9Over21 SymbolicIntegerTest>>#testGCDof12and21 SymbolicIntegerTest>>#testGCDof83and71 SymbolicIntegerTest>>#testGCDof9and21 SymbolicIntegerTest>>#testGCDofAdjacentFibonacciNumbers SymbolicIntegerTest>>#testGCDofMultiplicativeInversesInZ17 SymbolicIntegerTest>>#testGCDofZ17 SymbolicIntegerTest>>#testQuoRem9Over21 SymbolicIntegerTest>>#testQuoRemMinimal9Over21 SymbolicIntegerTest>>#testStandardQuoRem21Over9

S

Sequence diagrams Estrin's method Factorial, fast Factorial, slow Fibonacci numbers, additions Fibonacci numbers, exponential Fibonacci numbers, memoized Fibonacci numbers, tail-calls Horner's method Karatsuba's method

Sorting algorithms Topological by associations of naturals

T

TAOCP by Donald Knuth Volume 1, Algorithm T at page 264

Test cases Topological sort