Concurrent Windowed Data Structure Management
Original Publication Date: 1989-Nov-01
Included in the Prior Art Database: 2005-Jan-29
This article describes an efficient method for effectively eliminating the data structures and searching techniques which are required to support objects being displayed and manipulated within a windowing environment. Concurrent Windowed Data Structure Management is achieved by allocating and managing memory associated with object-related windows necessary for storing and retrieving information normally kept in classical data structures such as linked lists, queues, etc., and using system-supplied windowing system calls to replace specialized application-developed search and sorting algorithms.