The following operators can be used to better focus your queries.
( ) , AND, OR, NOT, W/#
? single char wildcard, not at start
* multi char wildcard, not at start
(Cat? OR feline) AND NOT dog?
Cat? W/5 behavior
(Cat? OR feline) AND traits
Cat AND charact*
This guide provides a more detailed description of the syntax that is supported along with examples.
This search box also supports the look-up of an IP.com Digital Signature (also referred to as Fingerprint); enter the 72-, 48-, or 32-character code to retrieve details of the associated file or submission.
Concept Search - What can I type?
For a concept search, you can enter phrases, sentences, or full paragraphs in English. For example, copy and paste the abstract of a patent application or paragraphs from an article.
Concept search eliminates the need for complex Boolean syntax to inform retrieval. Our Semantic Gist engine uses advanced cognitive semantic analysis to extract the meaning of data. This reduces the chances of missing valuable information, that may result from traditional keyword searching.
A technique is described whereby a message dequeueing message enables a message, from a Two-way Queue, to be enqueued on another queue.
English (United States)
This text was extracted from a PDF file.
100% of the total text.
Page 1 of 1
Message Dequeueing Message Operation
A technique is described whereby a message dequeueing message enables
a message, from a Two-way Queue, to be enqueued on another queue.
A message dequeueing message operation is called "SNARFing" and
involves a "message move from this queue to that queue". If there is a message
on the first queue, then the message is immediately dequeued from the first
queue and bound to the SNARF Message and the SNARF message is enqueued
back to its 'return' queue. If there is a negative number, or zero messages on the
queue, the SNARF message is added to the queue as a waiter, or negative
message. When a message finally arrives at the queue, the first waiter is
removed from the queue of waiters, the message is bound to the waiter (SNARF
message) and the SNARF message is enqueued on its return queue.
As an example of the operation, if a task wants to wait for the next message
from the terminal "A" queue, the terminal "B" queue or the terminal "C" queue, a
SNARF message can be sent to each of the three queues. The return address
of the SNARF message would be set to a fourth queue, on which the task would
By using SNARF messages, and Two-way Queues, some of the complexity
of managing the interaction and coordination of multiple tasks can be transferred
from software to the structure of the queues and messages. This simplifies and
clarifies the organization of the system.