16275012398

Committed 14 Jul 2025 06:38PM UTC coverage: 81.568% (+0.4%) from 81.147%

Build # 16275012398

Build Type

Pull #3852

github

Committed by

web-flow

Commit Message

Merge e4d6d19f4 into 65447ae8a

Pull Request Pull Request #3852: feat: call optimize in compressor

Run Details

5 of 6 new or added lines in 1 file covered. (83.33%)

370 existing lines in 35 files now uncovered.

46288 of 56748 relevant lines covered (81.57%)

157514.89 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

85.83

/vortex-expr/src/exprs/list_contains.rs

// SPDX-License-Identifier: Apache-2.0
// SPDX-FileCopyrightText: Copyright the Vortex contributors

use std::fmt::{Debug, Display, Formatter};
use std::hash::Hash;

use vortex_array::compute::list_contains as compute_list_contains;
use vortex_array::{ArrayRef, DeserializeMetadata, EmptyMetadata};
use vortex_dtype::DType;
use vortex_error::{VortexResult, vortex_bail};

use crate::{
    AnalysisExpr, ExprEncodingRef, ExprId, ExprRef, IntoExpr, LiteralVTable, Scope, StatsCatalog,
    VTable, and, gt, lit, lt, or, vtable,
};

vtable!(ListContains);

#[allow(clippy::derived_hash_with_manual_eq)]
#[derive(Debug, Clone, Hash)]
pub struct ListContainsExpr {
    list: ExprRef,
    value: ExprRef,
}

impl PartialEq for ListContainsExpr {
    fn eq(&self, other: &Self) -> bool {
        self.list.eq(&other.list) && self.value.eq(&other.value)
    }
}

pub struct ListContainsExprEncoding;

impl VTable for ListContainsVTable {
    type Expr = ListContainsExpr;
    type Encoding = ListContainsExprEncoding;
    type Metadata = EmptyMetadata;

    fn id(_encoding: &Self::Encoding) -> ExprId {
        ExprId::new_ref("list_contains")
    }

    fn encoding(_expr: &Self::Expr) -> ExprEncodingRef {
        ExprEncodingRef::new_ref(ListContainsExprEncoding.as_ref())
    }

    fn metadata(_expr: &Self::Expr) -> Option<Self::Metadata> {
        Some(EmptyMetadata)
    }

    fn children(expr: &Self::Expr) -> Vec<&ExprRef> {
        vec![&expr.list, &expr.value]
    }

    fn with_children(_expr: &Self::Expr, children: Vec<ExprRef>) -> VortexResult<Self::Expr> {
        Ok(ListContainsExpr::new(
            children[0].clone(),
            children[1].clone(),
        ))
    }

    fn build(
        _encoding: &Self::Encoding,
        _metadata: &<Self::Metadata as DeserializeMetadata>::Output,
        children: Vec<ExprRef>,
    ) -> VortexResult<Self::Expr> {
        if children.len() != 2 {
            vortex_bail!(
                "ListContains expression must have exactly 2 children, got {}",
                children.len()
            );
        }
        Ok(ListContainsExpr::new(
            children[0].clone(),
            children[1].clone(),
        ))
    }

    fn evaluate(expr: &Self::Expr, scope: &Scope) -> VortexResult<ArrayRef> {
        compute_list_contains(
            expr.list.evaluate(scope)?.as_ref(),
            expr.value.evaluate(scope)?.as_ref(),
        )
    }

    fn return_dtype(expr: &Self::Expr, scope: &DType) -> VortexResult<DType> {
        Ok(DType::Bool(
            expr.list.return_dtype(scope)?.nullability()
                | expr.value.return_dtype(scope)?.nullability(),
        ))
    }
}

impl ListContainsExpr {
    pub fn new(list: ExprRef, value: ExprRef) -> Self {
        Self { list, value }
    }

    pub fn new_expr(list: ExprRef, value: ExprRef) -> ExprRef {
        Self::new(list, value).into_expr()
    }

    pub fn value(&self) -> &ExprRef {
        &self.value
    }
}

pub fn list_contains(list: ExprRef, value: ExprRef) -> ExprRef {
    ListContainsExpr::new(list, value).into_expr()
}

impl Display for ListContainsExpr {
    fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {
        write!(f, "contains({}, {})", &self.list, &self.value)
    }
}

