使用named_mutex实现读写锁,实现进程之间读共享写独占

代码

  • 代码的名称是read_write_mutex.h
  • 这个代码可用,但是未优化,还存在冗余的代码
  • 如果涉及到进程挂掉了,造成进程堵塞,如何解决?还未涉及
//#ifndef BOOST_THREAD_PTHREAD_SHARED_MUTEX_HPP
#define BOOST_THREAD_PTHREAD_SHARED_MUTEX_HPP//  (C) Copyright 2006-8 Anthony Williams
//  (C) Copyright 2012 Vicente J. Botet Escriba
//
//  Distributed under the Boost Software License, Version 1.0. (See
//  accompanying file LICENSE_1_0.txt or copy at
//  http://www.boost.org/LICENSE_1_0.txt)#include <boost/assert.hpp>
#include <boost/static_assert.hpp>
#include <boost/thread/mutex.hpp>
#include <boost/thread/condition_variable.hpp>
#if defined BOOST_THREAD_PROVIDES_INTERRUPTIONS
#include <boost/thread/detail/thread_interruption.hpp>
#endif
#ifdef BOOST_THREAD_USES_CHRONO
#include <boost/chrono/system_clocks.hpp>
#include <boost/chrono/ceil.hpp>
#endif
#include <boost/thread/detail/delete.hpp>
#include <boost/assert.hpp>#include <boost/config/abi_prefix.hpp>
#include <boost/interprocess/sync/named_mutex.hpp>
#include <boost/interprocess/sync/named_condition.hpp>namespace bip = boost::interprocess;
namespace chy
{class shared_mutex{private:class state_data{public:state_data () :shared_count(0),exclusive(false),upgrade(false),exclusive_waiting_blocked(false){}void assert_free() const{BOOST_ASSERT( ! exclusive );BOOST_ASSERT( ! upgrade );BOOST_ASSERT( shared_count==0 );}void assert_locked() const{BOOST_ASSERT( exclusive );BOOST_ASSERT( shared_count==0 );BOOST_ASSERT( ! upgrade );}void assert_lock_shared () const{BOOST_ASSERT( ! exclusive );BOOST_ASSERT( shared_count>0 );//BOOST_ASSERT( (! upgrade) || (shared_count>1));// if upgraded there are at least 2 threads sharing the mutex,// except when unlock_upgrade_and_lock has decreased the number of readers but has not taken yet exclusive ownership.}void assert_lock_upgraded () const{BOOST_ASSERT( ! exclusive );BOOST_ASSERT(  upgrade );BOOST_ASSERT(  shared_count>0 );}void assert_lock_not_upgraded () const{BOOST_ASSERT(  ! upgrade );}bool can_lock () const{return ! (shared_count || exclusive);}void exclusive_blocked (bool blocked){exclusive_waiting_blocked = blocked;}void lock (){exclusive = true;}void unlock (){exclusive = false;exclusive_waiting_blocked = false;}bool can_lock_shared () const{return ! (exclusive || exclusive_waiting_blocked);}bool more_shared () const{return shared_count > 0 ;}unsigned get_shared_count () const{return shared_count ;}unsigned  lock_shared (){return ++shared_count;}void unlock_shared (){--shared_count;}bool unlock_shared_downgrades(){if (upgrade) {upgrade=false;exclusive=true;return true;} else {exclusive_waiting_blocked=false;return false;}}void lock_upgrade (){++shared_count;upgrade=true;}bool can_lock_upgrade () const{return ! (exclusive || exclusive_waiting_blocked || upgrade);}void unlock_upgrade (){upgrade=false;--shared_count;}//private:unsigned shared_count;bool exclusive;bool upgrade;bool exclusive_waiting_blocked;};state_data state;
//        boost::mutex state_change;bip::named_mutex state_change{bip::open_or_create,"mutex"};
//        boost::condition_variable shared_cond;bip::named_condition shared_cond{bip::open_or_create,"read"};
//        boost::condition_variable exclusive_cond;bip::named_condition exclusive_cond{bip::open_or_create,"write"};boost::condition_variable upgrade_cond;void release_waiters(){exclusive_cond.notify_one();shared_cond.notify_all();}public:BOOST_THREAD_NO_COPYABLE(shared_mutex)shared_mutex(){}~shared_mutex(){}void lock_shared(){
#if defined BOOST_THREAD_PROVIDES_INTERRUPTIONSboost::this_thread::disable_interruption do_not_disturb;
#endif
//            boost::unique_lock<boost::mutex> lk(state_change);
//            boost::unique_lock<bip::named_mutex>lk(state_change);boost::unique_lock<bip::named_mutex> lk(state_change);while(!state.can_lock_shared()){shared_cond.wait(lk);}state.lock_shared();}bool try_lock_shared(){
//            boost::unique_lock<boost::mutex> lk(state_change);boost::unique_lock<bip::named_mutex>lk(state_change);if(!state.can_lock_shared()){return false;}state.lock_shared();return true;}//#if defined BOOST_THREAD_USES_DATETIME
//        bool timed_lock_shared(boost::system_time const& timeout)
//        {
//#if defined BOOST_THREAD_PROVIDES_INTERRUPTIONS
//            boost::this_thread::disable_interruption do_not_disturb;
//#endifboost::unique_lock<boost::mutex> lk(state_change);
//            boost::unique_lock<bip::named_mutex>lk(state_change);
//
//            while(!state.can_lock_shared())
//            {
//                if(!shared_cond.timed_wait(lk,timeout))
//                {
//                    return false;
//                }
//            }
//            state.lock_shared();
//            return true;
//        }//        template<typename TimeDuration>
//        bool timed_lock_shared(TimeDuration const & relative_time)
//        {
//            return timed_lock_shared(boost::get_system_time()+relative_time);
//        }
//#endif
#ifdef BOOST_THREAD_USES_CHRONOtemplate <class Rep, class Period>bool try_lock_shared_for(const boost::chrono::duration<Rep, Period>& rel_time){return try_lock_shared_until(boost::chrono::steady_clock::now() + rel_time);}template <class Clock, class Duration>bool try_lock_shared_until(const boost::chrono::time_point<Clock, Duration>& abs_time){
#if defined BOOST_THREAD_PROVIDES_INTERRUPTIONSboost::this_thread::disable_interruption do_not_disturb;
#endif
//          boost::unique_lock<boost::mutex> lk(state_change);boost::unique_lock<bip::named_mutex>lk(state_change);while(!state.can_lock_shared())//while(state.exclusive || state.exclusive_waiting_blocked){
//              if(boost::cv_status::timeout==shared_cond.wait_until(lk,abs_time))
//              {
//                  return false;
//              }}state.lock_shared();return true;}
#endifvoid unlock_shared(){
//            boost::unique_lock<boost::mutex> lk(state_change);boost::unique_lock<bip::named_mutex>lk(state_change);state.assert_lock_shared();state.unlock_shared();if (! state.more_shared()){if (state.upgrade){// As there is a thread doing a unlock_upgrade_and_lock that is waiting for ! state.more_shared()// avoid other threads to lock, lock_upgrade or lock_shared, so only this thread is notified.state.upgrade=false;state.exclusive=true;//lk.unlock();upgrade_cond.notify_one();}else{state.exclusive_waiting_blocked=false;//lk.unlock();}release_waiters();}}void lock(){
#if defined BOOST_THREAD_PROVIDES_INTERRUPTIONSboost::this_thread::disable_interruption do_not_disturb;
#endif
//            boost::unique_lock<boost::mutex> lk(state_change);boost::unique_lock<bip::named_mutex>lk(state_change);while (state.shared_count || state.exclusive){state.exclusive_waiting_blocked=true;exclusive_cond.wait(lk);}state.exclusive=true;}#if defined BOOST_THREAD_USES_DATETIMEbool timed_lock(boost::system_time const& timeout){
#if defined BOOST_THREAD_PROVIDES_INTERRUPTIONSboost::this_thread::disable_interruption do_not_disturb;
#endif
//            boost::unique_lock<boost::mutex> lk(state_change);boost::unique_lock<bip::named_mutex>lk(state_change);while(state.shared_count || state.exclusive){state.exclusive_waiting_blocked=true;if(!exclusive_cond.timed_wait(lk,timeout)){if(state.shared_count || state.exclusive){state.exclusive_waiting_blocked=false;release_waiters();return false;}break;}}state.exclusive=true;return true;}template<typename TimeDuration>bool timed_lock(TimeDuration const & relative_time){return timed_lock(boost::get_system_time()+relative_time);}
#endif
#ifdef BOOST_THREAD_USES_CHRONOtemplate <class Rep, class Period>bool try_lock_for(const boost::chrono::duration<Rep, Period>& rel_time){return try_lock_until(boost::chrono::steady_clock::now() + rel_time);}template <class Clock, class Duration>bool try_lock_until(const boost::chrono::time_point<Clock, Duration>& abs_time){
#if defined BOOST_THREAD_PROVIDES_INTERRUPTIONSboost::this_thread::disable_interruption do_not_disturb;
#endif
//          boost::unique_lock<boost::mutex> lk(state_change);boost::unique_lock<bip::named_mutex>lk(state_change);while(state.shared_count || state.exclusive){state.exclusive_waiting_blocked=true;
//              if(boost::cv_status::timeout == exclusive_cond.wait_until(lk,abs_time))
//              {
//                  if(state.shared_count || state.exclusive)
//                  {
//                      state.exclusive_waiting_blocked=false;
//                      release_waiters();
//                      return false;
//                  }
//                  break;
//              }}state.exclusive=true;return true;}
#endifbool try_lock(){
//            boost::unique_lock<boost::mutex> lk(state_change);boost::unique_lock<bip::named_mutex>lk(state_change);if(state.shared_count || state.exclusive){return false;}else{state.exclusive=true;return true;}}void unlock(){
//            boost::unique_lock<boost::mutex> lk(state_change);boost::unique_lock<bip::named_mutex>lk(state_change);state.assert_locked();state.exclusive=false;state.exclusive_waiting_blocked=false;state.assert_free();release_waiters();}void lock_upgrade(){
#if defined BOOST_THREAD_PROVIDES_INTERRUPTIONSboost::this_thread::disable_interruption do_not_disturb;
#endif
//            boost::unique_lock<boost::mutex> lk(state_change);boost::unique_lock<bip::named_mutex>lk(state_change);while(state.exclusive || state.exclusive_waiting_blocked || state.upgrade){shared_cond.wait(lk);}state.lock_shared();state.upgrade=true;}#if defined BOOST_THREAD_USES_DATETIMEbool timed_lock_upgrade(boost::system_time const& timeout){
#if defined BOOST_THREAD_PROVIDES_INTERRUPTIONSboost::this_thread::disable_interruption do_not_disturb;
#endif
//            boost::unique_lock<boost::mutex> lk(state_change);boost::unique_lock<bip::named_mutex>lk(state_change);while(state.exclusive || state.exclusive_waiting_blocked || state.upgrade){if(!shared_cond.timed_wait(lk,timeout)){if(state.exclusive || state.exclusive_waiting_blocked || state.upgrade){return false;}break;}}state.lock_shared();state.upgrade=true;return true;}template<typename TimeDuration>bool timed_lock_upgrade(TimeDuration const & relative_time){return timed_lock_upgrade(boost::get_system_time()+relative_time);}
#endif
#ifdef BOOST_THREAD_USES_CHRONOtemplate <class Rep, class Period>bool try_lock_upgrade_for(const boost::chrono::duration<Rep, Period>& rel_time){return try_lock_upgrade_until(boost::chrono::steady_clock::now() + rel_time);}template <class Clock, class Duration>bool try_lock_upgrade_until(const boost::chrono::time_point<Clock, Duration>& abs_time){
#if defined BOOST_THREAD_PROVIDES_INTERRUPTIONSboost::this_thread::disable_interruption do_not_disturb;
#endif
//          boost::unique_lock<boost::mutex> lk(state_change);boost::unique_lock<bip::named_mutex>lk(state_change);while(state.exclusive || state.exclusive_waiting_blocked || state.upgrade){
//              if(boost::cv_status::timeout == shared_cond.wait_until(lk,abs_time))
//              {
//                  if(state.exclusive || state.exclusive_waiting_blocked || state.upgrade)
//                  {
//                      return false;
//                  }
//                  break;
//              }}state.lock_shared();state.upgrade=true;return true;}
#endifbool try_lock_upgrade(){
//            boost::unique_lock<boost::mutex> lk(state_change);boost::unique_lock<bip::named_mutex>lk(state_change);if(state.exclusive || state.exclusive_waiting_blocked || state.upgrade){return false;}else{state.lock_shared();state.upgrade=true;state.assert_lock_upgraded();return true;}}void unlock_upgrade(){
//            boost::unique_lock<boost::mutex> lk(state_change);boost::unique_lock<bip::named_mutex>lk(state_change);//state.upgrade=false;state.unlock_upgrade();if(! state.more_shared() ){state.exclusive_waiting_blocked=false;release_waiters();} else {shared_cond.notify_all();}}// Upgrade <-> Exclusivevoid unlock_upgrade_and_lock(){
#if defined BOOST_THREAD_PROVIDES_INTERRUPTIONSboost::this_thread::disable_interruption do_not_disturb;
#endif
//            boost::unique_lock<boost::mutex> lk(state_change);boost::unique_lock<bip::named_mutex>lk(state_change);state.assert_lock_upgraded();state.unlock_shared();
//            while (state.more_shared())
//            {
//                upgrade_cond.wait(lk);
//            }state.upgrade=false;state.exclusive=true;state.assert_locked();}void unlock_and_lock_upgrade(){
//            boost::unique_lock<boost::mutex> lk(state_change);boost::unique_lock<bip::named_mutex>lk(state_change);state.assert_locked();state.exclusive=false;state.upgrade=true;state.lock_shared();state.exclusive_waiting_blocked=false;state.assert_lock_upgraded();release_waiters();}bool try_unlock_upgrade_and_lock(){
//          boost::unique_lock<boost::mutex> lk(state_change);boost::unique_lock<bip::named_mutex>lk(state_change);state.assert_lock_upgraded();if(    !state.exclusive&& !state.exclusive_waiting_blocked&& state.upgrade&& state.shared_count==1){state.shared_count=0;state.exclusive=true;state.upgrade=false;state.assert_locked();return true;}return false;}
#ifdef BOOST_THREAD_USES_CHRONOtemplate <class Rep, class Period>booltry_unlock_upgrade_and_lock_for(const boost::chrono::duration<Rep, Period>& rel_time){return try_unlock_upgrade_and_lock_until(boost::chrono::steady_clock::now() + rel_time);}template <class Clock, class Duration>booltry_unlock_upgrade_and_lock_until(const boost::chrono::time_point<Clock, Duration>& abs_time){
#if defined BOOST_THREAD_PROVIDES_INTERRUPTIONSboost::this_thread::disable_interruption do_not_disturb;
#endif
//          boost::unique_lock<boost::mutex> lk(state_change);boost::unique_lock<bip::named_mutex>lk(state_change);state.assert_lock_upgraded();if (state.shared_count != 1){
//              for (;;)
//              {
//                  boost::cv_status status = shared_cond.wait_until(lk,abs_time);
//                if (state.shared_count == 1)
//                  break;
//                if(status == boost::cv_status::timeout)
//                  return false;
//              }}state.upgrade=false;state.exclusive=true;state.exclusive_waiting_blocked=false;state.shared_count=0;return true;}
#endif// Shared <-> Exclusivevoid unlock_and_lock_shared(){
//            boost::unique_lock<boost::mutex> lk(state_change);boost::unique_lock<bip::named_mutex>lk(state_change);state.assert_locked();state.exclusive=false;state.lock_shared();state.exclusive_waiting_blocked=false;release_waiters();}#ifdef BOOST_THREAD_PROVIDES_SHARED_MUTEX_UPWARDS_CONVERSIONSbool try_unlock_shared_and_lock(){boost::unique_lock<boost::mutex> lk(state_change);state.assert_lock_shared();if(    !state.exclusive&& !state.exclusive_waiting_blocked&& !state.upgrade&& state.shared_count==1){state.shared_count=0;state.exclusive=true;return true;}return false;}
#ifdef BOOST_THREAD_USES_CHRONOtemplate <class Rep, class Period>booltry_unlock_shared_and_lock_for(const chrono::duration<Rep, Period>& rel_time){return try_unlock_shared_and_lock_until(chrono::steady_clock::now() + rel_time);}template <class Clock, class Duration>booltry_unlock_shared_and_lock_until(const chrono::time_point<Clock, Duration>& abs_time){
#if defined BOOST_THREAD_PROVIDES_INTERRUPTIONSboost::this_thread::disable_interruption do_not_disturb;
#endifboost::unique_lock<boost::mutex> lk(state_change);state.assert_lock_shared();if (state.shared_count != 1){for (;;){cv_status status = shared_cond.wait_until(lk,abs_time);if (state.shared_count == 1)break;if(status == cv_status::timeout)return false;}}state.upgrade=false;state.exclusive=true;state.exclusive_waiting_blocked=false;state.shared_count=0;return true;}
#endif
#endif// Shared <-> Upgradevoid unlock_upgrade_and_lock_shared(){
//            boost::unique_lock<boost::mutex> lk(state_change);boost::unique_lock<bip::named_mutex>lk(state_change);state.assert_lock_upgraded();state.upgrade=false;state.exclusive_waiting_blocked=false;release_waiters();}#ifdef BOOST_THREAD_PROVIDES_SHARED_MUTEX_UPWARDS_CONVERSIONSbool try_unlock_shared_and_lock_upgrade(){boost::unique_lock<boost::mutex> lk(state_change);state.assert_lock_shared();if(    !state.exclusive&& !state.exclusive_waiting_blocked&& !state.upgrade){state.upgrade=true;return true;}return false;}
#ifdef BOOST_THREAD_USES_CHRONOtemplate <class Rep, class Period>booltry_unlock_shared_and_lock_upgrade_for(const chrono::duration<Rep, Period>& rel_time){return try_unlock_shared_and_lock_upgrade_until(chrono::steady_clock::now() + rel_time);}template <class Clock, class Duration>booltry_unlock_shared_and_lock_upgrade_until(const chrono::time_point<Clock, Duration>& abs_time){
#if defined BOOST_THREAD_PROVIDES_INTERRUPTIONSboost::this_thread::disable_interruption do_not_disturb;
#endifboost::unique_lock<boost::mutex> lk(state_change);state.assert_lock_shared();if(    state.exclusive|| state.exclusive_waiting_blocked|| state.upgrade){for (;;){cv_status status = exclusive_cond.wait_until(lk,abs_time);if(    ! state.exclusive&& ! state.exclusive_waiting_blocked&& ! state.upgrade)break;if(status == cv_status::timeout)return false;}}state.upgrade=true;return true;}
#endif
#endif};typedef shared_mutex upgrade_mutex;
}#include <boost/config/abi_suffix.hpp>//#endif

测试代码

#include <boost/thread/thread.hpp>
#include <boost/interprocess/sync/scoped_lock.hpp>
#include <boost/interprocess/sync/named_mutex.hpp>
#include <boost/ref.hpp>#include "read_write_mutex.h"#include <string>
#include <mutex>chy::shared_mutex global_mutex;
int global_num = 10;//全局变量,写者改变全局变量,读者读全局变量
namespace bip = boost::interprocess;
//bip::named_mutex global_mutex(bip::open_or_create,"mtx");//读线程
void read_thread(std::string &name){
//    boost::lock_guard<bip::named_mutex> lock(global_mutex);//读锁定
//    bip::named_mutex global_mutex(bip::open_or_create,"mtx");
//    global_mutex.lock();boost::shared_lock<chy::shared_mutex> lock{global_mutex};printf("线程%s抢占了资源,global_num = %d\n",name.c_str(),global_num);boost::this_thread::sleep(boost::posix_time::seconds(1));printf("线程%s释放了资源...\n",name.c_str());
//    global_mutex.unlock();
}//写线程
void write_thread(std::string &name){
//    std::lock_guard<bip::named_mutex> lock(global_mutex);//写锁定
//    bip::named_mutex global_mutex(bip::open_or_create,"mtx");
//    global_mutex.lock();boost::lock_guard<chy::shared_mutex> lock{global_mutex};global_num++;//写线程改变数据的数值printf("线程%s抢占了资源,global_num = %d\n",name.c_str(),global_num);boost::this_thread::sleep(boost::posix_time::seconds(1));printf("线程%s释放了资源...\n",name.c_str());
//    global_mutex.unlock();
}int main(){std::string read_thread_r1 = "read_thread_r1";std::string read_thread_r2 = "read_thread_r2";std::string read_thread_r3 = "read_thread_r3";std::string read_thread_r4 = "read_thread_r4";std::string read_thread_r5 = "read_thread_r5";std::string write_thread_w1 = "write_thread_w1";std::string write_thread_w2 = "write_thread_w2";boost::thread_group tg;tg.create_thread(boost::bind(read_thread,boost::ref(read_thread_r1)));tg.create_thread(boost::bind(read_thread,boost::ref(read_thread_r2)));tg.create_thread(boost::bind(read_thread,boost::ref(read_thread_r3)));tg.create_thread(boost::bind(read_thread,boost::ref(read_thread_r4)));tg.create_thread(boost::bind(read_thread,boost::ref(read_thread_r5)));tg.create_thread(boost::bind(write_thread,boost::ref(write_thread_w1)));tg.create_thread(boost::bind(write_thread,boost::ref(write_thread_w2)));tg.join_all();return 0;
}

 

本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如若转载,请注明出处:http://www.mzph.cn/news/446820.shtml

如若内容造成侵权/违法违规/事实不符,请联系多彩编程网进行投诉反馈email:809451989@qq.com,一经查实,立即删除!

相关文章

Android Activity之间传递类对象

一、简介 开发过程中&#xff0c;Activity之间传递数据是必不可少的&#xff0c;Android中使用Intent和Bundle作为数据载体&#xff0c;在Activity之间传递&#xff0c;对于基础数据类型&#xff0c;Bundle已经提供了相关的put、set方法&#xff0c;而作为自定义的类型则需要有…

C++3个汉诺塔递归问题

3个汉诺塔问题A—>C 移动次数2^n-1 hannoni(int n,char a,char b,char c)把n个盘子借助b,从a移动到cmove(int n,char a,char c)把第n个盘子,从a移动到c #include<iostream> #include<cmath> using namespace std; //汉诺塔问题A--->C //2^n-1次移动次数 …

clion编译器解决undefined reference to symbol ‘shm_open@@GLIBC_2.2.5‘

修改CMakelists文件 cmake_minimum_required(VERSION 3.17) project(mutex_learn)set(CMAKE_CXX_STANDARD 14)set(BOOST_ROOT "/usr/local/include/boost") #添加头文件搜索路径 include_directories(/usr/local/include) #添加库文件搜索路径 link_directories(/us…

Android 拦截或屏蔽返回键

在Android开发中我们常常会遇到需要拦截或屏蔽返回键的需求&#xff0c;对拦截后的返回键进行特殊操作。 监听返回键有两种方式 1、重写OnBackPressed方法 Overridepublic void onBackPressed() {// 完全由自己控制返回键逻辑&#xff0c;系统不再控制&#xff0c;但是有个前…

C++递归斐波那契数列

第一种 //斐波那契数列 // 0 1 1 … //从第1个开始 代码 #include<iostream> #include<cmath> using namespace std; //斐波那契数列 // 0 1 1 ... //从第1个开始 int f(int n) {int m; if(n1)return 0;if(n2)return 1;elsemf(n-1)f(n-2);return m;} int mai…

Android onActivityResult中requestCode与resultCode区别

想要了解requestCode与resultCode的区别&#xff0c;我们需要先了解以下三个方法的用法&#xff1a; startActivityForResult(Intent intent, Int requestCode) setResut(int resultCode, Intent intent) onActivityResult(int requestCode, int resultCode, Intent intent) …

使用named_mutex和named_condition配合实现读写锁

代码 代码的名称是read_write_mutex.h初步优化如果涉及到进程挂掉了&#xff0c;造成进程堵塞&#xff0c;如何解决&#xff1f;还未涉及 #include <boost/interprocess/sync/named_condition.hpp> #include <boost/interprocess/sync/named_mutex.hpp>namespace …

C++的输入与输出

输入与输出 输入:从外部输入设备(键盘)向计算机输入数据 输出:从计算机向外部输出设备(显示屏)输出数据 C使用流对象实现 使用流对象cin与cout,将标准输入输出流库的头文件iostream包含到源文件 #include<iostream>//标准输入输出库 using namespace std;//使用标准命…

Android 动态计算ListView的高度

目录一、简介二、效果图三、代码实现一、简介 在Android开发的过程中有的时候我们需要手动计算ListView的高度&#xff0c;比如说&#xff0c;ScrollView中嵌套ListView的时候&#xff0c;我们就需要手动精确计算ListView的高度了。 如果ListView的Item高度是固定的话还好计算…

DjangoRestFramework(drf实现五个接口)

安装&#xff1a;pip install djangorestframework 在使用drf之前&#xff0c;先 使用原生Django实现5个接口 models.py from django.db import modelsclass Book(models.Model):namemodels.CharField(max_length53)pricemodels.IntegerField() views.py from app01 impor…

linux使用共享内存进行进程通信

一、什么是共享内存 共享内存就是允许两个不相关的进程访问同一个逻辑内存。共享内存是在两个正在运行的进程之间共享和传递数据的一种非常有效的方式。不同进程之间共享的内存通常为同一段物理内存。使用共享内存进行通信的进程都需要同一段共享内存连接到它们自己的地址空间…

安卓TextView文本框与自定义边框

常用属性 自定义边框 基本使用 <?xml version"1.0" encoding"utf-8"?> <shape xmlns:android"http://schemas.android.com/apk/res/android"android:shape"rectangle矩形/ring圆环/oval椭圆/line直线"当为圆环时android:s…

Android RecyclerView实现九宫格效果

RecyclerView更加优化的复用机制和方便实现UI效果&#xff0c;几乎替代Listview和GridView的使用。但是分割线的实现&#xff0c;需要自己继承ItemDecoration来绘制。 完整代码已上传至Github&#xff1a;RecyclerView实现九宫格效果 效果图 item的布局文件 <?xml versi…

如何读取指针指向的地址空间呢?

方法 使用%p 接收指针返回的地址空间 代码 #include <stdio.h> #include <stdlib.h>int main() {int a 100;int *a_p &a;printf("%p\n",&a);//输出&#xff1a;002AF744 输出的是a变量的地址printf("%p\n",a_p);//输出&#xff1…

科学究研明表,汉字序顺并不一定影阅响读

有个很有意思的现象&#xff1a; 不信你就来试试 中文打乱小工具 github地址&#xff1a;在线打乱文字顺序

安卓EditText

常用属性 android:textAllCaps"false"去除大写状态 inputType 常用 textpassword密码 number数字 phone拨号键盘 设置光标位置 editText.setSelection(2);从1开始 editText.setSelection(1,3);从1开始,1–3中间部分,一个范围

完善博文 共享内存一写多读无锁实现的代码逻辑部分

使用共享内存(内存映射)实现发布订阅模式 多进程实现PubSub发布订阅模式&#xff0c;从而实现进程间的通信。通信方式可以是TCP/UDP&#xff0c;管道Pipe/消息队列&#xff0c;共享内存shared memory等等。其中TCP/UDP的方式是可以用作局域网以及跨平台的通信&#xff0c;Pipe…

想对你说的话,就在这里!

甜(Tu)言(Wei)蜜(Qing)语(Hua)最近在github上看到了一个朋友开发的 土味情话在线生成器 &#xff0c;感觉还不错&#xff0c;在这里推荐一下。 github地址&#xff1a;在线生成土味情话

linux读写文件 简单版

代码 //write void write_file(const std::string file_name){FILE *fp nullptr;fp fopen(file_name.c_str(),"w");fprintf(fp,"This is testing for mutex\n");fclose(fp); } //read void read_file(const std::string file_name){std::ifstream fp(fi…

具有中国风的传统颜色(炫酷)

一个小小的中国风的传统颜色&#xff0c;你觉得应该是什么样子的呢&#xff1f; 看了下面这个&#xff0c;我一个搞移动开发的都想去搞前端开发了。 废话不多说了&#xff0c;直接看效果&#xff1a; 访问地址&#xff1a;中国传统颜色手册 github地址&#xff1a;Chinese…