[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index] | [Elist Home]
Subject: RE: [xacml] Proposal of Model for comparing two sequences
On Thu, 12 Sep 2002, Daniel Engovatov wrote: > > NO!!! It will make API for extensions a living hell.. How so? > We went through this - runtime sequence size check is > MUCH simpler and achieves more with less clutter. There is not much clutter. The defintion of the list processing functions is concise (I will specify their semantics with Haskell) and you can use whatever boolean function you want, even extension functions. -Polar > daniel; > > -----Original Message----- > From: Polar Humenn > To: Michiharu Kudoh > Cc: Daniel Engovatov; 'XACML ' > Sent: 9/12/02 8:28 AM > Subject: RE: [xacml] Proposal of Model for comparing two sequences > > > <Apply FunctionId="function:at-least-on-match"> > <AttributeValue>function:string-greather-than</AttrbuteValue> > <ResourceDesignator> ..... </ResourceDesignator> > <ResourceDesignator> ..... </ResourceDesignator> > </Apply> >
[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index] | [Elist Home]
Powered by eList eXpress LLC