|
Eclipse Platform Release 3.6 |
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface IRequirement
A requirement represents some external constraint on an IInstallableUnit
.
Each requirement represents something an IInstallableUnit
needs that
it expects to be provided by another IInstallableUnit
. Requirements are
entirely generic, and are intended to be capable of representing anything that
an IInstallableUnit
may need either at install time, or at runtime.
Method Summary | |
---|---|
String |
getDescription()
Returns a textual description of this requirement. |
IMatchExpression<IInstallableUnit> |
getFilter()
|
IMatchExpression<IInstallableUnit> |
getMatches()
Returns a boolean match expression that will return true for any IInstallableUnit that matches the requirement. |
int |
getMax()
Returns the maximum cardinality of the requirement. |
int |
getMin()
Returns the minimum cardinality of the requirement. |
boolean |
isGreedy()
Returns whether this requirement should cause extra installable units to be installed in order to satisfy it. |
boolean |
isMatch(IInstallableUnit iu)
Returns whether the provided capabilities of the given installable unit satisfy this requirement. |
Method Detail |
---|
int getMin()
int getMax()
IMatchExpression<IInstallableUnit> getFilter()
IMatchExpression<IInstallableUnit> getMatches()
IInstallableUnit
that matches the requirement.
boolean isMatch(IInstallableUnit iu)
iu
- the installable unit to check for matching capabilities
true
if the given installable unit satisfies this
requirement, and false
otherwise.boolean isGreedy()
true
if additional installable units should be installed
to satisfy this requirement, and false
otherwiseString getDescription()
|
Eclipse Platform Release 3.6 |
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
Guidelines for using Eclipse APIs.
Copyright (c) Eclipse contributors and others 2000, 2010. All rights reserved.