Order-Related Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1045 53.3 Sorting Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1051 53.4 Alternate Orderings all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 120CHAPTER 11. TYPES 121 • There is no meaningful 11.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants

Order-Related Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1045 53.3 Sorting Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1051 53.4 Alternate Orderings all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 120CHAPTER 11. TYPES 121 • There is no meaningful 11.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants

Order-Related Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1223 55.3 Sorting Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1229 55.4 Alternate Orderings all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127CHAPTER 12. TYPES 128 • There is no meaningful 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants

Order-Related Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1223 55.3 Sorting Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1229 55.4 Alternate Orderings all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127CHAPTER 12. TYPES 128 • There is no meaningful 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants

Order-Related Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1223 55.3 Sorting Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1229 55.4 Alternate Orderings all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127CHAPTER 12. TYPES 128 • There is no meaningful 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants

Order-Related Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1276 56.3 Sorting Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1283 56.4 Alternate Orderings all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127CHAPTER 12. TYPES 128 • There is no meaningful 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants

Order-Related Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1274 56.3 Sorting Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1280 56.4 Alternate Orderings all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127CHAPTER 12. TYPES 128 • There is no meaningful 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants

Order-Related Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1273 56.3 Sorting Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1279 56.4 Alternate Orderings all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127CHAPTER 12. TYPES 128 • There is no meaningful 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants

Order-Related Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1273 56.3 Sorting Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1279 56.4 Alternate Orderings all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127CHAPTER 12. TYPES 128 • There is no meaningful 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants

Order-Related Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1265 55.3 Sorting Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1271 55.4 Alternate Orderings all values in Julia are true objects having a type that belongs to a single, fully connected type graph, all nodes of which are equally first-class as types. 127CHAPTER 12. TYPES 128 • There is no meaningful 12.2 Abstract Types Abstract types cannot be instantiated, and serve only as nodes in the type graph, thereby describing sets of related concrete types: those concrete types which are their descendants