for (key, code) in indices.into_iter() {
if code.len() > 1 {
index_locs.insert(key, IndexingCodePtr::Internal(prelude.len() + 1));
- prelude.push_back(IndexingLine::DynamicIndexedChoice(
- code.into_iter().collect(),
- ));
+ prelude.push_back(IndexingLine::DynamicIndexedChoice(code));
} else if let Some(i) = code.front() {
index_locs.insert(key, IndexingCodePtr::DynamicExternal(*i));
}
) -> IndexingCodePtr {
if lists.len() > 1 {
let lists = std::mem::take(lists);
- prelude.push_back(IndexingLine::DynamicIndexedChoice(
- lists.into_iter().collect(),
- ));
+ prelude.push_back(IndexingLine::DynamicIndexedChoice(lists));
IndexingCodePtr::Internal(1)
} else {
lists
str_loc,
)));
- prelude.into_iter().collect()
+ prelude.into()
}
}
-use std::collections::BTreeSet;
use std::env;
#[derive(Debug)]
impl MachineArgs {
pub fn new() -> Self {
- let args: BTreeSet<String> = env::args().collect();
Self {
- add_history: !args.contains("--no-add-history"),
+ add_history: env::args().all(|arg| arg != "--no-add-history"),
}
}
}
let list = match tail {
Term::Atom(atom) if atom == "[]" => match head {
- Term::Atom(ref a) if a.chars().collect::<Vec<_>>().len() == 1 => {
+ Term::Atom(ref a) if a.chars().count() == 1 => {
// Handle lists of char as strings
Term::String(a.to_string())
}
_ => Term::List(vec![head]),
},
Term::List(elems) if elems.is_empty() => match head {
- Term::Atom(ref a) if a.chars().collect::<Vec<_>>().len() == 1 => {
+ Term::Atom(ref a) if a.chars().count() == 1 => {
// Handle lists of char as strings
Term::String(a.to_string())
},
Term::List(elems)
},
Term::String(mut elems) => match head {
- Term::Atom(ref a) if a.chars().collect::<Vec<_>>().len() == 1 => {
+ Term::Atom(ref a) if a.chars().count() == 1 => {
// Handle lists of char as strings
elems.insert(0, a.chars().next().unwrap());
Term::String(elems)
let err = self.machine_st.permission_error(
Permission::Modify,
atom!("static_procedure"),
- functor_stub(atom!(":"), 2)
- .into_iter()
- .collect::<MachineStub>(),
+ functor_stub(atom!(":"), 2),
);
self.machine_st