6433387082

Committed 06 Oct 2023 03:10PM UTC coverage: 92.296% (-0.007%) from 92.303%

Build # 6433387082

Build Type

push

github

Committed by

mtf90

Commit Message

update Falk's developer id

Run Details

11573 of 12539 relevant lines covered (92.3%)

1.67 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

97.78

/algorithms/passive/ostia/src/main/java/de/learnlib/algorithms/ostia/IntQueue.java

/* Copyright (C) 2013-2023 TU Dortmund
 * This file is part of LearnLib, http://www.learnlib.de/.
 *
 * Licensed 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 de.learnlib.algorithms.ostia;

import java.util.HashSet;
import java.util.Set;
import java.util.StringJoiner;

import net.automatalib.commons.smartcollections.IntSeq;
import org.checkerframework.checker.nullness.qual.Nullable;
import org.checkerframework.checker.nullness.qual.PolyNull;

class IntQueue {

    int value;
    @Nullable IntQueue next;

    @Override
    public String toString() {
        final StringJoiner sj = new StringJoiner(", ", "[", "]");

        IntQueue iter = this;
        while (iter != null) {
            sj.add(Integer.toString(iter.value));
            iter = iter.next;
        }
        return sj.toString();
    }

    static @Nullable IntQueue asQueue(IntSeq str) {
        IntQueue q = null;
        for (int i = str.size() - 1; i >= 0; i--) {
            IntQueue next = new IntQueue();
            next.value = str.get(i);
            next.next = q;
            q = next;
        }
        assert !IntQueue.hasCycle(q);
        return q;
    }

    static boolean eq(@Nullable IntQueue a, @Nullable IntQueue b) {
        IntQueue aIter = a;
        IntQueue bIter = b;
        while (aIter != null && bIter != null) {
            if (aIter.value != bIter.value) {
                return false;
            }
            aIter = aIter.next;
            bIter = bIter.next;
        }
        return aIter == null && bIter == null;
    }

    static boolean hasCycle(@Nullable IntQueue q) {
        final Set<IntQueue> elements = new HashSet<>();
        IntQueue iter = q;
        while (iter != null) {
            if (!elements.add(iter)) {
                return true;
            }
            iter = iter.next;
        }
        return false;
    }

    static @PolyNull IntQueue copyAndConcat(@Nullable IntQueue q, @PolyNull IntQueue tail) {
        assert !hasCycle(q) && !hasCycle(tail);
        if (q == null) {
            return tail;
        }
        final IntQueue root = new IntQueue();
        root.value = q.value;
        IntQueue curr = root;
        IntQueue iter = q.next;
        while (iter != null) {
            curr.next = new IntQueue();
            curr = curr.next;
            curr.value = iter.value;
            iter = iter.next;
        }
        curr.next = tail;
        assert !hasCycle(root);
        return root;
    }
}

1	/* Copyright (C) 2013-2023 TU Dortmund
2	* This file is part of LearnLib, http://www.learnlib.de/.
3	*
4	* Licensed under the Apache License, Version 2.0 (the "License");
5	* you may not use this file except in compliance with the License.
6	* You may obtain a copy of the License at
7	*
8	* http://www.apache.org/licenses/LICENSE-2.0
9	*
10	* Unless required by applicable law or agreed to in writing, software
11	* distributed under the License is distributed on an "AS IS" BASIS,
12	* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13	* See the License for the specific language governing permissions and
14	* limitations under the License.
15	*/
16	package de.learnlib.algorithms.ostia;
17
18	import java.util.HashSet;
19	import java.util.Set;
20	import java.util.StringJoiner;
21
22	import net.automatalib.commons.smartcollections.IntSeq;
23	import org.checkerframework.checker.nullness.qual.Nullable;
24	import org.checkerframework.checker.nullness.qual.PolyNull;
25
26	class IntQueue {	2✔
27
28	int value;
29	@Nullable IntQueue next;
30
31	@Override
32	public String toString() {
33	final StringJoiner sj = new StringJoiner(", ", "[", "]");	2✔
34
35	IntQueue iter = this;	2✔
36	while (iter != null) {	2✔
37	sj.add(Integer.toString(iter.value));	2✔
38	iter = iter.next;	2✔
39	}
40	return sj.toString();	2✔
41	}
42
43	static @Nullable IntQueue asQueue(IntSeq str) {
44	IntQueue q = null;	2✔
45	for (int i = str.size() - 1; i >= 0; i--) {	2✔
46	IntQueue next = new IntQueue();	2✔
47	next.value = str.get(i);	2✔
48	next.next = q;	2✔
49	q = next;	2✔
50	}
51	assert !IntQueue.hasCycle(q);	2✔
52	return q;	2✔
53	}
54
55	static boolean eq(@Nullable IntQueue a, @Nullable IntQueue b) {
56	IntQueue aIter = a;	2✔
57	IntQueue bIter = b;	2✔
58	while (aIter != null && bIter != null) {	2✔
59	if (aIter.value != bIter.value) {	2✔
60	return false;	2✔
61	}
62	aIter = aIter.next;	2✔
63	bIter = bIter.next;	2✔
64	}
65	return aIter == null && bIter == null;	2✔
66	}
67
68	static boolean hasCycle(@Nullable IntQueue q) {
69	final Set<IntQueue> elements = new HashSet<>();	2✔
70	IntQueue iter = q;	2✔
71	while (iter != null) {	2✔
72	if (!elements.add(iter)) {	2✔
73	return true;	×
74	}
75	iter = iter.next;	2✔
76	}
77	return false;	2✔
78	}
79
80	static @PolyNull IntQueue copyAndConcat(@Nullable IntQueue q, @PolyNull IntQueue tail) {
81	assert !hasCycle(q) && !hasCycle(tail);	2✔
82	if (q == null) {	2✔
83	return tail;	2✔
84	}
85	final IntQueue root = new IntQueue();	2✔
86	root.value = q.value;	2✔
87	IntQueue curr = root;	2✔
88	IntQueue iter = q.next;	2✔
89	while (iter != null) {	2✔
90	curr.next = new IntQueue();	2✔
91	curr = curr.next;	2✔
92	curr.value = iter.value;	2✔
93	iter = iter.next;	2✔
94	}
95	curr.next = tail;	2✔
96	assert !hasCycle(root);	2✔
97	return root;	2✔
98	}
99	}

LearnLib / learnlib / 6433387082

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous