public interface PromotableCandidateItemOffer
extends java.io.Serializable
| Modifier and Type | Method and Description |
|---|---|
void |
addUse() |
int |
calculateMaximumNumberOfUses() |
int |
calculateMaxUsesForItemCriteria(OfferItemCriteria itemCriteria,
Offer promotion)
Determines the max number of times this itemCriteria might apply.
|
Money |
calculateSavingsForOrderItem(PromotableOrderItem orderItem,
int qtyToReceiveSavings)
Public only for unit testing - not intended to be called
|
int |
calculateTargetQuantityForTieredOffer()
Returns the number of item quantities that qualified as targets for
this promotion.
|
java.util.HashMap<OfferItemCriteria,java.util.List<PromotableOrderItem>> |
getCandidateQualifiersMap() |
java.util.List<PromotableOrderItem> |
getCandidateTargets() |
Offer |
getOffer() |
Money |
getPotentialSavings() |
int |
getPriority() |
int |
getUses() |
boolean |
hasQualifyingItemCriteria() |
boolean |
isLegacyOffer() |
void |
setCandidateQualifiersMap(java.util.HashMap<OfferItemCriteria,java.util.List<PromotableOrderItem>> candidateItemsMap) |
void |
setCandidateTargets(java.util.List<PromotableOrderItem> candidateTargets) |
void |
setPotentialSavings(Money savings) |
java.util.HashMap<OfferItemCriteria,java.util.List<PromotableOrderItem>> getCandidateQualifiersMap()
void setCandidateQualifiersMap(java.util.HashMap<OfferItemCriteria,java.util.List<PromotableOrderItem>> candidateItemsMap)
java.util.List<PromotableOrderItem> getCandidateTargets()
void setCandidateTargets(java.util.List<PromotableOrderItem> candidateTargets)
Money getPotentialSavings()
void setPotentialSavings(Money savings)
boolean hasQualifyingItemCriteria()
Money calculateSavingsForOrderItem(PromotableOrderItem orderItem, int qtyToReceiveSavings)
int calculateMaximumNumberOfUses()
int calculateTargetQuantityForTieredOffer()
int calculateMaxUsesForItemCriteria(OfferItemCriteria itemCriteria, Offer promotion)
itemCriteria - promotion - int getPriority()
Offer getOffer()
int getUses()
void addUse()
boolean isLegacyOffer()
Copyright © 2018. All Rights Reserved.