基於在 glib 庫中 hash 函數上搭建的 LRU 緩衝框架

https://buzzorange.com/techorange/2015/12/17/programmers-dilemma/
1.定義LRU緩衝的資料結構
LRU緩衝 = (數目，大小)；
ex: 
largeLRU  = new LRU(50,  512*1024/*512K*/)
smallLRU = new LRU(100, 4*1024   /*4K*/)

留言

張貼留言

這個網誌中的熱門文章

https://leetcode.com/contest/leetcode-weekly-contest-48/problems/maximum-swap/

Way 1:  #include <iostream> #include <list> using namespace std; class Solution { public:     int maximumSwap(int num) {         list<int> *buckets = new list<int>[10];         int digit = 0;         int temp = num;         while (temp != 0) {           buckets[temp % 10].push_front(digit++);           temp /= 10;         }         for (int i = 9; i >= 0; i--) {             while (!buckets[i].empty()) {                 if (buckets[i].front() != (--digit)) {                     int target = buckets[i].back();                     int plus   = numberFromDigit(num, target);     ...
閱讀完整內容

https://leetcode.com/contest/leetcode-weekly-contest-49/problems/cut-off-trees-for-golf-event/

圖片
http://alrightchiu.github.io/SecondRound/all-pairs-shortest-pathfloyd-warshall-algorithm.html http://slideplayer.com/slide/4393766/14/images/28/Some+Algorithms+When+no+negative+edges.jpg https://stackoverflow.com/questions/26547816/understanding-time-complexity-calculation-for-dijkstra-algorithm void Solution::dijkstraSingleSource(vector<list<pair<int, int> > > &edge, int src) { set< pair<int, int> > active_vertices; active_vertices.insert(make_pair(0, src)); while (active_vertices.size() != 0) { int vertex = (active_vertices.begin())->second; active_vertices.erase(make_pair(shortestDist[src][vertex], vertex)); list<pair<int, int> >::iterator iter; for (iter = edge[vertex].begin(); iter != edge[vertex].end(); iter++) { int dist = iter->first; int edgeLength = iter->second; if ((shortestDist[src][vertex] + edgeLength) < shorte...
閱讀完整內容

shared pipe hlxSweExam

#include <cstdlib> #include <new> template <class T> struct Mallocator { typedef T value_type; Mallocator() = default; template <class U> constexpr Mallocator(const Mallocator<U>&) noexcept {} [[nodiscard]] T* allocate(std::size_t n) { if(n > std::size_t(-1) / sizeof(T)) throw std::bad_alloc(); if(auto p = static_cast<T*>(std::malloc(n*sizeof(T)))) return p; throw std::bad_alloc(); } void deallocate(T* p, std::size_t) noexcept { std::free(p); } }; template <class T, class U> bool operator==(const Mallocator<T>&, const Mallocator<U>&) { return true; } template <class T, class U> bool operator!=(const Mallocator<T>&, const Mallocator<U>&) { return false; } https://elloop.github.io/c++/2016-09-19/stl-apply-imp-95-simple-allocator http://www.cnblogs.com/suzhou/p/5381738.html http://www.justskins.com/forums/shm_open-vs-open-253314.html http://www.drdobbs.com/creati...
閱讀完整內容