io.failify.rt.StackMatcher Maven / Gradle / Ivy
/*
* MIT License
*
* Copyright (c) 2017 Armin Balalaie
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*
*/
package io.failify.rt;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
/**
* This class is responsible for matching a given stack trace against the current stack trace
*/
public class StackMatcher {
// TODO change this so it returns true if the stack traces exist in the right order
/**
* This method matches the given stack arg against the current stack trace
* @param stack the list of methods separated by comma where the last called method comes in the end
* @return returns true if the given stack matches exactly the current stack, otherwise false
*/
public boolean match(String stack) {
StackTraceElement[] elements = Thread.currentThread().getStackTrace();
String[] inputTraces = stack.trim().split(",");
List inputList = Arrays.asList(inputTraces);
Collections.reverse(inputList);
inputTraces = inputList.toArray(new String[inputList.size()]);
for (int i=0; i
© 2015 - 2025 Weber Informatics LLC | Privacy Policy