示例#1
0
  static AdGroupCriterion addPartition(
      long adGroupId,
      AdGroupCriterion parent,
      ProductCondition condition,
      ProductPartitionType partitionType,
      FixedBid bid,
      Boolean isNegative) {
    AdGroupCriterion adGroupCriterion = null;

    if (isNegative) {
      adGroupCriterion = new NegativeAdGroupCriterion();
    } else {
      adGroupCriterion = new BiddableAdGroupCriterion();
      ((BiddableAdGroupCriterion) adGroupCriterion).setCriterionBid(bid);
    }

    adGroupCriterion.setAdGroupId(adGroupId);

    ProductPartition criterion = new ProductPartition();
    criterion.setCondition(condition);
    criterion.setParentCriterionId((parent != null) ? parent.getId() : null);

    if (partitionType == ProductPartitionType.SUBDIVISION) {
      criterion.setPartitionType(ProductPartitionType.SUBDIVISION); // Branch
      adGroupCriterion.setId(_referenceId--);
    } else {
      criterion.setPartitionType(ProductPartitionType.UNIT); // Leaf
    }

    adGroupCriterion.setCriterion(criterion);

    addPartitionAction(adGroupCriterion, ItemAction.ADD);

    return adGroupCriterion;
  }
示例#2
0
  static void printProductPartitions(ArrayOfAdGroupCriterion adGroupCriterions) {
    Map<Long, ArrayList<AdGroupCriterion>> childBranches =
        new HashMap<Long, ArrayList<AdGroupCriterion>>();
    AdGroupCriterion treeRoot = null;

    for (AdGroupCriterion adGroupCriterion : adGroupCriterions.getAdGroupCriterions()) {
      ProductPartition partition = (ProductPartition) adGroupCriterion.getCriterion();
      childBranches.put(adGroupCriterion.getId(), new ArrayList<AdGroupCriterion>());

      if (partition.getParentCriterionId() != null) {
        childBranches.get(partition.getParentCriterionId()).add(adGroupCriterion);
      } else {
        treeRoot = adGroupCriterion;
      }
    }

    printProductPartitionTree(treeRoot, childBranches, 0);
  }
示例#3
0
  static void printProductPartitionTree(
      AdGroupCriterion node, Map<Long, ArrayList<AdGroupCriterion>> childBranches, int treeLevel) {
    ProductPartition criterion = (ProductPartition) node.getCriterion();

    outputStatusMessage(
        String.format(
            "%" + ((treeLevel > 0) ? treeLevel * 4 : "") + "s%s\n",
            "",
            criterion.getPartitionType()));

    outputStatusMessage(
        String.format(
            "%" + ((treeLevel > 0) ? treeLevel * 4 : "") + "s%s%d\n",
            "",
            "ParentCriterionId: ",
            criterion.getParentCriterionId()));

    outputStatusMessage(
        String.format(
            "%" + ((treeLevel > 0) ? treeLevel * 4 : "") + "s%s%d\n", "", "Id: ", node.getId()));

    if (criterion.getPartitionType() == ProductPartitionType.UNIT) {
      if (node instanceof BiddableAdGroupCriterion) {
        outputStatusMessage(
            String.format(
                "%" + ((treeLevel > 0) ? treeLevel * 4 : "") + "s%s%.2f\n",
                "",
                "Bid amount: ",
                ((FixedBid) ((BiddableAdGroupCriterion) node).getCriterionBid())
                    .getBid()
                    .getAmount()));

      } else {
        if (node instanceof NegativeAdGroupCriterion) {
          outputStatusMessage(
              String.format("%" + treeLevel * 4 + "s%s\n", "", "Not bidding on this condition"));
        }
      }
    }

    String nullAttribute =
        (criterion.getParentCriterionId() != null) ? "(All Others)" : "(Tree Root)";

    outputStatusMessage(
        String.format(
            "%" + ((treeLevel > 0) ? treeLevel * 4 : "") + "s%s%s\n",
            "",
            "Attribute: ",
            (criterion.getCondition().getAttribute() == null)
                ? nullAttribute
                : criterion.getCondition().getAttribute()));

    outputStatusMessage(
        String.format(
            "%" + ((treeLevel > 0) ? treeLevel * 4 : "") + "s%s%s\n",
            "",
            "Condition: ",
            criterion.getCondition().getOperand()));

    for (AdGroupCriterion childNode : childBranches.get(node.getId())) {
      printProductPartitionTree(childNode, childBranches, treeLevel + 1);
    }
  }