virtual_query.h

Windows消息处理与资源定义
最新推荐文章于 2017-11-28 09:11:16 发布
原创 最新推荐文章于 2017-11-28 09:11:16 发布 · 508 阅读 · 0 ·
CC 4.0 BY-SA版权
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
文章标签：

#callback

本文介绍了Windows应用程序中消息处理函数WndProc及对话框过程函数About的声明方式，并展示了资源标识符的定义方法，包括退出命令IDM_EXIT、测试命令IDM_TEST及关于对话框命令IDM_ABOUT。

  name="google_ads_frame" marginwidth="0" marginheight="0" src="http://pagead2.googlesyndication.com/pagead/ads?client=ca-pub-5572165936844014&dt=1194442938015&lmt=1194190197&format=336x280_as&output=html&correlator=1194442937843&url=file%3A%2F%2F%2FC%3A%2FDocuments%2520and%2520Settings%2Flhh1%2F%E6%A1%8C%E9%9D%A2%2FCLanguage.htm&color_bg=FFFFFF&color_text=000000&color_link=000000&color_url=FFFFFF&color_border=FFFFFF&ad_type=text&ga_vid=583001034.1194442938&ga_sid=1194442938&ga_hid=1942779085&flash=9&u_h=768&u_w=1024&u_ah=740&u_aw=1024&u_cd=32&u_tz=480&u_java=true" frameborder="0" width="336" scrolling="no" height="280" allowtransparency="allowtransparency"> #define IDM_EXIT           100
#define IDM_TEST           200
#define IDM_ABOUT          301

LRESULT CALLBACK WndProc  (HWND, UINT, WPARAM, LPARAM);
LRESULT CALLBACK About    (HWND, UINT, WPARAM, LPARAM);

2022-11-18 stonedb-assert failed on i ＜ m_idx.size() at rc_attr.h:342-问题分析
悟世之路
11-18 190
mysql列存储引擎-assert failed on i < m_idx.size() at rc_attr.h:342-问题分析关联ISSUE: https://github.com/stoneatom/stonedb/issues/964
AMCL系列之头文件map.h
qq_34160473的博客
03-08 320
AMCL的地图头文件
map.h C++ 头文件下载
11-24
map.h C++ 头文件下载 C++17 标准库文件 unordered_map map
WXAPP-WEB-ShowMess:采用云开发后端服务打造的实时消息展板程序，使用小程序的客服消息能力发送消息，实时在WEB展板页面中展示，用于现场互动等多种玩法场景
05-28
实时消息展板——腾讯云·云开发Techo大会演示项目 项目介绍 采用云开发后端服务打造的实时消息展板程序。 使用小程序的客服消息能力发送消息，实时在WEB展板页面中展示，用于现场互动等多种玩法场景。 演示地址： 部署步骤 注意：一键部署之后还需要操作下述步骤中第5步 在部署成功之后，控制台会显示访问按钮，点击即可进入WEB页面应用 小程序访问需要微信搜索「小程序助手」，进入后选择以上部署的小程序-「版本管理」-「开发版」中会有CI机器人提交的最新版本，点击之后即可进入小程序 小程序开发者工具打开此项目 确定云开发环境（按量付费）最好有一个全新的按量付费小程序 将项目下载后打开，cloudfunctions存放云函数代码，miniprogram存放小程序代码，webview存放WEB应用代码 将cloudfunctions目录下三个云函数创建上传并云端安装依赖。delete云函数需要上传触发
2_menus.h
CCodes的专栏
11-08 662
  #define IDM_EXIT           100#define IDM_OLD            200#define IDM_NEW            201#define IDM_ABOUT          301LRESULT CALLBACK WndProc  (HWND, UINT, WPARAM, LPARAM);LRESULT CALLBACK Abou
