1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68
// This file is part of the shakmaty library. // Copyright (C) 2017-2018 Niklas Fiekas <niklas.fiekas@backscattering.de> // // This program is free software: you can redistribute it and/or modify // it under the terms of the GNU General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // This program is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // // You should have received a copy of the GNU General Public License // along with this program. If not, see <http://www.gnu.org/licenses/>. use types::Move; use arrayvec::{Array, ArrayVec}; /// A container for moves that can be stored inline on the stack. /// /// The capacity is limited, but there is enough space to contain the legal /// moves of any chess position, including any of the supported chess variants. /// /// # Example /// /// ``` /// use shakmaty::{Chess, Position, MoveList}; /// /// let pos = Chess::default(); /// let mut legals = MoveList::new(); /// pos.legal_moves(&mut legals); /// assert_eq!(legals.len(), 20); /// ``` pub type MoveList = ArrayVec<[Move; 512]>; pub trait ArrayVecExt { type Item; /// Retains only the elements specified by the predicate. /// /// In other words, remove all elements `e` such that `f(&e)` returns /// `false`. /// /// Like `ArrayVec::retain()`, but does not preserve order. fn swap_retain<F>(&mut self, f: F) where F: FnMut(&mut Self::Item) -> bool; } impl<A: Array> ArrayVecExt for ArrayVec<A> { type Item = A::Item; fn swap_retain<F>(&mut self, mut f: F) where F: FnMut(&mut Self::Item) -> bool, { let mut i = 0; while i < self.len() { if f(&mut self[i]) { i += 1; } else { self.swap_remove(i); } } } }