Comments (4)
Have you tried running the grading script on the provided development server or gg site? I would suggest you to try this since I've just checked that I don't have any problems on these environments.
If the same problem occurs on these environments, I guess you need to come up with a better solution since we set the timeout to be not too tight if your solution is correct. Below, I attach a part of the log regarding cargo_asan --release
that I got by submitting on gg for your reference.
Running with cargo_asan --release...
Compiling crossbeam-utils v0.8.19
Compiling libc v0.2.153
Compiling cfg-if v1.0.0
Compiling memchr v2.7.2
Compiling ppv-lite86 v0.2.17
Compiling regex-syntax v0.8.3
Compiling either v1.10.0
Compiling crossbeam-epoch v0.9.18
Compiling crossbeam-channel v0.5.12
Compiling aho-corasick v1.1.3
Compiling getrandom v0.2.12
Compiling rand_core v0.6.4
Compiling crossbeam-deque v0.8.5
Compiling cs431 v0.1.0 (https://github.com/kaist-cp/cs431#0bb98050)
Compiling rand_chacha v0.3.1
Compiling rayon-core v1.12.1
Compiling rand v0.8.5
Compiling rayon v1.10.0
Compiling regex-automata v0.4.6
Compiling regex v1.10.4
Compiling cs431-homework v0.1.0 (/app/files/checks/e4877fa5-0dfa-4705-b2d0-9570193bdb72/cs431/homework)
Finished `release` profile [optimized] target(s) in 7.58s
Doc-tests cs431-homework
running 19 tests
test src/linked_list.rs - linked_list::LinkedList<T>::len (line 405) ... ok
test src/linked_list.rs - linked_list::LinkedList<T>::new (line 197) ... ok
test src/linked_list.rs - linked_list::LinkedList<T>::back_mut (line 541) ... ok
test src/linked_list.rs - linked_list::LinkedList<T>::iter_mut (line 350) ... ok
test src/linked_list.rs - linked_list::LinkedList<T>::is_empty (line 385) ... ok
test src/linked_list.rs - linked_list::LinkedList<T>::back (line 522) ... ok
test src/linked_list.rs - linked_list::LinkedList<T>::append (line 221) ... ok
test src/linked_list.rs - linked_list::LinkedList<T>::push_back (line 611) ... ok
test src/linked_list.rs - linked_list::LinkedList<T>::pop_back (line 630) ... ok
test src/linked_list.rs - linked_list::LinkedList<T>::front_mut (line 497) ... ok
test src/linked_list.rs - linked_list::LinkedList<T>::push_front (line 567) ... ok
test src/linked_list.rs - linked_list::LinkedList<T>::front (line 478) ... ok
test src/linked_list.rs - linked_list::LinkedList<T>::iter (line 321) ... ok
test src/linked_list.rs - linked_list::LinkedList<T>::pop_front (line 589) ... ok
test src/linked_list.rs - linked_list::LinkedList<T>::contains (line 454) ... ok
test src/linked_list.rs - linked_list::IterMut<'_,T>::insert_next (line 720) ... ok
test src/linked_list.rs - linked_list::LinkedList<T>::clear (line 430) ... ok
test src/linked_list.rs - linked_list::IterMut<'_,T>::peek_next (line 760) ... ok
test src/linked_list.rs - linked_list::LinkedList<T>::prepend (line 266) ... ok
test result: ok. 19 passed; 0 failed; 0 ignored; 0 measured; 14 filtered out; finished in 0.76s
from cs431.
I have to say that if time-out doesn't occur with debug cargo_asan
and it occurs with --release
, it sounds a bit weird, since release should be faster (but maybe it's compilation time issue).
from cs431.
Actually, optimization of incorrect programs can lead to infinite loops; although it is probably unrelated here.
from cs431.
I tried it on the development server, and it was okay. I kind of forgot the existence of development server. Thank you all for your reply.
from cs431.
Related Issues (20)
- [Question] Unable to start the workspace on Coder HOT 1
- [Question] I get VALID?=timeout with full score log HOT 4
- [Lecture] Suggestion on teaching promising semantics HOT 1
- Optional Q&A session on June 5th (Wed)
- [Question] Understanding of access hazard & ABA hazard HOT 1
- Server rebooting scheduled (Jun 5, Wed, 10pm~) HOT 1
- [Question] zip is not installed on server HOT 2
- gg.kaist.ac.kr down for preparing for the final exam HOT 1
- [Question] find_harris_herlihy_shavit relaxed load for tag HOT 6
- [Question] Timeout on growable_array stress_concurrent with cargo_asan HOT 2
- [Question] How to get previous node of bucket sentinel? HOT 8
- [Question] Hazard Pointers: is it safe to protect a pointer to invalid memory? HOT 5
- [Question] Code lines for maintaining the invariants of stack/queue HOT 1
- [Question] About the problem of 2022 Fall HOT 2
- [Question] ordering in stack push for maintaining invariant HOT 1
- Final claim session on June 17th (Mon) HOT 4
- [Question] HW 7 reason for having atomicUsize type in hazard field HOT 2
- [Question] [HW7] Failed Basic Tests in hazard.rs HOT 3
- [Question] HW7 Dropping the Hazard Bag HOT 3
- [Question] Partial Points on HW7 HOT 1
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from cs431.