LRU stands for Least Recently Used. It is a caching algorithm that determines which items to remove from a cache when the cache limit is reached. The idea behind LRU is that items that have not been used recently are less likely to be needed in the future, so they can be safely removed from the cache to make room for new items. When an item is accessed, it becomes the most recently used item and moves to the front of the list, pushing other items towards the back. The item at the back of the list is considered least recently used and is therefore eligible for removal if necessary.
![make[5]: Entering directory `/home/onvif/gsoap_2.8.116/gsoap-2.8/gsoap/wsdl'
g++ -I/usr/lib64/include -DWITH_OPENSSL -DWITH_GZIP -DWSDL2H_IMPORT_PATH=](https://linuxcpp.0voice.com/zb_users/upload/2023/05/202305162233565655357.png)
![#include<my_head.h>
int main(int argc, char const *argv[])
{
int fd = 0;
if(-1 == (fd =open(](https://linuxcpp.0voice.com/zb_users/upload/2023/05/202305162214438435275.png)
