TAILIEUCHUNG - HandBooks Professional Java-C-Scrip-SQL part 98

Tham khảo tài liệu 'handbooks professional java-c-scrip-sql part 98', công nghệ thông tin, kỹ thuật lập trình phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả | std cout parking_lot_guard leave car_id n If there are no registered cars or if the car isn t registered sound the alarm std pair iterator iterator p std equal_range cars_- begin cars_- end car_id if cars_- end car_id alarm_ car_id else cars_- erase That s it Of course as we haven t connected any slots to any signals yet there s a bit more to do. Still these classes are remarkably simple for what they re about to do. To make the shared_ptrs for the alarm and the car identifiers behave correctly we implement the default constructor where the signal and the vector are properly allocated. The implicitly created copy constructor the destructor and the assignment operator will all do the right thing thanks to these fine smart pointers . The function connect_to_alarm forwards to call to the contained signal s connect. The function call operator tests the Boolean argument to see whether the car is entering or leaving and makes a call to the corresponding function enter leave. In the function enter the first thing that s done is to search through the vector for the identifier of the car. Finding it would mean that something has gone wrong perhaps someone has stolen a license plate. The search is performed using the algorithm binary_search 3 which expects a sorted sequence we make sure that it always is sorted . If we do find the identifier we immediately sound the alarm which involves invoking the signal. alarm_ car_id We need to dereference alarm_ first because alarm_ is a boost shared_ptr and when invoking it we pass to it the argument that is the car identifier. If we don t find the identifier all is well and we insert the car identifier into cars_ at the correct place. Remember that we need the sequence to be sorted at all times and the best way to ensure that is by inserting elements in a location such that the ordering isn t compromised. Using the algorithm lower_bound gives us this location in the sequence this algorithm also expects a sorted

• Kỹ thuật lập trình
• Thủ thuật lập trình
• hướng dẫn lập trình
• tài liệu lập trình
• học lập trình
• Java C Scrip SQL
• kỹ thuật lập trình
• kỹ năng lập trình
• bí quyết lập trình
• phương pháp lập trình
• tư liệu lập trình
• kĩ thuật lập trình
• kĩ năng lập trình
• AutoIT