bit

安装oracle出现环境不满足最低要求

旧街凉风 提交于 2020-01-22 23:44:20
安装win64_11gR2_database_1of2的时候出现这个,百度了下解决方法 在oracle安装包找到stage文件夹 然后找到cvu 然后在cvu里面找到cvu_prereq,用记事本打开 增加以下内容 <OPERATING_SYSTEM RELEASE="6.2"> <VERSION VALUE="3"/> <ARCHITECTURE VALUE="32-bit"/> <NAME VALUE="Windows 10"/> <ENV_VAR_LIST> <ENV_VAR NAME="PATH" MAX_LENGTH="1023" /> </ENV_VAR_LIST> </OPERATING_SYSTEM> 这一段和上面的最主要的不同就是6.2和window10 如何你安装的是64位的,则将32-bit改成64bit就可以了,改动后保存。重新点击setup.exe就不会出项这个错误提示了。 来源: https://www.cnblogs.com/qncl/p/8538695.html

自定义实现的布隆过滤器

半腔热情 提交于 2020-01-22 21:16:00
自定义实现的布隆过滤器 布隆过滤器是一种检索一个元素是否在一个集合中的算法,它的优点是空间效率和查询时间都比一般的算法要好的多,缺点是有一定的误识别率。 它能准确判断一个元素不在集合中,大概率判断一个元素在集合中。 基本原理 布隆过滤器数据结构布隆过滤器是一个 bit 向量或者说 bit 数组,长这样: 如果我们要映射一个值到布隆过滤器中,我们需要使用多个不同的哈希函数生成多个哈希值,并对每个生成的哈希值指向的 bit 位置 1,例如针对值 “baidu” 和三个不同的哈希函数分别生成了哈希值 0、3、6,则上图转变为: Ok,我们现在再存一个值 “tencent”,如果哈希函数返回 2、3、7 的话,图继续变为: 值得注意的是,3 这个 bit 位由于两个值的哈希函数都返回了这个 bit 位,因此它被覆盖了。现在我们如果想查询 “dianping” 这个值是否存在,哈希函数返回了 0、4、7三个值,结果我们发现 4 这个 bit 位上的值为 0,说明没有任何一个值映射到这个 bit 位上,因此我们可以很确定地说 “dianping” 这个值不存在。而当我们需要查询 “baidu” 这个值是否存在的话,那么哈希函数必然会返回 1、4、7,然后我们检查发现这三个 bit 位上的值均为 1,那么我们可以说 “baidu” 存在了么?答案是不可以,只能是 “baidu” 这个值可能存在。

linux MMC framework(2) - sdhci host driver

假如想象 提交于 2020-01-22 08:27:00
了解 sdhci host driver. 1.概述   The MultiMediaCard (MMC)/ Secure Digital (SD)/ Secure Digital Input Output (SDIO) host driver implements a standard Linux driver interface to the ultra MMC/SD host controller (microSDHC). The host driver is part of the Linux kernel MMC framework. 1.1.Kernel configuration You can manage the MMC driver support through the kernel configuration options: MMC/SD/SDIO (CONFIG_MMC) MMC block (CONFIG_MMC_BLOCK) Secure Digital Host Controller Interface support (CONFIG_MMC_SDHCI) SDHCI support on the platform-specific bus (CONFIG_MMC_SDHCI_PLTFM) 2.数据结构 2.1.struct sdhci_host

Microsoft Office 2010 Technical Preview - 测试邀请

痞子三分冷 提交于 2020-01-21 22:39:28
上午收到了来自"The Microsoft Office team"的测试邀请, 邀请内容如下: Welcome! We are pleased to invite you into the Technical Preview program to be among the first people in the world to experience Microsoft® Office 2010. The following link will bring you to Microsoft Connect, where you will find downloads available for early, pre-release versions of Microsoft Office 2010 products. You will also find product information and have the chance to participate in newsgroups to engage with our product teams and other program participants. Please note that there is no technical support offered for this program. To get

HDU5536 Chip Factory

