From b7bf00f7318a16c3ca6b3bda5ce2fa226a30a533 Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Fri, 4 Apr 2025 13:04:50 -0400 Subject: [PATCH] correct the angle brackets --- lectures/23_priority_queues/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/lectures/23_priority_queues/README.md b/lectures/23_priority_queues/README.md index d2097bf..5d19ce4 100644 --- a/lectures/23_priority_queues/README.md +++ b/lectures/23_priority_queues/README.md @@ -195,7 +195,7 @@ int main() { ## 23.6 Overloading operator() - When using std::priority_queue to store class objects, oftentimes, you need to define a class and overload its function call operator. -- This is because std::priority_queue by default uses std::less < T >, which means it tries to use operator< on the objects. However, if your class does not define operator< or you need a custom sorting order, you must explicitly provide a comparator. +- This is because std::priority_queue by default uses std::less <T>, which means it tries to use operator< on the objects. However, if your class does not define operator< or you need a custom sorting order, you must explicitly provide a comparator. ### 23.6.1 Why Not Overload operator< Directly?