《STL源码剖析》-- stl_map.h
一个人的战争
08-03 6252
// Filename: stl_map.h // Comment By: 凝霜 // E-mail: mdl2009@vip.qq.com // Blog: http://blog.csdn.net/mdl13412 /* * * Cop
shihaopeng@shihaopeng-virtual-machine11:~/Desktop/CODE/db3$ make g++ -c attendance_db.cpp -o attendance_db.o -Wall -Wextra -O2 -I. attendance_db.cpp:5:5: warning: identifier ‘nullptr’ is a keyword in C++11 [-Wc++0x-compat] AttendanceDB() : db(nullptr) {} ^ attendance_db.cpp:18:35: warning: missing terminating " character const char* sql_create = R"( ^ attendance_db.cpp:18:9: error: missing terminating " character const char* sql_create = R"( ^ attendance_db.cpp:25:10: warning: missing terminating " character )"; ^ attendance_db.cpp:25:9: error: missing terminating " character )"; ^ attendance_db.cpp:3:7: error: redefinition of ‘class AttendanceDB’ class AttendanceDB { ^ In file included from attendance_db.cpp:1:0: attendance_db.h:18:7: error: previous definition of ‘class AttendanceDB’ class AttendanceDB { ^ makefile:25: recipe for target 'attendance_db.o' failed make: *** [attendance_db.o] Error 1
08-23
int AttendanceDB::queryAll(std::vector<AttendanceRecord>& results) { const char* sql = "SELECT id, emp_id, name, avatar_path FROM attendance;"; sqlite3_stmt* stmt; int rc = sqlite3_prepare_v2(db, ...
char *cmlsh_filename_completion_function(const char *text, int state) { char current_dir[PATH_MAX]; char abs_path[PATH_MAX]; int is_prefix_of_existing = 0; int should_reset = 0; struct stat st; int flash_len = NOS_CMLSH_FLASH_DIR_LEN; int is_flash_mode = (strncmp(text, NOS_CMLSH_FLASH_DIR, flash_len) == 0); int is_flash_prefix = (strncmp(NOS_CMLSH_FLASH_DIR, text, strlen(text)) == 0) && (strlen(text) < flash_len); const char *compare_text = text; if (is_flash_mode && strncmp(text, NOS_CMLSH_FLASH_DIR, flash_len) == 0) { compare_text = text + flash_len; } const char *slash = strrchr(compare_text, '/'); const char *base = slash ? (slash + 1) : compare_text; int base_len = strlen(base); if (comp_state.matches && comp_state.count > 0 && base_len > 0) { int all_match = 1; for (int i = 0; i < comp_state.count; i++) { if (comp_state.matches[i] == NULL) continue; if (strncmp(comp_state.matches[i], base, base_len) != 0) { all_match = 0; break; } } is_prefix_of_existing = all_match; } else { is_prefix_of_existing = 0; } getcwd(current_dir, sizeof(current_dir)); if (is_flash_mode) { char flash_path[PATH_MAX]; snprintf(flash_path, sizeof(flash_path), "%s%s", NOS_CMLSH_HOME_DIR, text + flash_len); snprintf(abs_path, sizeof(abs_path), "%s", flash_path); } else { snprintf(abs_path, sizeof(abs_path), "%s/%s", current_dir, text); } should_reset = !comp_state.initialized || comp_state.matches == NULL || (!is_prefix_of_existing && access(abs_path, F_OK) != 0) || (comp_state.count == 1 && stat(abs_path, &st) == 0 && S_ISDIR(st.st_mode)) || (comp_state.count == 0 && stat(abs_path, &st) == 0 && S_ISDIR(st.st_mode)) || (comp_state.current_text && strlen(text) < strlen(comp_state.current_text)); if (comp_state.matches && comp_state.count == 1 && stat(abs_path, &st) == 0 && !S_ISDIR(st.st_mode)) { comp_state.initialized = 0; return NULL; } if (should_reset) { char *saved_last_prefix = NULL; char *saved_base_dir = NULL; int saved_flash_mode = comp_state.flash_mode; if (comp_state.last_prefix) { saved_last_prefix = XSTRDUP(MTYPE_TMP, comp_state.last_prefix); } if (comp_state.base_dir) { saved_base_dir = XSTRDUP(MTYPE_TMP, comp_state.base_dir); } cmlsh_reset_completion_state(); char *current_base = NULL; char *current_prefix = NULL; int current_level = 0; cmlsh_parse_input_text(text, &current_base, &current_prefix, &current_level); if (saved_last_prefix) { comp_state.last_prefix = saved_last_prefix; } else { comp_state.last_prefix = NULL; } if (saved_base_dir) { comp_state.base_dir = saved_base_dir; } else { comp_state.base_dir = NULL; } const char *use_prefix = current_prefix; if ((current_prefix == NULL || *current_prefix == '\0') && comp_state.last_prefix && comp_state.last_prefix[0] != '\0' && comp_state.base_dir && current_base && strcmp(comp_state.base_dir, current_base) == 0) { use_prefix = comp_state.last_prefix; } if (comp_state.base_dir == NULL || strcmp(comp_state.base_dir, current_base) != 0) { if (comp_state.base_dir) { XFREE(MTYPE_TMP, comp_state.base_dir); } comp_state.base_dir = XSTRDUP(MTYPE_TMP, current_base); } comp_state.flash_mode = saved_flash_mode; comp_state.current_level = current_level; comp_state.current_text = XSTRDUP(MTYPE_TMP, text); if (is_flash_mode) { const char *rel_path = comp_state.base_dir + flash_len; int needed = NOS_CMLSH_HOME_DIR_LEN + strlen(rel_path) + 2; char *actual_path = XCALLOC(MTYPE_TMP, needed); snprintf(actual_path, needed, "%s%s", NOS_CMLSH_HOME_DIR, rel_path); if (actual_path[strlen(actual_path) - 1] != '/') { actual_path = XREALLOC(MTYPE_TMP, actual_path, strlen(actual_path) + 2); strcat(actual_path, "/"); } comp_state.matches = cmlsh_generate_current_dir_paths(actual_path, use_prefix, current_level == 0); XFREE(MTYPE_TMP, actual_path); } else if (is_flash_prefix) { comp_state.matches = cmlsh_generate_current_dir_paths(current_base, use_prefix, 1); int count = 0; if (comp_state.matches) { while (comp_state.matches[count]) count++; } else { comp_state.matches = XCALLOC(MTYPE_TMP, 2 * sizeof(char*)); } int found = 0; for (int i = 0; i < count; i++) { if (strcmp(comp_state.matches[i], NOS_CMLSH_FLASH_DIR) == 0) { found = 1; break; } } if (!found) { comp_state.matches = XREALLOC(MTYPE_TMP, comp_state.matches, (count + 2) * sizeof(char*)); comp_state.matches[count] = XSTRDUP(MTYPE_TMP, NOS_CMLSH_FLASH_DIR); comp_state.matches[count + 1] = NULL; } comp_state.count = count + (found ? 0 : 1); } else { comp_state.matches = cmlsh_generate_current_dir_paths(current_base, use_prefix, current_level == 0); } if (current_prefix && *current_prefix) { if (comp_state.last_prefix) { XFREE(MTYPE_TMP, comp_state.last_prefix); } comp_state.last_prefix = XSTRDUP(MTYPE_TMP, current_prefix); } comp_state.count = 0; if (comp_state.matches) { while (comp_state.matches[comp_state.count]) { comp_state.count++; } } comp_state.last_state = -1; comp_state.initialized = 1; } if (!comp_state.matches || comp_state.count == 0) { comp_state.initialized = 0; return NULL; } int next_index = (comp_state.last_state + 1) % comp_state.count; comp_state.last_state = next_index; if (comp_state.count == 1) { next_index = 0; } char *match = comp_state.matches[next_index]; char *full_path = NULL; if (strcmp(match, NOS_CMLSH_FLASH_DIR) == 0) { full_path = XSTRDUP(MTYPE_TMP, NOS_CMLSH_FLASH_DIR); } else if (comp_state.flash_mode) { char *virtual_base = comp_state.base_dir; char *virtual_path = NULL; if (virtual_base && strlen(virtual_base) > 0) { int base_len = strlen(virtual_base); int needs_slash = (base_len > 0 && virtual_base[base_len - 1] != '/'); virtual_path = XCALLOC(MTYPE_TMP, base_len + strlen(match) + 2); if (needs_slash) { snprintf(virtual_path, base_len + strlen(match) + 2, "%s/%s", virtual_base, match); } else { snprintf(virtual_path, base_len + strlen(match) + 1, "%s%s", virtual_base, match); } } else { virtual_path = XSTRDUP(MTYPE_TMP, match); } full_path = virtual_path; } else { if (comp_state.base_dir && strlen(comp_state.base_dir) > 0) { int base_len = strlen(comp_state.base_dir); int needs_slash = (base_len > 0 && comp_state.base_dir[base_len - 1] != '/'); full_path = XCALLOC(MTYPE_TMP, base_len + strlen(match) + 2); if (needs_slash) { snprintf(full_path, base_len + strlen(match) + 2, "%s/%s", comp_state.base_dir, match); } else { snprintf(full_path, base_len + strlen(match) + 1, "%s%s", comp_state.base_dir, match); } } else { full_path = XSTRDUP(MTYPE_TMP, match); } } return full_path; } char **cmlsh_filename_completion_matches(const char text, CPFunction genfunc) { if (text == NULL || *text == ‘\0’) { comp_state.initialized = 0; return NULL; } char *match = (*genfunc)(text, 0); if (!match) { return NULL; } char **matches = (char **)XCALLOC(MTYPE_TMP, 2 * sizeof(char *)); matches[0] = match; matches[1] = NULL; return matches; } char** cmlsh_completion(char* text, int start, int end) { char** matches; char** filename_matches = NULL; int is_fs_command = 0; int fs_cmd_len = 0; int i; const LineInfo* li; li = el_line(e); rl_line_buffer = (char*)li->buffer; rl_end = li->lastchar - li->buffer; rl_line_buffer[rl_end] = '\0'; matches = completion_matches(text, cmlsh_completion_matches); for (i = 0; cmlsh_fs_commands[i]; i++) { int len = strlen(cmlsh_fs_commands[i]); if (strncmp(rl_line_buffer, cmlsh_fs_commands[i], len) == 0 && (rl_line_buffer[len] == ' ' || rl_line_buffer[len] == '\0')) { is_fs_command = 1; fs_cmd_len = len; break; } } if (!matches || !matches[0]) { if (matches) { for (i = 0; matches[i]; i++) { XFREE(MTYPE_TMP,matches[i]); } XFREE(MTYPE_TMP,matches); matches = NULL; } if (is_fs_command && start > fs_cmd_len) { filename_matches = cmlsh_filename_completion_matches(text, cmlsh_filename_completion_function); } if (!filename_matches || !filename_matches[0]) { return NULL; } #if 1 int matches_num, maxlen, match_len, match_display = 1; for (i = 0, maxlen = 0; comp_state.matches[i]; i++) { match_len = strlen(comp_state.matches[i]); if (match_len > maxlen) maxlen = match_len; } matches_num = i; printf("\n"); if (match_display) rl_display_match_list_tmp(comp_state.matches, matches_num, maxlen); #endif return NULL; } return matches; } 在这个基础上优化成linux原生的补全效果，不要另写钩子函数
最新发布
08-27
我们注意到，原生的Linux补全效果（如bash）在遇到唯一匹配项是目录时，会自动添加斜杠并继续补全该目录下的内容。而当前代码中，当唯一匹配项是目录时，并没有自动展开。 问题分析： 1. 当前代码中，当匹配到...
shihaopeng@shihaopeng-virtual-machine11:~/Desktop/CODE/db2$ make gcc -c attendance_db.c -o attendance_db.o -Wall -Wextra -O2 -I. attendance_db.c: In function ‘read_and_encode_image’: attendance_db.c:42:5: warning: ignoring return value of ‘fread’, declared with attribute warn_unused_result [-Wunused-result] fread(buffer, 1, file_len, fp); ^ gcc -c test.c -o test.o -Wall -Wextra -O2 -I. gcc attendance_db.o test.o -o test -lsqlite3 -lpthread attendance_db.o: In function `base64_encode': attendance_db.c:(.text+0x21): undefined reference to `BIO_f_base64' attendance_db.c:(.text+0x29): undefined reference to `BIO_new' attendance_db.c:(.text+0x31): undefined reference to `BIO_s_mem' attendance_db.c:(.text+0x39): undefined reference to `BIO_new' attendance_db.c:(.text+0x44): undefined reference to `BIO_push' attendance_db.c:(.text+0x54): undefined reference to `BIO_set_flags' attendance_db.c:(.text+0x62): undefined reference to `BIO_write' attendance_db.c:(.text+0x73): undefined reference to `BIO_ctrl' attendance_db.c:(.text+0x85): undefined reference to `BIO_ctrl' attendance_db.c:(.text+0xba): undefined reference to `BIO_free_all' collect2: error: ld returned 1 exit status makefile:21: recipe for target 'test' failed make: *** [test] Error 1
08-23
db_query_all(print_callback, NULL); db_close(); return 0; } ``` --- ## ✅ 相关问题 1. 为什么 `-lssl` 和 `-lcrypto` 要放在 `.o` 文件之后？ 2. 如果我不想使用 OpenSSL，还有哪些替代的 Base64 编码...
qwe123@qwe123-virtual-machine:~/CLionProjects/C_code/BDZ_hash$ gcc -O3 bdz_hash.c -lcmph -o bdz_hash bdz_hash.c:8:5: error: unknown type name ‘uint32_t’ 8 | uint32_t dist1; | ^~~~~~~~ bdz_hash.c:9:5: error: unknown type name ‘uint32_t’ 9 | uint32_t dist2; | ^~~~~~~~ bdz_hash.c:10:5: error: unknown type name ‘uint32_t’ 10 | uint32_t dist3; | ^~~~~~~~ bdz_hash.c:14:5: error: unknown type name ‘uint32_t’ 14 | uint32_t star_id1; | ^~~~~~~~ bdz_hash.c:15:5: error: unknown type name ‘uint32_t’ 15 | uint32_t star_id2; | ^~~~~~~~ bdz_hash.c:16:5: error: unknown type name ‘uint32_t’ 16 | uint32_t star_id3; | ^~~~~~~~ bdz_hash.c:17:5: error: unknown type name ‘uint32_t’ 17 | uint32_t dist1; | ^~~~~~~~ bdz_hash.c:18:5: error: unknown type name ‘uint32_t’ 18 | uint32_t dist2; | ^~~~~~~~ bdz_hash.c:19:5: error: unknown type name ‘uint32_t’ 19 | uint32_t dist3; | ^~~~~~~~ bdz_hash.c: In function ‘read_features’: bdz_hash.c:37:9: error: unknown type name ‘uint32_t’ 37 | uint32_t s1, s2, s3, d1, d2, d3; | ^~~~~~~~ bdz_hash.c:5:1: note: ‘uint32_t’ is defined in header ‘<stdint.h>’; did you forget to ‘#include <stdint.h>’? 4 | #include <cmph.h> +++ |+#include <stdint.h> 5 | bdz_hash.c: In function ‘build_bdz_mphf’: bdz_hash.c:59:56: warning: passing argument 1 of ‘cmph_io_vector_adapter’ from incompatible pointer type [-Wincompatible-pointer-types] 59 | cmph_io_adapter_t* source = cmph_io_vector_adapter((char*)keys, sizeof(FeatureKey), n); | ^~~~~~~~~~~ | | | char * In file included from bdz_hash.c:4: /usr/local/include/cmph.h:34:51: note: expected ‘char **’ but argument is of type ‘char *’ 34 | cmph_io_adapter_t *cmph_io_vector_adapter(char ** vector, cmph_uint32 nkeys); | ~~~~~~~~^~~~~~ bdz_hash.c:59:33: error: too many arguments to function ‘cmph_io_vector_adapter’ 59 | cmph_io_adapter_t* source = cmph_io_vector_adapter((char*)keys, sizeof(FeatureKey), n); | ^~~~~~~~~~~~~~~~~~~~~~ In file included from bdz_hash.c:4: /usr/local/include/cmph.h:34:20: note: declared here 34 | cmph_io_adapter_t *cmph_io_vector_adapter(char ** vector, cmph_uint32 nkeys); | ^~~~~~~~~~~~~~~~~~~~~~ bdz_hash.c: At top level: bdz_hash.c:83:18: error: unknown type name ‘uint32_t’ 83 | uint32_t d1, uint32_t d2, uint32_t d3) { | ^~~~~~~~ bdz_hash.c:83:18: note: ‘uint32_t’ is defined in header ‘<stdint.h>’; did you forget to ‘#include <stdint.h>’? bdz_hash.c:83:31: error: unknown type name ‘uint32_t’ 83 | uint32_t d1, uint32_t d2, uint32_t d3) { | ^~~~~~~~ bdz_hash.c:83:31: note: ‘uint32_t’ is defined in header ‘<stdint.h>’; did you forget to ‘#include <stdint.h>’? bdz_hash.c:83:44: error: unknown type name ‘uint32_t’ 83 | uint32_t d1, uint32_t d2, uint32_t d3) { | ^~~~~~~~ bdz_hash.c:83:44: note: ‘uint32_t’ is defined in header ‘<stdint.h>’; did you forget to ‘#include <stdint.h>’? bdz_hash.c: In function ‘main’: bdz_hash.c:126:10: warning: implicit declaration of function ‘query_feature’ [-Wimplicit-function-declaration] 126 | if (!query_feature(mphf, hash_table, test_key.dist1, test_key.dist2, test_key.dist3)) { |
08-01
1. 未包含`<stdint.h>`头文件，导致`uint32_t`类型未定义。 2. `cmph_io_vector_adapter`函数的调用参数不正确。根据cmph文档，该函数的原型是： ```c cmph_io_adapter_t *cmph_io_vector_adapter(char **vector, ...
enum-props:枚举，支持其他元数据
05-12
介绍 enum-props包装了出色的enum实现 。 它公开了一个Enum工厂，该工厂允许将其他元数据添加到每个枚举成员。 安装 npm install -S enum-props 用法 var Enum = require ( 'enum-props' ) ; // define a simple enum (automatically flaggable -> A: 0x01, B: 0x02, C: 0x04) //Uses bitwise 'OR' operation in between the values and creates enumerated constants. For example, if 'Read':1, 'Write':2, then ReadWrite= Read | Write = 1 | 2 = 3; var myEnum = new Enum (
CreateBitmap
07-15 1462
函数功能：该函数创建一个带有特定宽度、高度和颜色格式的位图。    函数原型：HBITMAP CreateBitmap(int nWidth,int nHeight, UINT cPlanes, UINT cBitsPeral,CONST VOID *lpvBits)；    参
map
h_11qx的博客
11-28 295
选择某种Map集合保存学号从1到15的学员的学号（键）和姓名（值），学号用字符串表示，输入的时候要以学号乱序的方式存入Map集合，然后按照学号从大到小的顺序将Map集合中的元素输出打印。需要自定义Map集合的比较器Comparator，因字符串对象的大小比较是按字典序，而非对应的数值。 要求：必须使用Map集合的内部排序机制进行排序，不能在外部排序。 import java.util.
STL源码剖析 容器 stl_map.h
07-22 1350
map -------------------------------------------------------------------------------- 所有元素都会根据元素的键值自动被排序。 map的所有元素都是 pair，同时拥有实值和键值。 不可以修改元素的键值，因为它关系到 map 元素的排列规则 可以修改元素的实值，因为它不影响 map 的排列规则 map iterator 既不是一种 constant iterators ， 也不是一种 mutable iterator 标准
create_dib_bitmap.cpp
CCodes的专栏
11-08 511
 
《STL源码剖析》---stl_map.h阅读笔记
KangRoger的专栏
08-16 5387
map是STL中的标准关系容器，它存储的元素时pair，拥有键值key和实值value。按照键值key存储到红黑树中，用红黑树提供的函数操作map。
enumprops.cpp
CCodes的专栏
11-08 675
  #include   #include "EnumProps.h" #if defined (WIN32) #define IS_WIN32 TRUE#else #define IS_WIN32 FALSE#endif#define IS_NT      IS_WIN32 && (BOOL)(GetVersion() #define IS_WIN32S  IS_WIN32 && (BO
CollectionView中deleteItems方法的使用
weixin_30301449的博客
10-31 789
最近在做一个批量删除照片的功能,调用了 deleteItems这个方法,但是使用这个方法之后程序崩溃,报错:You need to also delete associated data from the data source as well.这是因为在使用这个方法时,要删除数据源数据,我在项目中利用冒泡将indexPath进行有小到大排序,重新进行遍历,将其存到数组中,这样就可以实现照片的选中...
CreateDibBitmap为什么总是失败？
haohamaru的专栏
04-14 1087
 函数原型：HBITMAP CreateDIBitmap(HDC hdc,CONST BITMAPINFONEADER *lpbmih,DWORD fdwlnit,CONST VOID *lpblnit,CONST BITMAPINFO *lpbmi,UINT fuUsage)；    参数：    hdc：设备环境句柄。    lpbmih：指向位图信息头结构的指针，它可以是下列操作
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
表情包 代码片
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值