ε祈祈猫儿з 提交于 2020-01-21 18:52:41
题意: 给出一个数组 \(s\) ,求 \[ max_{i,j,k}(s_i + s_j)\oplus s_k ,i\neq j\neq k \] 思路: 01字典树,首先还是正常插入。可以想到枚举 \(i\) 、 \(j\) 的和,再字典树跑 \(k\) ,这里涉及下标不能相同,所以可以把 \(i\) 、 \(j\) ,先删除了。在插入的时候计数 \(cnt[u]++\) ,删除就依次把到达的各点 \(cnt[u]--\) 。跑 \(k\) 的时候判断是否可到达即可。 #include<bits/stdc++.h> using namespace std; const int N = 100010; const int inf = 0X3f3f3f3f; const long long INF = 0x3f3f3f3f3f3f3f3f; const double eps = 1e-6; const double pi = acos(-1.0); const int mod = 1000000007; typedef long long ll; int _; int n; int a[1010]; int tri[32 * 1010][2]; int cnt[32 * 1010], val[32 * 1010]; int tot; void init() { memset(tri,

2019 SDN上机第7次作业

瘦欲@ 提交于 2020-01-19 20:38:04
1.补充并运行basic代码 根据 P4教程 ,将 basic 和 basic_tunnel 两个案例程序补充完整,成功运行。 补充Basic代码: /* -*- P4_16 -*- */ #include <core.p4> #include <v1model.p4> const bit<16> TYPE_IPV4 = 0x800; /************************************************************************* *********************** H E A D E R S *********************************** *************************************************************************/ typedef bit<9> egressSpec_t; typedef bit<48> macAddr_t; typedef bit<32> ip4Addr_t; header ethernet_t { macAddr_t dstAddr; macAddr_t srcAddr; bit<16> etherType; } header ipv4_t { bit<4> version; bit<4> ihl;

bit-field in C++

心不动则不痛 提交于 2020-01-19 05:26:57
bit-field in CXX Declares a class data member with explicit size, in bits. Adjacent bit field members may be packed to share and straddle the individual bytes. A bit filed declaration is a class data member declaration which uses the following declarator: identifier(optional) attr(optional) : size (1) identifier(optional) attr(optional) : size brace-or-equal-initializer (2) (since C++ 20) The type of the bit field is introduced by the decl-specifier-seq of the declaration syntax. attr(C++11) - optional sequence of any number of attributes. identifier - the name of the bit field that it being

Bit hack to generate all integers with a given number of 1s

心不动则不痛 提交于 2020-01-18 22:52:12
问题 I forgot a bit hack to generate all integers with a given number of 1s. Does anybody remember it (and probably can explain it also)? 回答1: From Bit Twiddling Hacks Update Test program Live On Coliru #include <utility> #include <iostream> #include <bitset> using I = uint8_t; auto dump(I v) { return std::bitset<sizeof(I) * __CHAR_BIT__>(v); } I bit_twiddle_permute(I v) { I t = v | (v - 1); // t gets v's least significant 0 bits set to 1 // Next set to 1 the most significant bit to change, // set

Bit hack to generate all integers with a given number of 1s

一笑奈何 提交于 2020-01-18 22:39:59
问题 I forgot a bit hack to generate all integers with a given number of 1s. Does anybody remember it (and probably can explain it also)? 回答1: From Bit Twiddling Hacks Update Test program Live On Coliru #include <utility> #include <iostream> #include <bitset> using I = uint8_t; auto dump(I v) { return std::bitset<sizeof(I) * __CHAR_BIT__>(v); } I bit_twiddle_permute(I v) { I t = v | (v - 1); // t gets v's least significant 0 bits set to 1 // Next set to 1 the most significant bit to change, // set

Bit hack to generate all integers with a given number of 1s

久未见 提交于 2020-01-18 22:38:47
问题 I forgot a bit hack to generate all integers with a given number of 1s. Does anybody remember it (and probably can explain it also)? 回答1: From Bit Twiddling Hacks Update Test program Live On Coliru #include <utility> #include <iostream> #include <bitset> using I = uint8_t; auto dump(I v) { return std::bitset<sizeof(I) * __CHAR_BIT__>(v); } I bit_twiddle_permute(I v) { I t = v | (v - 1); // t gets v's least significant 0 bits set to 1 // Next set to 1 the most significant bit to change, // set