登录
首页 » C# » 右键菜单,可以增加系统的鼠标右键菜单功能,只是一般性介绍,可供参考...

右键菜单,可以增加系统的鼠标右键菜单功能,只是一般性介绍,可供参考...

于 2022-03-20 发布 文件大小:53.99 kB
0 75
下载积分: 2 下载次数: 1

代码说明:

右键菜单,可以增加系统的鼠标右键菜单功能,只是一般性介绍,可供参考-Right menu system can increase the right mouse button menu function, just a general introduction is available for reference

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • xuesheng
    校内学生通讯录管理系统,基本框架要求: 0.显示通讯录 * * 1.添加记录 * * 2.修改记录 * * 3.删除记录 * * 4.按姓名排序 * * 5.按姓名查询 * * 6.快速查询 * * 7.退出 (Campus student directory management system)
    2013-09-08 10:48:53下载
    积分:1
  • AES_CMAC
    AES加密,并完成基于AES的CAMC操作(AES encryption and the AES operation is completed based on CAMC)
    2014-11-08 23:11:00下载
    积分:1
  • batewosi1
    详细阐述了波特沃斯低通滤波器的matlab仿真原理及对应的c语言实现过程,读完此资料后,对于巴特沃斯低通滤波器不管从c语言实现还是matlab实现,你都会有很好的理解(Matlab simulation principles elaborated Porter Worth low-pass filter and the corresponding c language implementation process, after reading this information, for Butterworth low-pass filter regardless of language or a c matlab implementation, you will have a very good understanding)
    2014-10-30 09:17:14下载
    积分:1
  • c++ 通过dao 读写 access文件 实例源码下载
    c++ 通过dao 读写 access文件 实例源码下载
    2015-03-16下载
    积分:1
  • 基于lua配置文件的串口测试上位机程序
    基于lua配置文件的串口测试上位机程序,能自定义数据格式,自定义参数配置窗口。
    2023-07-13 07:30:07下载
    积分:1
  • heiv_src
    C++ code implementing the estimation of errors-in-variables models under point dependent noise. It includes examples for linear, ellipse, fundamental matrix and trifocal tensor estimation. The theory is described in A general method for errors-in-variables problems in computer vision(err)
    2020-12-18 20:19:10下载
    积分:1
  • AD7705SENSORv1.01
    P89LPC931操作AD7705的程序。 (P89LPC931 AD7705 operational procedures.)
    2007-03-20 09:43:23下载
    积分:1
  • BootLoader
    适用于NXP现有MCU,rappid bt; can和sci双支持(Suitable for NXP existing MCU, rappid bt; can and SCI dual support)
    2020-06-21 05:00:02下载
    积分:1
  • mini简易示波器 ADC+DMA
    说明:  基于正点原子mini板的简易示波器 ADC+DMA+LCD(Embadded Oscilloscope STM32F203RCT6)
    2020-07-07 13:08:58下载
    积分:1
  • 图的遍历
    基本要求:以邻接表为存储结构,实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点,分别输出每种遍历下的结点访问序列和相应生成树的边集。(Basic requirements: the adjacency list is used as storage structure to realize the depth first and breadth first traversal of connected undirected graph. Starting from user specified nodes, we output each node access sequence and the corresponding edge set of corresponding spanning tree respectively.)
    2018-06-05 09:18:27下载
    积分:1
  • 696518资源总数
  • 105559会员总数
  • 1今日下载