impl AnalysisExpr for ListContainsExpr {
    // falsification(contains([1,2,5], x)) =>
    //   falsification(x != 1) and falsification(x != 2) and falsification(x != 5)

    fn stat_falsification(&self, catalog: &mut dyn StatsCatalog) -> Option<ExprRef> {
        let min = self.list.min(catalog)?;
        let max = self.list.max(catalog)?;
        // If the list is constant when we can compare each element to the value
        if min == max {
            let list_ = min
                .as_opt::<LiteralVTable>()
                .and_then(|l| l.value().as_list_opt())
                .and_then(|l| l.elements())?;
            if list_.is_empty() {
                // contains([], x) is always false.
                return Some(lit(true));
            }
            let value_max = self.value.max(catalog)?;
            let value_min = self.value.min(catalog)?;

            return list_
                .iter()
                .map(move |v| {
                    or(
                        lt(value_max.clone(), lit(v.clone())),
                        gt(value_min.clone(), lit(v.clone())),
                    )
                })
                .reduce(and);
        }

        None
    }
}

#[cfg(test)]
mod tests {
    use vortex_array::arrays::{BoolArray, BooleanBuffer, ListArray, PrimitiveArray};
    use vortex_array::stats::Stat;
    use vortex_array::validity::Validity;
    use vortex_array::{Array, ArrayRef, IntoArray};
    use vortex_dtype::PType::I32;
    use vortex_dtype::{DType, Field, FieldPath, FieldPathSet, Nullability, StructFields};
    use vortex_scalar::Scalar;
    use vortex_utils::aliases::hash_map::HashMap;

    use crate::list_contains::list_contains;
    use crate::pruning::checked_pruning_expr;
    use crate::{Arc, HashSet, Scope, and, get_item, get_item_scope, gt, lit, lt, or, root};

    fn test_array() -> ArrayRef {
        ListArray::try_new(
            PrimitiveArray::from_iter(vec![1, 1, 2, 2, 2, 2, 2, 3, 3, 3]).into_array(),
            PrimitiveArray::from_iter(vec![0, 5, 10]).into_array(),
            Validity::AllValid,
        )
        .unwrap()
        .into_array()
    }

    #[test]
    pub fn test_one() {
        let arr = test_array();

        let expr = list_contains(root(), lit(1));
        let item = expr.evaluate(&Scope::new(arr)).unwrap();

        assert_eq!(
            item.scalar_at(0).unwrap(),
            Scalar::bool(true, Nullability::Nullable)
        );
        assert_eq!(
            item.scalar_at(1).unwrap(),
            Scalar::bool(false, Nullability::Nullable)
        );
    }

    #[test]
    pub fn test_all() {
        let arr = test_array();

        let expr = list_contains(root(), lit(2));
        let item = expr.evaluate(&Scope::new(arr)).unwrap();

        assert_eq!(
            item.scalar_at(0).unwrap(),
            Scalar::bool(true, Nullability::Nullable)
        );
        assert_eq!(
            item.scalar_at(1).unwrap(),
            Scalar::bool(true, Nullability::Nullable)
        );
    }

    #[test]
    pub fn test_none() {
        let arr = test_array();

        let expr = list_contains(root(), lit(4));
        let item = expr.evaluate(&Scope::new(arr)).unwrap();

        assert_eq!(
            item.scalar_at(0).unwrap(),
            Scalar::bool(false, Nullability::Nullable)
        );
        assert_eq!(
            item.scalar_at(1).unwrap(),
            Scalar::bool(false, Nullability::Nullable)
        );
    }

    #[test]
    pub fn test_empty() {
        let arr = ListArray::try_new(
            PrimitiveArray::from_iter(vec![1, 1, 2, 2, 2]).into_array(),
            PrimitiveArray::from_iter(vec![0, 5, 5]).into_array(),
            Validity::AllValid,
        )
        .unwrap()
        .into_array();

        let expr = list_contains(root(), lit(2));
        let item = expr.evaluate(&Scope::new(arr)).unwrap();

        assert_eq!(
            item.scalar_at(0).unwrap(),
            Scalar::bool(true, Nullability::Nullable)
        );
        assert_eq!(
            item.scalar_at(1).unwrap(),
            Scalar::bool(false, Nullability::Nullable)
        );
    }

