Abstract: A method and mechanism for converting a non-contiguous subset of values in a large range, such as selected Unicode code points, into a contiguous or mostly contiguous smaller range with a perfect hash. The large range is organized into a two-dimensional bitmap matrix of pages and offsets into the pages. The bits in the matrix equal one if the value is in the subset, and zero if not. The pages are then overlaid on one another into a one-dimensional bitmap by shifting each page as necessary to avoid conflicts with values on other pages. The shift amount is recorded and used in a hash computation, wherein a value of the large range is first separated into its page number and its offset into the page. The values are then hashed into the value of the dense subset range by looking up the shift amount for the page and adding the shift amount to the offset into the page.
Abstract: A method and system for integrating an object-based application with a version control system. Selected objects of an application such as a database are converted to individual text files and written to a temporary folder. The individual text files are then exported from the temporary folder to a version control system, whereby the version control system manages the files for developers and other developers according to its capabilities. Developers can check in individual objects for revising, whereby the text file corresponding to the checked-in object is exported by the version control system to a temporary folder and the data therein converted back into data in the object. An application program interface is provided to facilitate communication between application programs and the version control program for importing and exporting the text files and exchanging other related information.
Type:
Grant
Filed:
July 14, 1997
Date of Patent:
April 27, 1999
Assignee:
Microsoft Corporation
Inventors:
Chris C. Capossela, Kenny M. Felder, Nicholas J. Shulman, Peter H. Williamson
Abstract: A method and system of encoding image data in images having less than 128 distinct colors. Eight bit data bytes representing the color of each pixel data are re-indexed for each pixel to seven or less bits, and a sub-palette stores the relationship between the re-indexed colors and the original eight-bit color values. The remaining bits in the byte store run lengths of pixels that have contiguous colors. Further data compression is achieved by grouping pixels into rows, eliminating any duplicate rows and identifying the pixel data by a series of row pointers. Still further compression is accomplished by dropping representations of transparent pixels from the end of rows and representing a number of transparent pixels at the beginning of rows with a single byte.
Abstract: A method and mechanism for for filtering incoming documents against user queries. A plurality of user queries including terms connected by logical operators is received. Terms and sub-expressions are combined into distinct sub-expressions and embedded into a directed acyclic graph (DAG) having a plurality of nodes. Each node in the DAG includes pointers to any successor nodes thereof, the terms in the queries are embedded as source nodes in the graph, and the operators embedded as internal nodes. When a document is received, the document is evaluated against the nodes in the DAG by comparing the relevant terms in the document with the source nodes in the DAG representative thereof. For each term that matches a source node, the internal successor node of the matched source node is evaluated based on the logical operator represented by the successor node and truth information of the predecessor nodes thereto, thereby determining a truth value of the internal successor node.