OpenConcerto

Dépôt officiel du code source de l'ERP OpenConcerto
sonarqube

svn://code.openconcerto.org/openconcerto

Rev

Rev 73 | Show entire file | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 73 Rev 182
Line 1... Line 1...
1
/*
1
/*
2
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
2
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
3
 * 
3
 * 
4
 * Copyright 2011 OpenConcerto, by ILM Informatique. All rights reserved.
4
 * Copyright 2011-2019 OpenConcerto, by ILM Informatique. All rights reserved.
5
 * 
5
 * 
6
 * The contents of this file are subject to the terms of the GNU General Public License Version 3
6
 * The contents of this file are subject to the terms of the GNU General Public License Version 3
7
 * only ("GPL"). You may not use this file except in compliance with the License. You can obtain a
7
 * only ("GPL"). You may not use this file except in compliance with the License. You can obtain a
8
 * copy of the License at http://www.gnu.org/licenses/gpl-3.0.html See the License for the specific
8
 * copy of the License at http://www.gnu.org/licenses/gpl-3.0.html See the License for the specific
9
 * language governing permissions and limitations under the License.
9
 * language governing permissions and limitations under the License.
Line 21... Line 21...
21
    static public final <T> List<T> filter(final List<T> l, final SearchSpec search) {
21
    static public final <T> List<T> filter(final List<T> l, final SearchSpec search) {
22
        final List<T> result;
22
        final List<T> result;
23
        if (search == null || search.isEmpty())
23
        if (search == null || search.isEmpty())
24
            result = l;
24
            result = l;
25
        else {
25
        else {
26
            result = new ArrayList<T>(l.size());
26
            result = new ArrayList<>(l.size());
27
            for (final T item : l) {
27
            for (final T item : l) {
28
                if (search.match(item))
28
                if (search.match(item))
29
                    result.add(item);
29
                    result.add(item);
30
            }
30
            }
31
        }
31
        }