    #[test]
    pub fn test_nullable() {
        let arr = ListArray::try_new(
            PrimitiveArray::from_iter(vec![1, 1, 2, 2, 2]).into_array(),
            PrimitiveArray::from_iter(vec![0, 5, 5]).into_array(),
            Validity::Array(BoolArray::from(BooleanBuffer::from(vec![true, false])).into_array()),
        )
        .unwrap()
        .into_array();

        let expr = list_contains(root(), lit(2));
        let item = expr.evaluate(&Scope::new(arr)).unwrap();

        assert_eq!(
            item.scalar_at(0).unwrap(),
            Scalar::bool(true, Nullability::Nullable)
        );
        assert!(!item.is_valid(1).unwrap());
    }

    #[test]
    pub fn test_return_type() {
        let scope = DType::Struct(
            StructFields::new(
                ["array"].into(),
                vec![DType::List(
                    Arc::new(DType::Primitive(I32, Nullability::NonNullable)),
                    Nullability::Nullable,
                )],
            ),
            Nullability::NonNullable,
        );

        let expr = list_contains(get_item("array", root()), lit(2));

        // Expect nullable, although scope is non-nullable
        assert_eq!(
            expr.return_dtype(&scope).unwrap(),
            DType::Bool(Nullability::Nullable)
        );
    }

    #[test]
    pub fn list_falsification() {
        let expr = list_contains(
            lit(Scalar::list(
                Arc::new(DType::Primitive(I32, Nullability::NonNullable)),
                vec![1.into(), 2.into(), 3.into()],
                Nullability::NonNullable,
            )),
            get_item_scope("a"),
        );

        let (expr, st) = checked_pruning_expr(
            &expr,
            &FieldPathSet::from_iter([
                FieldPath::from_iter([Field::Name("a".into()), Field::Name("max".into())]),
                FieldPath::from_iter([Field::Name("a".into()), Field::Name("min".into())]),
            ]),
        )
        .unwrap();

        assert_eq!(
            &expr,
            &and(
                and(
                    or(
                        lt(get_item_scope("a_max"), lit(1i32)),
                        gt(get_item_scope("a_min"), lit(1i32)),
                    ),
                    or(
                        lt(get_item_scope("a_max"), lit(2i32)),
                        gt(get_item_scope("a_min"), lit(2i32)),
                    )
                ),
                or(
                    lt(get_item_scope("a_max"), lit(3i32)),
                    gt(get_item_scope("a_min"), lit(3i32)),
                )
            )
        );

        assert_eq!(
            st.map(),
            &HashMap::from_iter([(
                FieldPath::from_name("a"),
                HashSet::from([Stat::Min, Stat::Max])
            )])
        );
    }
}

