当前位置: 首页>>代码示例>>C++>>正文

C++ BitString::get_length方法代码示例

本文整理汇总了C++中BitString::get_length方法的典型用法代码示例。如果您正苦于以下问题：C++ BitString::get_length方法的具体用法？C++ BitString::get_length怎么用？C++ BitString::get_length使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BitString的用法示例。


在下文中一共展示了BitString::get_length方法的4个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。

示例1: Exists

bool QuadTree_S::Exists(const BitString &code, int x, int y) {
	DeltaCode delta;
	uint64_t cur = 0;
	long long nodes = delta.DecodeNextInt(code, &cur);
	long long size = code.get_length();
	long long nextIndx = 0;
	long long begRow = 0, begCol = 0, endRow = nodes, endCol = nodes;
	long long depth = 0,  nodesAtDepth = 1, nodesAtNextDepth = 0;
	for (long long i = 0; i < size;) {
		for(long long j = i; j < nodesAtDepth + i; j++) {	
			int curQuad = code.GetBit((j*2+cur)) << 1 | code.GetBit((j*2)+cur+1);
			if (j == nextIndx) {
				if (curQuad == 3) {
					double midRow = ((double)begRow + endRow)/2;
					double midCol = ((double)begCol + endCol)/2;
					if (x < midRow) { //We are in NE or NW
						if (y < midCol) { //We are in NW
							endRow = midRow;
							endCol = midCol;
							nextIndx = i + nodesAtDepth + nodesAtNextDepth;
						} else { //We are in NE
							endRow = midRow;
							begCol = midCol;
							nextIndx = i + nodesAtDepth + nodesAtNextDepth + 1;
						}
					} else if (y < midCol) { //We are in SW
						begRow = midRow;
						endCol = midCol;
						nextIndx = i + nodesAtDepth + nodesAtNextDepth + 2;
					} else { //We are in SE
						begRow = midRow;
						begCol = midCol;
						nextIndx = i + nodesAtDepth + nodesAtNextDepth + 3;
					}
					nodesAtNextDepth += 4;

					int nextQuad = code.GetBit((nextIndx*2)+cur) << 1 | code.GetBit((nextIndx*2)+cur+1);
					if (nextQuad == 1) return true;
					if (nextQuad == 0) return false;
					else if (nextQuad == 2)
						if (begCol-begRow + x == y) return false;
						else return true;
				} 
				else if (curQuad == 1) return true;
				else if (curQuad == 0) return false;
				else if (curQuad == 2) {
					if (begCol-begRow + x == y) return false;
					else return true;
				}
			} else if (curQuad == 3) {
				nodesAtNextDepth += 4;
			}
		}
		i += nodesAtDepth;
		nodesAtDepth = nodesAtNextDepth;
		nodesAtNextDepth = 0;
	}	
}
开发者ID:mnelson91，项目名称:thesis，代码行数:58，代码来源:quadtree_compression_s.cpp

示例2: if

std::vector<int> QuadTree_H::GetNeighbors(const BitString &code, int x) {
	DeltaCode delta;
	uint64_t cur = 0;
	int nodes = delta.DecodeNextInt(code, &cur);
	long long size = code.get_length();
	long long freq[4] = {0, 3, 1, 2};
	cur += 8;
	std::vector<int> neighbors;
	QueueObj pos;
	std::queue<QueueObj> posQueue;
	posQueue.push(QueueObj(0, 0, nodes, 0, nodes));
	pos = posQueue.front();
	long long depth = 0,  nodesAtDepth = 1, nodesAtNextDepth = 0;
	for(int i = 0; !posQueue.empty();) {
		for(long long j = i; j < nodesAtDepth + i; j++) {	
			int curQuad = GetNextHuffQuad(code, freq, &cur);
			if (j == pos.nextPos) {
				posQueue.pop();
				if (curQuad == 3) {
					double midRow = ((double)pos.begRow + pos.endRow)/2;
					double midCol = ((double)pos.begCol + pos.endCol)/2;
					if (x < midRow) {
						posQueue.push(QueueObj(i + nodesAtDepth + nodesAtNextDepth, pos.begRow, midRow, pos.begCol, midCol));
						posQueue.push(QueueObj(i + nodesAtDepth + nodesAtNextDepth + 1, pos.begRow, midRow, midCol, pos.endCol));
					} else {
						posQueue.push(QueueObj(i + nodesAtDepth + nodesAtNextDepth + 2, midRow, pos.endRow, pos.begCol, midCol));
						posQueue.push(QueueObj(i + nodesAtDepth + nodesAtNextDepth + 3, midRow, pos.endRow, midCol, pos.endCol));
					}
					nodesAtNextDepth += 4;
				} 
				else if (curQuad == 1) {
					for (int n = pos.begCol; n < pos.endCol; ++n) {
						neighbors.push_back(n);
					}
				}
				else if (curQuad == 2) {
					for (int n = pos.begCol; n < pos.endCol; ++n) {
						if (pos.begCol - pos.begRow + x == n) continue;
						neighbors.push_back(n);
					}
				}
				if (posQueue.empty()) break;
				pos = posQueue.front();
			} else if (curQuad == 3){
				nodesAtNextDepth += 4;
			}
		}
		i += nodesAtDepth;
		nodesAtDepth = nodesAtNextDepth;
		nodesAtNextDepth = 0;
	}
	return neighbors;
}
开发者ID:mnelson91，项目名称:thesis，代码行数:53，代码来源:quadtree_compression_h.cpp

