mondrianresult.java

OLAP 的客户端代码

/*
 * ====================================================================
 * This software is subject to the terms of the Common Public License
 * Agreement, available at the following URL:
 *   http://www.opensource.org/licenses/cpl.html .
 * Copyright (C) 2003-2004 TONBELLER AG.
 * All Rights Reserved.
 * You must accept the terms of that agreement to use this software.
 * ====================================================================
 *
 * 
 */
package com.tonbeller.jpivot.mondrian;

import java.util.ArrayList;

import com.tonbeller.jpivot.olap.model.Axis;
import com.tonbeller.jpivot.olap.model.impl.FormatStringParser;
import com.tonbeller.jpivot.olap.query.ResultBase;

/**
 * Result implementation for Mondrian
 */
public class MondrianResult extends ResultBase {

  private mondrian.olap.Result monResult = null;
  private int[] posize;
  private FormatStringParser formatStringParser = new FormatStringParser();

  /**
   * Constructor
   * @param model the associated MondrianModel
   */
  protected MondrianResult(mondrian.olap.Result monResult, MondrianModel model) {
    super(model);
    this.monResult = monResult;

    initData();
  }

  /**
   * initData creates all the wrapper objects
   */
  private void initData() {
    int i, j, k;
    mondrian.olap.Axis[] monAxes = monResult.getAxes();
    // first step: walk through axes and add the members to the model
    int nCells = 1;
    posize = new int[monAxes.length];
    for (i = 0; i < monAxes.length; i++) {
      mondrian.olap.Position[] monPositions = monAxes[i].positions;
      posize[i] = monPositions.length;
      nCells = nCells * monPositions.length;

      for (j = 0; j < monPositions.length; j++) {
        mondrian.olap.Member[] monMembers = monPositions[j].getMembers();
        for (k = 0; k < monMembers.length; k++) {
          ((MondrianModel) model).addMember(monMembers[k]);
        }
      }
    }
    mondrian.olap.Axis monSlicer = monResult.getSlicerAxis();
    mondrian.olap.Position[] monPositions = monSlicer.positions;
    for (j = 0; j < monPositions.length; j++) {
      mondrian.olap.Member[] monMembers = monPositions[j].getMembers();
      for (k = 0; k < monMembers.length; k++) {
        ((MondrianModel) model).addMember(monMembers[k]);
      }
    }

    // second step: create the result data
    axesList = new ArrayList();
    for (i = 0; i < monAxes.length; i++) {
      axesList.add(new MondrianAxis(i, monAxes[i], ((MondrianModel) model)));
    }
    slicer = new MondrianAxis(-1, monSlicer, ((MondrianModel) model));

    int[] iar = new int[monAxes.length];
    for (i = 0; i < monAxes.length; i++)
      iar[i] = 0;
    for (i = 0; i < nCells; i++) {
      mondrian.olap.Cell monCell = monResult.getCell(iar);
      MondrianCell cell = new MondrianCell(monCell, ((MondrianModel) model));
      cell.setFormattedValue(monCell.getFormattedValue(), formatStringParser);
      aCells.add(cell);
      if (nCells > 1)
        increment(iar); // not for 0-dimensional case
    }

  }

  /**
   * increment int array according to size of axis positions
   *  first index changes fastest
   * (0,0), (1,0) ... (NX-1, 0)
   * (0,1), (1,1) ... (NX-1, 1)
   */
  private void increment(int[] iar) {
    int nn = ++iar[0];
    // done for the 1-dimensional case
    if (iar.length > 1 && nn >= posize[0]) {
      iar[0] = 0;
      for (int i = 1; i < iar.length; i++) {
        int kk = ++iar[i];
        if (kk < posize[i])
          break;
        else
          iar[i] = 0;
      }
    }
  }

  /**
   * Returns the axes.
   * @return Axis[]
   */
  public Axis[] getAxes() {
    if (monResult == null)
      return null; // todo error handling
    return (Axis[]) axesList.toArray(new MondrianAxis[0]);
  }

} // MondrianResult