1	// SPDX-License-Identifier: Apache-2.0
2	// SPDX-FileCopyrightText: Copyright the Vortex contributors
3
4	use std::fmt::{Debug, Display, Formatter};
5	use std::hash::Hash;
6
7	use vortex_array::compute::list_contains as compute_list_contains;
8	use vortex_array::{ArrayRef, DeserializeMetadata, EmptyMetadata};
9	use vortex_dtype::DType;
10	use vortex_error::{VortexResult, vortex_bail};
11
12	use crate::{
13	AnalysisExpr, ExprEncodingRef, ExprId, ExprRef, IntoExpr, LiteralVTable, Scope, StatsCatalog,
14	VTable, and, gt, lit, lt, or, vtable,
15	};
16
17	vtable!(ListContains);
18
19	#[allow(clippy::derived_hash_with_manual_eq)]
20	#[derive(Debug, Clone, Hash)]
21	pub struct ListContainsExpr {
22	list: ExprRef,
23	value: ExprRef,
24	}
25
26	impl PartialEq for ListContainsExpr {
27	fn eq(&self, other: &Self) -> bool {	226✔
28	self.list.eq(&other.list) && self.value.eq(&other.value)	226✔
29	}	226✔
30	}
31
32	pub struct ListContainsExprEncoding;
33
34	impl VTable for ListContainsVTable {
35	type Expr = ListContainsExpr;
36	type Encoding = ListContainsExprEncoding;
37	type Metadata = EmptyMetadata;
38
39	fn id(_encoding: &Self::Encoding) -> ExprId {	123✔
40	ExprId::new_ref("list_contains")	123✔
41	}	123✔
42
43	fn encoding(_expr: &Self::Expr) -> ExprEncodingRef {	×
44	ExprEncodingRef::new_ref(ListContainsExprEncoding.as_ref())	×
45	}	×
46
47	fn metadata(_expr: &Self::Expr) -> Option<Self::Metadata> {	×
48	Some(EmptyMetadata)	×
49	}	×
50
51	fn children(expr: &Self::Expr) -> Vec<&ExprRef> {	1,638✔
52	vec![&expr.list, &expr.value]	1,638✔
53	}	1,638✔
54
55	fn with_children(_expr: &Self::Expr, children: Vec<ExprRef>) -> VortexResult<Self::Expr> {	78✔
56	Ok(ListContainsExpr::new(	78✔
57	children[0].clone(),	78✔
58	children[1].clone(),	78✔
59	))	78✔
60	}	78✔
61
62	fn build(	×
63	_encoding: &Self::Encoding,	×
64	_metadata: &<Self::Metadata as DeserializeMetadata>::Output,	×
65	children: Vec<ExprRef>,	×
66	) -> VortexResult<Self::Expr> {	×
67	if children.len() != 2 {	×
68	vortex_bail!(	×
69	"ListContains expression must have exactly 2 children, got {}",	×
70	children.len()	×
71	);	×
72	}	×
73	Ok(ListContainsExpr::new(	×
74	children[0].clone(),	×
75	children[1].clone(),	×
76	))	×
77	}	×
78
79	fn evaluate(expr: &Self::Expr, scope: &Scope) -> VortexResult<ArrayRef> {	31✔
80	compute_list_contains(	31✔
81	expr.list.evaluate(scope)?.as_ref(),	31✔
82	expr.value.evaluate(scope)?.as_ref(),	31✔
83	)
84	}	31✔
85
86	fn return_dtype(expr: &Self::Expr, scope: &DType) -> VortexResult<DType> {	84✔
87	Ok(DType::Bool(	84✔
88	expr.list.return_dtype(scope)?.nullability()	84✔
89	\| expr.value.return_dtype(scope)?.nullability(),	84✔
90	))
91	}	84✔
92	}
93
94	impl ListContainsExpr {
95	pub fn new(list: ExprRef, value: ExprRef) -> Self {	111✔
96	Self { list, value }	111✔
97	}	111✔
98
99	pub fn new_expr(list: ExprRef, value: ExprRef) -> ExprRef {	×
100	Self::new(list, value).into_expr()	×
101	}	×
102
UNCOV 103	pub fn value(&self) -> &ExprRef {	×
UNCOV 104	&self.value	×
UNCOV 105	}	×
106	}
107
108	pub fn list_contains(list: ExprRef, value: ExprRef) -> ExprRef {	33✔
109	ListContainsExpr::new(list, value).into_expr()	33✔
110	}	33✔
111
112	impl Display for ListContainsExpr {
UNCOV 113	fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {	×
UNCOV 114	write!(f, "contains({}, {})", &self.list, &self.value)	×
UNCOV 115	}	×
116	}
117
118	impl AnalysisExpr for ListContainsExpr {
119	// falsification(contains([1,2,5], x)) =>
120	// falsification(x != 1) and falsification(x != 2) and falsification(x != 5)
121
122	fn stat_falsification(&self, catalog: &mut dyn StatsCatalog) -> Option<ExprRef> {	27✔
123	let min = self.list.min(catalog)?;	27✔
124	let max = self.list.max(catalog)?;	27✔
125	// If the list is constant when we can compare each element to the value
126	if min == max {	27✔
127	let list_ = min	27✔
128	.as_opt::<LiteralVTable>()	27✔
129	.and_then(\|l\| l.value().as_list_opt())	27✔
130	.and_then(\|l\| l.elements())?;	27✔
131	if list_.is_empty() {	27✔
132	// contains([], x) is always false.
UNCOV 133	return Some(lit(true));	×
134	}	27✔
135	let value_max = self.value.max(catalog)?;	27✔
136	let value_min = self.value.min(catalog)?;	27✔
137
138	return list_	27✔
139	.iter()	27✔
140	.map(move \|v\| {	87✔
141	or(	87✔
142	lt(value_max.clone(), lit(v.clone())),	87✔
143	gt(value_min.clone(), lit(v.clone())),	87✔
144	)	87✔
145	})	87✔
146	.reduce(and);	27✔
UNCOV 147	}	×
UNCOV 148		×
UNCOV 149	None	×
150	}	27✔
151	}
152
153	#[cfg(test)]
154	mod tests {
155	use vortex_array::arrays::{BoolArray, BooleanBuffer, ListArray, PrimitiveArray};
156	use vortex_array::stats::Stat;
157	use vortex_array::validity::Validity;
158	use vortex_array::{Array, ArrayRef, IntoArray};
159	use vortex_dtype::PType::I32;
160	use vortex_dtype::{DType, Field, FieldPath, FieldPathSet, Nullability, StructFields};
161	use vortex_scalar::Scalar;
162	use vortex_utils::aliases::hash_map::HashMap;
163
164	use crate::list_contains::list_contains;
165	use crate::pruning::checked_pruning_expr;
166	use crate::{Arc, HashSet, Scope, and, get_item, get_item_scope, gt, lit, lt, or, root};
167
168	fn test_array() -> ArrayRef {	3✔
169	ListArray::try_new(	3✔
170	PrimitiveArray::from_iter(vec![1, 1, 2, 2, 2, 2, 2, 3, 3, 3]).into_array(),	3✔
171	PrimitiveArray::from_iter(vec![0, 5, 10]).into_array(),	3✔
172	Validity::AllValid,	3✔
173	)	3✔
174	.unwrap()	3✔
175	.into_array()	3✔
176	}	3✔
177
178	#[test]
179	pub fn test_one() {	1✔
180	let arr = test_array();	1✔
181		1✔
182	let expr = list_contains(root(), lit(1));	1✔
183	let item = expr.evaluate(&Scope::new(arr)).unwrap();	1✔
184		1✔
185	assert_eq!(	1✔
186	item.scalar_at(0).unwrap(),	1✔
187	Scalar::bool(true, Nullability::Nullable)	1✔
188	);	1✔
189	assert_eq!(	1✔
190	item.scalar_at(1).unwrap(),	1✔
191	Scalar::bool(false, Nullability::Nullable)	1✔
192	);	1✔
193	}	1✔
194
195	#[test]
196	pub fn test_all() {	1✔
197	let arr = test_array();	1✔
198		1✔
199	let expr = list_contains(root(), lit(2));	1✔
200	let item = expr.evaluate(&Scope::new(arr)).unwrap();	1✔
201		1✔
202	assert_eq!(	1✔
203	item.scalar_at(0).unwrap(),	1✔
204	Scalar::bool(true, Nullability::Nullable)	1✔
205	);	1✔
206	assert_eq!(	1✔
207	item.scalar_at(1).unwrap(),	1✔
208	Scalar::bool(true, Nullability::Nullable)	1✔
209	);	1✔
210	}	1✔
211
212	#[test]
213	pub fn test_none() {	1✔
214	let arr = test_array();	1✔
215		1✔
216	let expr = list_contains(root(), lit(4));	1✔
217	let item = expr.evaluate(&Scope::new(arr)).unwrap();	1✔
218		1✔
219	assert_eq!(	1✔
220	item.scalar_at(0).unwrap(),	1✔
221	Scalar::bool(false, Nullability::Nullable)	1✔
222	);	1✔
223	assert_eq!(	1✔
224	item.scalar_at(1).unwrap(),	1✔
225	Scalar::bool(false, Nullability::Nullable)	1✔
226	);	1✔
227	}	1✔
228
229	#[test]
230	pub fn test_empty() {	1✔
231	let arr = ListArray::try_new(	1✔
232	PrimitiveArray::from_iter(vec![1, 1, 2, 2, 2]).into_array(),	1✔
233	PrimitiveArray::from_iter(vec![0, 5, 5]).into_array(),	1✔
234	Validity::AllValid,	1✔
235	)	1✔
236	.unwrap()	1✔
237	.into_array();	1✔
238		1✔
239	let expr = list_contains(root(), lit(2));	1✔
240	let item = expr.evaluate(&Scope::new(arr)).unwrap();	1✔
241		1✔
242	assert_eq!(	1✔
243	item.scalar_at(0).unwrap(),	1✔
244	Scalar::bool(true, Nullability::Nullable)	1✔
245	);	1✔
246	assert_eq!(	1✔
247	item.scalar_at(1).unwrap(),	1✔
248	Scalar::bool(false, Nullability::Nullable)	1✔
249	);	1✔
250	}	1✔
251
252	#[test]
253	pub fn test_nullable() {	1✔
254	let arr = ListArray::try_new(	1✔
255	PrimitiveArray::from_iter(vec![1, 1, 2, 2, 2]).into_array(),	1✔
256	PrimitiveArray::from_iter(vec![0, 5, 5]).into_array(),	1✔
257	Validity::Array(BoolArray::from(BooleanBuffer::from(vec![true, false])).into_array()),	1✔
258	)	1✔
259	.unwrap()	1✔
260	.into_array();	1✔
261		1✔
262	let expr = list_contains(root(), lit(2));	1✔
263	let item = expr.evaluate(&Scope::new(arr)).unwrap();	1✔
264		1✔
265	assert_eq!(	1✔
266	item.scalar_at(0).unwrap(),	1✔
267	Scalar::bool(true, Nullability::Nullable)	1✔
268	);	1✔
269	assert!(!item.is_valid(1).unwrap());	1✔
270	}	1✔
271
272	#[test]
273	pub fn test_return_type() {	1✔
274	let scope = DType::Struct(	1✔
275	StructFields::new(	1✔
276	["array"].into(),	1✔
277	vec![DType::List(	1✔
278	Arc::new(DType::Primitive(I32, Nullability::NonNullable)),	1✔
279	Nullability::Nullable,	1✔
280	)],	1✔
281	),	1✔
282	Nullability::NonNullable,	1✔
283	);	1✔
284		1✔
285	let expr = list_contains(get_item("array", root()), lit(2));	1✔
286		1✔
287	// Expect nullable, although scope is non-nullable	1✔
288	assert_eq!(	1✔
289	expr.return_dtype(&scope).unwrap(),	1✔
290	DType::Bool(Nullability::Nullable)	1✔
291	);	1✔
292	}	1✔
293
294	#[test]
295	pub fn list_falsification() {	1✔
296	let expr = list_contains(	1✔
297	lit(Scalar::list(	1✔
298	Arc::new(DType::Primitive(I32, Nullability::NonNullable)),	1✔
299	vec![1.into(), 2.into(), 3.into()],	1✔
300	Nullability::NonNullable,	1✔
301	)),	1✔
302	get_item_scope("a"),	1✔
303	);	1✔
304		1✔
305	let (expr, st) = checked_pruning_expr(	1✔
306	&expr,	1✔
307	&FieldPathSet::from_iter([	1✔
308	FieldPath::from_iter([Field::Name("a".into()), Field::Name("max".into())]),	1✔
309	FieldPath::from_iter([Field::Name("a".into()), Field::Name("min".into())]),	1✔
310	]),	1✔
311	)	1✔
312	.unwrap();	1✔
313		1✔
314	assert_eq!(	1✔
315	&expr,	1✔
316	&and(	1✔
317	and(	1✔
318	or(	1✔
319	lt(get_item_scope("a_max"), lit(1i32)),	1✔
320	gt(get_item_scope("a_min"), lit(1i32)),	1✔
321	),	1✔
322	or(	1✔
323	lt(get_item_scope("a_max"), lit(2i32)),	1✔
324	gt(get_item_scope("a_min"), lit(2i32)),	1✔
325	)	1✔
326	),	1✔
327	or(	1✔
328	lt(get_item_scope("a_max"), lit(3i32)),	1✔
329	gt(get_item_scope("a_min"), lit(3i32)),	1✔
330	)	1✔
331	)	1✔
332	);	1✔
333
334	assert_eq!(	1✔
335	st.map(),	1✔
336	&HashMap::from_iter([(	1✔
337	FieldPath::from_name("a"),	1✔
338	HashSet::from([Stat::Min, Stat::Max])	1✔
339	)])	1✔
340	);	1✔
341	}	1✔
342	}

vortex-data / vortex / 16275012398

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous