You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

Npv.java 1.7KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647
  1. /* ====================================================================
  2. Licensed to the Apache Software Foundation (ASF) under one or more
  3. contributor license agreements. See the NOTICE file distributed with
  4. this work for additional information regarding copyright ownership.
  5. The ASF licenses this file to You under the Apache License, Version 2.0
  6. (the "License"); you may not use this file except in compliance with
  7. the License. You may obtain a copy of the License at
  8. http://www.apache.org/licenses/LICENSE-2.0
  9. Unless required by applicable law or agreed to in writing, software
  10. distributed under the License is distributed on an "AS IS" BASIS,
  11. WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  12. See the License for the specific language governing permissions and
  13. limitations under the License.
  14. ==================================================================== */
  15. package org.apache.poi.hssf.record.formula.functions;
  16. import org.apache.poi.hssf.record.formula.eval.EvaluationException;
  17. /**
  18. * Calculates the net present value of an investment by using a discount rate
  19. * and a series of future payments (negative values) and income (positive
  20. * values). Minimum 2 arguments, first arg is the rate of discount over the
  21. * length of one period others up to 254 arguments representing the payments and
  22. * income.
  23. *
  24. * @author SPetrakovsky
  25. */
  26. public class Npv extends NumericFunction.MultiArg {
  27. public Npv() {
  28. super(2, 255);
  29. }
  30. @Override
  31. protected double evaluate(double[] ds) throws EvaluationException {
  32. double rate = ds[0];
  33. double sum = 0;
  34. for (int i = 1; i < ds.length; i++) {
  35. sum += ds[i] / Math.pow(rate + 1, i);
  36. }
  37. return sum;
  38. }
  39. }