##简介
轻量级的onvif设备搜索C++客户端。
##特点
1、简单,不依赖gsoap.
2、支持多网卡,多网段,多IP搜索.彻底解决只能单IP网段搜索设备的限制。
2、使用boost,asio跨平台,支持windows,linux.
3、高效线程池处理udp收包,尽可能不丢包,不遗漏设备.
##Project Introduction
The project is a onvif discovery client project,through the project,you can learn
how to get the IPC(ip camera)'s address URL.
##Tips:
multi-interface,and multi network IP is OK.
The onvif discovery client src is used boost,asio. Not use gsoap.
The compile platform is windows,linux....
##example:
void CALLBACK OnvifCallback_SearchDevice(int nType,
int nValue,
const char* pDeviceURL,
int nDataSize,
void* pUser)
{
std::cerr << " onvif device number=" << nValue << ", " << pDeviceURL << std::endl << std::endl;
}
int main(void )
{
CDiscovery proxy;
proxy.SetUserCallBack(OnvifCallback_SearchDevice, NULL);
proxy.start();
system("pause");
proxy.stop();
return 0;
}
----------------------------------------------------
##ONVIF official website
http://www.onvif.org/
if you want to learn more onvif API
http://www.onvif.org/onvif/ver20/util/operationIndex.html
roger_77
- 粉丝: 189
- 资源: 2
最新资源
- js-leetcode题解之158-read-n-characters-given-read4-ii-call
- js-leetcode题解之157-read-n-characters-given-read4.js
- js-leetcode题解之156-binary-tree-upside-down.js
- js-leetcode题解之155-min-stack.js
- js-leetcode题解之154-find-minimum-in-rotated-sorted-array-ii.js
- js-leetcode题解之153-find-minimum-in-rotated-sorted-array.js
- js-leetcode题解之152-maximum-product-subarray.js
- js-leetcode题解之151-reverse-words-in-a-string.js
- js-leetcode题解之150-evaluate-reverse-polish-notation.js
- js-leetcode题解之149-max-points-on-a-line.js
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈
- 1
- 2
前往页