C++ (Cpp) bf Examples

Example #1

0

Show file

File: avl.c Project: shijith/toy

void deletes(int n)
{
				struct node *par = 0;
				temp = root;
				par = find_pos(n, root);
				if(temp -> data == n) {
								if( par -> left == temp){
												if(temp -> right == 0)
																par ->left = temp -> left;
												else if(temp -> left == 0)
																par ->left = temp -> right;
												else {
																del_min();
												}
								} else if(par -> right == temp) {
												if(temp -> right == 0)
																par ->right = temp -> left;
												else if(temp -> left == 0)
																par ->right = temp -> right;
												else {
																del_min();
												}
								}	else {
												printf("root changed\n");
												if(root -> right == 0)
																root = root -> left;
												else
																del_min();

								}
								
				} 
				bf(par);
				
}

Example #2

0

Show file

File: avl.c Project: shijith/toy

void bf(struct node *p)
{
				struct node *l, *r;
				int bal;
				if(p) {
						bal = counts(p -> left) - counts(p -> right);
						if(bal == 2 || bal == -2) {
								printf("%d %d\n", p -> data, bal);
								if(bal == 2) {
										if(l = p -> left) {
												bal = counts(l -> left) - counts(l -> right);
														if(bal >= 0)
																rot_r(p -> left, p);
														else {	
																rot_l(p -> left -> right, p -> left);
																rot_r(p -> left, p); 	
														}
										}
								} else {
										if(r = p -> right) {
												bal = counts(r -> left) - counts(r -> right);
												if(bal > 0) {
														rot_r(p -> right -> left, p -> right);
														rot_l(p -> right, p);
												} else
														rot_l(p -> right, p);
										}
								}
						} else
								bf(p -> parent);
			}
}

Example #3

0

Show file

File: libkvirijndael.cpp Project: CardinalSins/KVIrc

bool KviMircryptionEngine::doEncryptCBC(KviCString & plain, KviCString & encoded)
{
	// make sure it is a multiple of 8 bytes (eventually pad with zeroes)
	if(plain.len() % 8)
	{
		int oldL = plain.len();
		plain.setLen(plain.len() + (8 - (plain.len() % 8)));
		char * padB = plain.ptr() + oldL;
		char * padE = plain.ptr() + plain.len();
		while(padB < padE)
			*padB++ = 0;
	}

	int ll = plain.len() + 8;
	unsigned char * in = (unsigned char *)KviMemory::allocate(ll);

	InitVectorEngine::fillRandomIV(in, 8);

	KviMemory::copy(in + 8, plain.ptr(), plain.len());

	// encrypt
	unsigned char * out = (unsigned char *)KviMemory::allocate(ll);
	BlowFish bf((unsigned char *)m_szEncryptKey.ptr(), m_szEncryptKey.len());
	bf.ResetChain();
	bf.Encrypt(in, out, ll, BlowFish::CBC);
	KviMemory::free(in);

	encoded.bufferToBase64((const char *)out, ll);
	KviMemory::free(out);

	encoded.prepend('*'); // prepend the signature

	return true;
}

Example #4

0

Show file

File: find-boundary-components.C Project: gberti/gral

void find_boundary_component_germs(GRID const& G, FACETSET & C,
				   int& num_comps, int& num_facets)

{
  typedef GRID                          grid_type;
  typedef grid_types<GRID>              gt;
  typedef typename gt::Facet            Facet;
  typedef typename gt::FacetIterator    FacetIterator;
  typedef iscellinside_pred<grid_type>  inside;
  typedef BoundaryComponentEdgeIterator2D<grid_type, inside> BCFacetIterator;

  partial_grid_function<Facet,bool> marked(G,false);

  num_comps = num_facets = 0;
  for(FacetIterator f = G.FirstFacet(); ! f.IsDone(); ++f)
    if( (! marked(*f))  && (G.IsOnBoundary(*f))) {
      C.push_back(*f);
      num_comps++;
      BCFacetIterator bf(*f,inside(G));
      while(! bf.IsDone()) {
	num_facets++;
	marked[*bf] = true;
	++bf;
      }
    }
}

Example #5

0

Show file

File: pair_reads.cpp Project: LTLA/csaw

SEXP get_leftovers (SEXP bam, SEXP index, SEXP processed) try { 
    BamFile bf(bam, index);
    BamRead br;

    if (!isString(processed)) { throw std::runtime_error("names of processed chromosomes should be strings"); }
    const int nchr=LENGTH(processed);
    std::set<std::string> already_there;
    for (int i=0; i<nchr; ++i) {
        already_there.insert(std::string(CHAR(STRING_ELT(processed, i))));        
    }

    // Getting the reads mapped to chromosomes we didn't look at due to 'restrict'.
    int leftovers=0;
    std::set<std::string>::iterator iat;
    for (int cid=0; cid<bf.header->n_targets; ++cid) {
        iat=already_there.find(std::string(bf.header->target_name[cid]));
        if (iat!=already_there.end()) { continue; }
        BamIterator biter(bf, cid, 0, bf.header->target_len[cid]);
        while (bam_itr_next(bf.in, biter.iter, br.read) >= 0){ ++leftovers; }
    } 
    
    // Also getting the unmapped guys. 
    BamIterator biter(bf);
    while (bam_itr_next(bf.in, biter.iter, br.read) >= 0){ ++leftovers; }
    return(ScalarInteger(leftovers));
} catch (std::exception &e) {
    return mkString(e.what());
}

Example #6

0

Show file