Method and apparatus for multiple autorouter rule language

• US 5,642,513 A
• Filed: 09/26/1996
• Issued: 06/24/1997
• Est. Priority Date: 01/19/1994
• Status: Expired due to Fees

• Current Assignee: CareStream Health Incorporated
• Original Assignee: Eastman Kodak Company
• Inventors: Schnellinger, William R., Sorenson, Sidney D.
• Primary Examiner(s): Kriess, Kevin A.
• Assistant Examiner(s): Chavis, John Q.
• Application Number:
  US08/720,272
• Time in Patent Office: 271 Days
• Field of Search: 395/650, 395/700, 395/419.03
• US Class Current: 717/141
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00

Abstract

A method and apparatus for determining destinations for digital imagery. The automated routing process accesses routing elements in a digital image message header and processes the elements through a Multiple Autorouter Rule Language program. The method and apparatus collects data from the image'"'"'s header, processes it within rules in a MAR language file, and creates a multiple destination list used to route the image.

Claims

1. A method for routing digital medical images in conjunction with a digital imaging system comprising the steps of:

(a) accessing a set of automatically compiled adaptive routing elements of a digital image message header;

(b) creating a master union as a set of universal pointers to preferences in memory of all data types;

(c) building a function tree structure to implement a set of functions;

(d) creating a set of function pointers to the functions;

(e) providing a first set of neutral functions that point to all grammar types wherein the functions comprise a second set of functions which operate on arguments passed to the first set of function and wherein the second set of functions return a pointer which points to any data type;

(f) providing a fully re-entrant program wherein variables do not intermix;

(g) combining a commercial compiler, lex and yacc to compile a set of run-time rules; and

(h) inserting "c" code after every line of yacc code.

2. The method of claim 1 further comprising the step of changing a value and specific location in memory without moving memory.

3. The method of claim 1 further comprising the step of providing a modular queuing interface and an ACR_-- NEMA interface pointer.

4. The method of claim 1 wherein the programming language is modular.

5. The method of claim 1 wherein the data used in the programing language is modular.

6. A method for routing digital medical images in conjunction with a digital imaging system comprising the steps of:

(a) accessing elements of a digital image message header;

(b) creating a master union as a universal pointer to all data types;

(c) building a tree structure to implement a set of functions;

(d) creating a set of pointers to the functions;

(e) providing a first set of functions that point to all grammar types wherein the functions comprise a second set of functions which operate on arguments passed to the first set of function and wherein the second set of functions return a pointer which points to any data type;

(f) providing a fully re-entrant program wherein variables do no intermix;

(g) combining a commercial compiler, lex and yacc to compile a set of rules; and

(h) inserting "c" code after every line of yacc code.

7. A method for routing digital medical images in conjunction with a digital imaging system comprising the steps of:

(a) accessing a set of automatically compiled adaptive routing elements of a digital image message header;

(b) creating a master union as a set of universal pointers to preferences in memory of all data types;

(c) building a function tree structure to implement a set of functions;

(d) creating a set of function pointers to the functions;

(e) providing a first set of neutral functions that point to all grammar types wherein the functions comprise a second set of functions which operate on arguments passed to the first set of functions and wherein the second set of functions return a neutral pointer which points to any data type;

(f) providing a fully re-entrant program wherein variables do no intermix;

(g) combining a commercial compiler, lex and yacc to compile a set of run-time rules; and

(h) inserting "c" code after every line of yacc code.