1 /* 2 * (c) Copyright 2006-2020 by rapiddweller GmbH & Volker Bergmann. All rights reserved. 3 * 4 * Redistribution and use in source and binary forms, with or without 5 * modification, is permitted under the terms of the 6 * GNU General Public License. 7 * 8 * For redistributing this software or a derivative work under a license other 9 * than the GPL-compatible Free Software License as defined by the Free 10 * Software Foundation or approved by OSI, you must first obtain a commercial 11 * license to this software product from rapiddweller GmbH & Volker Bergmann. 12 * 13 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 14 * WITHOUT A WARRANTY OF ANY KIND. ALL EXPRESS OR IMPLIED CONDITIONS, 15 * REPRESENTATIONS AND WARRANTIES, INCLUDING ANY IMPLIED WARRANTY OF 16 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT, ARE 17 * HEREBY EXCLUDED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 18 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 19 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 20 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 21 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 22 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 23 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 24 * POSSIBILITY OF SUCH DAMAGE. 25 */ 26 27 package com.rapiddweller.domain.math; 28 29 import com.rapiddweller.benerator.primitive.number.RecurrenceRelationNumberGenerator; 30 31 /** 32 * Generates <a href="http://en.wikipedia.org/wiki/Fibonacci_number">Fibonacci Numbers</a>. 33 * It is defined recursively by 34 * <ul> 35 * <li>F(0) = 1</li> 36 * <li>F(1) = 1</li> 37 * <li>F(n) = F(n-1) + F(n-2)</li> 38 * </ul> 39 * <br/> 40 * Created at 03.07.2009 10:44:56 41 * 42 * @author Volker Bergmann 43 * @since 0.6.0 44 */ 45 public class FibonacciLongGenerator 46 extends RecurrenceRelationNumberGenerator<Long> { 47 48 private final boolean unique; 49 50 /** 51 * Instantiates a new Fibonacci long generator. 52 * 53 * @param min the min 54 * @param max the max 55 * @param unique the unique 56 */ 57 public FibonacciLongGenerator(Long min, Long max, boolean unique) { 58 super(Long.class, 2, min, max); 59 this.unique = unique; 60 } 61 62 // RecurrenceRelationNumberGenerator interface implementation ------------------------------------------------------ 63 64 @Override 65 protected Long aN() { 66 return aN(-1) + aN(-2); 67 } 68 69 @Override 70 protected Long a0(int n) { 71 return (n == 0 ? 0L : 1L); 72 } 73 74 @Override 75 protected void resetMembers() { 76 super.resetMembers(); 77 if (unique) { 78 generate(); 79 generate(); 80 } 81 } 82 83 }