Browse files

Added project and code for Cocoa Data Structures framework.

git-svn-id: http://dysart.cs.byu.edu/chsvn/trunk@2 a75b6edf-6070-4da8-89c8-9992cc802e51
  • Loading branch information...
1 parent ccec8fd commit 16cec0699b0eab969bec5fad58bd7e0c911dffc4 @quinntaylor committed Sep 24, 2008
View
602 DataStructures.xcodeproj/project.pbxproj
@@ -0,0 +1,602 @@
+// !$*UTF8*$!
+{
+ archiveVersion = 1;
+ classes = {
+ };
+ objectVersion = 45;
+ objects = {
+
+/* Begin PBXAggregateTarget section */
+ E4FE76D80E89556A00971EE6 /* Documentation */ = {
+ isa = PBXAggregateTarget;
+ buildConfigurationList = E4FE76F70E8955BB00971EE6 /* Build configuration list for PBXAggregateTarget "Documentation" */;
+ buildPhases = (
+ E4FE76D70E89556A00971EE6 /* ShellScript */,
+ );
+ dependencies = (
+ E4FE76DC0E89557F00971EE6 /* PBXTargetDependency */,
+ );
+ name = Documentation;
+ productName = Documentation;
+ };
+/* End PBXAggregateTarget section */
+
+/* Begin PBXBuildFile section */
+ 8DC2EF530486A6940098B216 /* InfoPlist.strings in Resources */ = {isa = PBXBuildFile; fileRef = 089C1666FE841158C02AAC07 /* InfoPlist.strings */; };
+ E4ADBA930E88155A00B570BC /* Foundation.framework in Frameworks */ = {isa = PBXBuildFile; fileRef = 0867D69BFE84028FC02AAC07 /* Foundation.framework */; };
+ E4ADBB240E88174200B570BC /* ArrayHeap.h in Headers */ = {isa = PBXBuildFile; fileRef = E4ADBB060E88174200B570BC /* ArrayHeap.h */; settings = {ATTRIBUTES = (Public, ); }; };
+ E4ADBB250E88174200B570BC /* ArrayHeap.m in Sources */ = {isa = PBXBuildFile; fileRef = E4ADBB070E88174200B570BC /* ArrayHeap.m */; };
+ E4ADBB260E88174200B570BC /* ArrayQueue.h in Headers */ = {isa = PBXBuildFile; fileRef = E4ADBB080E88174200B570BC /* ArrayQueue.h */; settings = {ATTRIBUTES = (Public, ); }; };
+ E4ADBB270E88174200B570BC /* ArrayQueue.m in Sources */ = {isa = PBXBuildFile; fileRef = E4ADBB090E88174200B570BC /* ArrayQueue.m */; };
+ E4ADBB280E88174200B570BC /* ArrayStack.h in Headers */ = {isa = PBXBuildFile; fileRef = E4ADBB0A0E88174200B570BC /* ArrayStack.h */; settings = {ATTRIBUTES = (Public, ); }; };
+ E4ADBB290E88174200B570BC /* ArrayStack.m in Sources */ = {isa = PBXBuildFile; fileRef = E4ADBB0B0E88174200B570BC /* ArrayStack.m */; };
+ E4ADBB2A0E88174200B570BC /* AbstractTree.h in Headers */ = {isa = PBXBuildFile; fileRef = E4ADBB0C0E88174200B570BC /* AbstractTree.h */; settings = {ATTRIBUTES = (); }; };
+ E4ADBB2B0E88174200B570BC /* Comparable.h in Headers */ = {isa = PBXBuildFile; fileRef = E4ADBB0D0E88174200B570BC /* Comparable.h */; settings = {ATTRIBUTES = (Public, ); }; };
+ E4ADBB2C0E88174200B570BC /* DSFArrayQueue.h in Headers */ = {isa = PBXBuildFile; fileRef = E4ADBB0E0E88174200B570BC /* DSFArrayQueue.h */; settings = {ATTRIBUTES = (Public, ); }; };
+ E4ADBB2D0E88174200B570BC /* DSFArrayQueue.m in Sources */ = {isa = PBXBuildFile; fileRef = E4ADBB0F0E88174200B570BC /* DSFArrayQueue.m */; };
+ E4ADBB2E0E88174200B570BC /* DSFMutableArray.h in Headers */ = {isa = PBXBuildFile; fileRef = E4ADBB100E88174200B570BC /* DSFMutableArray.h */; settings = {ATTRIBUTES = (Public, ); }; };
+ E4ADBB2F0E88174200B570BC /* DSFMutableArray.m in Sources */ = {isa = PBXBuildFile; fileRef = E4ADBB110E88174200B570BC /* DSFMutableArray.m */; };
+ E4ADBB300E88174200B570BC /* Heap.h in Headers */ = {isa = PBXBuildFile; fileRef = E4ADBB120E88174200B570BC /* Heap.h */; settings = {ATTRIBUTES = (Public, ); }; };
+ E4ADBB310E88174200B570BC /* LLQueue.h in Headers */ = {isa = PBXBuildFile; fileRef = E4ADBB130E88174200B570BC /* LLQueue.h */; settings = {ATTRIBUTES = (Public, ); }; };
+ E4ADBB320E88174200B570BC /* LLQueue.m in Sources */ = {isa = PBXBuildFile; fileRef = E4ADBB140E88174200B570BC /* LLQueue.m */; };
+ E4ADBB330E88174200B570BC /* LLStack.h in Headers */ = {isa = PBXBuildFile; fileRef = E4ADBB150E88174200B570BC /* LLStack.h */; settings = {ATTRIBUTES = (Public, ); }; };
+ E4ADBB340E88174200B570BC /* LLStack.m in Sources */ = {isa = PBXBuildFile; fileRef = E4ADBB160E88174200B570BC /* LLStack.m */; };
+ E4ADBB350E88174200B570BC /* LinkedList.h in Headers */ = {isa = PBXBuildFile; fileRef = E4ADBB170E88174200B570BC /* LinkedList.h */; settings = {ATTRIBUTES = (Public, ); }; };
+ E4ADBB360E88174200B570BC /* Queue.h in Headers */ = {isa = PBXBuildFile; fileRef = E4ADBB180E88174200B570BC /* Queue.h */; settings = {ATTRIBUTES = (Public, ); }; };
+ E4ADBB370E88174200B570BC /* RBNode.h in Headers */ = {isa = PBXBuildFile; fileRef = E4ADBB190E88174200B570BC /* RBNode.h */; settings = {ATTRIBUTES = (Private, ); }; };
+ E4ADBB380E88174200B570BC /* RBNode.m in Sources */ = {isa = PBXBuildFile; fileRef = E4ADBB1A0E88174200B570BC /* RBNode.m */; };
+ E4ADBB390E88174200B570BC /* RedBlackTree.h in Headers */ = {isa = PBXBuildFile; fileRef = E4ADBB1B0E88174200B570BC /* RedBlackTree.h */; settings = {ATTRIBUTES = (Public, ); }; };
+ E4ADBB3A0E88174200B570BC /* RedBlackTree.m in Sources */ = {isa = PBXBuildFile; fileRef = E4ADBB1C0E88174200B570BC /* RedBlackTree.m */; };
+ E4ADBB3B0E88174200B570BC /* Stack.h in Headers */ = {isa = PBXBuildFile; fileRef = E4ADBB1D0E88174200B570BC /* Stack.h */; settings = {ATTRIBUTES = (Public, ); }; };
+ E4ADBB3C0E88174200B570BC /* StandardLinkedList.h in Headers */ = {isa = PBXBuildFile; fileRef = E4ADBB1E0E88174200B570BC /* StandardLinkedList.h */; settings = {ATTRIBUTES = (Public, ); }; };
+ E4ADBB3D0E88174200B570BC /* StandardLinkedList.m in Sources */ = {isa = PBXBuildFile; fileRef = E4ADBB1F0E88174200B570BC /* StandardLinkedList.m */; };
+ E4ADBB400E88174200B570BC /* UnbalancedTree.h in Headers */ = {isa = PBXBuildFile; fileRef = E4ADBB220E88174200B570BC /* UnbalancedTree.h */; settings = {ATTRIBUTES = (Public, ); }; };
+ E4ADBB410E88174200B570BC /* UnbalancedTree.m in Sources */ = {isa = PBXBuildFile; fileRef = E4ADBB230E88174200B570BC /* UnbalancedTree.m */; };
+ E4ADBB800E8828C500B570BC /* README in Resources */ = {isa = PBXBuildFile; fileRef = E4ADBB7E0E8828C500B570BC /* README */; };
+ E4ADBB810E8828C500B570BC /* LICENSE in Resources */ = {isa = PBXBuildFile; fileRef = E4ADBB7F0E8828C500B570BC /* LICENSE */; };
+ E4ADBC9A0E88412C00B570BC /* AbstractTree.m in Sources */ = {isa = PBXBuildFile; fileRef = E4ADBC990E88412C00B570BC /* AbstractTree.m */; };
+ E4B83B6F0E898C76008914BD /* Test.m in Sources */ = {isa = PBXBuildFile; fileRef = E4B83B6E0E898C76008914BD /* Test.m */; };
+ E4B83B960E898D9B008914BD /* DataStructures.framework in Frameworks */ = {isa = PBXBuildFile; fileRef = 8DC2EF5B0486A6940098B216 /* DataStructures.framework */; };
+ E4FE77C70E8978C300971EE6 /* Tree.h in Headers */ = {isa = PBXBuildFile; fileRef = E4FE77C60E8978C300971EE6 /* Tree.h */; };
+ E4FE77CA0E8978DD00971EE6 /* AbstractTree.h in Headers */ = {isa = PBXBuildFile; fileRef = E4FE77C90E8978DD00971EE6 /* AbstractTree.h */; };
+/* End PBXBuildFile section */
+
+/* Begin PBXContainerItemProxy section */
+ E4B83B8A0E898D11008914BD /* PBXContainerItemProxy */ = {
+ isa = PBXContainerItemProxy;
+ containerPortal = 0867D690FE84028FC02AAC07 /* Project object */;
+ proxyType = 1;
+ remoteGlobalIDString = 8DC2EF4F0486A6940098B216;
+ remoteInfo = DataStructures;
+ };
+ E4B83CE40E89EF12008914BD /* PBXContainerItemProxy */ = {
+ isa = PBXContainerItemProxy;
+ containerPortal = 0867D690FE84028FC02AAC07 /* Project object */;
+ proxyType = 1;
+ remoteGlobalIDString = E4FE76D80E89556A00971EE6;
+ remoteInfo = Documentation;
+ };
+ E4FE76DB0E89557F00971EE6 /* PBXContainerItemProxy */ = {
+ isa = PBXContainerItemProxy;
+ containerPortal = 0867D690FE84028FC02AAC07 /* Project object */;
+ proxyType = 1;
+ remoteGlobalIDString = 8DC2EF4F0486A6940098B216;
+ remoteInfo = DataStructures;
+ };
+/* End PBXContainerItemProxy section */
+
+/* Begin PBXFileReference section */
+ 0867D69BFE84028FC02AAC07 /* Foundation.framework */ = {isa = PBXFileReference; lastKnownFileType = wrapper.framework; name = Foundation.framework; path = /System/Library/Frameworks/Foundation.framework; sourceTree = "<absolute>"; };
+ 089C1667FE841158C02AAC07 /* English */ = {isa = PBXFileReference; fileEncoding = 10; lastKnownFileType = text.plist.strings; name = English; path = English.lproj/InfoPlist.strings; sourceTree = "<group>"; };
+ 8DC2EF5B0486A6940098B216 /* DataStructures.framework */ = {isa = PBXFileReference; explicitFileType = wrapper.framework; includeInIndex = 0; path = DataStructures.framework; sourceTree = BUILT_PRODUCTS_DIR; };
+ E4ADBB060E88174200B570BC /* ArrayHeap.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = ArrayHeap.h; path = source/ArrayHeap.h; sourceTree = "<group>"; };
+ E4ADBB070E88174200B570BC /* ArrayHeap.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = ArrayHeap.m; path = source/ArrayHeap.m; sourceTree = "<group>"; };
+ E4ADBB080E88174200B570BC /* ArrayQueue.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = ArrayQueue.h; path = source/ArrayQueue.h; sourceTree = "<group>"; };
+ E4ADBB090E88174200B570BC /* ArrayQueue.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = ArrayQueue.m; path = source/ArrayQueue.m; sourceTree = "<group>"; };
+ E4ADBB0A0E88174200B570BC /* ArrayStack.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = ArrayStack.h; path = source/ArrayStack.h; sourceTree = "<group>"; };
+ E4ADBB0B0E88174200B570BC /* ArrayStack.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = ArrayStack.m; path = source/ArrayStack.m; sourceTree = "<group>"; };
+ E4ADBB0C0E88174200B570BC /* AbstractTree.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = AbstractTree.h; path = source/AbstractTree.h; sourceTree = "<group>"; };
+ E4ADBB0D0E88174200B570BC /* Comparable.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = Comparable.h; path = source/Comparable.h; sourceTree = "<group>"; };
+ E4ADBB0E0E88174200B570BC /* DSFArrayQueue.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = DSFArrayQueue.h; path = source/DSFArrayQueue.h; sourceTree = "<group>"; };
+ E4ADBB0F0E88174200B570BC /* DSFArrayQueue.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = DSFArrayQueue.m; path = source/DSFArrayQueue.m; sourceTree = "<group>"; };
+ E4ADBB100E88174200B570BC /* DSFMutableArray.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = DSFMutableArray.h; path = source/DSFMutableArray.h; sourceTree = "<group>"; };
+ E4ADBB110E88174200B570BC /* DSFMutableArray.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = DSFMutableArray.m; path = source/DSFMutableArray.m; sourceTree = "<group>"; };
+ E4ADBB120E88174200B570BC /* Heap.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = Heap.h; path = source/Heap.h; sourceTree = "<group>"; };
+ E4ADBB130E88174200B570BC /* LLQueue.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = LLQueue.h; path = source/LLQueue.h; sourceTree = "<group>"; };
+ E4ADBB140E88174200B570BC /* LLQueue.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = LLQueue.m; path = source/LLQueue.m; sourceTree = "<group>"; };
+ E4ADBB150E88174200B570BC /* LLStack.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = LLStack.h; path = source/LLStack.h; sourceTree = "<group>"; };
+ E4ADBB160E88174200B570BC /* LLStack.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = LLStack.m; path = source/LLStack.m; sourceTree = "<group>"; };
+ E4ADBB170E88174200B570BC /* LinkedList.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = LinkedList.h; path = source/LinkedList.h; sourceTree = "<group>"; };
+ E4ADBB180E88174200B570BC /* Queue.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = Queue.h; path = source/Queue.h; sourceTree = "<group>"; };
+ E4ADBB190E88174200B570BC /* RBNode.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = RBNode.h; path = source/RBNode.h; sourceTree = "<group>"; };
+ E4ADBB1A0E88174200B570BC /* RBNode.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = RBNode.m; path = source/RBNode.m; sourceTree = "<group>"; };
+ E4ADBB1B0E88174200B570BC /* RedBlackTree.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = RedBlackTree.h; path = source/RedBlackTree.h; sourceTree = "<group>"; };
+ E4ADBB1C0E88174200B570BC /* RedBlackTree.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = RedBlackTree.m; path = source/RedBlackTree.m; sourceTree = "<group>"; };
+ E4ADBB1D0E88174200B570BC /* Stack.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = Stack.h; path = source/Stack.h; sourceTree = "<group>"; };
+ E4ADBB1E0E88174200B570BC /* StandardLinkedList.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = StandardLinkedList.h; path = source/StandardLinkedList.h; sourceTree = "<group>"; };
+ E4ADBB1F0E88174200B570BC /* StandardLinkedList.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = StandardLinkedList.m; path = source/StandardLinkedList.m; sourceTree = "<group>"; };
+ E4ADBB220E88174200B570BC /* UnbalancedTree.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = UnbalancedTree.h; path = source/UnbalancedTree.h; sourceTree = "<group>"; };
+ E4ADBB230E88174200B570BC /* UnbalancedTree.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = UnbalancedTree.m; path = source/UnbalancedTree.m; sourceTree = "<group>"; };
+ E4ADBB7E0E8828C500B570BC /* README */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text; path = README; sourceTree = "<group>"; };
+ E4ADBB7F0E8828C500B570BC /* LICENSE */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text; path = LICENSE; sourceTree = "<group>"; };
+ E4ADBC990E88412C00B570BC /* AbstractTree.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = AbstractTree.m; path = source/AbstractTree.m; sourceTree = "<group>"; };
+ E4B83B620E898C26008914BD /* Test */ = {isa = PBXFileReference; explicitFileType = "compiled.mach-o.executable"; includeInIndex = 0; path = Test; sourceTree = BUILT_PRODUCTS_DIR; };
+ E4B83B6E0E898C76008914BD /* Test.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = Test.m; path = test/Test.m; sourceTree = "<group>"; };
+ E4FE77C60E8978C300971EE6 /* Tree.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = Tree.h; path = source/Tree.h; sourceTree = "<group>"; };
+ E4FE77C90E8978DD00971EE6 /* AbstractTree.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = AbstractTree.h; path = source/AbstractTree.h; sourceTree = "<group>"; };
+/* End PBXFileReference section */
+
+/* Begin PBXFrameworksBuildPhase section */
+ 8DC2EF560486A6940098B216 /* Frameworks */ = {
+ isa = PBXFrameworksBuildPhase;
+ buildActionMask = 2147483647;
+ files = (
+ E4ADBA930E88155A00B570BC /* Foundation.framework in Frameworks */,
+ );
+ runOnlyForDeploymentPostprocessing = 0;
+ };
+ E4B83B600E898C26008914BD /* Frameworks */ = {
+ isa = PBXFrameworksBuildPhase;
+ buildActionMask = 2147483647;
+ files = (
+ E4B83B960E898D9B008914BD /* DataStructures.framework in Frameworks */,
+ );
+ runOnlyForDeploymentPostprocessing = 0;
+ };
+/* End PBXFrameworksBuildPhase section */
+
+/* Begin PBXGroup section */
+ 034768DFFF38A50411DB9C8B /* Products */ = {
+ isa = PBXGroup;
+ children = (
+ 8DC2EF5B0486A6940098B216 /* DataStructures.framework */,
+ E4B83B620E898C26008914BD /* Test */,
+ );
+ name = Products;
+ sourceTree = "<group>";
+ };
+ 0867D691FE84028FC02AAC07 /* DataStructures */ = {
+ isa = PBXGroup;
+ children = (
+ 08FB77AEFE84172EC02AAC07 /* Classes */,
+ 089C1665FE841158C02AAC07 /* Resources */,
+ 0867D69AFE84028FC02AAC07 /* External Frameworks */,
+ 034768DFFF38A50411DB9C8B /* Products */,
+ E4B83B6E0E898C76008914BD /* Test.m */,
+ );
+ name = DataStructures;
+ sourceTree = "<group>";
+ };
+ 0867D69AFE84028FC02AAC07 /* External Frameworks */ = {
+ isa = PBXGroup;
+ children = (
+ 1058C7B0FEA5585E11CA2CBB /* Linked Frameworks */,
+ 1058C7B2FEA5585E11CA2CBB /* Other Frameworks */,
+ );
+ name = "External Frameworks";
+ sourceTree = "<group>";
+ };
+ 089C1665FE841158C02AAC07 /* Resources */ = {
+ isa = PBXGroup;
+ children = (
+ E4ADBB7F0E8828C500B570BC /* LICENSE */,
+ E4ADBB7E0E8828C500B570BC /* README */,
+ 089C1666FE841158C02AAC07 /* InfoPlist.strings */,
+ );
+ name = Resources;
+ sourceTree = "<group>";
+ };
+ 08FB77AEFE84172EC02AAC07 /* Classes */ = {
+ isa = PBXGroup;
+ children = (
+ E4FE77C90E8978DD00971EE6 /* AbstractTree.h */,
+ E4ADBC990E88412C00B570BC /* AbstractTree.m */,
+ E4ADBB060E88174200B570BC /* ArrayHeap.h */,
+ E4ADBB070E88174200B570BC /* ArrayHeap.m */,
+ E4ADBB080E88174200B570BC /* ArrayQueue.h */,
+ E4ADBB090E88174200B570BC /* ArrayQueue.m */,
+ E4ADBB0A0E88174200B570BC /* ArrayStack.h */,
+ E4ADBB0B0E88174200B570BC /* ArrayStack.m */,
+ E4ADBB0C0E88174200B570BC /* AbstractTree.h */,
+ E4ADBB0D0E88174200B570BC /* Comparable.h */,
+ E4ADBB0E0E88174200B570BC /* DSFArrayQueue.h */,
+ E4ADBB0F0E88174200B570BC /* DSFArrayQueue.m */,
+ E4ADBB100E88174200B570BC /* DSFMutableArray.h */,
+ E4ADBB110E88174200B570BC /* DSFMutableArray.m */,
+ E4ADBB120E88174200B570BC /* Heap.h */,
+ E4ADBB130E88174200B570BC /* LLQueue.h */,
+ E4ADBB140E88174200B570BC /* LLQueue.m */,
+ E4ADBB150E88174200B570BC /* LLStack.h */,
+ E4ADBB160E88174200B570BC /* LLStack.m */,
+ E4ADBB170E88174200B570BC /* LinkedList.h */,
+ E4ADBB180E88174200B570BC /* Queue.h */,
+ E4ADBB190E88174200B570BC /* RBNode.h */,
+ E4ADBB1A0E88174200B570BC /* RBNode.m */,
+ E4ADBB1B0E88174200B570BC /* RedBlackTree.h */,
+ E4ADBB1C0E88174200B570BC /* RedBlackTree.m */,
+ E4ADBB1D0E88174200B570BC /* Stack.h */,
+ E4ADBB1E0E88174200B570BC /* StandardLinkedList.h */,
+ E4ADBB1F0E88174200B570BC /* StandardLinkedList.m */,
+ E4FE77C60E8978C300971EE6 /* Tree.h */,
+ E4ADBB220E88174200B570BC /* UnbalancedTree.h */,
+ E4ADBB230E88174200B570BC /* UnbalancedTree.m */,
+ );
+ name = Classes;
+ sourceTree = "<group>";
+ };
+ 1058C7B0FEA5585E11CA2CBB /* Linked Frameworks */ = {
+ isa = PBXGroup;
+ children = (
+ );
+ name = "Linked Frameworks";
+ sourceTree = "<group>";
+ };
+ 1058C7B2FEA5585E11CA2CBB /* Other Frameworks */ = {
+ isa = PBXGroup;
+ children = (
+ 0867D69BFE84028FC02AAC07 /* Foundation.framework */,
+ );
+ name = "Other Frameworks";
+ sourceTree = "<group>";
+ };
+/* End PBXGroup section */
+
+/* Begin PBXHeadersBuildPhase section */
+ 8DC2EF500486A6940098B216 /* Headers */ = {
+ isa = PBXHeadersBuildPhase;
+ buildActionMask = 2147483647;
+ files = (
+ E4ADBB240E88174200B570BC /* ArrayHeap.h in Headers */,
+ E4ADBB260E88174200B570BC /* ArrayQueue.h in Headers */,
+ E4ADBB280E88174200B570BC /* ArrayStack.h in Headers */,
+ E4ADBB2A0E88174200B570BC /* AbstractTree.h in Headers */,
+ E4ADBB2B0E88174200B570BC /* Comparable.h in Headers */,
+ E4ADBB2C0E88174200B570BC /* DSFArrayQueue.h in Headers */,
+ E4ADBB2E0E88174200B570BC /* DSFMutableArray.h in Headers */,
+ E4ADBB300E88174200B570BC /* Heap.h in Headers */,
+ E4ADBB310E88174200B570BC /* LLQueue.h in Headers */,
+ E4ADBB330E88174200B570BC /* LLStack.h in Headers */,
+ E4ADBB350E88174200B570BC /* LinkedList.h in Headers */,
+ E4ADBB360E88174200B570BC /* Queue.h in Headers */,
+ E4ADBB370E88174200B570BC /* RBNode.h in Headers */,
+ E4ADBB390E88174200B570BC /* RedBlackTree.h in Headers */,
+ E4ADBB3B0E88174200B570BC /* Stack.h in Headers */,
+ E4ADBB3C0E88174200B570BC /* StandardLinkedList.h in Headers */,
+ E4ADBB400E88174200B570BC /* UnbalancedTree.h in Headers */,
+ E4FE77C70E8978C300971EE6 /* Tree.h in Headers */,
+ E4FE77CA0E8978DD00971EE6 /* AbstractTree.h in Headers */,
+ );
+ runOnlyForDeploymentPostprocessing = 0;
+ };
+/* End PBXHeadersBuildPhase section */
+
+/* Begin PBXNativeTarget section */
+ 8DC2EF4F0486A6940098B216 /* DataStructures */ = {
+ isa = PBXNativeTarget;
+ buildConfigurationList = 1DEB91AD08733DA50010E9CD /* Build configuration list for PBXNativeTarget "DataStructures" */;
+ buildPhases = (
+ 8DC2EF500486A6940098B216 /* Headers */,
+ 8DC2EF520486A6940098B216 /* Resources */,
+ 8DC2EF540486A6940098B216 /* Sources */,
+ 8DC2EF560486A6940098B216 /* Frameworks */,
+ );
+ buildRules = (
+ );
+ dependencies = (
+ );
+ name = DataStructures;
+ productInstallPath = "$(HOME)/Library/Frameworks";
+ productName = DataStructures;
+ productReference = 8DC2EF5B0486A6940098B216 /* DataStructures.framework */;
+ productType = "com.apple.product-type.framework";
+ };
+ E4B83B610E898C26008914BD /* Test */ = {
+ isa = PBXNativeTarget;
+ buildConfigurationList = E4B83B6D0E898C49008914BD /* Build configuration list for PBXNativeTarget "Test" */;
+ buildPhases = (
+ E4B83B5F0E898C26008914BD /* Sources */,
+ E4B83B600E898C26008914BD /* Frameworks */,
+ );
+ buildRules = (
+ );
+ dependencies = (
+ E4B83B8B0E898D11008914BD /* PBXTargetDependency */,
+ E4B83CE50E89EF12008914BD /* PBXTargetDependency */,
+ );
+ name = Test;
+ productName = Test;
+ productReference = E4B83B620E898C26008914BD /* Test */;
+ productType = "com.apple.product-type.tool";
+ };
+/* End PBXNativeTarget section */
+
+/* Begin PBXProject section */
+ 0867D690FE84028FC02AAC07 /* Project object */ = {
+ isa = PBXProject;
+ buildConfigurationList = 1DEB91B108733DA50010E9CD /* Build configuration list for PBXProject "DataStructures" */;
+ compatibilityVersion = "Xcode 3.1";
+ hasScannedForEncodings = 1;
+ mainGroup = 0867D691FE84028FC02AAC07 /* DataStructures */;
+ productRefGroup = 034768DFFF38A50411DB9C8B /* Products */;
+ projectDirPath = "";
+ projectRoot = "";
+ targets = (
+ 8DC2EF4F0486A6940098B216 /* DataStructures */,
+ E4FE76D80E89556A00971EE6 /* Documentation */,
+ E4B83B610E898C26008914BD /* Test */,
+ );
+ };
+/* End PBXProject section */
+
+/* Begin PBXResourcesBuildPhase section */
+ 8DC2EF520486A6940098B216 /* Resources */ = {
+ isa = PBXResourcesBuildPhase;
+ buildActionMask = 2147483647;
+ files = (
+ 8DC2EF530486A6940098B216 /* InfoPlist.strings in Resources */,
+ E4ADBB800E8828C500B570BC /* README in Resources */,
+ E4ADBB810E8828C500B570BC /* LICENSE in Resources */,
+ );
+ runOnlyForDeploymentPostprocessing = 0;
+ };
+/* End PBXResourcesBuildPhase section */
+
+/* Begin PBXShellScriptBuildPhase section */
+ E4FE76D70E89556A00971EE6 /* ShellScript */ = {
+ isa = PBXShellScriptBuildPhase;
+ buildActionMask = 2147483647;
+ files = (
+ );
+ inputPaths = (
+ );
+ outputPaths = (
+ );
+ runOnlyForDeploymentPostprocessing = 0;
+ shellPath = /bin/sh;
+ shellScript = doxygen;
+ };
+/* End PBXShellScriptBuildPhase section */
+
+/* Begin PBXSourcesBuildPhase section */
+ 8DC2EF540486A6940098B216 /* Sources */ = {
+ isa = PBXSourcesBuildPhase;
+ buildActionMask = 2147483647;
+ files = (
+ E4ADBB250E88174200B570BC /* ArrayHeap.m in Sources */,
+ E4ADBB270E88174200B570BC /* ArrayQueue.m in Sources */,
+ E4ADBB290E88174200B570BC /* ArrayStack.m in Sources */,
+ E4ADBB2D0E88174200B570BC /* DSFArrayQueue.m in Sources */,
+ E4ADBB2F0E88174200B570BC /* DSFMutableArray.m in Sources */,
+ E4ADBB320E88174200B570BC /* LLQueue.m in Sources */,
+ E4ADBB340E88174200B570BC /* LLStack.m in Sources */,
+ E4ADBB380E88174200B570BC /* RBNode.m in Sources */,
+ E4ADBB3A0E88174200B570BC /* RedBlackTree.m in Sources */,
+ E4ADBB3D0E88174200B570BC /* StandardLinkedList.m in Sources */,
+ E4ADBB410E88174200B570BC /* UnbalancedTree.m in Sources */,
+ E4ADBC9A0E88412C00B570BC /* AbstractTree.m in Sources */,
+ );
+ runOnlyForDeploymentPostprocessing = 0;
+ };
+ E4B83B5F0E898C26008914BD /* Sources */ = {
+ isa = PBXSourcesBuildPhase;
+ buildActionMask = 2147483647;
+ files = (
+ E4B83B6F0E898C76008914BD /* Test.m in Sources */,
+ );
+ runOnlyForDeploymentPostprocessing = 0;
+ };
+/* End PBXSourcesBuildPhase section */
+
+/* Begin PBXTargetDependency section */
+ E4B83B8B0E898D11008914BD /* PBXTargetDependency */ = {
+ isa = PBXTargetDependency;
+ target = 8DC2EF4F0486A6940098B216 /* DataStructures */;
+ targetProxy = E4B83B8A0E898D11008914BD /* PBXContainerItemProxy */;
+ };
+ E4B83CE50E89EF12008914BD /* PBXTargetDependency */ = {
+ isa = PBXTargetDependency;
+ target = E4FE76D80E89556A00971EE6 /* Documentation */;
+ targetProxy = E4B83CE40E89EF12008914BD /* PBXContainerItemProxy */;
+ };
+ E4FE76DC0E89557F00971EE6 /* PBXTargetDependency */ = {
+ isa = PBXTargetDependency;
+ target = 8DC2EF4F0486A6940098B216 /* DataStructures */;
+ targetProxy = E4FE76DB0E89557F00971EE6 /* PBXContainerItemProxy */;
+ };
+/* End PBXTargetDependency section */
+
+/* Begin PBXVariantGroup section */
+ 089C1666FE841158C02AAC07 /* InfoPlist.strings */ = {
+ isa = PBXVariantGroup;
+ children = (
+ 089C1667FE841158C02AAC07 /* English */,
+ );
+ name = InfoPlist.strings;
+ sourceTree = "<group>";
+ };
+/* End PBXVariantGroup section */
+
+/* Begin XCBuildConfiguration section */
+ 1DEB91AE08733DA50010E9CD /* Debug */ = {
+ isa = XCBuildConfiguration;
+ buildSettings = {
+ ALWAYS_SEARCH_USER_PATHS = NO;
+ COPY_PHASE_STRIP = NO;
+ DYLIB_COMPATIBILITY_VERSION = 1;
+ DYLIB_CURRENT_VERSION = 1;
+ FRAMEWORK_VERSION = A;
+ GCC_DYNAMIC_NO_PIC = NO;
+ GCC_ENABLE_FIX_AND_CONTINUE = YES;
+ GCC_MODEL_TUNING = G5;
+ GCC_OPTIMIZATION_LEVEL = 0;
+ GCC_PRECOMPILE_PREFIX_HEADER = NO;
+ GCC_PREFIX_HEADER = "";
+ INFOPLIST_FILE = Info.plist;
+ INSTALL_PATH = "$(HOME)/Library/Frameworks";
+ PRODUCT_NAME = DataStructures;
+ WRAPPER_EXTENSION = framework;
+ };
+ name = Debug;
+ };
+ 1DEB91AF08733DA50010E9CD /* Release */ = {
+ isa = XCBuildConfiguration;
+ buildSettings = {
+ ALWAYS_SEARCH_USER_PATHS = NO;
+ DEBUG_INFORMATION_FORMAT = "dwarf-with-dsym";
+ DYLIB_COMPATIBILITY_VERSION = 1;
+ DYLIB_CURRENT_VERSION = 1;
+ FRAMEWORK_VERSION = A;
+ GCC_MODEL_TUNING = G5;
+ GCC_PRECOMPILE_PREFIX_HEADER = NO;
+ GCC_PREFIX_HEADER = "";
+ INFOPLIST_FILE = Info.plist;
+ INSTALL_PATH = "$(HOME)/Library/Frameworks";
+ PRODUCT_NAME = DataStructures;
+ WRAPPER_EXTENSION = framework;
+ };
+ name = Release;
+ };
+ 1DEB91B208733DA50010E9CD /* Debug */ = {
+ isa = XCBuildConfiguration;
+ buildSettings = {
+ ARCHS = "$(ARCHS_STANDARD_32_BIT)";
+ GCC_C_LANGUAGE_STANDARD = c99;
+ GCC_ENABLE_SYMBOL_SEPARATION = NO;
+ GCC_OPTIMIZATION_LEVEL = 0;
+ GCC_USE_GCC3_PFE_SUPPORT = YES;
+ GCC_WARN_ABOUT_RETURN_TYPE = YES;
+ GCC_WARN_MISSING_PARENTHESES = NO;
+ GCC_WARN_UNUSED_VARIABLE = YES;
+ ONLY_ACTIVE_ARCH = YES;
+ PREBINDING = NO;
+ PRECOMPS_INCLUDE_HEADERS_FROM_BUILT_PRODUCTS_DIR = NO;
+ SDKROOT = macosx10.5;
+ };
+ name = Debug;
+ };
+ 1DEB91B308733DA50010E9CD /* Release */ = {
+ isa = XCBuildConfiguration;
+ buildSettings = {
+ ARCHS = "$(ARCHS_STANDARD_32_BIT)";
+ GCC_C_LANGUAGE_STANDARD = c99;
+ GCC_ENABLE_SYMBOL_SEPARATION = NO;
+ GCC_USE_GCC3_PFE_SUPPORT = YES;
+ GCC_WARN_ABOUT_RETURN_TYPE = YES;
+ GCC_WARN_MISSING_PARENTHESES = NO;
+ GCC_WARN_UNUSED_VARIABLE = YES;
+ PREBINDING = NO;
+ PRECOMPS_INCLUDE_HEADERS_FROM_BUILT_PRODUCTS_DIR = NO;
+ SDKROOT = macosx10.5;
+ };
+ name = Release;
+ };
+ E4B83B640E898C27008914BD /* Debug */ = {
+ isa = XCBuildConfiguration;
+ buildSettings = {
+ ALWAYS_SEARCH_USER_PATHS = NO;
+ COPY_PHASE_STRIP = NO;
+ GCC_DYNAMIC_NO_PIC = NO;
+ GCC_ENABLE_FIX_AND_CONTINUE = YES;
+ GCC_MODEL_TUNING = G5;
+ GCC_OPTIMIZATION_LEVEL = 0;
+ GCC_PRECOMPILE_PREFIX_HEADER = YES;
+ GCC_PREFIX_HEADER = "$(SYSTEM_LIBRARY_DIR)/Frameworks/AppKit.framework/Headers/AppKit.h";
+ INSTALL_PATH = /usr/local/bin;
+ OTHER_LDFLAGS = (
+ "-framework",
+ Foundation,
+ "-framework",
+ AppKit,
+ );
+ PREBINDING = NO;
+ PRODUCT_NAME = Test;
+ };
+ name = Debug;
+ };
+ E4B83B650E898C27008914BD /* Release */ = {
+ isa = XCBuildConfiguration;
+ buildSettings = {
+ ALWAYS_SEARCH_USER_PATHS = NO;
+ COPY_PHASE_STRIP = YES;
+ DEBUG_INFORMATION_FORMAT = "dwarf-with-dsym";
+ GCC_ENABLE_FIX_AND_CONTINUE = NO;
+ GCC_MODEL_TUNING = G5;
+ GCC_PRECOMPILE_PREFIX_HEADER = YES;
+ GCC_PREFIX_HEADER = "$(SYSTEM_LIBRARY_DIR)/Frameworks/AppKit.framework/Headers/AppKit.h";
+ INSTALL_PATH = /usr/local/bin;
+ OTHER_LDFLAGS = (
+ "-framework",
+ Foundation,
+ "-framework",
+ AppKit,
+ );
+ PREBINDING = NO;
+ PRODUCT_NAME = Test;
+ ZERO_LINK = NO;
+ };
+ name = Release;
+ };
+ E4FE76D90E89556A00971EE6 /* Debug */ = {
+ isa = XCBuildConfiguration;
+ buildSettings = {
+ COPY_PHASE_STRIP = NO;
+ GCC_DYNAMIC_NO_PIC = NO;
+ GCC_OPTIMIZATION_LEVEL = 0;
+ PRODUCT_NAME = Documentation;
+ };
+ name = Debug;
+ };
+ E4FE76DA0E89556A00971EE6 /* Release */ = {
+ isa = XCBuildConfiguration;
+ buildSettings = {
+ COPY_PHASE_STRIP = YES;
+ DEBUG_INFORMATION_FORMAT = "dwarf-with-dsym";
+ GCC_ENABLE_FIX_AND_CONTINUE = NO;
+ PRODUCT_NAME = Documentation;
+ ZERO_LINK = NO;
+ };
+ name = Release;
+ };
+/* End XCBuildConfiguration section */
+
+/* Begin XCConfigurationList section */
+ 1DEB91AD08733DA50010E9CD /* Build configuration list for PBXNativeTarget "DataStructures" */ = {
+ isa = XCConfigurationList;
+ buildConfigurations = (
+ 1DEB91AE08733DA50010E9CD /* Debug */,
+ 1DEB91AF08733DA50010E9CD /* Release */,
+ );
+ defaultConfigurationIsVisible = 0;
+ defaultConfigurationName = Release;
+ };
+ 1DEB91B108733DA50010E9CD /* Build configuration list for PBXProject "DataStructures" */ = {
+ isa = XCConfigurationList;
+ buildConfigurations = (
+ 1DEB91B208733DA50010E9CD /* Debug */,
+ 1DEB91B308733DA50010E9CD /* Release */,
+ );
+ defaultConfigurationIsVisible = 0;
+ defaultConfigurationName = Release;
+ };
+ E4B83B6D0E898C49008914BD /* Build configuration list for PBXNativeTarget "Test" */ = {
+ isa = XCConfigurationList;
+ buildConfigurations = (
+ E4B83B640E898C27008914BD /* Debug */,
+ E4B83B650E898C27008914BD /* Release */,
+ );
+ defaultConfigurationIsVisible = 0;
+ defaultConfigurationName = Release;
+ };
+ E4FE76F70E8955BB00971EE6 /* Build configuration list for PBXAggregateTarget "Documentation" */ = {
+ isa = XCConfigurationList;
+ buildConfigurations = (
+ E4FE76D90E89556A00971EE6 /* Debug */,
+ E4FE76DA0E89556A00971EE6 /* Release */,
+ );
+ defaultConfigurationIsVisible = 0;
+ defaultConfigurationName = Release;
+ };
+/* End XCConfigurationList section */
+ };
+ rootObject = 0867D690FE84028FC02AAC07 /* Project object */;
+}
View
258 Doxyfile
@@ -0,0 +1,258 @@
+# Doxyfile 1.5.6
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+DOXYFILE_ENCODING = UTF-8
+PROJECT_NAME = "Cocoa Data Structures"
+PROJECT_NUMBER = 0.9.0
+OUTPUT_DIRECTORY = docs
+CREATE_SUBDIRS = NO
+OUTPUT_LANGUAGE = English
+BRIEF_MEMBER_DESC = YES
+REPEAT_BRIEF = YES
+ABBREVIATE_BRIEF = "The $name class" \
+ "The $name widget" \
+ "The $name file" \
+ is \
+ provides \
+ specifies \
+ contains \
+ represents \
+ a \
+ an \
+ the
+ALWAYS_DETAILED_SEC = NO
+INLINE_INHERITED_MEMB = NO
+FULL_PATH_NAMES = NO
+STRIP_FROM_PATH = /Applications/
+STRIP_FROM_INC_PATH =
+SHORT_NAMES = NO
+JAVADOC_AUTOBRIEF = NO
+QT_AUTOBRIEF = NO
+MULTILINE_CPP_IS_BRIEF = NO
+DETAILS_AT_TOP = NO
+INHERIT_DOCS = YES
+SEPARATE_MEMBER_PAGES = NO
+TAB_SIZE = 7
+ALIASES =
+OPTIMIZE_OUTPUT_FOR_C = NO
+OPTIMIZE_OUTPUT_JAVA = NO
+OPTIMIZE_FOR_FORTRAN = NO
+OPTIMIZE_OUTPUT_VHDL = NO
+BUILTIN_STL_SUPPORT = NO
+CPP_CLI_SUPPORT = NO
+SIP_SUPPORT = NO
+IDL_PROPERTY_SUPPORT = YES
+DISTRIBUTE_GROUP_DOC = NO
+SUBGROUPING = YES
+TYPEDEF_HIDES_STRUCT = NO
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+EXTRACT_ALL = YES
+EXTRACT_PRIVATE = YES
+EXTRACT_STATIC = YES
+EXTRACT_LOCAL_CLASSES = YES
+EXTRACT_LOCAL_METHODS = NO
+EXTRACT_ANON_NSPACES = NO
+HIDE_UNDOC_MEMBERS = NO
+HIDE_UNDOC_CLASSES = NO
+HIDE_FRIEND_COMPOUNDS = NO
+HIDE_IN_BODY_DOCS = NO
+INTERNAL_DOCS = NO
+CASE_SENSE_NAMES = NO
+HIDE_SCOPE_NAMES = NO
+SHOW_INCLUDE_FILES = YES
+INLINE_INFO = YES
+SORT_MEMBER_DOCS = YES
+SORT_BRIEF_DOCS = NO
+SORT_GROUP_NAMES = NO
+SORT_BY_SCOPE_NAME = NO
+GENERATE_TODOLIST = YES
+GENERATE_TESTLIST = YES
+GENERATE_BUGLIST = YES
+GENERATE_DEPRECATEDLIST= YES
+ENABLED_SECTIONS =
+MAX_INITIALIZER_LINES = 30
+SHOW_USED_FILES = YES
+SHOW_DIRECTORIES = NO
+SHOW_FILES = YES
+SHOW_NAMESPACES = YES
+FILE_VERSION_FILTER =
+#---------------------------------------------------------------------------
+# configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+QUIET = NO
+WARNINGS = YES
+WARN_IF_UNDOCUMENTED = YES
+WARN_IF_DOC_ERROR = YES
+WARN_NO_PARAMDOC = NO
+WARN_FORMAT = "$file:$line: $text"
+WARN_LOGFILE =
+#---------------------------------------------------------------------------
+# configuration options related to the input files
+#---------------------------------------------------------------------------
+INPUT = "/Users/quinn/Desktop/Cocoa Data Structures framework/source"
+INPUT_ENCODING = UTF-8
+FILE_PATTERNS = *.c \
+ *.h \
+ *.m
+RECURSIVE = NO
+EXCLUDE =
+EXCLUDE_SYMLINKS = NO
+EXCLUDE_PATTERNS =
+EXCLUDE_SYMBOLS =
+EXAMPLE_PATH =
+EXAMPLE_PATTERNS = *
+EXAMPLE_RECURSIVE = NO
+IMAGE_PATH =
+INPUT_FILTER =
+FILTER_PATTERNS =
+FILTER_SOURCE_FILES = NO
+#---------------------------------------------------------------------------
+# configuration options related to source browsing
+#---------------------------------------------------------------------------
+SOURCE_BROWSER = NO
+INLINE_SOURCES = NO
+STRIP_CODE_COMMENTS = YES
+REFERENCED_BY_RELATION = NO
+REFERENCES_RELATION = NO
+REFERENCES_LINK_SOURCE = YES
+USE_HTAGS = NO
+VERBATIM_HEADERS = NO
+#---------------------------------------------------------------------------
+# configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+ALPHABETICAL_INDEX = NO
+COLS_IN_ALPHA_INDEX = 5
+IGNORE_PREFIX =
+#---------------------------------------------------------------------------
+# configuration options related to the HTML output
+#---------------------------------------------------------------------------
+GENERATE_HTML = YES
+HTML_OUTPUT = .
+HTML_FILE_EXTENSION = .html
+HTML_HEADER =
+HTML_FOOTER =
+HTML_STYLESHEET = doxygen.css
+HTML_ALIGN_MEMBERS = YES
+GENERATE_HTMLHELP = NO
+GENERATE_DOCSET = NO
+DOCSET_FEEDNAME = "Cocoa Data Structures Framework"
+DOCSET_BUNDLE_ID = org.doxygen.Project
+HTML_DYNAMIC_SECTIONS = NO
+CHM_FILE =
+HHC_LOCATION =
+GENERATE_CHI = NO
+CHM_INDEX_ENCODING =
+BINARY_TOC = NO
+TOC_EXPAND = NO
+DISABLE_INDEX = NO
+ENUM_VALUES_PER_LINE = 4
+GENERATE_TREEVIEW = ALL
+TREEVIEW_WIDTH = 250
+FORMULA_FONTSIZE = 10
+#---------------------------------------------------------------------------
+# configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+GENERATE_LATEX = NO
+LATEX_OUTPUT = latex
+LATEX_CMD_NAME = latex
+MAKEINDEX_CMD_NAME = makeindex
+COMPACT_LATEX = NO
+PAPER_TYPE = a4wide
+EXTRA_PACKAGES =
+LATEX_HEADER =
+PDF_HYPERLINKS = YES
+USE_PDFLATEX = YES
+LATEX_BATCHMODE = NO
+LATEX_HIDE_INDICES = NO
+#---------------------------------------------------------------------------
+# configuration options related to the RTF output
+#---------------------------------------------------------------------------
+GENERATE_RTF = NO
+RTF_OUTPUT = rtf
+COMPACT_RTF = NO
+RTF_HYPERLINKS = NO
+RTF_STYLESHEET_FILE =
+RTF_EXTENSIONS_FILE =
+#---------------------------------------------------------------------------
+# configuration options related to the man page output
+#---------------------------------------------------------------------------
+GENERATE_MAN = NO
+MAN_OUTPUT = man
+MAN_EXTENSION = .3
+MAN_LINKS = NO
+#---------------------------------------------------------------------------
+# configuration options related to the XML output
+#---------------------------------------------------------------------------
+GENERATE_XML = NO
+XML_OUTPUT = xml
+XML_SCHEMA =
+XML_DTD =
+XML_PROGRAMLISTING = YES
+#---------------------------------------------------------------------------
+# configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+GENERATE_AUTOGEN_DEF = NO
+#---------------------------------------------------------------------------
+# configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+GENERATE_PERLMOD = NO
+PERLMOD_LATEX = NO
+PERLMOD_PRETTY = YES
+PERLMOD_MAKEVAR_PREFIX =
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+ENABLE_PREPROCESSING = YES
+MACRO_EXPANSION = NO
+EXPAND_ONLY_PREDEF = NO
+SEARCH_INCLUDES = YES
+INCLUDE_PATH =
+INCLUDE_FILE_PATTERNS =
+PREDEFINED =
+EXPAND_AS_DEFINED =
+SKIP_FUNCTION_MACROS = YES
+#---------------------------------------------------------------------------
+# Configuration::additions related to external references
+#---------------------------------------------------------------------------
+TAGFILES = doxygen-cocoa-tags.xml # Cocoa framework docs
+GENERATE_TAGFILE =
+ALLEXTERNALS = NO
+EXTERNAL_GROUPS = YES
+PERL_PATH = /usr/bin/perl
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+CLASS_DIAGRAMS = YES
+MSCGEN_PATH = /Applications/Doxygen.app/Contents/Resources/
+HIDE_UNDOC_RELATIONS = YES
+HAVE_DOT = YES
+DOT_FONTNAME = FreeSans
+DOT_FONTPATH =
+CLASS_GRAPH = YES
+COLLABORATION_GRAPH = YES
+GROUP_GRAPHS = YES
+UML_LOOK = NO
+TEMPLATE_RELATIONS = NO
+INCLUDE_GRAPH = YES
+INCLUDED_BY_GRAPH = YES
+CALL_GRAPH = NO
+CALLER_GRAPH = NO
+GRAPHICAL_HIERARCHY = YES
+DIRECTORY_GRAPH = YES
+DOT_IMAGE_FORMAT = png
+DOT_PATH = /Applications/Doxygen.app/Contents/Resources/
+DOTFILE_DIRS =
+DOT_GRAPH_MAX_NODES = 50
+MAX_DOT_GRAPH_DEPTH = 1000
+DOT_TRANSPARENT = YES
+DOT_MULTI_TARGETS = NO
+GENERATE_LEGEND = YES
+DOT_CLEANUP = YES
+#---------------------------------------------------------------------------
+# Configuration::additions related to the search engine
+#---------------------------------------------------------------------------
+SEARCHENGINE = NO
View
BIN English.lproj/InfoPlist.strings
Binary file not shown.
View
26 Info.plist
@@ -0,0 +1,26 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+<dict>
+ <key>CFBundleDevelopmentRegion</key>
+ <string>English</string>
+ <key>CFBundleExecutable</key>
+ <string>${EXECUTABLE_NAME}</string>
+ <key>CFBundleName</key>
+ <string>${PRODUCT_NAME}</string>
+ <key>CFBundleIconFile</key>
+ <string></string>
+ <key>CFBundleIdentifier</key>
+ <string>com.yourcompany.${PRODUCT_NAME:identifier}</string>
+ <key>CFBundleInfoDictionaryVersion</key>
+ <string>6.0</string>
+ <key>CFBundlePackageType</key>
+ <string>FMWK</string>
+ <key>CFBundleSignature</key>
+ <string>????</string>
+ <key>CFBundleVersion</key>
+ <string>1.0</string>
+ <key>NSPrincipalClass</key>
+ <string></string>
+</dict>
+</plist>
View
505 LICENSE
@@ -0,0 +1,505 @@
+
+ GNU LESSER GENERAL PUBLIC LICENSE
+ Version 2.1, February 1999
+
+ Copyright (C) 1991, 1999 Free Software Foundation, Inc.
+ 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+[This is the first released version of the Lesser GPL. It also counts
+ as the successor of the GNU Library Public License, version 2, hence
+ the version number 2.1.]
+
+ Preamble
+
+ The licenses for most software are designed to take away your
+freedom to share and change it. By contrast, the GNU General Public
+Licenses are intended to guarantee your freedom to share and change
+free software--to make sure the software is free for all its users.
+
+ This license, the Lesser General Public License, applies to some
+specially designated software packages--typically libraries--of the
+Free Software Foundation and other authors who decide to use it. You
+can use it too, but we suggest you first think carefully about whether
+this license or the ordinary General Public License is the better
+strategy to use in any particular case, based on the explanations below.
+
+ When we speak of free software, we are referring to freedom of use,
+not price. Our General Public Licenses are designed to make sure that
+you have the freedom to distribute copies of free software (and charge
+for this service if you wish); that you receive source code or can get
+it if you want it; that you can change the software and use pieces of
+it in new free programs; and that you are informed that you can do
+these things.
+
+ To protect your rights, we need to make restrictions that forbid
+distributors to deny you these rights or to ask you to surrender these
+rights. These restrictions translate to certain responsibilities for
+you if you distribute copies of the library or if you modify it.
+
+ For example, if you distribute copies of the library, whether gratis
+or for a fee, you must give the recipients all the rights that we gave
+you. You must make sure that they, too, receive or can get the source
+code. If you link other code with the library, you must provide
+complete object files to the recipients, so that they can relink them
+with the library after making changes to the library and recompiling
+it. And you must show them these terms so they know their rights.
+
+ We protect your rights with a two-step method: (1) we copyright the
+library, and (2) we offer you this license, which gives you legal
+permission to copy, distribute and/or modify the library.
+
+ To protect each distributor, we want to make it very clear that
+there is no warranty for the free library. Also, if the library is
+modified by someone else and passed on, the recipients should know
+that what they have is not the original version, so that the original
+author's reputation will not be affected by problems that might be
+introduced by others.
+
+ Finally, software patents pose a constant threat to the existence of
+any free program. We wish to make sure that a company cannot
+effectively restrict the users of a free program by obtaining a
+restrictive license from a patent holder. Therefore, we insist that
+any patent license obtained for a version of the library must be
+consistent with the full freedom of use specified in this license.
+
+ Most GNU software, including some libraries, is covered by the
+ordinary GNU General Public License. This license, the GNU Lesser
+General Public License, applies to certain designated libraries, and
+is quite different from the ordinary General Public License. We use
+this license for certain libraries in order to permit linking those
+libraries into non-free programs.
+
+ When a program is linked with a library, whether statically or using
+a shared library, the combination of the two is legally speaking a
+combined work, a derivative of the original library. The ordinary
+General Public License therefore permits such linking only if the
+entire combination fits its criteria of freedom. The Lesser General
+Public License permits more lax criteria for linking other code with
+the library.
+
+ We call this license the "Lesser" General Public License because it
+does Less to protect the user's freedom than the ordinary General
+Public License. It also provides other free software developers Less
+of an advantage over competing non-free programs. These disadvantages
+are the reason we use the ordinary General Public License for many
+libraries. However, the Lesser license provides advantages in certain
+special circumstances.
+
+ For example, on rare occasions, there may be a special need to
+encourage the widest possible use of a certain library, so that it becomes
+a de-facto standard. To achieve this, non-free programs must be
+allowed to use the library. A more frequent case is that a free
+library does the same job as widely used non-free libraries. In this
+case, there is little to gain by limiting the free library to free
+software only, so we use the Lesser General Public License.
+
+ In other cases, permission to use a particular library in non-free
+programs enables a greater number of people to use a large body of
+free software. For example, permission to use the GNU C Library in
+non-free programs enables many more people to use the whole GNU
+operating system, as well as its variant, the GNU/Linux operating
+system.
+
+ Although the Lesser General Public License is Less protective of the
+users' freedom, it does ensure that the user of a program that is
+linked with the Library has the freedom and the wherewithal to run
+that program using a modified version of the Library.
+
+ The precise terms and conditions for copying, distribution and
+modification follow. Pay close attention to the difference between a
+"work based on the library" and a "work that uses the library". The
+former contains code derived from the library, whereas the latter must
+be combined with the library in order to run.
+
+ GNU LESSER GENERAL PUBLIC LICENSE
+ TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+ 0. This License Agreement applies to any software library or other
+program which contains a notice placed by the copyright holder or
+other authorized party saying it may be distributed under the terms of
+this Lesser General Public License (also called "this License").
+Each licensee is addressed as "you".
+
+ A "library" means a collection of software functions and/or data
+prepared so as to be conveniently linked with application programs
+(which use some of those functions and data) to form executables.
+
+ The "Library", below, refers to any such software library or work
+which has been distributed under these terms. A "work based on the
+Library" means either the Library or any derivative work under
+copyright law: that is to say, a work containing the Library or a
+portion of it, either verbatim or with modifications and/or translated
+straightforwardly into another language. (Hereinafter, translation is
+included without limitation in the term "modification".)
+
+ "Source code" for a work means the preferred form of the work for
+making modifications to it. For a library, complete source code means
+all the source code for all modules it contains, plus any associated
+interface definition files, plus the scripts used to control compilation
+and installation of the library.
+
+ Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope. The act of
+running a program using the Library is not restricted, and output from
+such a program is covered only if its contents constitute a work based
+on the Library (independent of the use of the Library in a tool for
+writing it). Whether that is true depends on what the Library does
+and what the program that uses the Library does.
+
+ 1. You may copy and distribute verbatim copies of the Library's
+complete source code as you receive it, in any medium, provided that
+you conspicuously and appropriately publish on each copy an
+appropriate copyright notice and disclaimer of warranty; keep intact
+all the notices that refer to this License and to the absence of any
+warranty; and distribute a copy of this License along with the
+Library.
+
+ You may charge a fee for the physical act of transferring a copy,
+and you may at your option offer warranty protection in exchange for a
+fee.
+
+ 2. You may modify your copy or copies of the Library or any portion
+of it, thus forming a work based on the Library, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+ a) The modified work must itself be a software library.
+
+ b) You must cause the files modified to carry prominent notices
+ stating that you changed the files and the date of any change.
+
+ c) You must cause the whole of the work to be licensed at no
+ charge to all third parties under the terms of this License.
+
+ d) If a facility in the modified Library refers to a function or a
+ table of data to be supplied by an application program that uses
+ the facility, other than as an argument passed when the facility
+ is invoked, then you must make a good faith effort to ensure that,
+ in the event an application does not supply such function or
+ table, the facility still operates, and performs whatever part of
+ its purpose remains meaningful.
+
+ (For example, a function in a library to compute square roots has
+ a purpose that is entirely well-defined independent of the
+ application. Therefore, Subsection 2d requires that any
+ application-supplied function or table used by this function must
+ be optional: if the application does not supply it, the square
+ root function must still compute square roots.)
+
+These requirements apply to the modified work as a whole. If
+identifiable sections of that work are not derived from the Library,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works. But when you
+distribute the same sections as part of a whole which is a work based
+on the Library, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote
+it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Library.
+
+In addition, mere aggregation of another work not based on the Library
+with the Library (or with a work based on the Library) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+ 3. You may opt to apply the terms of the ordinary GNU General Public
+License instead of this License to a given copy of the Library. To do
+this, you must alter all the notices that refer to this License, so
+that they refer to the ordinary GNU General Public License, version 2,
+instead of to this License. (If a newer version than version 2 of the
+ordinary GNU General Public License has appeared, then you can specify
+that version instead if you wish.) Do not make any other change in
+these notices.
+
+ Once this change is made in a given copy, it is irreversible for
+that copy, so the ordinary GNU General Public License applies to all
+subsequent copies and derivative works made from that copy.
+
+ This option is useful when you wish to copy part of the code of
+the Library into a program that is not a library.
+
+ 4. You may copy and distribute the Library (or a portion or
+derivative of it, under Section 2) in object code or executable form
+under the terms of Sections 1 and 2 above provided that you accompany
+it with the complete corresponding machine-readable source code, which
+must be distributed under the terms of Sections 1 and 2 above on a
+medium customarily used for software interchange.
+
+ If distribution of object code is made by offering access to copy
+from a designated place, then offering equivalent access to copy the
+source code from the same place satisfies the requirement to
+distribute the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+ 5. A program that contains no derivative of any portion of the
+Library, but is designed to work with the Library by being compiled or
+linked with it, is called a "work that uses the Library". Such a
+work, in isolation, is not a derivative work of the Library, and
+therefore falls outside the scope of this License.
+
+ However, linking a "work that uses the Library" with the Library
+creates an executable that is a derivative of the Library (because it
+contains portions of the Library), rather than a "work that uses the
+library". The executable is therefore covered by this License.
+Section 6 states terms for distribution of such executables.
+
+ When a "work that uses the Library" uses material from a header file
+that is part of the Library, the object code for the work may be a
+derivative work of the Library even though the source code is not.
+Whether this is true is especially significant if the work can be
+linked without the Library, or if the work is itself a library. The
+threshold for this to be true is not precisely defined by law.
+
+ If such an object file uses only numerical parameters, data
+structure layouts and accessors, and small macros and small inline
+functions (ten lines or less in length), then the use of the object
+file is unrestricted, regardless of whether it is legally a derivative
+work. (Executables containing this object code plus portions of the
+Library will still fall under Section 6.)
+
+ Otherwise, if the work is a derivative of the Library, you may
+distribute the object code for the work under the terms of Section 6.
+Any executables containing that work also fall under Section 6,
+whether or not they are linked directly with the Library itself.
+
+ 6. As an exception to the Sections above, you may also combine or
+link a "work that uses the Library" with the Library to produce a
+work containing portions of the Library, and distribute that work
+under terms of your choice, provided that the terms permit
+modification of the work for the customer's own use and reverse
+engineering for debugging such modifications.
+
+ You must give prominent notice with each copy of the work that the
+Library is used in it and that the Library and its use are covered by
+this License. You must supply a copy of this License. If the work
+during execution displays copyright notices, you must include the
+copyright notice for the Library among them, as well as a reference
+directing the user to the copy of this License. Also, you must do one
+of these things:
+
+ a) Accompany the work with the complete corresponding
+ machine-readable source code for the Library including whatever
+ changes were used in the work (which must be distributed under
+ Sections 1 and 2 above); and, if the work is an executable linked
+ with the Library, with the complete machine-readable "work that
+ uses the Library", as object code and/or source code, so that the
+ user can modify the Library and then relink to produce a modified
+ executable containing the modified Library. (It is understood
+ that the user who changes the contents of definitions files in the
+ Library will not necessarily be able to recompile the application
+ to use the modified definitions.)
+
+ b) Use a suitable shared library mechanism for linking with the
+ Library. A suitable mechanism is one that (1) uses at run time a
+ copy of the library already present on the user's computer system,
+ rather than copying library functions into the executable, and (2)
+ will operate properly with a modified version of the library, if
+ the user installs one, as long as the modified version is
+ interface-compatible with the version that the work was made with.
+
+ c) Accompany the work with a written offer, valid for at
+ least three years, to give the same user the materials
+ specified in Subsection 6a, above, for a charge no more
+ than the cost of performing this distribution.
+
+ d) If distribution of the work is made by offering access to copy
+ from a designated place, offer equivalent access to copy the above
+ specified materials from the same place.
+
+ e) Verify that the user has already received a copy of these
+ materials or that you have already sent this user a copy.
+
+ For an executable, the required form of the "work that uses the
+Library" must include any data and utility programs needed for
+reproducing the executable from it. However, as a special exception,
+the materials to be distributed need not include anything that is
+normally distributed (in either source or binary form) with the major
+components (compiler, kernel, and so on) of the operating system on
+which the executable runs, unless that component itself accompanies
+the executable.
+
+ It may happen that this requirement contradicts the license
+restrictions of other proprietary libraries that do not normally
+accompany the operating system. Such a contradiction means you cannot
+use both them and the Library together in an executable that you
+distribute.
+
+ 7. You may place library facilities that are a work based on the
+Library side-by-side in a single library together with other library
+facilities not covered by this License, and distribute such a combined
+library, provided that the separate distribution of the work based on
+the Library and of the other library facilities is otherwise
+permitted, and provided that you do these two things:
+
+ a) Accompany the combined library with a copy of the same work
+ based on the Library, uncombined with any other library
+ facilities. This must be distributed under the terms of the
+ Sections above.
+
+ b) Give prominent notice with the combined library of the fact
+ that part of it is a work based on the Library, and explaining
+ where to find the accompanying uncombined form of the same work.
+
+ 8. You may not copy, modify, sublicense, link with, or distribute
+the Library except as expressly provided under this License. Any
+attempt otherwise to copy, modify, sublicense, link with, or
+distribute the Library is void, and will automatically terminate your
+rights under this License. However, parties who have received copies,
+or rights, from you under this License will not have their licenses
+terminated so long as such parties remain in full compliance.
+
+ 9. You are not required to accept this License, since you have not
+signed it. However, nothing else grants you permission to modify or
+distribute the Library or its derivative works. These actions are
+prohibited by law if you do not accept this License. Therefore, by
+modifying or distributing the Library (or any work based on the
+Library), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Library or works based on it.
+
+ 10. Each time you redistribute the Library (or any work based on the
+Library), the recipient automatically receives a license from the
+original licensor to copy, distribute, link with or modify the Library
+subject to these terms and conditions. You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties with
+this License.
+
+ 11. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License. If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Library at all. For example, if a patent
+license would not permit royalty-free redistribution of the Library by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Library.
+
+If any portion of this section is held invalid or unenforceable under any
+particular circumstance, the balance of the section is intended to apply,
+and the section as a whole is intended to apply in other circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system which is
+implemented by public license practices. Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+ 12. If the distribution and/or use of the Library is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Library under this License may add
+an explicit geographical distribution limitation excluding those countries,
+so that distribution is permitted only in or among countries not thus
+excluded. In such case, this License incorporates the limitation as if
+written in the body of this License.
+
+ 13. The Free Software Foundation may publish revised and/or new
+versions of the Lesser General Public License from time to time.
+Such new versions will be similar in spirit to the present version,
+but may differ in detail to address new problems or concerns.
+
+Each version is given a distinguishing version number. If the Library
+specifies a version number of this License which applies to it and
+"any later version", you have the option of following the terms and
+conditions either of that version or of any later version published by
+the Free Software Foundation. If the Library does not specify a
+license version number, you may choose any version ever published by
+the Free Software Foundation.
+
+ 14. If you wish to incorporate parts of the Library into other free
+programs whose distribution conditions are incompatible with these,
+write to the author to ask for permission. For software which is
+copyrighted by the Free Software Foundation, write to the Free
+Software Foundation; we sometimes make exceptions for this. Our
+decision will be guided by the two goals of preserving the free status
+of all derivatives of our free software and of promoting the sharing
+and reuse of software generally.
+
+ NO WARRANTY
+
+ 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
+WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
+EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
+OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
+KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
+LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
+THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+ 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
+WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
+AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
+FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
+CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
+LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
+RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
+FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
+SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
+DAMAGES.
+
+ END OF TERMS AND CONDITIONS
+
+ How to Apply These Terms to Your New Libraries
+
+ If you develop a new library, and you want it to be of the greatest
+possible use to the public, we recommend making it free software that
+everyone can redistribute and change. You can do so by permitting
+redistribution under these terms (or, alternatively, under the terms of the
+ordinary General Public License).
+
+ To apply these terms, attach the following notices to the library. It is
+safest to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least the
+"copyright" line and a pointer to where the full notice is found.
+
+ <one line to give the library's name and a brief idea of what it does.>
+ Copyright (C) <year> <name of author>
+
+ This library is free software; you can redistribute it and/or
+ modify it under the terms of the GNU Lesser General Public
+ License as published by the Free Software Foundation; either
+ version 2.1 of the License, or (at your option) any later version.
+
+ This library is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ Lesser General Public License for more details.
+
+ You should have received a copy of the GNU Lesser General Public
+ License along with this library; if not, write to the Free Software
+ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+
+Also add information on how to contact you by electronic and paper mail.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the library, if
+necessary. Here is a sample; alter the names:
+
+ Yoyodyne, Inc., hereby disclaims all copyright interest in the
+ library `Frob' (a library for tweaking knobs) written by James Random Hacker.
+
+ <signature of Ty Coon>, 1 April 1990
+ Ty Coon, President of Vice
+
+That's all there is to it!
+
+
View
52 README
@@ -0,0 +1,52 @@
+Data Structures Framework
+version 0.9.0
+June 17, 2002
+Los Angeles
+Phillip Morelock - creator / maintainer
+http://www.phillipmorelock.com/examples/cocoadata/
+
+CONTRIBUTORS (contributors go at the top in alpha order):
+Max Horn
+////////Bugfixes, ideas/example code/inspiration for converting
+////////much of the "guts" to straight C for speed, ideas for interface consistency
+Phillip Morelock me@phillipmorelock.com http://www.phillipmorelock.com/
+////////Stacks, Queues, Linked Lists, Trees, maintenance, conversion of internals to straight C
+Jay Wardell
+///////Bugfixes, ideas for conversion of data structures to other types
+Gordon Worley redbird@rbisland.cx http://www.rbisland.cx/
+///////ArrayHeap
+
+This entire package and all files underneath it are licensed to you under the GNU LGPL -- which can be found verbatim in the LICENSE file. What this basically means is that anyone can use this package for any purpose -- but there are very important restrictions, so you must read that file before using the source in this package. My current personal official release of this software in source form only can be found at http://www.phillipmorelock.com/examples/cocoadata/DataFrame.sit
+
+As well, this README file is considered a source file under the LGPL and you must include it if you redistribute the library in source form under the LGPL. If you change the library, you should make your own additional README and include it with the source, describing your changes. If you contribute to the library by giving me source, you may keep your copyright or assign it to me, but you must agree to license it through the library's LGPL license.
+
+My name is Phillip Morelock and I can be reached through http://www.phillipmorelock.com/ .
+This Framework is Free Software and is intended for educational purposes or to serve as a foundation for more highly refined / optimized data structures. Generic data structures will continue to be added to the library, and of course I will continue to refine and specialize these structures if they are needed for particular applications. I would really, really appreciate any contributions to the Framework, or at least please drop me an email if you're going to make use of any of it. But you don't have to -- you just have to read and abide by the LGPL included in the file LICENSE. The LGPL is commonly misunderstood -- read it and understand it.
+
+In this release:
+- More bugfixes. Most of the code should be better tested generally now.
+- Some adventures off on random trails. Feel free to go there yourself ;)
+- A standard LinkedList implementation, with an NSEnumerator and a fast C internal structure.
+- Two stacks and two queues -- one stack and one array using NSMutableArray, and another set using my linked list implementation.
+- A heap implementation using NSMutableArray. Some raw C optimizations for this class as well.
+- Unbalanced binary search tree that uses the Comparable protocol for comparisons. It's cool, because it doesn't use recursion -- but consequently it's a bit of a hack. It is also unbalanced and the NSEnumerator needs work (I'm not sure right now that it wouldn't crash. Just wanted to get this release out, so don't use the objectEnumerator for now).
+- A red-black tree that does not implement the remove algorithm -- i would appreciate any help on this. No remove method is provided. It's hard. I'm working on it. It is also not converted to straight C yet, as I have not had the time. The interface is now cleaner, however.
+- Conversion methods to convert several of the data structures to other types (or to generate data structures from Cocoa standards such as NSSet, NSArray, etc.).
+- Interface "compliance" with other Foundation data structures. Whereas before the interfaces in this library were wildly inconsistent with each other and with Cocoa, now you will find method names that feel more like the method names you will find in other Foundation classes. This should make working with the library easier.
+
+Future releases:
+-Algorithm improvements, an n-way tree, more data structure conversion methods. I was going to implement a Hashtable -- but doesn't NSDictionary do well enough for everyone? It's pretty fast and seems to work properly. If anyone can think of a necessarily more specialized hashtable implementation, please let me know.
+- Pre, post, and inorder iterators for both binary search trees.
+- Remove method for red-black tree.
+
+A few caveats:
+
+1. While certain implementations utilize straight C for the internals, this Framework is still fairly high level. It uses lots of nifty Objective-C constructs because when I started writing this framework, it was a way for me to learn how to generically work with the language's runtime type system. I am a Java programmer by trade. As a consequence, raw machine performance is not emphasized in this incarnation -- but all algorithms should be sound algorithms you would expect in data structures of these kinds (i.e., if you know what O(log(n)) means, you probably know what a proper data structure algorithm is...if the algorithms are bad, please tell me). You will find that certain implementations use a lot of raw C for optimization, while some implementations (notably those based on Arrays or our Red Black Tree) utilize higher-level objective c constructs.
+
+2. My environments: Mac OS X 10.1.3 on a PowerMac G4 733, and an iBook 500 mhz. The source is provided in a .sit archive that has a .pbproj Mac OS X project builder file in it, for those of you using the IDE. Also, I encourage feedback from anyone using GNUStep about portability issues, and will include any patches necessary or remove any OS X specific code if it is not critical to the library.
+
+3. Ok, I heard from Don Yacktman, the creator / maintainer of MiscKit. It seems his kit should be re-released for OS X within the next year (that's just what I inferred from his email, not a firm statement, I specifically disclaim responsibility for spreading this rumor). Nevertheless, work will continue on this framework until such time as I have a MiscKit in my warm, live hands. At that point, non-redundant code may be donated to MiscKit or I may focus my own personal efforts on improving MiscKit. Don says MiscKit will be released under a BSD-style license to allow greater flexibilty for the user -- I have no problem relicensing my code for this purpose, but I will ask all contributors individually if that day ever comes...don't worry if you've contributed to this framework.
+
+4. The Framework might not compile right on your machine. My machines all have my account with the same name and uid so I can work seamlessly across my home unix (mac/linux) network. From what I've heard, people haven't had problems with this. If this is a problem for you, and you know how to / figure out how to fix it, please drop me an email and let me know what I can do to better prepare these things for release.
+
+5. There isn't a heck of a lot of header documentation and commenting. this is because I think these are fairly basic data structures at this time and don't need documentation (sorry!). If you need help, feel free to email me. If you want to contribute documentation, I will be happy to include accurate documentation in these files. (NOTE: this is getting better. Especially read the protocol declarations).
View
12 docs.html
@@ -0,0 +1,12 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+<head>
+ <title>Redirect</title>
+ <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+ <meta http-equiv="refresh" content="0;url=docs/index.html">
+</head>
+
+<body>
+</body>
+</html>
+
View
69 doxygen-cocoa-tags.xml
@@ -0,0 +1,69 @@
+<tagfile>
+
+ <!-- Foundation classes & protocols -->
+ <compound kind="class">
+ <name>NSArray</name>
+ <filename>http://developer.apple.com/documentation/Cocoa/Reference/Foundation/Classes/NSArray_Class/Reference/Reference.html</filename>
+ </compound>
+ <compound kind="class">
+ <name>NSBundle</name>
+ <filename>http://developer.apple.com/documentation/Cocoa/Reference/Foundation/Classes/NSBundle_Class/Reference/Reference.html</filename>
+ </compound>
+ <compound kind="class">
+ <name>NSCoder</name>
+ <filename>http://developer.apple.com/documentation/Cocoa/Reference/Foundation/Classes/NSCoder_Class/Reference/NSCoder.html</filename>
+ </compound>
+ <compound kind="protocol">
+ <name>NSCoding</name>
+ <filename>http://developer.apple.com/documentation/Cocoa/Reference/Foundation/Protocols/NSCoding_Protocol/Reference/Reference.html</filename>
+ <member kind="function">
+ <name>initWithCoder:</name>
+ <anchor>//apple_ref/occ/intfm/NSCoding/initWithCoder:</anchor>
+ </member>
+ <member kind="function">
+ <name>encodeWithCoder:</name>
+ <anchor>//apple_ref/occ/intfm/NSCoding/encodeWithCoder:</anchor>
+ </member>
+ </compound>
+ <compound kind="class">
+ <name>NSData</name>
+ <filename>http://developer.apple.com/documentation/Cocoa/Reference/Foundation/Classes/NSData_Class/Reference/Reference.html</filename>
+ </compound>
+ <compound kind="class">
+ <name>NSDictionary</name>
+ <filename>http://developer.apple.com/documentation/Cocoa/Reference/Foundation/Classes/NSDictionary_Class/Reference/Reference.html</filename>
+ </compound>
+ <compound kind="class">
+ <name>NSEnumerator</name>
+ <filename>http://developer.apple.com/documentation/Cocoa/Reference/Foundation/Classes/NSEnumerator_Class/Reference/Reference.html</filename>
+ </compound>
+ <compound kind="class">
+ <name>NSError</name>
+ <filename>http://developer.apple.com/documentation/Cocoa/Reference/Foundation/Classes/NSError_Class/Reference/Reference.html</filename>
+ </compound>
+ <compound kind="class">
+ <name>NSNotification</name>
+ <filename>http://developer.apple.com/documentation/Cocoa/Reference/Foundation/Classes/NSNotification_Class/Reference/Reference.html</filename>
+ </compound>
+ <compound kind="class">
+ <name>NSObject</name>
+ <filename>http://developer.apple.com/documentation/Cocoa/Reference/Foundation/Classes/NSObject_Class/Reference/Reference.html</filename>
+ </compound>
+ <compound kind="protocol">
+ <name>NSObject</name>
+ <filename>http://developer.apple.com/documentation/Cocoa/Reference/Foundation/Protocols/NSObject_Protocol/Reference/NSObject.html</filename>
+ </compound>
+ <compound kind="class">
+ <name>NSSet</name>
+ <filename>http://developer.apple.com/documentation/Cocoa/Reference/Foundation/Classes/NSSet_Class/Reference/Reference.html</filename>
+ </compound>
+ <compound kind="class">
+ <name>NSString</name>
+ <filename>http://developer.apple.com/documentation/Cocoa/Reference/Foundation/Classes/NSString_Class/Reference/NSString.html</filename>
+ </compound>
+ <compound kind="class">
+ <name>NSView</name>
+ <filename>http://developer.apple.com/documentation/Cocoa/Reference/ApplicationKit/Classes/NSView_Class/Reference/NSView.html</filename>
+ </compound>
+
+</tagfile>
View
430 doxygen.css
@@ -0,0 +1,430 @@
+body, table, div, p, dl {
+ font-family: Lucida Grande, Verdana, Geneva, Arial, sans-serif;
+ font-size: 12px;
+}
+
+/* @group Heading Levels */
+
+h1 {
+ text-align: center;
+ font-size: 150%;
+}
+
+h2 {
+ font-size: 120%;
+}
+
+h3 {
+ font-size: 100%;
+}
+
+/* @end */
+
+caption {
+ font-weight: bold;
+}
+
+div.qindex, div.navpath, div.navtab{
+ background-color: #e8eef2;
+ border: 1px solid #84b0c7;
+ text-align: center;
+ margin: 2px;
+ padding: 2px;
+}
+
+div.qindex, div.navpath {
+ width: 100%;
+ line-height: 140%;
+}
+
+div.navtab {
+ margin-right: 15px;
+}
+
+/* @group Link Styling */
+
+a {
+ color: #153788;
+ font-weight: normal;
+ text-decoration: none;
+}
+
+.contents a:visited {
+ color: #1b77c5;
+}
+
+a:hover {
+ text-decoration: underline;
+}
+
+a.qindex {
+ font-weight: bold;
+}
+
+a.qindexHL {
+ font-weight: bold;
+ background-color: #6666cc;
+ color: #ffffff;
+ border: 1px double #9295C2;
+}
+
+a.el {
+ font-weight: bold;
+}
+
+a.elRef {
+}
+
+a.code {
+}
+
+a.codeRef {
+}
+
+/* @end */
+
+dl.el {
+ margin-left: -1cm;
+}
+
+.fragment {
+ font-family: monospace, fixed;
+ font-size: 105%;
+}
+
+code {
+ color: #3d4f5f;
+}
+
+pre.fragment {
+ border: 1px solid #CCCCCC;
+ background-color: #f5f5f5;
+ padding: 4px 6px;
+ margin: 4px 8px 4px 2px;
+}
+
+div.ah {
+ background-color: black;
+ font-weight: bold;
+ color: #ffffff;
+ margin-bottom: 3px;
+ margin-top: 3px
+}
+
+div.groupHeader {
+ margin-left: 16px;
+ margin-top: 12px;
+ margin-bottom: 6px;
+ font-weight: bold;
+}
+
+div.groupText {
+ margin-left: 16px;
+ font-style: italic;
+}
+
+body {
+ background: white;
+ color: black;
+ margin-right: 20px;
+ margin-left: 20px;
+}
+
+td.indexkey {
+ background-color: #e8eef2;
+ font-weight: bold;
+ border: 1px solid #CCCCCC;
+ margin: 2px 0px 2px 0;
+ padding: 2px 10px;
+}
+
+td.indexvalue {
+ background-color: #e8eef2;
+// font-style: italic;
+ border: 1px solid #CCCCCC;
+ padding: 2px 10px;
+ margin: 2px 0px;
+}
+
+tr.memlist {
+ background-color: #f0f0f0;
+}
+
+p.formulaDsp {
+ text-align: center;
+}
+
+img.formulaDsp {
+
+}
+
+img.formulaInl {
+ vertical-align: middle;
+}
+
+/* @group Code Colorization */
+
+span.keyword {
+ color: #008000
+}
+
+span.keywordtype {
+ color: #604020
+}
+
+span.keywordflow {
+ color: #e08000
+}
+
+span.comment {
+ color: #800000
+}
+
+span.preprocessor {
+ color: #806020
+}
+
+span.stringliteral {
+ color: #002080
+}
+
+span.charliteral {
+ color: #008080
+}
+
+/* @end */
+
+.search {
+ color: #003399;
+ font-weight: bold;
+}
+
+form.search {
+ margin-bottom: 0px;
+ margin-top: 0px;
+}
+
+input.search {
+ font-size: 75%;
+ color: #000080;
+ font-weight: normal;
+ background-color: #e8eef2;
+}
+
+td.tiny {
+ font-size: 75%;
+}
+
+.dirtab {
+ padding: 4px;
+ border-collapse: collapse;
+ border: 1px solid #84b0c7;
+}
+
+th.dirtab {
+ background: #e8eef2;
+ font-weight: bold;
+}
+
+hr {
+ height: 0;
+ border: none;
+ border-top: 1px solid #666;
+}
+
+/* @group Member Descriptions */
+
+.mdescLeft, .mdescRight,
+.memItemLeft, .memItemRight,
+.memTemplItemLeft, .memTemplItemRight, .memTemplParams {
+ background-color: #FAFAFA;
+ border: none;
+ margin: 4px;
+ padding: 1px 0 0 8px;
+}
+
+.mdescLeft, .mdescRight {
+ padding: 0px 8px 4px 8px;
+ color: #555;
+}
+
+.memItemLeft, .memItemRight, .memTemplParams {
+ border-top: 1px solid #ccc;
+}
+
+.memTemplParams {
+ color: #606060;
+}
+
+/* @end */
+
+/* @group Member Details */
+
+/* Styles for detailed member documentation */
+
+.memtemplate {
+ font-size: 80%;
+ color: #606060;
+ font-weight: normal;
+ margin-left: 3px;
+}
+
+.memnav {
+ background-color: #e8eef2;
+ border: 1px solid #84b0c7;
+ text-align: center;
+ margin: 2px;
+ margin-right: 15px;
+ padding: 2px;
+}
+
+.memitem {
+ padding: 0;
+}
+
+.memname, .memname a.elRef {
+ white-space: nowrap;
+ font-weight: bold;
+}
+
+.memproto, .memdoc {
+ border: 1px solid #84b0c7;
+}
+
+.memproto {
+ padding: 0;
+ background-color: #d5e1e8;
+ font-weight: bold;
+ -webkit-border-top-left-radius: 8px;
+ -webkit-border-top-right-radius: 8px;
+ -moz-border-radius-topleft: 8px;
+ -moz-border-radius-topright: 8px;
+}
+
+.memdoc {
+ padding: 2px 5px;
+ background-color: #eef3f5;
+ border-top-width: 0;
+ -webkit-border-bottom-left-radius: 8px;
+ -webkit-border-bottom-right-radius: 8px;
+ -moz-border-radius-bottomleft: 8px;
+ -moz-border-radius-bottomright: 8px;
+}
+
+.memdoc p, .memdoc dl, .memdoc ul {
+ margin: 6px 0;
+}
+
+.paramkey {
+ text-align: right;
+}
+
+.paramtype {
+ white-space: nowrap;
+}
+
+.paramname {
+ color: #602020;
+ white-space: nowrap;
+}
+.paramname em {
+ font-style: normal;
+}
+
+/* @end */
+
+/* @group Directory (tree) */
+
+/* for the tree view */
+
+.ftvtree {
+ font-family: sans-serif;
+ margin: 0.5em;
+}
+
+/* these are for tree view when used as main index */
+
+.directory {
+ font-size: 9pt;
+ font-weight: bold;
+}
+
+.directory h3 {
+ margin: 0px;
+ margin-top: 1em;
+ font-size: 11pt;
+}
+
+/*
+The following two styles can be used to replace the root node title
+with an image of your choice. Simply uncomment the next two styles,
+specify the name of your image and be sure to set 'height' to the
+proper pixel height of your image.
+*/
+
+/*
+.directory h3.swap {
+ height: 61px;
+ background-repeat: no-repeat;
+ background-image: url("yourimage.gif");
+}
+.directory h3.swap span {
+ display: none;
+}
+*/
+
+.directory > h3 {
+ margin-top: 0;
+}
+
+.directory p {
+ margin: 0px;
+ white-space: nowrap;
+}
+
+.directory div {
+ display: none;
+ margin: 0px;
+}
+
+.directory img {
+ vertical-align: -30%;
+}
+
+/* these are for tree view when not used as main index */
+
+.directory-alt {
+ font-size: 100%;
+ font-weight: bold;
+}
+
+.directory-alt h3 {
+ margin: 0px;
+ margin-top: 1em;
+ font-size: 11pt;
+}
+
+.directory-alt > h3 {
+ margin-top: 0;
+}
+
+.directory-alt p {
+ margin: 0px;
+ white-space: nowrap;
+}
+
+.directory-alt div {
+ display: none;
+ margin: 0px;
+}
+
+.directory-alt img {
+ vertical-align: -30%;
+}
+
+/* @end */
+
+address {
+ font-style: normal;
+ color: #333;
+}
View
83 source/AbstractTree.h
@@ -0,0 +1,83 @@
+/************************
+ A Cocoa DataStructuresFramework
+ Copyright (C) 2002 Phillip Morelock in the United States
+ http://www.phillipmorelock.com
+ Other copyrights for this specific file as acknowledged herein.
+
+ This library is free software; you can redistribute it and/or
+ modify it under the terms of the GNU Lesser General Public
+ License as published by the Free Software Foundation; either
+ version 2.1 of the License, or (at your option) any later version.
+
+ This library is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ Lesser General Public License for more details.
+
+ You should have received a copy of the GNU Lesser General Public
+ License along with this library; if not, write to the Free Software
+ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ *******************************/
+/*
+ * AbstractTree.h
+ * DataStructuresFramework
+ */
+
+#import <Foundation/Foundation.h>
+#import "Comparable.h"
+#import "Tree.h"
+#import "Stack.h"
+
+/**
+ This is to be treated as an abstract class, and concrete child classes must
+ implement all methods in the Tree protocol.
+ */
+@interface AbstractTree : NSObject <Tree>
+{
+ /** A count of how many elements are currently in the tree. */
+ unsigned long count;
+}
+
+/**
+ Creates an NSSet which contains the objects from this binary tree. Uses a pre-order
+ traversal since it requires less space, is extremely fast, and sets are unordered.
+ */
+- (NSSet *) contentsAsSet;
+
+/**
+ Creates an NSArray which contains the objects from the specified binary tree.
+ The tree traversal ordering (in-order, pre-order, post-order) must be specified.
+ The object traversed last will be at the end of the array.
+ */
+- (NSArray *) contentsAsArrayWithOrder:(CHTraversalOrder)traversalOrder;
+
+/**
+ Creates a Stack which contains Comparable objects from a binary tree.
+ The tree traversal ordering (in-order, pre-order, post-order) must be specified.
+ The object traversed last will be on the top of the stack.
+ */
+- (id <Stack>) contentsAsStackWithInsertionOrder:(CHTraversalOrder)traversalOrder;
+
+/**
+ Create an enumerator which performs a in-order traversal. Although this has greater
+ space complexity than pre-order (depth-first) traversal, it is a sensible default
+ since it returns values according to their natural ordering based on compare:.
+ */
+- (NSEnumerator *)objectEnumerator;
+
+/**
+ Convenience method for raising an NSException for an unsupported class operation.
+ */
++ (id)exceptionForUnsupportedOperation:(SEL)operation;
+
+/**
+ Convenience method for raising an NSException for an unsupported operation.
+ */
+- (id)exceptionForUnsupportedOperation:(SEL)operation;
+
+/**
+ Convenience method for raising an NSException for an invalid (nil) argument.
+ */
+- (id)exceptionForInvalidArgument:(SEL)operation;
+
+@end
View
159 source/AbstractTree.m
@@ -0,0 +1,159 @@
+/************************
+ A Cocoa DataStructuresFramework
+ Copyright (C) 2002 Phillip Morelock in the United States
+ http://www.phillipmorelock.com
+ Other copyrights for this specific file as acknowledged herein.
+
+ This library is free software; you can redistribute it and/or
+ modify it under the terms of the GNU Lesser General Public
+ License as published by the Free Software Foundation; either
+ version 2.1 of the License, or (at your option) any later version.
+
+ This library is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ Lesser General Public License for more details.
+
+ You should have received a copy of the GNU Lesser General Public
+ License along with this library; if not, write to the Free Software
+ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ *******************************/
+/*
+ * Tree.m
+ * DataStructuresFramework
+ */
+
+#import "AbstractTree.h"
+#import "LLStack.h"
+
+@implementation AbstractTree
+
++ (id)exceptionForUnsupportedOperation:(SEL)operation {
+ [NSException raise:NSInternalInconsistencyException
+ format:@"+[%@ %s] -- Unsupported operation.",
+ [self class], sel_getName(operation)];
+ return nil;
+}
+
+- (id)exceptionForUnsupportedOperation:(SEL)operation {
+ [NSException raise:NSInternalInconsistencyException
+ format:@"-[%@ %s] -- Unsupported operation.",
+ [self class], sel_getName(operation)];
+ return nil;
+}
+
+- (id)exceptionForInvalidArgument:(SEL)operation {
+ [NSException raise:NSInvalidArgumentException
+ format:@"-[%@ %s] -- Invalid nil argument.",
+ [self class], sel_getName(operation)];
+ return nil;
+}
+
+
+#pragma mark Default Error Implementations
+
+- (void)addObject:(id <Comparable>)anObject {
+ [self exceptionForUnsupportedOperation:_cmd];
+}
+
+- (void)addObjectsFromArray:(NSArray *)anArray {
+ [self exceptionForUnsupportedOperation:_cmd];
+}
+
+- (BOOL)containsObject:(id <Comparable>)anObject {
+ [self exceptionForUnsupportedOperation:_cmd];
+ return NO;
+}
+
+- (void)removeObject:(id <Comparable>)element {
+ [self exceptionForUnsupportedOperation:_cmd];
+}
+
+- (void)removeAllObjects {
+ [self exceptionForUnsupportedOperation:_cmd];
+}
+
+- (id)findMin {
+ return [self exceptionForUnsupportedOperation:_cmd];
+}
+
+- (id)findMax {
+ return [self exceptionForUnsupportedOperation:_cmd];
+}
+
+- (id)findObject:(id <Comparable>)anObject {
+ return [self exceptionForUnsupportedOperation:_cmd];
+}
+
+- (BOOL)isEmpty {
+ [self exceptionForUnsupportedOperation:_cmd];
+ return NO;
+}
+
+#pragma mark Convenience Constructors
+
++ (id<Tree>)treeWithObjectsFromEnumerator:(NSEnumerator*)enumerator {
+ id<Tree> tree = [[self alloc] init];
+ id object;
+ while (object = [enumerator nextObject]) {
+ [tree addObject:object];
+ }
+ return [tree autorelease];
+}
+
++ (id<Tree>)treeWithObjectsFromFastEnumeration:(id<NSFastEnumeration>)collection {
+ id<Tree> tree = [[self alloc] init];
+ for (id object in collection) {
+ [tree addObject:object];
+ }
+ return [tree autorelease];
+}
+
+#pragma mark Collection Conversions
+
+- (NSSet *) contentsAsSet {
+ NSEnumerator *enumerator = [self objectEnumeratorWithTraversalOrder:CHTraversePreOrder];
+
+ NSMutableSet *set = [[NSMutableSet alloc] init];
+ id object;
+ while ((object = [enumerator nextObject])) {
+ [set addObject:object];
+ }
+ return [set autorelease];
+}
+
+- (NSArray *) contentsAsArrayWithOrder:(CHTraversalOrder)order {
+ NSEnumerator *enumerator = [self objectEnumeratorWithTraversalOrder:order];
+
+ NSMutableArray *array = [[NSMutableArray alloc] init];
+ id object;
+ while ((object = [enumerator nextObject])) {
+ [array addObject:object];
+ }
+ return [array autorelease];
+ // Document that the returned object is mutable? Return immutable copy instead?
+}
+
+- (id <Stack>) contentsAsStackWithInsertionOrder:(CHTraversalOrder)order {
+ NSEnumerator *enumerator = [self objectEnumeratorWithTraversalOrder:order];
+
+ id <Stack> stack = [[LLStack alloc] init];
+ id object;
+ while ((object = [enumerator nextObject])) {
+ [stack push:object];
+ }
+ return [stack autorelease];
+}
+
+#pragma mark Object Enumerators
+
+- (NSEnumerator *)objectEnumerator {
+ return [self objectEnumeratorWithTraversalOrder:CHTraverseInOrder];
+}
+
+/* Must be specified by concrete child classes. */
+- (NSEnumerator *)objectEnumeratorWithTraversalOrder:(CHTraversalOrder)order {
+ return [self exceptionForUnsupportedOperation:_cmd];
+}
+
+@end
View
41 source/ArrayHeap.h
@@ -0,0 +1,41 @@
+/************************
+A Cocoa DataStructuresFramework
+Copyright (C) 2002 Phillip Morelock in the United States
+http://www.phillipmorelock.com
+Other copyrights for this specific file as acknowledged herein.
+
+This library is free software; you can redistribute it and/or
+modify it under the terms of the GNU Lesser General Public
+License as published by the Free Software Foundation; either
+version 2.1 of the License, or (at your option) any later version.
+
+This library is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public
+License along with this library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+*******************************/
+//
+// ArrayHeap.h
+// DataStructuresFramework
+//
+// Created by Gordon Worley on Tue Apr 02 2002.
+// Copyright (c) 2002 Gordon Worley redbird@rbisland.cx
+// Edits and refactoring by Phillip Morelock for purposes
+// of integration with the library, and for performance.
+/////SEE LICENSE FILE FOR LICENSE INFORMATION///////
+/////many thanks to Gordon for the very first outside contribution to the library!
+
+#import <Foundation/Foundation.h>
+#import <Heap.h>
+#import <Comparable.h>
+
+@interface ArrayHeap : NSObject <Heap>
+{
+ NSMutableArray *irep;
+}
+
+@end
View
203 source/ArrayHeap.m
@@ -0,0 +1,203 @@
+/************************
+A Cocoa DataStructuresFramework
+Copyright (C) 2002 Phillip Morelock in the United States
+http://www.phillipmorelock.com
+Other copyrights for this specific file as acknowledged herein.
+
+This library is free software; you can redistribute it and/or
+modify it under the terms of the GNU Lesser General Public
+License as published by the Free Software Foundation; either
+version 2.1 of the License, or (at your option) any later version.
+
+This library is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public
+License along with this library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+*******************************/
+//
+// ArrayHeap.m
+// DataStructuresFramework
+//
+// Created by Gordon Worley on Tue Apr 02 2002.
+// Copyright (c) 2002 Gordon Worley redbird@rbisland.cx
+// Contributions by Phillip Morelock for purposes of integration with the library.
+/////SEE LICENSE FILE FOR LICENSE INFORMATION///////
+
+/*******
+/////Additions by Phillip Morelock Apr 03 02
+/////fine-tuned memory management / object releases, etc.
+/////replaced some internal method calls with the "straight call" so as
+/////to reduce obj_c multiple messaging
+/////PM 04.14.02 -- converted bubbleup and bubbledown to static C functions instead of
+/////////////////////messages to self.
+//
+/////many thanks to Gordon for the very first outside contribution to the library!
+*******/
+
+#import "ArrayHeap.h"
+
+/*************
+C functions to speed the bubble up and bubble down
+***************/
+
+static void _bubbleup(NSMutableArray *heap)
+{
+ int i, parent;
+
+ //get the last index...
+ i = [heap count] - 1;
+
+ while (i > 0)
+ {
+ parent = i / 2;
+ if ([[heap objectAtIndex: i] compare: [heap objectAtIndex: parent]] > 0)
+ {
+ [heap exchangeObjectAtIndex: i withObjectAtIndex: parent];
+ i = parent;
+ }
+ else
+ i = 0;
+ }
+
+ return;
+}
+
+static void _bubbledown(NSMutableArray *heap)
+{
+ int parent = 0, lchild, rchild;
+
+ while (parent < [heap count] / 2)
+ {
+ lchild = parent * 2;
+ rchild = parent * 2 + 1;
+
+ if ([heap objectAtIndex: lchild] != nil && [heap objectAtIndex: rchild] != nil)
+ {
+ if ([[heap objectAtIndex: lchild] compare: [heap objectAtIndex: rchild]] > 0)
+ {
+ if ([[heap objectAtIndex: lchild] compare: [heap objectAtIndex: parent]] > 0)
+ {
+ [heap exchangeObjectAtIndex: lchild withObjectAtIndex: parent];
+ parent = lchild;
+ }
+ else
+ parent = [heap count];
+ }
+ else
+ {
+ if ([[heap objectAtIndex: rchild] compare: [heap objectAtIndex: parent]] > 0)
+ {
+ [heap exchangeObjectAtIndex: rchild withObjectAtIndex: parent];
+ parent = rchild;
+ }
+ else
+ parent = [heap count];
+ }
+ }
+ else if ([heap objectAtIndex: lchild])
+ {
+ if ([[heap objectAtIndex: lchild] compare: [heap objectAtIndex: parent]] > 0)
+ {
+ [heap exchangeObjectAtIndex: lchild withObjectAtIndex: parent];
+ parent = lchild;
+ }
+ else
+ parent = [heap count];
+ }
+ else if ([heap objectAtIndex: rchild])
+ {
+ if ([[heap objectAtIndex: rchild] compare: [heap objectAtIndex: parent]] > 0)
+ {
+ [heap exchangeObjectAtIndex: rchild withObjectAtIndex: parent];
+ parent = rchild;
+ }
+ else
+ parent = [heap count];
+ }
+ else
+ parent = [heap count];
+ }
+
+}
+
+/***************
+@interface ArrayHeap : NSObject <Heap>
+{
+ NSMutableArray *irep;
+}
+*****************/
+
+@implementation ArrayHeap
+
+-(id)init
+{
+ [super init];
+
+ irep = [[NSMutableArray alloc] init];
+
+ return self;
+}
+
+- (void)dealloc
+{
+ [irep release];
+
+ [super dealloc];
+}
+
+- (BOOL)addObject:(id <Comparable>)obj
+{
+ if (!obj)
+ return NO;
+
+ [irep addObject: obj];
+
+ _bubbleup(irep);
+
+ return YES;
+}
+
+- (id)removeRoot
+{
+ id obj;
+
+ if (![irep count])
+ return nil;
+
+ obj = [[irep objectAtIndex: 0] retain];
+ [irep exchangeObjectAtIndex: 0 withObjectAtIndex: [irep count] - 1];
+ [irep removeLastObject];
+
+ _bubbledown(irep);
+
+ return [obj autorelease];
+}
+
+- (id) removeLast
+{
+ id obj;
+
+ if (![irep count])
+ return nil;
+
+ obj = [[irep lastObject] retain];
+ [irep removeLastObject];
+
+ return [obj autorelease];
+}
+
+- (unsigned)count
+{
+ return [irep count];
+}
+
+- (BOOL) isEmpty
+{
+ return ([irep count] > 0) ? YES : NO;
+}
+
+@end
View
59 source/ArrayQueue.h
@@ -0,0 +1,59 @@
+/************************
+A Cocoa DataStructuresFramework
+Copyright (C) 2002 Phillip Morelock in the United States
+http://www.phillipmorelock.com
+Other copyrights for this specific file as acknowledged herein.
+
+This library is free software; you can redistribute it and/or
+modify it under the terms of the GNU Lesser General Public
+License as published by the Free Software Foundation; either
+version 2.1 of the License, or (at your option) any later version.
+
+This library is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public
+License along with this library; if not, write to the Free Software
+Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+*******************************/
+/*
+ * ArrayQueue.h
+ * Data Structures Framework
+/////SEE LICENSE FILE FOR LICENSE INFORMATION///////
+ *
+ */
+
+//////////
+//A fairly basic queue implementation that puts its data in an NSMutableArray
+//See the protocol definition for Queue to understand the contract.
+/////////
+
+#import <Foundation/Foundation.h>
+#import "Queue.h"
+
+@interface ArrayQueue : NSObject <Queue>
+{
+ NSMutableArray *theQ;
+
+ int backIndex; //where to place the next element
+ int frontIndex; //the current front of the queue
+ unsigned int qSize; //the current size
+ unsigned int arrsz;
+
+ id niller; //the marker for dead spots in the queue
+}
+
+- init;
+- initWithCapacity:(unsigned)capacity;
+
+//returns the size of the queue currently
+-(unsigned int) count;
+