2024-04-10 20:51:02 -04:00
|
|
|
use anyhow::{bail, Context, Result};
|
2024-04-12 12:57:04 -04:00
|
|
|
use crossterm::{
|
|
|
|
style::Stylize,
|
|
|
|
terminal::{Clear, ClearType},
|
|
|
|
ExecutableCommand,
|
|
|
|
};
|
2024-04-13 23:13:27 -04:00
|
|
|
use std::{
|
|
|
|
fs::{self, File},
|
|
|
|
io::{Read, StdoutLock, Write},
|
|
|
|
};
|
2024-04-10 20:51:02 -04:00
|
|
|
|
2024-04-13 19:15:43 -04:00
|
|
|
use crate::{exercise::Exercise, info_file::InfoFile, FENISH_LINE};
|
2024-04-10 20:51:02 -04:00
|
|
|
|
2024-04-13 23:13:27 -04:00
|
|
|
const STATE_FILE_NAME: &str = ".rustlings-state.txt";
|
2024-04-13 19:15:43 -04:00
|
|
|
const BAD_INDEX_ERR: &str = "The current exercise index is higher than the number of exercises";
|
2024-04-10 20:51:02 -04:00
|
|
|
|
2024-04-12 14:06:56 -04:00
|
|
|
#[must_use]
|
|
|
|
pub enum ExercisesProgress {
|
|
|
|
AllDone,
|
|
|
|
Pending,
|
|
|
|
}
|
|
|
|
|
2024-04-10 20:51:02 -04:00
|
|
|
pub struct AppState {
|
2024-04-13 19:15:43 -04:00
|
|
|
current_exercise_ind: usize,
|
|
|
|
exercises: Vec<Exercise>,
|
2024-04-10 20:51:02 -04:00
|
|
|
n_done: u16,
|
2024-04-13 19:15:43 -04:00
|
|
|
welcome_message: String,
|
|
|
|
final_message: String,
|
2024-04-13 23:13:27 -04:00
|
|
|
file_buf: Vec<u8>,
|
2024-04-10 20:51:02 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
impl AppState {
|
2024-04-13 23:13:27 -04:00
|
|
|
fn update_from_file(&mut self) {
|
|
|
|
self.file_buf.clear();
|
|
|
|
self.n_done = 0;
|
|
|
|
|
|
|
|
if File::open(STATE_FILE_NAME)
|
|
|
|
.and_then(|mut file| file.read_to_end(&mut self.file_buf))
|
|
|
|
.is_ok()
|
|
|
|
{
|
|
|
|
let mut lines = self.file_buf.split(|c| *c == b'\n');
|
|
|
|
let Some(current_exercise_name) = lines.next() else {
|
|
|
|
return;
|
|
|
|
};
|
|
|
|
|
|
|
|
if lines.next().is_none() {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
let mut done_exercises = hashbrown::HashSet::with_capacity(self.exercises.len());
|
|
|
|
|
|
|
|
for done_exerise_name in lines {
|
|
|
|
if done_exerise_name.is_empty() {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
done_exercises.insert(done_exerise_name);
|
|
|
|
}
|
|
|
|
|
|
|
|
for (ind, exercise) in self.exercises.iter_mut().enumerate() {
|
|
|
|
if done_exercises.contains(exercise.name.as_bytes()) {
|
|
|
|
exercise.done = true;
|
|
|
|
self.n_done += 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if exercise.name.as_bytes() == current_exercise_name {
|
|
|
|
self.current_exercise_ind = ind;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2024-04-13 19:15:43 -04:00
|
|
|
pub fn new(info_file: InfoFile) -> Self {
|
2024-04-13 23:13:27 -04:00
|
|
|
let exercises = info_file
|
2024-04-13 19:15:43 -04:00
|
|
|
.exercises
|
|
|
|
.into_iter()
|
|
|
|
.map(|mut exercise_info| {
|
|
|
|
// Leaking to be able to borrow in the watch mode `Table`.
|
|
|
|
// Leaking is not a problem because the `AppState` instance lives until
|
|
|
|
// the end of the program.
|
2024-04-13 20:41:19 -04:00
|
|
|
let path = exercise_info.path().leak();
|
2024-04-13 19:15:43 -04:00
|
|
|
|
|
|
|
exercise_info.name.shrink_to_fit();
|
|
|
|
let name = exercise_info.name.leak();
|
|
|
|
|
|
|
|
let hint = exercise_info.hint.trim().to_owned();
|
|
|
|
|
|
|
|
Exercise {
|
|
|
|
name,
|
|
|
|
path,
|
|
|
|
mode: exercise_info.mode,
|
|
|
|
hint,
|
|
|
|
done: false,
|
|
|
|
}
|
|
|
|
})
|
|
|
|
.collect::<Vec<_>>();
|
|
|
|
|
2024-04-13 23:13:27 -04:00
|
|
|
let mut slf = Self {
|
|
|
|
current_exercise_ind: 0,
|
2024-04-10 20:51:02 -04:00
|
|
|
exercises,
|
2024-04-13 23:13:27 -04:00
|
|
|
n_done: 0,
|
2024-04-13 19:15:43 -04:00
|
|
|
welcome_message: info_file.welcome_message.unwrap_or_default(),
|
|
|
|
final_message: info_file.final_message.unwrap_or_default(),
|
2024-04-13 23:13:27 -04:00
|
|
|
file_buf: Vec::with_capacity(2048),
|
|
|
|
};
|
|
|
|
|
|
|
|
slf.update_from_file();
|
|
|
|
|
|
|
|
slf
|
2024-04-10 20:51:02 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
#[inline]
|
|
|
|
pub fn current_exercise_ind(&self) -> usize {
|
2024-04-13 19:15:43 -04:00
|
|
|
self.current_exercise_ind
|
2024-04-10 20:51:02 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
#[inline]
|
2024-04-13 19:15:43 -04:00
|
|
|
pub fn exercises(&self) -> &[Exercise] {
|
|
|
|
&self.exercises
|
2024-04-10 20:51:02 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
#[inline]
|
|
|
|
pub fn n_done(&self) -> u16 {
|
|
|
|
self.n_done
|
|
|
|
}
|
|
|
|
|
|
|
|
#[inline]
|
2024-04-13 19:15:43 -04:00
|
|
|
pub fn current_exercise(&self) -> &Exercise {
|
|
|
|
&self.exercises[self.current_exercise_ind]
|
2024-04-10 20:51:02 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
pub fn set_current_exercise_ind(&mut self, ind: usize) -> Result<()> {
|
|
|
|
if ind >= self.exercises.len() {
|
|
|
|
bail!(BAD_INDEX_ERR);
|
|
|
|
}
|
|
|
|
|
2024-04-13 19:15:43 -04:00
|
|
|
self.current_exercise_ind = ind;
|
2024-04-10 20:51:02 -04:00
|
|
|
|
2024-04-13 23:13:27 -04:00
|
|
|
self.write()
|
2024-04-10 20:51:02 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
pub fn set_current_exercise_by_name(&mut self, name: &str) -> Result<()> {
|
2024-04-13 19:15:43 -04:00
|
|
|
// O(N) is fine since this method is used only once until the program exits.
|
|
|
|
// Building a hashmap would have more overhead.
|
|
|
|
self.current_exercise_ind = self
|
2024-04-10 20:51:02 -04:00
|
|
|
.exercises
|
|
|
|
.iter()
|
2024-04-13 19:15:43 -04:00
|
|
|
.position(|exercise| exercise.name == name)
|
2024-04-10 20:51:02 -04:00
|
|
|
.with_context(|| format!("No exercise found for '{name}'!"))?;
|
|
|
|
|
2024-04-13 23:13:27 -04:00
|
|
|
self.write()
|
2024-04-10 20:51:02 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
pub fn set_pending(&mut self, ind: usize) -> Result<()> {
|
2024-04-13 19:15:43 -04:00
|
|
|
let exercise = self.exercises.get_mut(ind).context(BAD_INDEX_ERR)?;
|
|
|
|
|
|
|
|
if exercise.done {
|
|
|
|
exercise.done = false;
|
2024-04-10 20:51:02 -04:00
|
|
|
self.n_done -= 1;
|
2024-04-13 23:13:27 -04:00
|
|
|
self.write()?;
|
2024-04-10 20:51:02 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
Ok(())
|
|
|
|
}
|
|
|
|
|
2024-04-12 12:57:04 -04:00
|
|
|
fn next_pending_exercise_ind(&self) -> Option<usize> {
|
2024-04-13 19:15:43 -04:00
|
|
|
if self.current_exercise_ind == self.exercises.len() - 1 {
|
2024-04-10 20:51:02 -04:00
|
|
|
// The last exercise is done.
|
|
|
|
// Search for exercises not done from the start.
|
2024-04-13 19:15:43 -04:00
|
|
|
return self.exercises[..self.current_exercise_ind]
|
2024-04-10 20:51:02 -04:00
|
|
|
.iter()
|
2024-04-13 19:15:43 -04:00
|
|
|
.position(|exercise| !exercise.done);
|
2024-04-10 20:51:02 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
// The done exercise isn't the last one.
|
|
|
|
// Search for a pending exercise after the current one and then from the start.
|
2024-04-13 19:15:43 -04:00
|
|
|
match self.exercises[self.current_exercise_ind + 1..]
|
2024-04-10 20:51:02 -04:00
|
|
|
.iter()
|
2024-04-13 19:15:43 -04:00
|
|
|
.position(|exercise| !exercise.done)
|
2024-04-10 20:51:02 -04:00
|
|
|
{
|
2024-04-13 19:15:43 -04:00
|
|
|
Some(ind) => Some(self.current_exercise_ind + 1 + ind),
|
|
|
|
None => self.exercises[..self.current_exercise_ind]
|
2024-04-10 20:51:02 -04:00
|
|
|
.iter()
|
2024-04-13 19:15:43 -04:00
|
|
|
.position(|exercise| !exercise.done),
|
2024-04-10 20:51:02 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2024-04-12 12:57:04 -04:00
|
|
|
pub fn done_current_exercise(&mut self, writer: &mut StdoutLock) -> Result<ExercisesProgress> {
|
2024-04-13 19:15:43 -04:00
|
|
|
let exercise = &mut self.exercises[self.current_exercise_ind];
|
|
|
|
if !exercise.done {
|
|
|
|
exercise.done = true;
|
2024-04-10 20:51:02 -04:00
|
|
|
self.n_done += 1;
|
|
|
|
}
|
|
|
|
|
2024-04-12 12:57:04 -04:00
|
|
|
let Some(ind) = self.next_pending_exercise_ind() else {
|
|
|
|
writer.write_all(RERUNNING_ALL_EXERCISES_MSG)?;
|
|
|
|
|
|
|
|
for (exercise_ind, exercise) in self.exercises().iter().enumerate() {
|
|
|
|
writer.write_fmt(format_args!("Running {exercise} ... "))?;
|
|
|
|
writer.flush()?;
|
|
|
|
|
|
|
|
if !exercise.run()?.status.success() {
|
2024-04-12 13:30:29 -04:00
|
|
|
writer.write_fmt(format_args!("{}\n\n", "FAILED".red()))?;
|
|
|
|
|
2024-04-13 19:15:43 -04:00
|
|
|
self.current_exercise_ind = exercise_ind;
|
2024-04-12 12:57:04 -04:00
|
|
|
|
|
|
|
// No check if the exercise is done before setting it to pending
|
|
|
|
// because no pending exercise was found.
|
2024-04-13 19:15:43 -04:00
|
|
|
self.exercises[exercise_ind].done = false;
|
2024-04-12 12:57:04 -04:00
|
|
|
self.n_done -= 1;
|
|
|
|
|
2024-04-13 23:13:27 -04:00
|
|
|
self.write()?;
|
2024-04-12 12:57:04 -04:00
|
|
|
|
|
|
|
return Ok(ExercisesProgress::Pending);
|
|
|
|
}
|
|
|
|
|
|
|
|
writer.write_fmt(format_args!("{}\n", "ok".green()))?;
|
|
|
|
}
|
|
|
|
|
|
|
|
writer.execute(Clear(ClearType::All))?;
|
|
|
|
writer.write_all(FENISH_LINE.as_bytes())?;
|
2024-04-12 14:06:56 -04:00
|
|
|
writer.write_all(self.final_message.as_bytes())?;
|
|
|
|
writer.write_all(b"\n")?;
|
2024-04-12 12:57:04 -04:00
|
|
|
|
2024-04-10 20:51:02 -04:00
|
|
|
return Ok(ExercisesProgress::AllDone);
|
|
|
|
};
|
|
|
|
|
|
|
|
self.set_current_exercise_ind(ind)?;
|
|
|
|
|
|
|
|
Ok(ExercisesProgress::Pending)
|
|
|
|
}
|
2024-04-13 23:13:27 -04:00
|
|
|
|
|
|
|
// Write the state file.
|
|
|
|
// The file's format is very simple:
|
|
|
|
// - The first line is the name of the current exercise.
|
|
|
|
// - The second line is an empty line.
|
|
|
|
// - All remaining lines are the names of done exercises.
|
|
|
|
fn write(&mut self) -> Result<()> {
|
|
|
|
self.file_buf.clear();
|
|
|
|
|
|
|
|
self.file_buf
|
|
|
|
.extend_from_slice(self.current_exercise().name.as_bytes());
|
|
|
|
self.file_buf.extend_from_slice(b"\n\n");
|
|
|
|
|
|
|
|
for exercise in &self.exercises {
|
|
|
|
if exercise.done {
|
|
|
|
self.file_buf.extend_from_slice(exercise.name.as_bytes());
|
2024-04-14 08:53:32 -04:00
|
|
|
self.file_buf.push(b'\n');
|
2024-04-13 23:13:27 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fs::write(STATE_FILE_NAME, &self.file_buf)
|
|
|
|
.with_context(|| format!("Failed to write the state file {STATE_FILE_NAME}"))?;
|
|
|
|
|
|
|
|
Ok(())
|
|
|
|
}
|
2024-04-10 20:51:02 -04:00
|
|
|
}
|
2024-04-12 12:57:04 -04:00
|
|
|
|
|
|
|
const RERUNNING_ALL_EXERCISES_MSG: &[u8] = b"
|
|
|
|
All exercises seem to be done.
|
|
|
|
Recompiling and running all exercises to make sure that all of them are actually done.
|
|
|
|
|
|
|
|
";
|