示例3: Compress


//.........这里部分代码省略.........
				++freq[0];
			}
			if (edgeQuad == 3) Compress(depthStrings, depthSizes, freq, d);
		}
		currentString = quadStrings[0];
	}
	depthStrings[depth-1].AppendBit(0);
	depthStrings[depth-1].AppendBit(1);
	++depthSizes[depth-1];
	++freq[1];
	for (long long d = depth - 1; d >= 1; --d) {
		if (!Compress(depthStrings, depthSizes, freq, d)) break;
	}
	for (int i = 1; i < quadStrings.size(); ++i) {
		dCommon = DeepestCommonQuad(depth, currentString, quadStrings[i]);
		upQuad = QuadAtDepth(quadStrings[i], depth - dCommon - 1);
		upString = StripNQuads(quadStrings[i], depth - dCommon - 1) - 1;
		upCommon = DeepestCommonQuad(depth, currentString, upString);
		if (currentString < upString) {
			for (long long d = depth - 1; d >= dCommon; --d) {
				long long curQuad = QuadAtDepth(currentString, depth - d - 1);
				long long upQuad = QuadAtDepth(upString, depth - d - 1);
				for (int q = curQuad; q < upQuad; ++q) {
					depthStrings[d].AppendBit(0);
					depthStrings[d].AppendBit(0);
					++depthSizes[d];
					++freq[0];
				}
				if (upQuad == 3 && upQuad != curQuad) {
					for (long long y = d; y >= 1; --y) {
						if (!Compress(depthStrings, depthSizes, freq, y)) break;
					}
				}
			}
		}
		currentString = upString + 1;
		if (currentString < quadStrings[i]) {
			for (long long d = dCommon; d < depth; ++d) {
				long long curQuad = QuadAtDepth(currentString, depth - d - 1);
				long long edgeQuad = QuadAtDepth(quadStrings[i], depth - d - 1);
				for (long long q = curQuad; q < edgeQuad; ++q) {
					depthStrings[d].AppendBit(0);
					depthStrings[d].AppendBit(0);
					++depthSizes[d];
					++freq[0];
				}
				if (edgeQuad == 3 && edgeQuad != curQuad) {
					for (long long y = d; y >= 1; --y) {
						if (!Compress(depthStrings, depthSizes, freq, y)) break;
					}
				}
			}
			currentString = quadStrings[i];
		}
		depthStrings[depth-1].AppendBit(0);
		depthStrings[depth-1].AppendBit(1);
		++depthSizes[depth-1];
		++freq[1];
		for (long long d = depth - 1; d >= 1; --d) {
			if (!Compress(depthStrings, depthSizes, freq, d)) break;
		}
	}
	currentString = quadStrings.back();
	long long endString = GetQuadString(size, size - 1, size - 1);
	dCommon = DeepestCommonQuad(depth, currentString, endString);
	if (currentString < endString) {
		for (long long d = depth - 1; d >= 0; --d) {
			long long curQuad = QuadAtDepth(currentString, depth - d - 1);
			long long upQuad = QuadAtDepth(endString, depth - d - 1);
			for (long long q = curQuad; q < upQuad; ++q) {
				depthStrings[d].AppendBit(0);
				depthStrings[d].AppendBit(0);
				++depthSizes[d];
				++freq[0];
			}
			if (upQuad == 3 && curQuad != upQuad) {
				for (long long y = d; y >= 1; --y) {
					if (!Compress(depthStrings, depthSizes, freq, y)) break;
				}
			}
		}
	}
	result->Init(0);
	DeltaCode delta;
	BitString tmp;
	delta.EncodeInt(size, &tmp);
	result->AppendBitString(tmp);
	++freq[3];
	BitString huff[4];
	GetHuffStrings(result, freq, huff);
	result->AppendBitString(huff[3]);
	for (int i = 0; i < depth; ++i) {
		BitString * ds = &depthStrings[i];
		for ( long long j = 0; j < ds->get_length(); j+=2) {
			int quad = ds->GetBit(j) << 1 | ds->GetBit(j+1);
			result->AppendBitString(huff[quad]);
		}
	}
	result->PrintRUSAGE();
}
开发者ID:mnelson91，项目名称:thesis，代码行数:101，代码来源:quadtree_compression_h.cpp

