Java 中的内联比较器与自定义比较器

对列表进行排序时，使用内联 java Comparator（带有匿名内部类）与实现单独的自定义 Comparator 类之间是否存在性能差异？

1.

public class SortByErrorComparator implements Comparator<WorkflowError> {
    public int compare(WorkflowError obj1, WorkflowError obj2) {
        return obj1.getErrorCode().compareTo(obj2.getErrorCode());
    }
}
Collections.sort(list, new SortByErrorComparator()) ;

2.

Collections.sort(list, new Comparator<WorkflowError>() {
    public int compare(WorkflowError obj1, WorkflowError obj2) {
        return obj1.getErrorCode().compareTo(obj2.getErrorCode());
    }
});

还有，什么时候会compare()方法被调用？

还有选项 3 - lambdaFunction:

Collections.sort(list, (a, b) -> a.getErrorCode().compareTo(b.getErrorCode()));

据报道，这应该快 2 倍左右这个基准数据 https://stackoverflow.com/a/19005979/256196.

...或者（感谢@JB尼泽特 https://stackoverflow.com/users/571407/jb-nizet) 选项 4:

list.sort(Comparator.comparing(WorkflowError::getErrorCode))