-
Notifications
You must be signed in to change notification settings - Fork 1.7k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
FINERACT-1981: EMI Calculator performance optimization
- Loading branch information
Showing
3 changed files
with
196 additions
and
10 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
103 changes: 103 additions & 0 deletions
103
fineract-progressive-loan/src/main/java/org/apache/fineract/portfolio/util/Memo.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,103 @@ | ||
| /** | ||
| * Licensed to the Apache Software Foundation (ASF) under one | ||
| * or more contributor license agreements. See the NOTICE file | ||
| * distributed with this work for additional information | ||
| * regarding copyright ownership. The ASF licenses this file | ||
| * to you under the Apache License, Version 2.0 (the | ||
| * "License"); you may not use this file except in compliance | ||
| * with the License. You may obtain a copy of the License at | ||
| * | ||
| * http://www.apache.org/licenses/LICENSE-2.0 | ||
| * | ||
| * Unless required by applicable law or agreed to in writing, | ||
| * software distributed under the License is distributed on an | ||
| * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY | ||
| * KIND, either express or implied. See the License for the | ||
| * specific language governing permissions and limitations | ||
| * under the License. | ||
| */ | ||
| package org.apache.fineract.portfolio.util; | ||
|
|
||
| import java.util.function.Supplier; | ||
|
|
||
| /** | ||
| * Memo (Object value cache) for calculations | ||
| * | ||
| */ | ||
| public final class Memo<T> { | ||
|
|
||
| private final Object lock = new Object(); | ||
| private final Supplier<? extends T> supplier; | ||
| private final Supplier<Object> dependenciesGetter; | ||
| private final boolean useReferenceCheck; | ||
|
|
||
| private volatile T value; | ||
| private volatile int[] dependencyHashCodes = new int[0]; | ||
|
|
||
| private Memo(Supplier<? extends T> supplier, Supplier<Object> dependenciesGetter, boolean useReferenceCheck) { | ||
| this.supplier = supplier; | ||
| this.dependenciesGetter = dependenciesGetter; | ||
| this.useReferenceCheck = useReferenceCheck; | ||
| } | ||
|
|
||
| public T get() { | ||
| Object actualDependencies = dependenciesGetter != null ? dependenciesGetter.get() : null; | ||
| if (actualDependencies == null && value != null) { | ||
| return value; | ||
| } | ||
| synchronized (lock) { | ||
| if (checkDependencyChangedAndUpdate(actualDependencies)) { | ||
| value = supplier.get(); | ||
| } | ||
| } | ||
| return value; | ||
| } | ||
|
|
||
| private boolean checkDependencyChangedAndUpdate(Object actualDependencies) { | ||
| if (actualDependencies == null) { | ||
| return true; | ||
| } | ||
| if (actualDependencies instanceof Object[] actualDependencyList) { | ||
| boolean isSame = dependencyHashCodes.length == actualDependencyList.length; | ||
| int[] actualDependencyHashCodes = new int[actualDependencyList.length]; | ||
| for (int i = 0; i < actualDependencyList.length; i++) { | ||
| actualDependencyHashCodes[i] = getHashCode(actualDependencyList[i]); | ||
| if (isSame) { | ||
| isSame = dependencyHashCodes[i] == actualDependencyHashCodes[i]; | ||
| } | ||
| } | ||
| if (!isSame) { | ||
| dependencyHashCodes = actualDependencyHashCodes; | ||
| } | ||
| return !isSame; | ||
| } else { | ||
| final int[] actualDependencyHashCodes = { getHashCode(actualDependencies) }; | ||
| final boolean isSame = dependencyHashCodes.length == actualDependencyHashCodes.length | ||
| && dependencyHashCodes[0] == actualDependencyHashCodes[0]; | ||
| if (!isSame) { | ||
| dependencyHashCodes = actualDependencyHashCodes; | ||
| return true; | ||
| } | ||
| } | ||
| return false; | ||
| } | ||
|
|
||
| private int getHashCode(Object dependency) { | ||
| if (dependency == null) { | ||
| return 0; | ||
| } | ||
| return useReferenceCheck ? System.identityHashCode(dependency) : dependency.hashCode(); | ||
| } | ||
|
|
||
| public static <T> Memo<T> of(Supplier<? extends T> supplier) { | ||
| return new Memo<>(supplier, null, false); | ||
| } | ||
|
|
||
| public static <T> Memo<T> of(Supplier<? extends T> supplier, Supplier<Object> dependenciesFunction) { | ||
| return new Memo<>(supplier, dependenciesFunction, false); | ||
| } | ||
|
|
||
| public static <T> Memo<T> of(Supplier<? extends T> supplier, Supplier<Object> dependenciesFunction, boolean useReferenceCheck) { | ||
| return new Memo<>(supplier, dependenciesFunction, useReferenceCheck); | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters