Re: FCGlob

[James Antill <jantill@redhat.com>]

[-- Attachment #1: Type: text/plain, Size: 1305 bytes --]

On Tue, 2007-04-17 at 13:51 -0400, John D. Ramsdell wrote:

> The paper states that an FCGlob prototype would require creating:
> 
>    A comparison function that receives two patterns as parameters and
>    returns the set relationship. Possible set relationships between
>    the set of paths pattern A matches and the set of paths pattern B
>    matches are: subset, superset, disjoint and ambiguous.
> 
> I speculated that finite automata is required to implement the
> comparison function as specified.  Do you have an alternative
> algorithm that meets the above specification?  I don't recall seeing
> one in the paper.

 Sections two and three (and figure 3 within section three) explains
this, AIUI. The idea is that you can split the "patterns" into a list of
nodes and the easily compare nodes, so:

cmp("/x/y/a*/**/b", "/x/**/b")

  ==

cmp(["x", "y", "a*", "**", "b"], ["x", "**", "b"])

  ==

cmp(["x", "y", "a*", "b"], ["x", "*", "*", "*", "b"])

...and the comparison function for the last part should "be easy",
although AIUI they hadn't written it.

-- 
James Antill - <james.antill@redhat.com>
setsockopt(fd, IPPROTO_TCP, TCP_CONGESTION, ...);
setsockopt(fd, IPPROTO_TCP, TCP_DEFER_ACCEPT, ...);
setsockopt(fd, SOL_SOCKET,  SO_ATTACH_FILTER, ...);


[-- Attachment #2: This is a digitally signed message part --]
[-- Type: application/pgp-signature, Size: 189 bytes --]