亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

? 歡迎來到蟲蟲下載站! | ?? 資源下載 ?? 資源專輯 ?? 關于我們
? 蟲蟲下載站

?? options.cpp

?? 一個開源的網絡開發庫ACE
?? CPP
?? 第 1 頁 / 共 3 頁
字號:
        case 'c':
          {
            ACE_SET_BITS (option_word_, COMP);
            break;
          }
        // Make the generated tables readonly (const).
        case 'C':
          {
            ACE_SET_BITS (option_word_, CONSTANT);
            break;
          }
        // Enable debugging option.
        case 'd':
          {
            ACE_SET_BITS (option_word_, DEBUGGING);
            ACE_ERROR ((LM_ERROR,
                        "Starting program %n, version %s, with debugging on.\n",
                        version_string));
            break;
          }
        // Enable duplicate option.
        case 'D':
          {
            ACE_SET_BITS (option_word_, DUP);
            break;
          }
        // Allows user to provide keyword/attribute separator
        case 'e':
          {
            delimiters_ = getopt.opt_arg ();
            break;
          }
        case 'E':
          {
            ACE_SET_BITS (option_word_, ENUM);
            break;
          }
        // Generate the hash table ``fast.''
        case 'f':
          {
            ACE_SET_BITS (option_word_, FAST);
            iterations_ = ACE_OS::atoi (getopt.opt_arg ());
            if (iterations_ < 0)
              {
                ACE_ERROR ((LM_ERROR, "iterations value must not be negative, assuming 0\n"));
                iterations_ = 0;
              }
            break;
          }
        // Use the ``inline'' keyword for generated sub-routines.
        case 'g':
          {
            ACE_SET_BITS (option_word_, INLINE);
            break;
          }
        // Make the keyword table a global variable.
        case 'G':
          {
            ACE_SET_BITS (option_word_, GLOBAL);
            break;
          }
        // Displays a list of helpful Options to the user.
        case 'h':
          {
            ACE_OS::fprintf (stderr,
                             "-a\tGenerate ANSI standard C output code, i.e., function prototypes.\n"
			     "-b\tGenerate code for Linear Search.\n"
                             "-B\tGenerate code for Binary Search.\n"
                             "-c\tGenerate comparison code using strncmp rather than strcmp.\n"
                             "-C\tMake the contents of generated lookup tables constant, i.e., readonly.\n"
                             "-d\tEnables the debugging option (produces verbose output to the standard\n"
                             "\terror).\n"
                             "-D\tHandle keywords that hash to duplicate values.  This is useful\n"
                             "\tfor certain highly redundant keyword sets.\n"
                             "-e\tAllow user to provide a string containing delimiters used to separate\n"
                             "\tkeywords from their attributes.  Default is \",\\n\"\n"
                             "-E\tDefine constant values using an enum local to the lookup function\n"
                             "\trather than with defines\n"
                             "-f\tGenerate the gen-perf.hash function ``fast.''  This decreases GPERF's\n"
                             "\trunning time at the cost of minimizing generated table-size.\n"
                             "\tThe numeric argument represents the number of times to iterate when\n"
                             "\tresolving a collision.  `0' means ``iterate by the number of keywords.''\n"
                             "-F\tProvided expression will be used to assign default values in keyword\n"
                             "\ttable, i.e., the fill value.  Default is \"\".\n"
                             "-g\tMake generated routines use ``inline'' to remove function overhead.\n"
                             "-G\tGenerate the static table of keywords as a static global variable,\n"
                             "\trather than hiding it inside of the lookup function (which is the\n"
                             "\tdefault behavior).\n"
                             "-h\tPrints this message.\n"
                             "-H\tAllow user to specify name of generated hash function. Default\n"
                             "\tis `hash'.\n"
                             "-i\tProvide an initial value for the associate values array.  Default is 0.\n"
                             "-I\tGenerate comparison code using case insensitive string comparison, e.g.,\n"
                             "\tstrncasecmp or strcasecmp.\n"
                             "\tSetting this value larger helps inflate the size of the final table.\n"
                             "-j\tAffects the ``jump value,'' i.e., how far to advance the associated\n"
                             "\tcharacter value upon collisions.  Must be an odd number, default is %d.\n"
                             "-J\tSkips '#include <string.h>' part in the output.\n"
                             "-k\tAllows selection of the key positions used in the hash function.\n"
                             "\tThe allowable choices range between 1-%d, inclusive.  The positions\n"
                             "\tare separated by commas, ranges may be used, and key positions may\n"
                             "\toccur in any order.  Also, the meta-character '*' causes the generated\n"
                             "\thash function to consider ALL key positions, and $ indicates the\n"
                             "\t``final character'' of a key, e.g., $,1,2,4,6-10.\n"
                             "-K\tAllow use to select name of the keyword component in the keyword\n"
                             "\tstructure.\n"
                             "-l\tCompare key lengths before trying a string comparison.  This helps\n"
                             "\tcut down on the number of string comparisons made during the lookup.\n"
                             "-L\tGenerates code in the language specified by the option's argument.\n"
                             "\tLanguages handled are currently C++ and C.  The default is C.\n"
                             "-m\tAvoids the warning about identical hash values. This is valid\n"
                             "\tonly if the -D option is enabled.\n"
                             "-M\tSkips class definition in the output. This is valid only in C++ mode.\n"
                             "-n\tDo not include the length of the keyword when computing the hash\n"
                             "\tfunction.\n"
                             "-N\tAllow user to specify name of generated lookup function.  Default\n"
                             "\tname is `in_word_set.'\n"
                             "-o\tReorders input keys by frequency of occurrence of the key sets.\n"
                             "\tThis should decrease the search time dramatically.\n"
                             "-O\tOptimize the generated lookup function by assuming that all input\n"
                             "\tkeywords are members of the keyset from the keyfile.\n"
                             "-p\tChanges the return value of the generated function ``in_word_set''\n"
                             "\tfrom its default boolean value (i.e., 0 or 1), to type ``pointer\n"
                             "\tto wordlist array''  This is most useful when the -t option, allowing\n"
                             "\tuser-defined structs, is used.\n"
                             "-r\tUtilizes randomness to initialize the associated values table.\n"
                             "-s\tAffects the size of the generated hash table.  The numeric argument\n"
                             "\tfor this option indicates ``how many times larger or smaller'' the\n"
                             "\tassociated value range should be, in relationship to the number of\n"
                             "\tkeys, e.g. a value of 3 means ``allow the maximum associated value\n"
                             "\tto be about 3 times larger than the number of input keys.''\n"
                             "\tConversely, a value of -3 means ``make the maximum associated\n"
                             "\tvalue about 3 times smaller than the number of input keys. A\n"
                             "\tlarger table should decrease the time required for an unsuccessful\n"
                             "\tsearch, at the expense of extra table space.  Default value is 1.\n"
                             "-S\tCauses the generated C code to use a switch statement scheme, rather\n"
                             "\tthan an array lookup table.  This can lead to a reduction in both\n"
                             "\ttime and space requirements for some keyfiles.  The argument to\n"
                             "\tthis option determines how many switch statements are generated.\n"
                             "\tA value of 1 generates 1 switch containing all the elements, a value\n"
                             "\tof 2 generates 2 tables with 1/2 the elements in each table, etc.\n"
                             "\tThis is useful since many C compilers cannot correctly generate code\n"
                             "\tfor large switch statements.\n"
                             "-t\tAllows the user to include a structured type declaration for \n"
                             "\tgenerated code. Any text before %%%% is consider part of the type\n"
                             "\tdeclaration.  Key words and additional fields may follow this, one\n"
                             "\tgroup of fields per line.\n"
                             "-T\tPrevents the transfer of the type declaration to the output file.\n"
                             "\tUse this option if the type is already defined elsewhere.\n"
                             "-v\tPrints out the current version number and exits with a value of 0\n"
                             "-V\tExits silently with a value of 0.\n"
                             "-Z\tAllow user to specify name of generated C++ class.  Default\n"
                             "\tname is `Perfect_Hash.'\n",
                             DEFAULT_JUMP_VALUE,
                             MAX_KEY_POS - 1);
            Options::usage ();
            return -1;
          }
        // Sets the name for the hash function.
        case 'H':
          {
            hash_name_ = getopt.opt_arg ();
            break;
          }
        // Sets the initial value for the associated values array.
        case 'i':
          {
            initial_asso_value_ = ACE_OS::atoi (getopt.opt_arg ());
            if (initial_asso_value_ < 0)
              ACE_ERROR ((LM_ERROR,
                          "Initial value %d should be non-zero, ignoring and continuing.\n",
                          initial_asso_value_));
            if (option[RANDOM])
              ACE_ERROR ((LM_ERROR,
                          "warning, -r option superceeds -i, ignoring -i option and continuing\n"));
            break;
          }
         case 'I':
           {
             ACE_SET_BITS (option_word_, STRCASECMP);
             break;
           }
         // Sets the jump value, must be odd for later algorithms.
        case 'j':
          {
            jump_ = ACE_OS::atoi (getopt.opt_arg ());
            if (jump_ < 0)
              ACE_ERROR_RETURN ((LM_ERROR,
                                 "Jump value %d must be a positive number.\n%r",
                                 jump_,
                                 &Options::usage),
                                 -1);
            else if (jump_ && ACE_EVEN (jump_))
              ACE_ERROR ((LM_ERROR,
                          "Jump value %d should be odd, adding 1 and continuing...\n",
                          jump_++));
            break;
          }
        // Skip including the header file string.h.
        case 'J':
          {
            ACE_SET_BITS (option_word_, SKIPSTRINGH);
            break;
          }
        // Sets key positions used for hash function.
        case 'k':
          {
            const int BAD_VALUE = -1;
            int value;
            Iterator expand (getopt.opt_arg (),
                             1,
                             MAX_KEY_POS - 1,
                             WORD_END,
                             BAD_VALUE,
                             EOS);

            // Use all the characters for hashing!!!!
            if (*getopt.opt_arg () == '*')
              option_word_ = (option_word_ & ~DEFAULTCHARS) | ALLCHARS;
            else
              {
                char *l_key_pos;

                for (l_key_pos = key_positions_;
                     (value = expand ()) != EOS;
                     l_key_pos++)
                  if (value == BAD_VALUE)
                    ACE_ERROR_RETURN ((LM_ERROR,
                                       "Illegal key value or range, use 1,2,3-%d,'$' or '*'.\n%r",
                                       MAX_KEY_POS - 1,
                                       usage),
                                      -1);
                  else
                    *l_key_pos = value;;

                *l_key_pos = EOS;

                total_keysig_size_ = (l_key_pos - key_positions_);
                if (total_keysig_size_ == 0)
                  ACE_ERROR_RETURN ((LM_ERROR,
                                     "No keys selected.\n%r",
                                     &Options::usage),
                                    -1);
                else if (key_sort (key_positions_, total_keysig_size_) == 0)
                  ACE_ERROR_RETURN ((LM_ERROR,
                                     "Duplicate keys selected\n%r",
                                     &Options::usage),
                                    -1);
                if (total_keysig_size_ != 2
                    || (key_positions_[0] != 1
                        || key_positions_[1] != WORD_END))
                  ACE_CLR_BITS (option_word_, DEFAULTCHARS);
              }
            break;
          }
        // Make this the keyname for the keyword component field.
        case 'K':
          {
            key_name_ = getopt.opt_arg ();
            break;
          }
        // Create length table to avoid extra string compares.
        case 'l':
          {
            ACE_SET_BITS (option_word_, LENTABLE);
            break;
          }
        // Deal with different generated languages.
        case 'L':
          {
            option_word_ &= ~C;
            if (!ACE_OS::strcmp (getopt.opt_arg (), "C++"))
              ACE_SET_BITS (option_word_, (CPLUSPLUS | ANSI));
            else if (!ACE_OS::strcmp (getopt.opt_arg (), "C"))
              ACE_SET_BITS (option_word_, C);
            else
              {
                ACE_ERROR ((LM_ERROR,
                            "unsupported language option %s, defaulting to C\n",
                            getopt.opt_arg ()));
                ACE_SET_BITS (option_word_, C);
              }
            break;
          }
        // Don't print the warnings.
        case 'm':
          {
            ACE_SET_BITS (option_word_, MUTE);
            break;

?? 快捷鍵說明

復制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號 Ctrl + =
減小字號 Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频
欧美日韩亚洲国产综合| 国产精品色婷婷| 精品国产乱码久久久久久闺蜜| 精品va天堂亚洲国产| 亚洲激情综合网| 国产剧情一区在线| 欧美日韩综合在线免费观看| 国产无一区二区| 极品少妇一区二区三区精品视频| 在线视频欧美精品| 中文字幕第一页久久| 麻豆成人av在线| 欧美高清视频不卡网| 亚洲激情自拍视频| 91网站最新网址| 欧美国产激情一区二区三区蜜月| 奇米精品一区二区三区在线观看| 欧洲国产伦久久久久久久| 国产精品成人在线观看| 成人激情黄色小说| 中文乱码免费一区二区| 国内一区二区在线| 久久女同性恋中文字幕| 韩国视频一区二区| 久久女同精品一区二区| 国内成+人亚洲+欧美+综合在线| 欧美一区二区三区免费在线看| 亚洲永久免费视频| 欧美性色综合网| 一区二区三区成人在线视频| 91视频com| 亚洲免费观看在线视频| 91丨porny丨户外露出| 国产精品久久久久久久久晋中| 风间由美性色一区二区三区| 国产欧美一区二区精品性| 狠狠色狠狠色合久久伊人| 日韩欧美一区中文| 久久99国产精品麻豆| 精品国产髙清在线看国产毛片| 美女精品自拍一二三四| 欧美成人三级在线| 国内精品视频666| 国产欧美日韩视频一区二区| 福利电影一区二区| 亚洲欧美日韩国产另类专区| 色综合久久久久综合体桃花网| 亚洲乱码国产乱码精品精小说| 在线亚洲高清视频| 午夜电影一区二区三区| 日韩午夜av一区| 国产精品99久久久久久久女警| 国产农村妇女毛片精品久久麻豆| 99久久er热在这里只有精品66| 亚洲色欲色欲www| 欧美精品一卡两卡| 国产精一品亚洲二区在线视频| 国产精品国产三级国产a| 色综合久久99| 激情欧美一区二区| 亚洲日本va在线观看| 欧美日韩不卡在线| 国产精品1024久久| 亚洲最大的成人av| 精品国产91乱码一区二区三区| 东方aⅴ免费观看久久av| 一区二区三区中文在线| 欧美一区二区视频在线观看| 丁香天五香天堂综合| 亚洲亚洲精品在线观看| 国产亚洲欧美一区在线观看| 91美女精品福利| 久久99精品久久久| 亚洲欧美激情在线| 精品国产91久久久久久久妲己| 91亚洲午夜精品久久久久久| 免费成人在线网站| 亚洲欧美一区二区三区极速播放| 日韩欧美高清在线| 91.com在线观看| 国产91丝袜在线播放| 日韩二区三区四区| 国产精品乱码一区二区三区软件| 91麻豆精品国产91久久久资源速度| 粉嫩aⅴ一区二区三区四区| 日日夜夜一区二区| 最新热久久免费视频| 精品国产一区二区国模嫣然| 欧美无乱码久久久免费午夜一区| 国产在线精品一区在线观看麻豆| 亚洲成人福利片| 成人欧美一区二区三区白人| 日韩午夜电影av| 欧美高清视频一二三区| 一本一本大道香蕉久在线精品| 国产美女精品一区二区三区| 午夜精品爽啪视频| 夜夜精品浪潮av一区二区三区| 国产网红主播福利一区二区| 日韩视频免费直播| 欧美三级视频在线播放| av在线免费不卡| 国产成人啪午夜精品网站男同| 麻豆成人免费电影| 日本伊人午夜精品| 天天av天天翘天天综合网| 亚洲欧美怡红院| 亚洲男同性视频| **欧美大码日韩| 亚洲欧美激情小说另类| 亚洲日本在线观看| 亚洲视频一区在线| 成人免费小视频| 国产精品视频一二三区| 国产精品私人影院| 中文字幕亚洲成人| 国产精品久久久久久亚洲毛片 | 久久九九全国免费| 日韩欧美国产不卡| 久久理论电影网| 日本一区二区三区dvd视频在线 | 欧美丰满一区二区免费视频| 欧美午夜免费电影| 91精品国产aⅴ一区二区| 欧美高清精品3d| 精品国产一区二区亚洲人成毛片 | 欧美日韩亚洲综合在线| 欧美三级中文字幕在线观看| 欧美少妇性性性| 欧美浪妇xxxx高跟鞋交| 亚洲黄色av一区| 一区二区三区精品视频| 亚洲午夜精品在线| 免费人成在线不卡| 国产不卡视频在线播放| 99re6这里只有精品视频在线观看| 色噜噜久久综合| 欧美日韩一区二区欧美激情| 欧美一级一区二区| 久久精品亚洲精品国产欧美| 国产精品水嫩水嫩| 午夜日韩在线电影| 黑人巨大精品欧美黑白配亚洲| 成人免费毛片片v| 欧美日韩一区二区三区视频 | 欧美日韩免费视频| 欧美成人午夜电影| 亚洲色图一区二区三区| 首页国产欧美日韩丝袜| 国产一区二区三区精品欧美日韩一区二区三区| 国产精品一区二区久久不卡 | 亚洲图片欧美综合| 韩国av一区二区三区四区| 日本韩国一区二区| 欧美va亚洲va香蕉在线| 亚洲欧洲韩国日本视频| 麻豆精品视频在线| 99久久精品国产观看| 91麻豆精品国产91久久久久久久久| 久久久国际精品| 午夜在线成人av| jlzzjlzz亚洲日本少妇| 日本一区二区三区久久久久久久久不 | 国产精品久久看| 日韩**一区毛片| 91丨九色porny丨蝌蚪| 26uuu色噜噜精品一区| 夜夜揉揉日日人人青青一国产精品| 韩国三级电影一区二区| 这里只有精品免费| 亚洲免费观看高清完整版在线观看熊 | 日本不卡一区二区三区高清视频| 国产乱码精品一区二区三| 欧美视频一区二区三区在线观看| 国产亚洲精品资源在线26u| 亚洲超丰满肉感bbw| 成人精品亚洲人成在线| 亚洲精品一区二区三区四区高清| 玉足女爽爽91| 国产成人一区在线| 2023国产一二三区日本精品2022| 亚洲一级二级在线| 99国产精品国产精品久久| 2020国产精品| 蜜臀久久99精品久久久久久9| 色吊一区二区三区| 成人免费在线观看入口| 国产在线国偷精品产拍免费yy| 69成人精品免费视频| 一区二区三区欧美激情| 成人激情小说网站| 中文天堂在线一区| 国产高清不卡二三区| 欧美sm美女调教| 日一区二区三区| 欧美一区二区高清| 久久99精品久久久久| 精品欧美乱码久久久久久1区2区| 五月天亚洲婷婷| 3d成人动漫网站|