本文整理汇总了C++中hash_set类的典型用法代码示例。如果您正苦于以下问题:C++ hash_set类的具体用法?C++ hash_set怎么用?C++ hash_set使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
在下文中一共展示了hash_set类的20个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的C++代码示例。
示例1: calculaCertos
// Alínea D
int Aposta::calculaCertos(const hash_set<int> &sorteio) const{
hash_set<int>::iterator it;
int c =0;
for (it=numeros.begin(); it!=numeros.end(); it++)
if (sorteio.find(*it)!=sorteio.end()) c++;
return c;
}
开发者ID:andrefreitas,项目名称:feup-aeda,代码行数:8,代码来源:Aposta.cpp
示例2: updateHelper
static void updateHelper (SLE::ref entry,
hash_set< uint256 >& seen,
OrderBookDB::IssueToOrderBook& destMap,
OrderBookDB::IssueToOrderBook& sourceMap,
hash_set< Issue >& XDVBooks,
int& books)
{
if (entry->getType () == ltDIR_NODE &&
entry->isFieldPresent (sfExchangeRate) &&
entry->getFieldH256 (sfRootIndex) == entry->getIndex())
{
Book book;
book.in.currency.copyFrom (entry->getFieldH160 (sfTakerPaysCurrency));
book.in.account.copyFrom (entry->getFieldH160 (sfTakerPaysIssuer));
book.out.account.copyFrom (entry->getFieldH160 (sfTakerGetsIssuer));
book.out.currency.copyFrom (entry->getFieldH160 (sfTakerGetsCurrency));
uint256 index = getBookBase (book);
if (seen.insert (index).second)
{
auto orderBook = std::make_shared<OrderBook> (index, book);
sourceMap[book.in].push_back (orderBook);
destMap[book.out].push_back (orderBook);
if (isXDV(book.out))
XDVBooks.insert(book.in);
++books;
}
}
}
开发者ID:xdv,项目名称:divvyd,代码行数:29,代码来源:OrderBookDB.cpp
示例3: print
void print(hash_set &S) {
iterator_t p = S.begin();
while(p!=S.end()) {
cout << S.retrieve(p) << " ";
p = S.next(p);
}
cout << endl;
}
开发者ID:Malows,项目名称:aedcode,代码行数:8,代码来源:tryhset2.cpp
示例4: srand
void LinearSNNClassifier::checkgradRowSparse(const vector<Example>& examples, mat& Wd, const mat& gradWd, const string& mark, int iter,
const hash_set<int>& sparseRowIndexes, const mat& ft) {
//Random randWdRowcheck = new Random(iter + "Row".hashCode() + hash));
int charseed = mark.length();
for (int i = 0; i < mark.length(); i++) {
charseed = (int) (mark[i]) * 5 + charseed;
}
srand(iter + charseed);
std::vector<int> idRows, idCols;
idRows.clear();
idCols.clear();
if (sparseRowIndexes.empty()) {
for (int i = 0; i < Wd.n_rows; ++i)
idRows.push_back(i);
} else {
hash_set<int>::iterator it;
for (it = sparseRowIndexes.begin(); it != sparseRowIndexes.end(); ++it)
idRows.push_back(*it);
}
for (int idx = 0; idx < Wd.n_cols; idx++)
idCols.push_back(idx);
random_shuffle(idRows.begin(), idRows.end());
random_shuffle(idCols.begin(), idCols.end());
int check_i = idRows[0], check_j = idCols[0];
double orginValue = Wd(check_i, check_j);
Wd(check_i, check_j) = orginValue + 0.001;
double lossAdd = 0.0;
for (int i = 0; i < examples.size(); i++) {
Example oneExam = examples[i];
lossAdd += computeScore(oneExam);
}
Wd(check_i, check_j) = orginValue - 0.001;
double lossPlus = 0.0;
for (int i = 0; i < examples.size(); i++) {
Example oneExam = examples[i];
lossPlus += computeScore(oneExam);
}
double mockGrad = (lossAdd - lossPlus) / (0.002 * ft(check_i, check_j));
mockGrad = mockGrad / examples.size();
double computeGrad = gradWd(check_i, check_j);
printf("Iteration %d, Checking gradient for %s[%d][%d]:\t", iter, mark.c_str(), check_i, check_j);
printf("mock grad = %.18f, computed grad = %.18f\n", mockGrad, computeGrad);
Wd(check_i, check_j) = orginValue;
}
开发者ID:SUTDNLP,项目名称:NNTransitionParser,代码行数:53,代码来源:LinearSNNClassifier.cpp
示例5: main
int main(){
for(int i=0;i<100;i++){
tab.insert(2*i + 1);
}
for(hash_set<int>::iterator iter = tab.begin();
iter!=tab.end();
iter++){
cout<<(*iter)<<" ";
}
cout<<endl;
return 0;
}
开发者ID:ZhouWeikuan,项目名称:zoj,代码行数:14,代码来源:hash_set.cpp
示例6: trim_entropy_filter
int trim_entropy_filter(vector<string>* keep_words, hash_set<string>& cad_words_set, WordInfoMap& wordinfo_map)
{
keep_words->reserve(cad_words_set.size());
for (hash_set<string>::iterator it = cad_words_set.begin(); it != cad_words_set.end(); ++it) {
WordInfoMap::iterator it_map = wordinfo_map.find(*it);
if (it_map == wordinfo_map.end()) {
fprintf(stderr, "WARNING, word[%s] in cad_word, not in word_info", it->c_str());
continue;
}
if (it_map->first.size() <= WORD_LEN - 4 && it_map->second.calc_is_keep()) {
keep_words->push_back(*it);
}
}
return 0;
}
开发者ID:HelloWorldCAT,项目名称:yaha,代码行数:15,代码来源:segword.cpp
示例7: markReachableFunctionsExternallyAccessible
void TDDataStructures::markReachableFunctionsExternallyAccessible(DSNode *N,
hash_set<DSNode*> &Visited) {
if (!N || Visited.count(N)) return;
Visited.insert(N);
for (unsigned i = 0, e = N->getNumLinks(); i != e; ++i) {
DSNodeHandle &NH = N->getLink(i);
if (DSNode *NN = NH.getNode()) {
std::vector<const Function*> Functions;
NN->addFullFunctionList(Functions);
ArgsRemainIncomplete.insert(Functions.begin(), Functions.end());
markReachableFunctionsExternallyAccessible(NN, Visited);
}
}
}
开发者ID:brills,项目名称:pfpa,代码行数:15,代码来源:TopDownClosure.cpp
示例8: ReadNum
void ReadNum(ifstream &input,hash_set<long> &myset)
{
long num;
while(!input.fail()){
input>>num;
myset.insert(num);
}
}
开发者ID:chungjin,项目名称:Algorithms-Design-and-Analysis-Part-1,代码行数:8,代码来源:1.cpp
示例9: static_string
static_string () {
if (!s_static_string_set) {
s_static_string_set = VNEW hash_set<string>;
}
string value ( "" );
const string &v = s_static_string_set->insert ( value );
m_str = v.c_str();
}
开发者ID:vengine,项目名称:xhnSTL,代码行数:8,代码来源:xhn_static_string.hpp
示例10: static_string
static_string ( const char *str ) {
euint32 hash_value = calc_hashnr ( str, _strlen ( str ) );
xhn::hash_set<string>::bucket& b = s_static_string_set.get_bucket(hash_value);
{
SpinLock::Instance inst = b.m_lock.Lock();
xhn::list<xhn::string>::iterator iter = b.begin();
xhn::list<xhn::string>::iterator end = b.begin();
for (; iter != end; iter++) {
if (*iter == str) {
m_str = (*iter).c_str();
return;
}
}
}
string value ( str );
const string &v = s_static_string_set.insert ( value );
m_str = v.c_str();
}
开发者ID:vengine,项目名称:XGC,代码行数:18,代码来源:xhn_static_string.hpp
示例11: ComputePostOrder
void TDDataStructures::ComputePostOrder(const Function* F,
hash_set<DSGraph*> &Visited,
std::vector<DSGraph*> &PostOrder) {
if (F->isDeclaration()) return;
DSGraph* G = getOrFetchDSGraph(F);
if (Visited.count(G)) return;
Visited.insert(G);
// Recursively traverse all of the callee graphs.
for (DSGraph::fc_iterator CI = G->fc_begin(), CE = G->fc_end(); CI != CE; ++CI){
Instruction *CallI = CI->getCallSite().getInstruction();
for (calleeTy::iterator I = callee.begin(CallI),
E = callee.end(CallI); I != E; ++I)
ComputePostOrder(*I, Visited, PostOrder);
}
PostOrder.push_back(G);
}
开发者ID:brills,项目名称:pfpa,代码行数:18,代码来源:TopDownClosure.cpp
示例12: containsArrayOps
bool containsArrayOps(const ASTNode& n, hash_set<int> & visited)
{
if (n.GetIndexWidth() > 0)
return true;
if (n.Degree() ==0)
return false;
if (visited.find(n.GetNodeNum()) != visited.end())
return false;
visited.insert(n.GetNodeNum());
for (int i =0; i < n.Degree();i++)
if (containsArrayOps(n[i],visited))
return true;
return false;
}
开发者ID:chubbymaggie,项目名称:Tac-Symbolic-Executor,代码行数:19,代码来源:ASTmisc.cpp
示例13: ComputeNodesReachableFrom
/// ComputeNodesReacahbleFrom - Compute the set of nodes in the specified
/// inverse graph that are reachable from N. This is a simple depth first
/// search.
///
static void ComputeNodesReachableFrom(DSNode *N,
std::set<std::pair<DSNode*,DSNode*> > &InverseGraph,
hash_set<const DSNode*> &Reachable) {
if (!Reachable.insert(N).second) return; // Already visited!
std::set<std::pair<DSNode*,DSNode*> >::iterator I =
InverseGraph.lower_bound(std::make_pair(N, (DSNode*)0));
for (; I != InverseGraph.end() && I->first == N; ++I)
ComputeNodesReachableFrom(I->second, InverseGraph, Reachable);
}
开发者ID:brills,项目名称:pfpa,代码行数:14,代码来源:StructureFieldVisitor.cpp
示例14: numberOfReadsLessThan
// counts the number of reads. Shortcut when we get to the limit.
void numberOfReadsLessThan(const ASTNode& n, hash_set<int>& visited, int& soFar,
const int limit)
{
if (n.isAtom())
return;
if (visited.find(n.GetNodeNum()) != visited.end())
return;
if (n.GetKind() == READ)
soFar++;
if (soFar > limit)
return;
visited.insert(n.GetNodeNum());
for (size_t i = 0; i < n.Degree(); i++)
numberOfReadsLessThan(n[i], visited, soFar, limit);
}
开发者ID:cambridgehackers,项目名称:stp,代码行数:21,代码来源:ASTmisc.cpp
示例15: getNB
void getNB(HashGraph* G, int v, int distance, hash_set<int>& result, vector<bool>& mark)
{
assert(distance==1 || distance==2);
EdgeMap* p_neighbors=G->getNeighbors(v);
EdgeMap::iterator pnb;
for (pnb=p_neighbors->begin(); pnb!=p_neighbors->end(); pnb++)
{
UINT w=pnb->first;
if(!mark[w])
result.insert(w);
}
if(distance==1)
return;
hash_set<int>::iterator p;
vector<int> temp;
for(p=result.begin(); p!=result.end(); p++)
temp.push_back(*p);
int imnb_size=result.size();
//result.clear();
for(int i=0; i<imnb_size; i++)
{
p_neighbors=G->getNeighbors(temp[i]);
for (pnb=p_neighbors->begin(); pnb!=p_neighbors->end(); pnb++)
{
UINT w=pnb->first;
if(!mark[w])
result.insert(w); //automatically handel duplication.
}
}
for(int i=0; i<imnb_size; i++)
result.erase(temp[i]);
}
开发者ID:renqHIT,项目名称:Tale,代码行数:35,代码来源:query.cpp
示例16: support
void support(const ast &t, std::set<std::string> &res, hash_set<ast> &memo){
if(memo.find(t) != memo.end()) return;
memo.insert(t);
int nargs = num_args(t);
for(int i = 0; i < nargs; i++)
support(arg(t,i),res,memo);
switch(op(t)){
case Uninterpreted:
if(nargs == 0 || !is_tree) {
std::string name = string_of_symbol(sym(t));
res.insert(name);
}
break;
case Forall:
case Exists:
support(get_quantifier_body(t),res,memo);
break;
default:;
}
}
开发者ID:greatmazinger,项目名称:z3,代码行数:22,代码来源:iz3checker.cpp
示例17: mapNodes
void Query::mapNodes(vector<Neighborhood>& nbs, HashGraph* Gdb, OrthologInfoList* pOrthinfolist_db, hash_set<int>& Sq, hash_set<int>& Sdb, GraphMatch* gm, Queue& Q, hash_set<int>& nodesInQ, vector<bool>& mark, vector<bool>& dbmark)
{
hash_set<int>::iterator p;
hash_map< int, vector<int>, inthash > lmap_q, lmap_db;
for(p=Sq.begin(); p!=Sq.end(); p++)
{
for(unsigned int i=0; i<(*pOrthinfolist)[*p].size(); i++)
{
if((*pOrthinfolist)[*p][i]==0)
continue;
lmap_q[(*pOrthinfolist)[*p][i]].push_back(*p);
}
}
for(p=Sdb.begin(); p!=Sdb.end(); p++)
{
if(!dbmark[*p])
{
for(unsigned int i=0; i<(*pOrthinfolist_db)[*p].size(); i++)
{
if((*pOrthinfolist_db)[*p][i]==0)
continue;
lmap_db[(*pOrthinfolist_db)[*p][i]].push_back(*p);
}
}
}
hash_map<int, vector<int>, inthash>::iterator iter, iter2;
for(iter=lmap_q.begin(); iter!=lmap_q.end(); iter++)
{
iter2=lmap_db.find(iter->first);
if(iter2==lmap_db.end())
continue;
else
mapNodesHelp(nbs, Gdb, pOrthinfolist_db, iter->second, iter2->second, gm, Q, nodesInQ, mark, dbmark);
}
}
开发者ID:renqHIT,项目名称:Tale,代码行数:37,代码来源:query.cpp
示例18: gen_trim_entropy
int gen_trim_entropy(hash_set<string>& cad_words_set, WordInfoMap* wordinfo_map)
{
for (WordInfoMap::iterator it = wordinfo_map->begin(); it != wordinfo_map->end(); ++it) {
string& word = const_cast<string&>(it->first);
uint32_t freq = it->second.freq;
if (word.length() >= 3 * 2) {//三个汉字,abc,插入词bc's left trim a,插入词ab's right trim c
string left_trim(word.begin(), word.begin() + 2);
string right_part(word.begin() + 2, word.end());
if (cad_words_set.find(right_part) != cad_words_set.end()) {
WordInfoMap::iterator it_r = wordinfo_map->find(right_part);
if (it_r == wordinfo_map->end()) {
fprintf(stderr, "WARNING, word[%s] in cad word, not in word_info", right_part.c_str());
continue;
}
it_r->second.left_trim[left_trim] += freq;
#ifdef DEBUG
fprintf(stderr, "DEBUG, word[%s],left_trim[%s]\n", word.c_str(), left_trim.c_str());
#endif
}
string right_trim(word.end() - 2, word.end());
string left_part(word.begin(), word.end() - 2);
if (cad_words_set.find(left_part) != cad_words_set.end()) {
WordInfoMap::iterator it_l = wordinfo_map->find(left_part);
if (it_l == wordinfo_map->end()) {
fprintf(stderr, "WARNING, word[%s] in cad_word, not in word_info", left_part.c_str());
continue;
}
it_l->second.right_trim[right_trim] += freq;
#ifdef DEBUG
fprintf(stderr, "DEBUG, word[%s],right_trim[%s]\n", word.c_str(), right_trim.c_str());
#endif
}
}
}
return 0;
}
开发者ID:HelloWorldCAT,项目名称:yaha,代码行数:36,代码来源:segword.cpp
示例19: terminated
/*! \brief Returns lists of applications to be asked to quit on shutdown.
\param userApps List of RosterAppInfos identifying the user applications.
Those will be ask to quit first.
\param systemApps List of RosterAppInfos identifying the system applications
(like Tracker and Deskbar), which will be asked to quit after the
user applications are gone.
\param vitalSystemApps A set of team_ids identifying teams that must not
be terminated (app server and registrar).
\return \c B_OK, if everything went fine, another error code otherwise.
*/
status_t
TRoster::GetShutdownApps(AppInfoList& userApps, AppInfoList& systemApps,
AppInfoList& backgroundApps, hash_set<team_id>& vitalSystemApps)
{
BAutolock _(fLock);
status_t error = B_OK;
// get the vital system apps:
// * ourself
// * kernel team
// * app server
// * debug server
// ourself
vitalSystemApps.insert(be_app->Team());
// kernel team
team_info teamInfo;
if (get_team_info(B_SYSTEM_TEAM, &teamInfo) == B_OK)
vitalSystemApps.insert(teamInfo.team);
// app server
RosterAppInfo* info
= fRegisteredApps.InfoFor("application/x-vnd.haiku-app_server");
if (info != NULL)
vitalSystemApps.insert(info->team);
// debug server
info = fRegisteredApps.InfoFor("application/x-vnd.haiku-debug_server");
if (info != NULL)
vitalSystemApps.insert(info->team);
// populate the other groups
for (AppInfoList::Iterator it(fRegisteredApps.It());
RosterAppInfo* info = *it; ++it) {
if (vitalSystemApps.find(info->team) == vitalSystemApps.end()) {
RosterAppInfo* clonedInfo = info->Clone();
if (clonedInfo) {
if (_IsSystemApp(info)) {
if (!systemApps.AddInfo(clonedInfo))
error = B_NO_MEMORY;
} else if (info->flags & B_BACKGROUND_APP) {
if (!backgroundApps.AddInfo(clonedInfo))
error = B_NO_MEMORY;
} else {
if (!userApps.AddInfo(clonedInfo))
error = B_NO_MEMORY;
}
if (error != B_OK)
delete clonedInfo;
} else
error = B_NO_MEMORY;
}
if (error != B_OK)
break;
}
// Special case, we add the input server to vital apps here so it is
// not excluded in the lists above
info = fRegisteredApps.InfoFor("application/x-vnd.Be-input_server");
if (info != NULL)
vitalSystemApps.insert(info->team);
// clean up on error
if (error != B_OK) {
userApps.MakeEmpty(true);
systemApps.MakeEmpty(true);
}
return error;
}
开发者ID:looncraz,项目名称:haiku,代码行数:85,代码来源:TRoster.cpp
示例20: fun
int fun(){
ut i, t;
Node one = {0}, next;
tab.clear();
for(i=0;i<SIZ;i++){
cin>>t;
if(t){
one.m |= (1<<i);
one.s++;
}
}
priority_queue<Node, vector<Node>, Node::cmp> q;
q.push(one);
while(!q.empty()){
one=q.top(); q.pop();
if(one.m == 0)
break;
for(i=0;i<SIZ;i++){
next = one;
next.o |= (1<<i);
set(next,i);
if(tab.find(next.m) == tab.end()){
q.push(next);
tab.insert(next.m);
}
}
}
output(one.o);
return 0;
}
开发者ID:ZhouWeikuan,项目名称:zoj,代码行数:30,代码来源:1354.cpp
注:本文中的hash_set类示例由纯净天空整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。 |
请发表评论