Chapter 10: The Hash Object as a Dynamic Data Structure

10.1 Introduction

10.2 Stable Unduplication

10.2.1 Basic Stable Unduplication

10.2.2 Selective Unduplication

10.3 Testing Data for Grouping

10.3.1 Grouped vs Non-Grouped

10.3.2 Using a Hash Table to Check for Grouping

10.4 Hash Tables as Other Data Structures

10.4.1 Stacks and Queues

10.4.2 Implementing a Stack

10.4.3 Implementing a Queue

10.4.4 Using a Hash Stack to Find Consecutive Events

10.5 Array Sorting

10.5.1 Using a Hash Table to Sort Arrays

10.6 Summary

10.1 Introduction

There exist a great variety of practical data-processing scenarios where programming actions must be taken depending on whether or not a current value in the program has already been encountered during its execution. ...

Get Data Management Solutions Using SAS Hash Table Operations now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.