示例4: Exists

bool QuadTree_DP::Exists(const BitString &code, int x, int y) {
	DeltaCode delta;
	uint64_t cur = 0;
	long long nodes = delta.DecodeNextInt(code, &cur);
	long long depth = delta.DecodeNextInt(code, &cur);
	std::vector<long long> depthSizes(depth+1);
	depthSizes[0] = 1;
	for (int i = 1; i <= depth; ++i) {
		depthSizes[i] = delta.DecodeNextInt(code, &cur);
	}
	long long offset = cur;
	std::vector<long long> depthIndices(depth+2);
	depthIndices[0] = 0;
	for (int i = 1; i < depth + 2; ++i) {
		depthIndices[i] = depthSizes[i-1] + depthIndices[i-1];
	}
	long long size = code.get_length();
	long long nextIndx = 0;
	long long begRow = 0, begCol = 0, endRow = nodes, endCol = nodes;
	long long curDepth = 0,  nodesAtDepth = 1, nodesAtNextDepth = 0;
	for (long long i = 0; i < depth; ++i) {
		for(long long j = depthIndices[i]; j < depthIndices[i+1]; ++j) {	
			int curQuad = code.GetBit(offset+(j*2)) << 1 | code.GetBit(offset+(j*2)+1);
			if (j == nextIndx) {
				if (curQuad == 3) {
					double midRow = ((double)begRow + endRow)/2;
					double midCol = ((double)begCol + endCol)/2;
					if (x < midRow) { //We are in NE or NW
						if (y < midCol) { //We are in NW
							endRow = midRow;
							endCol = midCol;
							nextIndx = depthIndices[i+1] + nodesAtNextDepth;
						} else { //We are in NE
							endRow = midRow;
							begCol = midCol;
							nextIndx = depthIndices[i+1] + nodesAtNextDepth + 1;
						}
					} else if (y < midCol) { //We are in SW
						begRow = midRow;
						endCol = midCol;
						nextIndx = depthIndices[i+1] + nodesAtNextDepth + 2;
					} else { //We are in SE
						begRow = midRow;
						begCol = midCol;
						nextIndx = depthIndices[i+1] + nodesAtNextDepth + 3;
					}
					nodesAtNextDepth += 4;

					int nextQuad = code.GetBit(offset+(nextIndx*2)) << 1 | code.GetBit(offset+(nextIndx*2)+1);
					if (nextQuad == 1) return true;
					if (nextQuad == 0) return false;
					else if (nextQuad == 2)
						if (begCol-begRow + x == y) return false;
						else return true;
				} 
				else if (curQuad == 1) return true;
				else if (curQuad == 0) return false;
				else if (curQuad == 2) {
					if (begCol-begRow + x == y) return false;
					else return true;
				}
				break;

			} else if (curQuad == 3) {
				nodesAtNextDepth += 4;
			}
		}
		nodesAtDepth = nodesAtNextDepth;
		nodesAtNextDepth = 0;
	}	
}
开发者ID:mnelson91，项目名称:thesis，代码行数:71，代码来源:quadtree_compression_dp.cpp


注：本文中的BitString::get_length方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。