|
/* Copyright (C) 2004 - 2007 db4objects Inc. http://www.db4o.com */
using System;
using Db4objects.Db4o.Query;
namespace Db4objects.Db4o.Internal.Cluster
{
/// <exclude></exclude>
public class ClusterConstraint : IConstraint
{
internal readonly Db4objects.Db4o.Cluster.Cluster _cluster;
internal readonly IConstraint[] _constraints;
public ClusterConstraint(Db4objects.Db4o.Cluster.Cluster cluster, IConstraint[] constraints
)
{
_cluster = cluster;
_constraints = constraints;
}
private Db4objects.Db4o.Internal.Cluster.ClusterConstraint Compatible(IConstraint
with)
{
if (!(with is Db4objects.Db4o.Internal.Cluster.ClusterConstraint))
{
throw new ArgumentException();
}
Db4objects.Db4o.Internal.Cluster.ClusterConstraint other = (Db4objects.Db4o.Internal.Cluster.ClusterConstraint
)with;
if (other._constraints.Length != _constraints.Length)
{
throw new ArgumentException();
}
return other;
}
public virtual IConstraint And(IConstraint with)
{
return Join(with, true);
}
public virtual IConstraint Or(IConstraint with)
{
return Join(with, false);
}
private IConstraint Join(IConstraint with, bool isAnd)
{
lock (_cluster)
{
Db4objects.Db4o.Internal.Cluster.ClusterConstraint other = Compatible(with);
IConstraint[] newConstraints = new IConstraint[_constraints.Length];
for (int i = 0; i < _constraints.Length; i++)
{
newConstraints[i] = isAnd ? _constraints[i].And(other._constraints[i]) : _constraints
[i].Or(other._constraints[i]);
}
return new Db4objects.Db4o.Internal.Cluster.ClusterConstraint(_cluster, newConstraints
);
}
}
public virtual IConstraint Equal()
{
lock (_cluster)
{
for (int i = 0; i < _constraints.Length; i++)
{
_constraints[i].Equal();
}
return this;
}
}
public virtual IConstraint Greater()
{
lock (_cluster)
{
for (int i = 0; i < _constraints.Length; i++)
{
_constraints[i].Greater();
}
return this;
}
}
public virtual IConstraint Smaller()
{
lock (_cluster)
{
for (int i = 0; i < _constraints.Length; i++)
{
_constraints[i].Smaller();
}
return this;
}
}
public virtual IConstraint Identity()
{
lock (_cluster)
{
for (int i = 0; i < _constraints.Length; i++)
{
_constraints[i].Identity();
}
return this;
}
}
public virtual IConstraint Like()
{
lock (_cluster)
{
for (int i = 0; i < _constraints.Length; i++)
{
_constraints[i].Like();
}
return this;
}
}
public virtual IConstraint StartsWith(bool caseSensitive)
{
lock (_cluster)
{
for (int i = 0; i < _constraints.Length; i++)
{
_constraints[i].StartsWith(caseSensitive);
}
return this;
}
}
public virtual IConstraint EndsWith(bool caseSensitive)
{
lock (_cluster)
{
for (int i = 0; i < _constraints.Length; i++)
{
_constraints[i].EndsWith(caseSensitive);
}
return this;
}
}
public virtual IConstraint Contains()
{
lock (_cluster)
{
for (int i = 0; i < _constraints.Length; i++)
{
_constraints[i].Contains();
}
return this;
}
}
public virtual IConstraint Not()
{
lock (_cluster)
{
for (int i = 0; i < _constraints.Length; i++)
{
_constraints[i].Not();
}
return this;
}
}
public virtual object GetObject()
{
throw new NotSupportedException();
}
}
}
|
By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.
If a file you wish to view isn't highlighted, and is a text file (not binary), please
let us know and we'll add colourisation support for it.
This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.
A list of licenses authors might use can be found here
This member has not yet provided a Biography. Assume it's interesting and varied, and probably something to do with programming.