diff --git a/benchmarks/execution/JS/modelchecking/LinkedList.js b/benchmarks/execution/JS/modelchecking/LinkedList.js index eb1815f399d6883bf81f1e956a83f6c3b7afc494..19b134f72781dfe4cc9900314ac5e92a7fdf78ff 100644 --- a/benchmarks/execution/JS/modelchecking/LinkedList.js +++ b/benchmarks/execution/JS/modelchecking/LinkedList.js @@ -1,3 +1,9 @@ +/* +Minor parts of implementation bases on https://kenjj.medium.com/linked-list-with-typescript-ea8c88276e2e +Implementation is strongly modified to imitate behavior of Java linked list, particularly a double-linked list +which can be used as a stack or queue, to access the first and last element (for DFS, BFS, Mixed BFS/DFS) for model checking more efficiently. +The LinkedList implementation is designed for the model checking code generation specifically, thus only contains functions for accessing and modifying the first/last element, and accessing the length efficiently. +*/ export class LinkedListNode { constructor(value) { this.value = value;