{"text": "#include \"TileLayerBuilder.h\"\n#include \"TextFormatter.h\"\n#include \"Color.h\"\n\n#include \n#include \n#include \n\n#include \n\nnamespace {\n static float calculateScale(const carto::vt::VertexArray& values, const carto::vt::VertexArray& indices) {\n float maxValue = 0.0f;\n if (!values.empty()) {\n for (std::size_t index : indices) {\n float value = values[index];\n maxValue = std::max(maxValue, std::abs(value));\n }\n }\n if (maxValue == 0.0f) {\n return 1.0f;\n }\n return std::pow(2.0f, std::floor(std::log(32767.0f / maxValue) / std::log(2.0f)));\n }\n\n template \n static float calculateScale(const carto::vt::VertexArray& values, const carto::vt::VertexArray& indices) {\n float maxValue = 0.0f;\n if (!values.empty()) {\n for (std::size_t index : indices) {\n const T& value = values[index];\n for (auto it = value.cbegin(); it != value.cend(); it++) {\n maxValue = std::max(maxValue, std::abs(static_cast(*it)));\n }\n }\n }\n if (maxValue == 0.0f) {\n return 1.0f;\n }\n return std::pow(2.0f, std::floor(std::log(32767.0f / maxValue) / std::log(2.0f)));\n }\n}\n\nnamespace carto { namespace vt {\n TileLayerBuilder::TileLayerBuilder(const TileId& tileId, int layerIdx, std::shared_ptr transformer, float tileSize, float geomScale) :\n _tileId(tileId), _layerIdx(layerIdx), _tileSize(tileSize), _geomScale(geomScale), _transformer(std::move(transformer)), _clipBox(cglib::vec2(-0.125f, -0.125f), cglib::vec2(1.125f, 1.125f)), _polygonClipBox(cglib::vec2(-0.001953125f, -0.001953125), cglib::vec2(1.001953125f, 1.001953125f))\n {\n _coords.reserve(RESERVED_VERTICES);\n _texCoords.reserve(RESERVED_VERTICES);\n _binormals.reserve(RESERVED_VERTICES);\n _heights.reserve(RESERVED_VERTICES);\n _attribs.reserve(RESERVED_VERTICES);\n _indices.reserve(RESERVED_VERTICES);\n _ids.reserve(RESERVED_VERTICES);\n }\n\n void TileLayerBuilder::setClipBox(const cglib::bbox2& clipBox) {\n _clipBox = clipBox;\n }\n\n void TileLayerBuilder::addBackground(const std::shared_ptr& background) {\n _backgroundList.push_back(background);\n }\n\n void TileLayerBuilder::addBitmap(const std::shared_ptr& bitmap) {\n _bitmapList.push_back(bitmap);\n }\n\n TileLayerBuilder::PointProcessor TileLayerBuilder::createPointProcessor(const PointStyle& style, const std::shared_ptr& glyphMap) {\n if (style.sizeFunc == FloatFunction(0) || !style.image) {\n return PointProcessor();\n }\n\n if (_builderParameters.type != TileGeometry::Type::POINT || _builderParameters.glyphMap != glyphMap || _builderParameters.transform != style.transform || _builderParameters.compOp != style.compOp || _builderParameters.parameterCount >= TileGeometry::StyleParameters::MAX_PARAMETERS) {\n appendGeometry();\n }\n _builderParameters.type = TileGeometry::Type::POINT;\n _builderParameters.glyphMap = glyphMap;\n _builderParameters.transform = style.transform;\n _builderParameters.compOp = style.compOp;\n GlyphMap::GlyphId glyphId = glyphMap->loadBitmapGlyph(style.image->bitmap, style.image->sdfMode);\n int styleIndex = _builderParameters.parameterCount;\n while (--styleIndex >= 0) {\n if (_builderParameters.colorFuncs[styleIndex] == style.colorFunc && _builderParameters.widthFuncs[styleIndex] == style.sizeFunc && _builderParameters.offsetFuncs[styleIndex] == FloatFunction(0)) {\n break;\n }\n }\n if (styleIndex < 0) {\n styleIndex = _builderParameters.parameterCount++;\n _builderParameters.colorFuncs[styleIndex] = style.colorFunc;\n _builderParameters.widthFuncs[styleIndex] = style.sizeFunc;\n _builderParameters.offsetFuncs[styleIndex] = FloatFunction(0);\n }\n\n return [style, styleIndex, glyphMap, glyphId, this](long long id, const Vertex& vertex) {\n std::size_t i0 = _indices.size();\n cglib::vec2 pen(0, 0);\n const GlyphMap::Glyph* glyph = glyphMap->getGlyph(glyphId);\n if (glyph) {\n pen = -cglib::vec2(glyph->width, glyph->height) * 0.5f;\n tesselateGlyph(vertex, static_cast(styleIndex), pen * style.image->scale, cglib::vec2(glyph->width, glyph->height) * style.image->scale, glyph);\n }\n _ids.fill(id, _indices.size() - i0);\n };\n }\n\n TileLayerBuilder::TextProcessor TileLayerBuilder::createTextProcessor(const TextStyle& style, const TextFormatter& formatter) {\n if (style.sizeFunc == FloatFunction(0) && !style.backgroundImage) {\n return TextProcessor();\n }\n\n std::optional transform;\n if (style.angle != 0) {\n float angle = -style.angle * boost::math::constants::pi() / 180.0f;\n transform = Transform::fromMatrix2(cglib::rotate2_matrix(angle));\n }\n\n const std::shared_ptr& font = formatter.getFont();\n\n if (_builderParameters.type != TileGeometry::Type::POINT || _builderParameters.glyphMap != font->getGlyphMap() || _builderParameters.transform != transform || _builderParameters.compOp != style.compOp || _builderParameters.parameterCount + 2 > TileGeometry::StyleParameters::MAX_PARAMETERS) {\n appendGeometry();\n }\n _builderParameters.type = TileGeometry::Type::POINT;\n _builderParameters.glyphMap = font->getGlyphMap();\n _builderParameters.transform = transform;\n _builderParameters.compOp = style.compOp;\n int styleIndex = _builderParameters.parameterCount;\n while (--styleIndex >= 0) {\n if (_builderParameters.colorFuncs[styleIndex] == style.colorFunc && _builderParameters.widthFuncs[styleIndex] == style.sizeFunc && _builderParameters.offsetFuncs[styleIndex] == FloatFunction(0)) {\n break;\n }\n }\n if (styleIndex < 0) {\n styleIndex = _builderParameters.parameterCount++;\n _builderParameters.colorFuncs[styleIndex] = style.colorFunc;\n _builderParameters.widthFuncs[styleIndex] = style.sizeFunc;\n _builderParameters.offsetFuncs[styleIndex] = FloatFunction(0);\n }\n\n int haloStyleIndex = -1;\n if (style.haloRadiusFunc != FloatFunction(0)) {\n for (haloStyleIndex = _builderParameters.parameterCount; --haloStyleIndex >= 0; ) {\n if (_builderParameters.colorFuncs[haloStyleIndex] == style.haloColorFunc && _builderParameters.widthFuncs[haloStyleIndex] == style.sizeFunc && _builderParameters.offsetFuncs[haloStyleIndex] == style.haloRadiusFunc) {\n break;\n }\n }\n if (haloStyleIndex < 0) {\n haloStyleIndex = _builderParameters.parameterCount++;\n _builderParameters.colorFuncs[haloStyleIndex] = style.haloColorFunc;\n _builderParameters.widthFuncs[haloStyleIndex] = style.sizeFunc;\n _builderParameters.offsetFuncs[haloStyleIndex] = style.haloRadiusFunc;\n }\n }\n\n return [style, styleIndex, haloStyleIndex, font, formatter, this](long long id, const Vertex& vertex, const std::string& text) {\n std::size_t i0 = _indices.size();\n std::vector glyphs = formatter.format(text, 1.0f);\n Font::Metrics metrics = font->getMetrics(1.0f);\n if (style.backgroundImage) {\n const GlyphMap::Glyph* baseGlyph = font->getGlyphMap()->getGlyph(font->getGlyphMap()->loadBitmapGlyph(style.backgroundImage->bitmap, style.backgroundImage->sdfMode));\n if (baseGlyph) {\n float scale = style.backgroundImage->scale / formatter.getFontSize();\n Font::Glyph glyph(0, Font::NULL_CODEPOINT, *baseGlyph, cglib::vec2(baseGlyph->width, baseGlyph->height) * (style.backgroundScale * scale), style.backgroundOffset * scale, cglib::vec2(0, 0));\n tesselateGlyph(vertex, styleIndex, glyph.offset * style.backgroundImage->scale, glyph.size * style.backgroundImage->scale, &glyph.baseGlyph);\n }\n }\n\n for (int pass = (haloStyleIndex >= 0 ? 0 : 1); pass < 2; pass++) {\n cglib::vec2 pen(0, 0);\n for (Font::Glyph& glyph : glyphs) {\n if (glyph.codePoint == Font::CR_CODEPOINT) {\n pen = cglib::vec2(0, 0);\n }\n else {\n cglib::vec2 offset(glyph.offset(0), metrics.ascent + metrics.descent - glyph.size(1) - glyph.offset(1));\n tesselateGlyph(vertex, static_cast(pass == 0 ? haloStyleIndex : styleIndex), pen + offset, glyph.size, &glyph.baseGlyph);\n }\n\n pen += glyph.advance;\n }\n }\n _ids.fill(id, _indices.size() - i0);\n };\n }\n\n TileLayerBuilder::LineProcessor TileLayerBuilder::createLineProcessor(const LineStyle& style, const std::shared_ptr& strokeMap) {\n if (style.widthFunc == FloatFunction(0)) {\n return LineProcessor();\n }\n\n if ((_builderParameters.strokeMap && _builderParameters.strokeMap != strokeMap) || _builderParameters.transform != style.transform || _builderParameters.compOp != style.compOp || _builderParameters.parameterCount >= TileGeometry::StyleParameters::MAX_PARAMETERS) {\n appendGeometry();\n }\n else if (!(_builderParameters.type == TileGeometry::Type::LINE || (_builderParameters.type == TileGeometry::Type::POLYGON && !_builderParameters.pattern && !_builderParameters.transform))) { // we can use also line drawing shader but ONLY if pattern/transform is not used for polygons (pattern can be used for lines)\n appendGeometry();\n }\n _builderParameters.type = TileGeometry::Type::LINE;\n _builderParameters.strokeMap = strokeMap;\n _builderParameters.transform = style.transform;\n _builderParameters.compOp = style.compOp;\n StrokeMap::StrokeId strokeId = (style.strokePattern ? strokeMap->loadBitmapPattern(style.strokePattern) : 0);\n const StrokeMap::Stroke* stroke = (strokeId != 0 ? strokeMap->getStroke(strokeId) : nullptr);\n int styleIndex = _builderParameters.parameterCount;\n while (--styleIndex >= 0) {\n if (_builderParameters.colorFuncs[styleIndex] == style.colorFunc && _builderParameters.widthFuncs[styleIndex] == style.widthFunc && _builderParameters.offsetFuncs[styleIndex] == style.offsetFunc && _builderParameters.lineStrokeIds[styleIndex] == strokeId) {\n break;\n }\n }\n if (styleIndex < 0) {\n styleIndex = _builderParameters.parameterCount++;\n _builderParameters.colorFuncs[styleIndex] = style.colorFunc;\n _builderParameters.widthFuncs[styleIndex] = style.widthFunc;\n _builderParameters.offsetFuncs[styleIndex] = style.offsetFunc;\n _builderParameters.lineStrokeIds[styleIndex] = strokeId;\n }\n\n return [style, styleIndex, stroke, this](long long id, const Vertices& vertices) {\n std::size_t i0 = _indices.size();\n _binormals.fill(cglib::vec2(0, 0), _coords.size() - _binormals.size()); // needed if previously only polygons were used\n tesselateLine(vertices, static_cast(styleIndex), stroke, style);\n _ids.fill(id, _indices.size() - i0);\n };\n }\n\n TileLayerBuilder::PolygonProcessor TileLayerBuilder::createPolygonProcessor(const PolygonStyle& style) {\n TileGeometry::Type type = TileGeometry::Type::POLYGON;\n if (_builderParameters.pattern != style.pattern || _builderParameters.transform != style.transform || _builderParameters.compOp != style.compOp || _builderParameters.parameterCount >= TileGeometry::StyleParameters::MAX_PARAMETERS) {\n appendGeometry();\n }\n else if (!(_builderParameters.type == TileGeometry::Type::POLYGON || (_builderParameters.type == TileGeometry::Type::LINE && !style.pattern && !style.transform))) { // we can use also line drawing shader but ONLY if pattern/transform is not used for polygons (pattern can be used for lines)\n appendGeometry();\n }\n else {\n type = _builderParameters.type;\n }\n _builderParameters.type = type;\n _builderParameters.pattern = style.pattern;\n _builderParameters.transform = style.transform;\n _builderParameters.compOp = style.compOp;\n int styleIndex = _builderParameters.parameterCount;\n while (--styleIndex >= 0) {\n if (_builderParameters.colorFuncs[styleIndex] == style.colorFunc && _builderParameters.widthFuncs[styleIndex] == FloatFunction(0) && _builderParameters.offsetFuncs[styleIndex] == FloatFunction(0) && _builderParameters.lineStrokeIds[styleIndex] == 0) {\n break;\n }\n }\n if (styleIndex < 0) {\n styleIndex = _builderParameters.parameterCount++;\n _builderParameters.colorFuncs[styleIndex] = style.colorFunc;\n _builderParameters.widthFuncs[styleIndex] = FloatFunction(0); // fill width information when we need to use line shader with polygons\n _builderParameters.offsetFuncs[styleIndex] = FloatFunction(0); // fill offset information when we need to use line shader with polygons\n _builderParameters.lineStrokeIds[styleIndex] = 0; // fill stroke information when we need to use line shader with polygons\n }\n\n return [type, style, styleIndex, this](long long id, const VerticesList& verticesList) {\n std::size_t i0 = _ids.size();\n tesselatePolygon(verticesList, static_cast(styleIndex), style);\n _ids.fill(id, _indices.size() - i0);\n if (type == TileGeometry::Type::LINE) {\n _binormals.fill(cglib::vec2(0, 0), _coords.size() - _binormals.size()); // use zero binormals if using 'lines'\n }\n };\n }\n\n TileLayerBuilder::Polygon3DProcessor TileLayerBuilder::createPolygon3DProcessor(const Polygon3DStyle& style) {\n if (_builderParameters.type != TileGeometry::Type::POLYGON3D || _builderParameters.transform != style.transform || _builderParameters.parameterCount >= TileGeometry::StyleParameters::MAX_PARAMETERS) {\n appendGeometry();\n }\n _builderParameters.type = TileGeometry::Type::POLYGON3D;\n _builderParameters.transform = style.transform;\n int styleIndex = _builderParameters.parameterCount;\n while (--styleIndex >= 0) {\n if (_builderParameters.colorFuncs[styleIndex] == style.colorFunc) {\n break;\n }\n }\n if (styleIndex < 0) {\n styleIndex = _builderParameters.parameterCount++;\n _builderParameters.colorFuncs[styleIndex] = style.colorFunc;\n }\n\n return [style, styleIndex, this](long long id, const VerticesList& verticesList, float minHeight, float maxHeight) {\n std::size_t i0 = _ids.size();\n tesselatePolygon3D(verticesList, minHeight, maxHeight, static_cast(styleIndex), style);\n _ids.fill(id, _indices.size() - i0);\n };\n }\n\n TileLayerBuilder::PointLabelProcessor TileLayerBuilder::createPointLabelProcessor(const PointLabelStyle& style, const std::shared_ptr& glyphMap) {\n if (style.sizeFunc == FloatFunction(0) || !style.image) {\n return PointLabelProcessor();\n }\n\n const GlyphMap::Glyph* baseGlyph = glyphMap->getGlyph(glyphMap->loadBitmapGlyph(style.image->bitmap, style.image->sdfMode));\n if (!baseGlyph) {\n return PointLabelProcessor();\n }\n std::vector bitmapGlyphs = {\n Font::Glyph(0, Font::CR_CODEPOINT, GlyphMap::Glyph(false, 0, 0, 0, 0, cglib::vec2(0, 0)), cglib::vec2(0, 0), cglib::vec2(0, 0), -cglib::vec2(style.image->bitmap->width, style.image->bitmap->height) * (style.image->scale * 0.5f)),\n Font::Glyph(0, Font::NULL_CODEPOINT, *baseGlyph, cglib::vec2(baseGlyph->width, baseGlyph->height) * style.image->scale, cglib::vec2(0, 0), cglib::vec2(0, 0))\n };\n\n float scale = 1.0f / _tileSize;\n std::optional transform;\n if (style.transform) {\n cglib::mat3x3 flippedTransform = style.transform->matrix3() * cglib::scale3_matrix(cglib::vec3(1, -1, 1));\n cglib::mat2x2 matrix{ { flippedTransform(0, 0), flippedTransform(0, 1)}, { -flippedTransform(1, 0), -flippedTransform(1, 1) } };\n cglib::vec2 translate(flippedTransform(0, 2) / _tileSize, flippedTransform(1, 2) / _tileSize);\n transform = Transform::fromMatrix2Translate(matrix, translate);\n }\n\n if (!_labelStyle || _labelStyle->orientation != style.orientation || _labelStyle->colorFunc != style.colorFunc || _labelStyle->sizeFunc != style.sizeFunc || _labelStyle->haloColorFunc != ColorFunction() || _labelStyle->haloRadiusFunc != FloatFunction() || _labelStyle->autoflip != style.autoflip || _labelStyle->scale != scale || _labelStyle->ascent != 0.0f || _labelStyle->descent != 0.0f || _labelStyle->transform != transform || _labelStyle->glyphMap != glyphMap) {\n _labelStyle = std::make_shared(style.orientation, style.colorFunc, style.sizeFunc, ColorFunction(), FloatFunction(), style.autoflip, scale, 0.0f, 0.0f, transform, glyphMap);\n }\n\n return [bitmapGlyphs, this](long long localId, long long globalId, long long groupId, const std::variant& position, float priority, float minimumGroupDistance) {\n std::optional> labelPosition;\n std::vector> labelVertices;\n if (auto pos = std::get_if(&position)) {\n labelPosition = *pos;\n }\n else if (auto vertices = std::get_if(&position)) {\n VertexArray> tesselatedVertices;\n _transformer->tesselateLineString(vertices->data(), vertices->size(), tesselatedVertices);\n labelVertices.assign(tesselatedVertices.begin(), tesselatedVertices.end());\n }\n\n TileLabel::PlacementInfo placementInfo(priority, minimumGroupDistance);\n auto pointLabel = std::make_shared(_tileId, _layerIdx, localId, globalId, groupId, bitmapGlyphs, std::move(labelPosition), std::move(labelVertices), _labelStyle, placementInfo);\n _labelList.push_back(std::move(pointLabel));\n };\n }\n\n TileLayerBuilder::TextLabelProcessor TileLayerBuilder::createTextLabelProcessor(const TextLabelStyle& style, const TextFormatter& formatter) {\n if (style.sizeFunc == FloatFunction(0) && !style.backgroundImage) {\n return TextLabelProcessor();\n }\n\n float scale = 1.0f / _tileSize;\n std::optional transform;\n if (style.orientation != LabelOrientation::LINE && style.angle != 0) {\n float angle = style.angle * boost::math::constants::pi() / 180.0f;\n transform = Transform::fromMatrix2(cglib::rotate2_matrix(angle));\n }\n\n const std::shared_ptr& font = formatter.getFont();\n Font::Metrics metrics = formatter.getFont()->getMetrics(1.0f);\n if (!_labelStyle || _labelStyle->orientation != style.orientation || _labelStyle->colorFunc != style.colorFunc || _labelStyle->sizeFunc != style.sizeFunc || _labelStyle->haloColorFunc != style.haloColorFunc || _labelStyle->haloRadiusFunc != style.haloRadiusFunc || _labelStyle->autoflip != style.autoflip || _labelStyle->scale != scale || _labelStyle->ascent != metrics.ascent || _labelStyle->descent != metrics.descent || _labelStyle->transform != transform || _labelStyle->glyphMap != font->getGlyphMap()) {\n _labelStyle = std::make_shared(style.orientation, style.colorFunc, style.sizeFunc, style.haloColorFunc, style.haloRadiusFunc, style.autoflip, scale, metrics.ascent, metrics.descent, transform, font->getGlyphMap());\n }\n\n return [style, font, formatter, this](long long localId, long long globalId, long long groupId, const std::optional& position, const Vertices& vertices, const std::string& text, float priority, float minimumGroupDistance) {\n if (!text.empty() || style.backgroundImage) {\n std::vector glyphs = formatter.format(text, 1.0f);\n if (style.backgroundImage) {\n const GlyphMap::Glyph* baseGlyph = font->getGlyphMap()->getGlyph(font->getGlyphMap()->loadBitmapGlyph(style.backgroundImage->bitmap, style.backgroundImage->sdfMode));\n if (baseGlyph) {\n float scale = style.backgroundImage->scale / formatter.getFontSize();\n glyphs.insert(glyphs.begin(), Font::Glyph(0, Font::NULL_CODEPOINT, *baseGlyph, cglib::vec2(baseGlyph->width, baseGlyph->height) * (style.backgroundScale * scale), style.backgroundOffset * scale, cglib::vec2(baseGlyph->width, 0) * scale));\n }\n }\n\n std::optional> labelPosition;\n if (position) {\n labelPosition = *position;\n }\n std::vector> labelVertices;\n if (!vertices.empty()) {\n VertexArray> tesselatedVertices;\n _transformer->tesselateLineString(vertices.data(), vertices.size(), tesselatedVertices);\n labelVertices.assign(tesselatedVertices.begin(), tesselatedVertices.end());\n }\n\n TileLabel::PlacementInfo placementInfo(priority, minimumGroupDistance);\n auto textLabel = std::make_shared(_tileId, _layerIdx, localId, globalId, groupId, std::move(glyphs), std::move(labelPosition), std::move(labelVertices), _labelStyle, placementInfo);\n _labelList.push_back(std::move(textLabel));\n }\n };\n }\n\n std::shared_ptr TileLayerBuilder::buildTileLayer(std::optional compOp, FloatFunction opacityFunc) const {\n std::vector> geometryList = _geometryList;\n packGeometry(geometryList);\n\n return std::make_shared(_layerIdx, std::move(compOp), std::move(opacityFunc), _backgroundList, _bitmapList, std::move(geometryList), _labelList);\n }\n\n void TileLayerBuilder::appendGeometry() {\n if (_builderParameters.type == TileGeometry::Type::NONE) {\n return;\n }\n\n packGeometry(_geometryList);\n\n _builderParameters = BuilderParameters();\n _coords.clear();\n _texCoords.clear();\n _binormals.clear();\n _heights.clear();\n _attribs.clear();\n _indices.clear();\n _ids.clear();\n }\n\n void TileLayerBuilder::packGeometry(std::vector>& geometryList) const {\n if (_builderParameters.type == TileGeometry::Type::NONE) {\n return;\n }\n\n // Create style parameters\n TileGeometry::StyleParameters styleParameters;\n styleParameters.parameterCount = _builderParameters.parameterCount;\n for (int i = 0; i < styleParameters.parameterCount; i++) {\n styleParameters.colorFuncs[i] = _builderParameters.colorFuncs[i];\n styleParameters.widthFuncs[i] = _builderParameters.widthFuncs[i];\n styleParameters.offsetFuncs[i] = _builderParameters.offsetFuncs[i];\n const StrokeMap::Stroke* stroke = nullptr;\n if (_builderParameters.strokeMap && _builderParameters.lineStrokeIds[i] != 0) {\n stroke = _builderParameters.strokeMap->getStroke(_builderParameters.lineStrokeIds[i]);\n }\n styleParameters.strokeScales[i] = (stroke ? stroke->scale : 0);\n }\n if (_builderParameters.transform) {\n cglib::vec2 translate = _builderParameters.transform->translate();\n if (translate != cglib::vec2(0, 0)) {\n styleParameters.translate = translate * (1.0f / _tileSize);\n }\n }\n styleParameters.compOp = _builderParameters.compOp;\n\n if (_builderParameters.strokeMap) {\n bool strokeUsed = std::any_of(_builderParameters.lineStrokeIds.begin(), _builderParameters.lineStrokeIds.begin() + _builderParameters.parameterCount, [](StrokeMap::StrokeId strokeId) { return strokeId != 0; });\n if (strokeUsed) {\n styleParameters.pattern = _builderParameters.strokeMap->getBitmapPattern();\n }\n }\n else if (_builderParameters.glyphMap) {\n styleParameters.pattern = _builderParameters.glyphMap->getBitmapPattern();\n }\n else {\n styleParameters.pattern = _builderParameters.pattern;\n }\n\n // Transform coordinates, binormals, calculate normals\n VertexArray> coords;\n VertexArray> normals;\n VertexArray> binormals;\n coords.reserve(_coords.size());\n normals.reserve(_coords.size());\n binormals.reserve(_binormals.size());\n if (!_builderParameters.transform) {\n for (std::size_t i = 0; i < _coords.size(); i++) {\n coords.append(_transformer->calculatePoint(_coords[i]));\n normals.append(_transformer->calculateNormal(_coords[i]));\n if (!_binormals.empty()) {\n binormals.append(_transformer->calculateVector(_coords[i], _binormals[i]));\n }\n }\n }\n else {\n cglib::mat2x2 transform = _builderParameters.transform->matrix2();\n cglib::mat2x2 invTransTransform = cglib::transpose(cglib::inverse(transform));\n for (std::size_t i = 0; i < _coords.size(); i++) {\n cglib::vec2 pos;\n if (_builderParameters.type == TileGeometry::Type::POINT) {\n pos = _coords[i];\n } else {\n pos = cglib::transform(_coords[i], transform);\n }\n coords.append(_transformer->calculatePoint(pos));\n normals.append(_transformer->calculateNormal(pos));\n if (!_binormals.empty()) {\n cglib::vec2 binormal;\n if (_builderParameters.type == TileGeometry::Type::POINT) {\n binormal = cglib::transform(_binormals[i], transform);\n } else {\n binormal = cglib::unit(cglib::transform(_binormals[i], invTransTransform)) * cglib::length(_binormals[i]);\n }\n binormals.append(_transformer->calculateVector(pos, binormal));\n }\n }\n }\n if (std::all_of(normals.begin(), normals.end(), [](const cglib::vec3& normal) { return normal(2) == 1; })) {\n normals.clear();\n }\n\n // Transform texture coordinates. Note that texture coordinates are also used as local tile coordinates for 3D polygons.\n VertexArray> texCoords;\n if (styleParameters.pattern || _builderParameters.type == TileGeometry::Type::POLYGON3D) {\n texCoords.reserve(_texCoords.size());\n cglib::mat2x2 transform = cglib::mat2x2::identity();\n if (styleParameters.pattern) {\n transform = cglib::mat2x2 {{ 1.0f / styleParameters.pattern->bitmap->width, 0 }, { 0, 1.0f / styleParameters.pattern->bitmap->height }};\n }\n else if (_builderParameters.type == TileGeometry::Type::POLYGON3D && _builderParameters.transform) {\n transform = _builderParameters.transform->matrix2();\n }\n for (std::size_t i = 0; i < _texCoords.size(); i++) {\n texCoords.append(cglib::transform(_texCoords[i], transform));\n }\n }\n\n // Transform heights\n VertexArray heights;\n heights.reserve(_heights.size());\n for (std::size_t i = 0; i < _heights.size(); i++) {\n heights.append(_transformer->calculateHeight(_coords[i], _heights[i]));\n }\n\n // Compress attributes\n VertexArray> attribs;\n attribs.copy(_attribs, 0, _attribs.size());\n if (std::all_of(attribs.begin(), attribs.end(), [](const cglib::vec4& attrib) { return attrib == cglib::vec4(0, 0, 0, 0); })) {\n attribs.clear();\n }\n\n // Calculate number of dimensions required for coordinates/binormals\n int dimensions = 2;\n if (std::any_of(coords.begin(), coords.end(), [](const cglib::vec3& coord) { return coord(2) != 0; })) {\n dimensions = 3;\n }\n else if (std::any_of(normals.begin(), normals.end(), [](const cglib::vec3& normal) { return normal(2) != 1; })) {\n dimensions = 3;\n }\n else if (std::any_of(binormals.begin(), binormals.end(), [](const cglib::vec3& binormal) { return binormal(2) != 0; })) {\n dimensions = 3;\n }\n\n // Split/repack geometry\n float coordScale = calculateScale(coords, _indices);\n float binormalScale = calculateScale(binormals, _indices);\n float texCoordScale = calculateScale(texCoords, _indices);\n float heightScale = calculateScale(heights, _indices);\n for (std::size_t offset = 0; offset < _indices.size(); ) {\n std::size_t count = std::min(std::size_t(65535), _indices.size() - offset);\n\n std::vector indexTable(coords.size(), 65536);\n VertexArray> remappedCoords;\n remappedCoords.reserve(coords.size());\n VertexArray> remappedAttribs;\n remappedAttribs.reserve(attribs.size());\n VertexArray> remappedTexCoords;\n remappedTexCoords.reserve(texCoords.size());\n VertexArray> remappedNormals;\n remappedNormals.reserve(normals.size());\n VertexArray> remappedBinormals;\n remappedBinormals.reserve(binormals.size());\n VertexArray remappedHeights;\n remappedHeights.reserve(heights.size());\n VertexArray remappedIndices;\n remappedIndices.reserve(count);\n VertexArray remappedIds;\n remappedIds.reserve(count);\n for (std::size_t i = 0; i < count; i++) {\n std::size_t index = _indices[offset + i];\n std::size_t remappedIndex = indexTable[index];\n if (remappedIndex == 65536) {\n remappedIndex = remappedCoords.size();\n indexTable[index] = remappedIndex;\n\n remappedCoords.append(coords[index]);\n if (!attribs.empty()) {\n remappedAttribs.append(attribs[index]);\n }\n if (!texCoords.empty()) {\n remappedTexCoords.append(texCoords[index]);\n }\n if (!normals.empty()) {\n remappedNormals.append(normals[index]);\n }\n if (!binormals.empty()) {\n remappedBinormals.append(binormals[index]);\n }\n if (!heights.empty()) {\n remappedHeights.append(heights[index]);\n }\n }\n\n remappedIndices.append(remappedIndex);\n remappedIds.append(_ids[offset + i]);\n }\n\n packGeometry(_builderParameters.type, dimensions, coordScale, binormalScale, texCoordScale, heightScale, remappedCoords, remappedTexCoords, remappedNormals, remappedBinormals, remappedHeights, remappedAttribs, remappedIndices, remappedIds, styleParameters, geometryList);\n\n offset += count;\n }\n }\n\n void TileLayerBuilder::packGeometry(TileGeometry::Type type, int dimensions, float coordScale, float binormalScale, float texCoordScale, float heightScale, const VertexArray>& coords, const VertexArray>& texCoords, const VertexArray>& normals, const VertexArray>& binormals, const VertexArray& heights, const VertexArray>& attribs, const VertexArray& indices, const VertexArray& ids, const TileGeometry::StyleParameters& styleParameters, std::vector>& geometryList) const {\n if (indices.empty()) {\n return;\n }\n \n // Build geometry layout info\n TileGeometry::VertexGeometryLayoutParameters vertexGeomLayoutParams;\n vertexGeomLayoutParams.dimensions = dimensions;\n vertexGeomLayoutParams.coordOffset = vertexGeomLayoutParams.vertexSize;\n vertexGeomLayoutParams.vertexSize += dimensions * sizeof(std::int16_t);\n vertexGeomLayoutParams.vertexSize = (vertexGeomLayoutParams.vertexSize + 3) & ~3;\n\n if (!attribs.empty()) {\n vertexGeomLayoutParams.attribsOffset = vertexGeomLayoutParams.vertexSize;\n vertexGeomLayoutParams.vertexSize += 4 * sizeof(std::int8_t);\n }\n\n if (!texCoords.empty()) {\n vertexGeomLayoutParams.texCoordOffset = vertexGeomLayoutParams.vertexSize;\n vertexGeomLayoutParams.vertexSize += 2 * sizeof(std::int16_t);\n }\n\n if (!normals.empty()) {\n vertexGeomLayoutParams.normalOffset = vertexGeomLayoutParams.vertexSize;\n vertexGeomLayoutParams.vertexSize += dimensions * sizeof(std::int16_t);\n vertexGeomLayoutParams.vertexSize = (vertexGeomLayoutParams.vertexSize + 3) & ~3;\n }\n\n if (!binormals.empty()) {\n vertexGeomLayoutParams.binormalOffset = vertexGeomLayoutParams.vertexSize;\n vertexGeomLayoutParams.vertexSize += dimensions * sizeof(std::int16_t);\n vertexGeomLayoutParams.vertexSize = (vertexGeomLayoutParams.vertexSize + 3) & ~3;\n }\n\n if (!heights.empty()) {\n vertexGeomLayoutParams.heightOffset = vertexGeomLayoutParams.vertexSize;\n vertexGeomLayoutParams.vertexSize += sizeof(std::int16_t);\n vertexGeomLayoutParams.vertexSize = (vertexGeomLayoutParams.vertexSize + 3) & ~3;\n }\n\n vertexGeomLayoutParams.coordScale = coordScale;\n vertexGeomLayoutParams.binormalScale = binormalScale;\n vertexGeomLayoutParams.texCoordScale = texCoordScale;\n vertexGeomLayoutParams.heightScale = heightScale;\n\n // Interleave, compress actual geometry data\n VertexArray compressedVertexGeometry;\n compressedVertexGeometry.fill(0, coords.size() * vertexGeomLayoutParams.vertexSize);\n for (std::size_t i = 0; i < coords.size(); i++) {\n std::uint8_t* baseCompressedPtr = &compressedVertexGeometry[i * vertexGeomLayoutParams.vertexSize];\n\n const cglib::vec3& coord = coords[i];\n std::int16_t* compressedCoordPtr = reinterpret_cast(baseCompressedPtr + vertexGeomLayoutParams.coordOffset);\n for (int j = 0; j < dimensions; j++) {\n compressedCoordPtr[j] = static_cast(coord(j) * coordScale);\n }\n\n if (!attribs.empty()) {\n const cglib::vec4& attrib = attribs[i];\n std::int8_t* compressedAttribsPtr = reinterpret_cast(baseCompressedPtr + vertexGeomLayoutParams.attribsOffset);\n compressedAttribsPtr[0] = attrib(0);\n compressedAttribsPtr[1] = attrib(1);\n compressedAttribsPtr[2] = attrib(2);\n compressedAttribsPtr[3] = attrib(3);\n }\n\n if (!texCoords.empty()) {\n const cglib::vec2& texCoord = texCoords[i];\n std::int16_t* compressedTexCoordPtr = reinterpret_cast(baseCompressedPtr + vertexGeomLayoutParams.texCoordOffset);\n compressedTexCoordPtr[0] = static_cast(texCoord(0) * texCoordScale);\n compressedTexCoordPtr[1] = static_cast(texCoord(1) * texCoordScale);\n }\n\n if (!normals.empty()) {\n const cglib::vec3& normal = normals[i];\n std::int16_t* compressedNormalPtr = reinterpret_cast(baseCompressedPtr + vertexGeomLayoutParams.normalOffset);\n for (int j = 0; j < dimensions; j++) {\n compressedNormalPtr[j] = static_cast(normal(j) * 32767.0f); // assume strict range -1..1\n }\n }\n\n if (!binormals.empty()) {\n const cglib::vec3& binormal = binormals[i];\n std::int16_t* compressedBinormalPtr = reinterpret_cast(baseCompressedPtr + vertexGeomLayoutParams.binormalOffset);\n for (int j = 0; j < dimensions; j++) {\n compressedBinormalPtr[j] = static_cast(binormal(j) * binormalScale);\n }\n }\n\n if (!heights.empty()) {\n float height = heights[i];\n std::int16_t* compressedHeightPtr = reinterpret_cast(baseCompressedPtr + vertexGeomLayoutParams.heightOffset);\n compressedHeightPtr[0] = static_cast(height * heightScale);\n }\n }\n\n // Compress indices\n VertexArray compressedIndices;\n compressedIndices.reserve(indices.size());\n for (std::size_t i = 0; i < indices.size(); i++) {\n compressedIndices.append(static_cast(indices[i]));\n }\n\n // Compress ids\n std::vector> compressedIds;\n if (!ids.empty()) {\n std::size_t offset = 0;\n for (std::size_t i = 1; i < ids.size(); i++) {\n if (ids[i] != ids[offset]) {\n compressedIds.emplace_back(i - offset, ids[offset]);\n offset = i;\n }\n }\n compressedIds.emplace_back(ids.size() - offset, ids[offset]);\n compressedIds.shrink_to_fit();\n }\n\n // Store geometry\n auto geometry = std::make_shared(type, _geomScale, styleParameters, vertexGeomLayoutParams, std::move(compressedVertexGeometry), std::move(compressedIndices), std::move(compressedIds));\n geometryList.push_back(std::move(geometry));\n }\n\n bool TileLayerBuilder::tesselateGlyph(const cglib::vec2& point, std::int8_t styleIndex, const cglib::vec2& pen, const cglib::vec2& size, const GlyphMap::Glyph* glyph) {\n float u0 = 0, v0 = 0, u1 = 0, v1 = 0;\n cglib::vec2 p0 = pen, p3 = pen + size;\n cglib::vec4 attrib(styleIndex, 0, 0, 0);\n if (glyph) {\n u0 = static_cast(glyph->x); // NOTE: u,v coordinates will be normalized when the layer is built\n v0 = static_cast(glyph->y);\n u1 = static_cast(glyph->x + glyph->width);\n v1 = static_cast(glyph->y + glyph->height);\n attrib(1) = (glyph->sdfMode ? -1 : 1);\n }\n\n if (_clipBox.inside(point)) {\n std::size_t i0 = _coords.size();\n _indices.append(i0 + 0, i0 + 2, i0 + 1);\n _indices.append(i0 + 0, i0 + 3, i0 + 2);\n\n _coords.append(point, point, point, point);\n _texCoords.append(cglib::vec2(u0, v0), cglib::vec2(u1, v0), cglib::vec2(u1, v1), cglib::vec2(u0, v1));\n _binormals.append(cglib::vec2(p0(0), p0(1)), cglib::vec2(p3(0), p0(1)), cglib::vec2(p3(0), p3(1)), cglib::vec2(p0(0), p3(1)));\n _attribs.append(attrib, attrib, attrib, attrib);\n }\n\n return true;\n }\n\n bool TileLayerBuilder::tesselatePolygon(const std::vector>>& pointsList, std::int8_t styleIndex, const PolygonStyle& style) {\n _tesselator.clear();\n if (!_tesselator.tesselate(pointsList)) {\n return false;\n }\n\n float du_dx = 0.0f, dv_dy = 0.0f;\n if (style.pattern) {\n du_dx = _tileSize / style.pattern->widthScale;\n dv_dy = _tileSize / style.pattern->heightScale;\n }\n\n std::size_t offset = _coords.size();\n for (std::size_t i = 0; i < _tesselator.getVertices().size(); i++) {\n cglib::vec2 p = _tesselator.getVertices()[i];\n cglib::vec2 uv((p(0) + 0.5f) * du_dx, (p(1) + 0.5f) * dv_dy);\n\n _coords.append(p);\n _texCoords.append(uv);\n }\n\n for (std::size_t i = 0; i < _tesselator.getElements().size(); i += 3) {\n int i0 = _tesselator.getElements()[i + 0];\n int i1 = _tesselator.getElements()[i + 1];\n int i2 = _tesselator.getElements()[i + 2];\n\n cglib::bbox2 bounds(_coords[i0 + offset]);\n bounds.add(_coords[i1 + offset]);\n bounds.add(_coords[i2 + offset]);\n if (_polygonClipBox.inside(bounds)) {\n std::array srcIndices = { { i0 + offset, i2 + offset, i1 + offset } };\n _transformer->tesselateTriangles(srcIndices.data(), srcIndices.size(), _coords, _texCoords, _indices);\n }\n }\n\n _attribs.fill(cglib::vec4(styleIndex, 0, 0, 0), _coords.size() - offset);\n\n return true;\n }\n\n bool TileLayerBuilder::tesselatePolygon3D(const std::vector>>& pointsList, float minHeight, float maxHeight, std::int8_t styleIndex, const Polygon3DStyle& style) {\n _tesselator.clear();\n if (!_tesselator.tesselate(pointsList)) {\n return false;\n }\n\n if (minHeight != maxHeight) {\n for (const std::vector>& points : pointsList) {\n std::size_t j = points.size() - 1;\n for (std::size_t i = 0; i < points.size(); i++) {\n cglib::bbox2 bounds(points[i]);\n bounds.add(points[j]);\n if (_polygonClipBox.inside(bounds)) {\n cglib::vec2 tangent(cglib::unit(points[i] - points[j]));\n cglib::vec2 binormal = cglib::vec2(tangent(1), -tangent(0));\n\n std::size_t i0 = _coords.size();\n _coords.append(points[i], points[j], points[j]);\n _texCoords.append(points[i], points[j], points[j]);\n _binormals.append(binormal, binormal, binormal);\n _heights.append(minHeight, minHeight, maxHeight);\n _attribs.append(cglib::vec4(styleIndex, 1, 0, 0), cglib::vec4(styleIndex, 1, 0, 0), cglib::vec4(styleIndex, 1, 1, 0));\n _indices.append(i0 + 0, i0 + 1, i0 + 2);\n\n std::size_t i1 = _coords.size();\n _coords.append(points[j], points[i], points[i]);\n _texCoords.append(points[j], points[i], points[i]);\n _binormals.append(binormal, binormal, binormal);\n _heights.append(maxHeight, maxHeight, minHeight);\n _attribs.append(cglib::vec4(styleIndex, 1, 1, 0), cglib::vec4(styleIndex, 1, 1, 0), cglib::vec4(styleIndex, 1, 0, 0));\n _indices.append(i1 + 0, i1 + 1, i1 + 2);\n }\n\n j = i;\n }\n }\n }\n\n std::size_t offset = _coords.size();\n for (std::size_t i = 0; i < _tesselator.getVertices().size(); i++) {\n cglib::vec2 p = _tesselator.getVertices()[i];\n\n _coords.append(p);\n _texCoords.append(p);\n }\n\n for (std::size_t i = 0; i < _tesselator.getElements().size(); i += 3) {\n int i0 = _tesselator.getElements()[i + 0];\n int i1 = _tesselator.getElements()[i + 1];\n int i2 = _tesselator.getElements()[i + 2];\n\n cglib::bbox2 bounds(_coords[i0 + offset]);\n bounds.add(_coords[i1 + offset]);\n bounds.add(_coords[i2 + offset]);\n if (_polygonClipBox.inside(bounds)) {\n std::array srcIndices = { { i0 + offset, i2 + offset, i1 + offset } };\n _transformer->tesselateTriangles(srcIndices.data(), srcIndices.size(), _coords, _texCoords, _indices);\n }\n }\n\n _binormals.fill(cglib::vec2(0, 0), _coords.size() - offset);\n _heights.fill(maxHeight, _coords.size() - offset);\n _attribs.fill(cglib::vec4(styleIndex, 0, 1, 0), _coords.size() - offset);\n\n return true;\n }\n\n bool TileLayerBuilder::tesselateLine(const std::vector>& linePoints, std::int8_t styleIndex, const StrokeMap::Stroke* stroke, const LineStyle& style) {\n if (linePoints.size() < 2) {\n return false;\n }\n\n float v0 = 0, v1 = 0, du_dl = 0;\n if (stroke) {\n v1 = stroke->y0 + 0.5f;\n v0 = stroke->y1 - 0.5f;\n du_dl = _tileSize / stroke->scale;\n }\n\n VertexArray> points;\n points.reserve(linePoints.size());\n _transformer->tesselateLineString(linePoints.data(), linePoints.size(), points);\n\n bool cycle = points[0] == points[points.size() - 1];\n bool endpoints = !cycle && style.capMode != LineCapMode::NONE;\n float linePos = 0;\n\n float minSplitDot = 1.0f;\n float minMiterDot = 1.0f;\n switch (style.joinMode) {\n case LineJoinMode::BEVEL:\n case LineJoinMode::ROUND:\n minSplitDot = stroke ? MIN_STROKE_DOT : MIN_BEVEL_DOT;\n break;\n case LineJoinMode::MITER:\n minSplitDot = stroke ? MIN_STROKE_DOT : MIN_BEVEL_DOT;\n minMiterDot = stroke ? MIN_STROKE_DOT : MIN_MITER_DOT;\n break;\n default:\n break;\n }\n\n std::size_t i = 1;\n for (; i < points.size(); i++) {\n if (points[i] != points[i - 1]) {\n break;\n }\n }\n if (i >= points.size()) {\n return false;\n }\n\n cglib::vec2 knotBinormal(0, 0);\n if (cycle) {\n std::size_t j = points.size() - 1;\n for (; j > i; j--) {\n if (points[j] != points[j - 1]) {\n break;\n }\n }\n\n cglib::vec2 prevTangent(cglib::unit(points[j] - points[j - 1]));\n cglib::vec2 prevBinormal = cglib::vec2(prevTangent(1), -prevTangent(0));\n cglib::vec2 tangent(cglib::unit(points[i] - points[i - 1]));\n cglib::vec2 binormal = cglib::vec2(tangent(1), -tangent(0));\n\n float dot = cglib::dot_product(binormal, prevBinormal);\n if (dot < minSplitDot) {\n cycle = endpoints = false;\n }\n else {\n knotBinormal = cglib::unit(binormal + prevBinormal) * (1 / std::sqrt((1 + dot) / 2));\n }\n }\n\n cglib::vec2 binormal(0, 0), tangent(0, 0);\n {\n const cglib::vec2& p0 = points[i - 1];\n const cglib::vec2& p1 = points[i];\n float u0 = linePos * du_dl;\n cglib::vec2 dp(p1 - p0);\n linePos += cglib::length(dp);\n\n tangent = cglib::unit(dp);\n binormal = cglib::vec2(tangent(1), -tangent(0));\n\n if (endpoints) {\n std::size_t i0 = _coords.size();\n tesselateLineEndPoint(p0, u0, v0, v1, i0 + 2, i0, -tangent, binormal, styleIndex, style); // refer to the point that will be added after end point\n }\n\n _coords.append(p0, p0);\n _texCoords.append(cglib::vec2(u0, v0), cglib::vec2(u0, v1));\n _binormals.append(cycle ? -knotBinormal : -binormal, cycle ? knotBinormal : binormal);\n _attribs.append(cglib::vec4(styleIndex, 0, 1, 0), cglib::vec4(styleIndex, 0, -1, 0));\n }\n\n while (++i < points.size()) {\n const cglib::vec2& p0 = points[i - 1];\n const cglib::vec2& p1 = points[i];\n if (p0 == p1) {\n continue;\n }\n float u0 = linePos * du_dl;\n cglib::vec2 dp(p1 - p0);\n linePos += cglib::length(dp);\n\n cglib::vec2 prevBinormal = binormal;\n cglib::vec2 prevTangent = tangent;\n tangent = cglib::unit(dp);\n binormal = cglib::vec2(tangent(1), -tangent(0));\n\n std::size_t i0 = _coords.size();\n\n cglib::bbox2 bounds(p0);\n bounds.add(_coords[i0 - 2]);\n if (_clipBox.inside(bounds)) {\n _indices.append(i0 - 1, i0 - 2, i0 + 0);\n _indices.append(i0 - 1, i0 + 0, i0 + 1);\n }\n\n float dot = cglib::dot_product(binormal, prevBinormal);\n if (dot < minSplitDot) {\n // Split line segments\n _coords.append(p0, p0);\n _texCoords.append(cglib::vec2(u0, v0), cglib::vec2(u0, v1));\n _binormals.append(-prevBinormal, prevBinormal);\n _attribs.append(cglib::vec4(styleIndex, 0, 1, 0), cglib::vec4(styleIndex, 0, -1, 0));\n\n _coords.append(p0, p0);\n _texCoords.append(cglib::vec2(u0, v0), cglib::vec2(u0, v1));\n _binormals.append(-binormal, binormal);\n _attribs.append(cglib::vec4(styleIndex, 0, 1, 0), cglib::vec4(styleIndex, 0, -1, 0));\n }\n else if (dot < minMiterDot) {\n // Use bevel line join\n cglib::vec2 lerpedBinormal = cglib::unit(binormal + prevBinormal);\n std::int8_t sin = static_cast(127.0f * cglib::dot_product(prevTangent, lerpedBinormal));\n cglib::vec2 lerpedScaledBinormal = lerpedBinormal * (1 / std::sqrt((1 + dot) * 0.5f));\n\n _coords.append(p0, p0);\n _texCoords.append(cglib::vec2(u0, v0), cglib::vec2(u0, v1));\n _attribs.append(cglib::vec4(styleIndex, 0, 1, -sin), cglib::vec4(styleIndex, 0, -1, 0));\n\n _coords.append(p0, p0);\n _texCoords.append(cglib::vec2(u0, v0), cglib::vec2(u0, v1));\n _attribs.append(cglib::vec4(styleIndex, 0, 1, sin), cglib::vec4(styleIndex, 0, -1, 0));\n\n if (cglib::dot_product(prevTangent, binormal) < 0) {\n _binormals.append(-prevBinormal, lerpedScaledBinormal);\n _binormals.append(-binormal, lerpedScaledBinormal);\n _indices.append(i0 + 1, i0 + 0, i0 + 2);\n } else {\n _binormals.append(-lerpedScaledBinormal, prevBinormal);\n _binormals.append(-lerpedScaledBinormal, binormal);\n _indices.append(i0 + 1, i0 + 0, i0 + 3);\n }\n }\n else {\n // Use miter line join\n cglib::vec2 lerpedBinormal = cglib::unit(binormal + prevBinormal);\n std::int8_t sin = static_cast(127.0f * cglib::dot_product(prevTangent, lerpedBinormal));\n cglib::vec2 lerpedScaledBinormal = lerpedBinormal * (1 / std::sqrt((1 + dot) * 0.5f));\n\n _coords.append(p0, p0);\n _texCoords.append(cglib::vec2(u0, v0), cglib::vec2(u0, v1));\n _binormals.append(-lerpedScaledBinormal, lerpedScaledBinormal);\n _attribs.append(cglib::vec4(styleIndex, 0, 1, -sin), cglib::vec4(styleIndex, 0, -1, sin));\n\n if (stroke) {\n _coords.append(p0, p0);\n _texCoords.append(cglib::vec2(u0, v0), cglib::vec2(u0, v1));\n _binormals.append(-lerpedScaledBinormal, lerpedScaledBinormal);\n _attribs.append(cglib::vec4(styleIndex, 0, 1, sin), cglib::vec4(styleIndex, 0, -1, -sin));\n }\n }\n }\n \n {\n const cglib::vec2& p0 = points[i - 1];\n float u0 = linePos * du_dl;\n\n std::size_t i0 = _coords.size();\n \n cglib::bbox2 bounds(p0);\n bounds.add(_coords[i0 - 2]);\n if (_clipBox.inside(bounds)) {\n _indices.append(i0 - 1, i0 - 2, i0 + 0);\n _indices.append(i0 - 1, i0 + 0, i0 + 1);\n }\n\n _coords.append(p0, p0);\n _texCoords.append(cglib::vec2(u0, v0), cglib::vec2(u0, v1));\n _binormals.append(cycle ? -knotBinormal : -binormal, cycle ? knotBinormal : binormal);\n _attribs.append(cglib::vec4(styleIndex, 0, 1, 0), cglib::vec4(styleIndex, 0, -1, 0));\n\n if (endpoints) {\n std::size_t i1 = _coords.size();\n tesselateLineEndPoint(p0, u0, v0, v1, i1, i0, tangent, binormal, styleIndex, style);\n }\n }\n return true;\n }\n\n bool TileLayerBuilder::tesselateLineEndPoint(const cglib::vec2& p0, float u0, float v0, float v1, std::size_t i0, std::size_t i1, const cglib::vec2& tangent, const cglib::vec2& binormal, std::int8_t styleIndex, const LineStyle& style) {\n if (_clipBox.inside(p0)) {\n float cap = style.capMode == LineCapMode::ROUND ? 1.0f : 0.0f;\n\n _coords.append(p0, p0);\n _texCoords.append(cglib::vec2(u0, v0), cglib::vec2(u0, v1));\n _binormals.append(tangent - binormal, tangent + binormal);\n _attribs.append(cglib::vec4(styleIndex, cap, 1, 0), cglib::vec4(styleIndex, cap, -1, 0));\n\n _indices.append(i0 + 1, i1 + 0, i0 + 0);\n _indices.append(i0 + 1, i1 + 1, i1 + 0);\n }\n return true;\n }\n} }\n", "meta": {"hexsha": "6d5adf65b4a88a4461f0cd75b393cc4d3337e111", "size": 55677, "ext": "cpp", "lang": "C++", "max_stars_repo_path": "vt/src/vt/TileLayerBuilder.cpp", "max_stars_repo_name": "CartoDB/mobile-carto-libs", "max_stars_repo_head_hexsha": "c1def8e8d91a98adff1aaef440c5d207be8ffe52", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 6.0, "max_stars_repo_stars_event_min_datetime": "2018-06-27T17:43:35.000Z", "max_stars_repo_stars_event_max_datetime": "2021-06-29T18:50:49.000Z", "max_issues_repo_path": "vt/src/vt/TileLayerBuilder.cpp", "max_issues_repo_name": "CartoDB/mobile-carto-libs", "max_issues_repo_head_hexsha": "c1def8e8d91a98adff1aaef440c5d207be8ffe52", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 22.0, "max_issues_repo_issues_event_min_datetime": "2019-04-10T06:38:09.000Z", "max_issues_repo_issues_event_max_datetime": "2022-01-20T08:12:02.000Z", "max_forks_repo_path": "vt/src/vt/TileLayerBuilder.cpp", "max_forks_repo_name": "CartoDB/mobile-carto-libs", "max_forks_repo_head_hexsha": "c1def8e8d91a98adff1aaef440c5d207be8ffe52", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 5.0, "max_forks_repo_forks_event_min_datetime": "2019-03-12T10:25:20.000Z", "max_forks_repo_forks_event_max_datetime": "2021-12-28T10:18:56.000Z", "avg_line_length": 52.7744075829, "max_line_length": 639, "alphanum_fraction": 0.6007148374, "num_tokens": 13747, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.5964331462646254, "lm_q2_score": 0.2509127812837603, "lm_q1q2_score": 0.14965269957908098}} {"text": "// Copyright 2020 The Beam Team\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\n#include \"utils.h\"\n\n#include \"wallet/core/common_utils.h\"\n#include \"wallet/core/strings_resources.h\"\n\n#include \n#include \n\nusing namespace std;\nusing namespace beam;\nusing namespace beam::wallet;\nusing namespace ECC;\n\nnamespace beam::wallet\n{\nbool ReadAmount(const po::variables_map& vm, Amount& amount, const Amount& limit, bool asset)\n{\n if (vm.count(cli::AMOUNT) == 0)\n {\n LOG_ERROR() << kErrorAmountMissing;\n return false;\n }\n\n const auto strAmount = vm[cli::AMOUNT].as();\n\n try\n {\n boost::multiprecision::cpp_dec_float_50 preciseAmount(strAmount.c_str());\n preciseAmount *= Rules::Coin;\n\n if (preciseAmount == 0)\n {\n LOG_ERROR() << kErrorZeroAmount;\n return false;\n }\n\n if (preciseAmount < 0)\n {\n LOG_ERROR() << (boost::format(kErrorNegativeAmount) % strAmount).str();\n return false;\n }\n\n if (preciseAmount > limit)\n {\n std::stringstream ssLimit;\n ssLimit << PrintableAmount(limit, false, asset ? kAmountASSET : \"\", asset ? kAmountAGROTH : \"\");\n LOG_ERROR() << (boost::format(kErrorTooBigAmount) % strAmount % ssLimit.str()).str();\n return false;\n }\n\n amount = preciseAmount.convert_to();\n }\n catch (const std::runtime_error& err)\n {\n LOG_ERROR() << \"the argument ('\" << strAmount << \"') for option '--amount' is invalid.\";\n LOG_ERROR() << err.what();\n return false;\n }\n\n return true;\n}\n\nbool ReadFee(const po::variables_map& vm, Amount& fee, bool checkFee)\n{\n if (auto it = vm.find(cli::FEE); it != vm.end())\n {\n fee = it->second.as>().value;\n }\n else\n {\n fee = kMinFeeInGroth;\n }\n\n if (checkFee && fee < kMinFeeInGroth)\n {\n LOG_ERROR() << kErrorFeeToLow;\n return false;\n }\n\n return true;\n}\n\nbool LoadReceiverParams(const po::variables_map& vm, TxParameters& params)\n{\n if (vm.find(cli::RECEIVER_ADDR) == vm.end())\n {\n LOG_ERROR() << kErrorReceiverAddrMissing;\n return false;\n }\n auto addressOrToken = vm[cli::RECEIVER_ADDR].as();\n auto receiverParams = ParseParameters(addressOrToken);\n if (!receiverParams)\n {\n LOG_ERROR() << kErrorReceiverAddrMissing;\n return false;\n }\n if (!LoadReceiverParams(*receiverParams, params))\n {\n return false;\n }\n if (auto peerID = params.GetParameter(beam::wallet::TxParameterID::PeerID); !peerID || std::to_string(*peerID) != addressOrToken)\n {\n params.SetParameter(beam::wallet::TxParameterID::OriginalToken, addressOrToken);\n }\n\n if (vm.find(cli::MAX_PRIVACY_ADDRESS) != vm.end() && vm[cli::MAX_PRIVACY_ADDRESS].as())\n {\n params.SetParameter(TxParameterID::TransactionType, TxType::PushTransaction);\n }\n return true;\n}\n\nbool LoadBaseParamsForTX(const po::variables_map& vm, Asset::ID& assetId, Amount& amount, Amount& fee, WalletID& receiverWalletID, bool checkFee, bool skipReceiverWalletID)\n{\n if (!skipReceiverWalletID)\n {\n TxParameters params;\n if (!LoadReceiverParams(vm, params))\n {\n return false;\n }\n if (auto peerID = params.GetParameter(TxParameterID::PeerID); peerID)\n {\n receiverWalletID = *peerID;\n }\n }\n\n if (!ReadAmount(vm, amount))\n {\n return false;\n }\n\n if (!ReadFee(vm, fee, checkFee))\n {\n return false;\n }\n\n if(vm.count(cli::ASSET_ID)) // asset id can be zero if beam only\n {\n assetId = vm[cli::ASSET_ID].as>().value;\n }\n\n return true;\n}\n\nbool CheckFeeForShieldedInputs(Amount amount, Amount fee, Asset::ID assetId, const IWalletDB::Ptr& walletDB, bool isPushTx, Amount& feeForShieldedInputs)\n{\n Transaction::FeeSettings fs;\n Amount shieldedOutputsFee = isPushTx ? fs.m_Kernel + fs.m_Output + fs.m_ShieldedOutput : 0;\n\n auto coinSelectionRes = CalcShieldedCoinSelectionInfo(\n walletDB, amount, (isPushTx && fee > shieldedOutputsFee) ? fee - shieldedOutputsFee : fee, assetId, isPushTx);\n feeForShieldedInputs = coinSelectionRes.shieldedInputsFee;\n\n bool isBeam = assetId == Asset::s_BeamID;\n if (isBeam && (coinSelectionRes.selectedSumBeam - coinSelectionRes.selectedFee - coinSelectionRes.changeBeam) < amount)\n {\n LOG_ERROR() << kErrorNotEnoughtCoins;\n return false;\n }\n\n if (!isBeam && (coinSelectionRes.selectedSumAsset - coinSelectionRes.changeAsset < amount))\n {\n // TODO: enough beam & asset\n LOG_ERROR() << kErrorNotEnoughtCoins;\n return false;\n }\n\n if (coinSelectionRes.minimalFee > fee)\n {\n if (isPushTx && !coinSelectionRes.shieldedInputsFee)\n {\n LOG_ERROR() << boost::format(kErrorFeeForShieldedOutToLow) % coinSelectionRes.minimalFee;\n }\n else\n {\n LOG_ERROR() << boost::format(kErrorFeeForShieldedToLow) % coinSelectionRes.minimalFee;\n }\n return false;\n }\n\n return true;\n}\n\n} // namespace beam::wallet", "meta": {"hexsha": "902ba76eff604153a2629e3771ef970eb957f0f4", "size": 5806, "ext": "cpp", "lang": "C++", "max_stars_repo_path": "wallet/cli/utils.cpp", "max_stars_repo_name": "anatolse/beam", "max_stars_repo_head_hexsha": "43c4ce0011598641d9cdeffbfdee66fde0a49730", "max_stars_repo_licenses": ["Apache-2.0"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "wallet/cli/utils.cpp", "max_issues_repo_name": "anatolse/beam", "max_issues_repo_head_hexsha": "43c4ce0011598641d9cdeffbfdee66fde0a49730", "max_issues_repo_licenses": ["Apache-2.0"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "wallet/cli/utils.cpp", "max_forks_repo_name": "anatolse/beam", "max_forks_repo_head_hexsha": "43c4ce0011598641d9cdeffbfdee66fde0a49730", "max_forks_repo_licenses": ["Apache-2.0"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 29.175879397, "max_line_length": 172, "alphanum_fraction": 0.6370995522, "num_tokens": 1446, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.519521321952093, "lm_q2_score": 0.28776780965284365, "lm_q1q2_score": 0.1495015128861036}} {"text": "/* Copyright (C) 2010-2019, The Regents of The University of Michigan.\n All rights reserved.\n\n This software was developed as part of the The Vulcan project in the Intelligent Robotics Lab\n under the direction of Benjamin Kuipers, kuipers@umich.edu. Use of this code is governed by an\n MIT-style License that can be found at \"https://github.com/h2ssh/Vulcan\".\n*/\n\n\n/**\n* \\file dynamic_object_filter.cpp\n* \\author Collin Johnson and Jong Jin Park\n*\n* Definition of DynamicObjectFilter.\n*/\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n\nnamespace vulcan\n{\nnamespace mpepc\n{\n\nstruct object_goal_visitor : public boost::static_visitor\n{\n position_t objPosition;\n double objHeading;\n double goalHeading;\n\n object_goal_visitor(position_t objPosition, double objHeading, double goalHeading)\n : objPosition(objPosition)\n , objHeading(objHeading)\n , goalHeading(goalHeading)\n {\n }\n\n pose_t operator()(const Line& goal);\n pose_t operator()(const Point& goal);\n};\n\n\nDynamicObjectFilter::DynamicObjectFilter(const dynamic_object_filter_params_t& params)\n: params_(params)\n{\n}\n\n\nstd::vector DynamicObjectFilter::filterObjects(const tracker::DynamicObjectCollection& objects,\n const motion_state_t& robotState,\n const ObstacleDistanceGrid& map,\n int64_t startTimeUs)\n{\n std::vector filteredObjects;\n\n for(auto& object : objects)\n {\n // read the state of a tracked object and form a candidate object\n if(startTimeUs - object->timeLastSeen() > params_.staleObjectTimeUs)\n {\n std::cout<<\"WARNING!: DynamicObjectFilter: Timestamp of the tracked object is old. This data is ignored \\\n as it may be stale.\\n\";\n }\n else\n {\n dynamic_object_state_t objState = createObjectState(*object);\n\n // Ignore objects that are far from the robot or too close to walls to matter\n if(isNearRobot(objState, robotState) && isFarFromWalls(objState, map))\n {\n // TODO: bunch of heuristic here to make things work. Clean it up!\n // special treatment for things behind the robot\n if(params_.shouldSlowdownObjectsBehindRobot)\n {\n objState = slowdownObjectBehindRobot(objState, robotState);\n }\n\n // cap object speeds\n float speed = std::sqrt(objState.xVel * objState.xVel + objState.yVel * objState.yVel);\n if(speed > params_.maxObjectSpeed)\n {\n objState.xVel = objState.xVel / speed * params_.maxObjectSpeed;\n objState.yVel = objState.yVel / speed * params_.maxObjectSpeed;\n }\n\n // set start state for trajectory estimation\n float timeToForward = utils::usec_to_sec(startTimeUs - object->timeLastSeen());\n objState.x += objState.xVel * timeToForward;\n objState.y += objState.yVel * timeToForward;\n\n // initialize dynamic object trajectory and push to storage\n dynamic_object_trajectory_t trajectory;\n trajectory.type = DynamicObjectType::pedestrian;\n trajectory.timestamp = startTimeUs;\n trajectory.priorProbability = 1.0;\n trajectory.laserObject = object->clone();\n trajectory.states.push_back(objState);\n trajectory.goal = estimateGoal(*object);\n trajectory.preferredVel = estimatePreferredVelocity(objState, trajectory.goal);\n\n std::cout << \"Created object at \" << objState.x << ',' << objState.y << \" Vel: \"\n << objState.xVel << ',' << objState.yVel << \" Goal:\" << trajectory.goal\n << \" Pref vel:\" << trajectory.preferredVel << '\\n';\n\n filteredObjects.push_back(trajectory);\n }\n }\n }\n\n return filteredObjects;\n}\n\n\nvoid DynamicObjectFilter::visitPerson(const tracker::Person& person)\n{\n std::cerr<<\"ERROR!!: DynamicObjectFilter: Unable to handle person model.\\n\\n\";\n assert(false);\n}\n\n\nvoid DynamicObjectFilter::visitUnclassified(const tracker::UnclassifiedObject& object)\n{\n initialObjectState_ = object.motionState();\n}\n\n\nvoid DynamicObjectFilter::visitRigid(const tracker::RigidObject& object)\n{\n using msi = tracker::MotionStateIndex;\n\n // ignore spurious velocity estimate based on its uncertainty\n // velocity uncertainty\n auto motionStateWithUncertainty = object.slowMotionState();\n\n // get the largest eigenvalue of the covariance on velocity\n Matrix velocityCov = motionStateWithUncertainty.getCovariance().submat(msi::velXIndex, msi::velXIndex, msi::velYIndex, msi::velYIndex);\n Vector eigVal = arma::eig_sym(velocityCov);\n\n initialObjectState_ = object.motionState();\n double maxStdDev = std::sqrt(eigVal(1)); // eigenvalues are in ascending order, and is in covariance so scale them\n // to get the standard deviation\n\n if(maxStdDev > params_.maxTrustedVelocityStd)\n {\n initialObjectState_.xVel = 0.0;\n initialObjectState_.yVel = 0.0;\n }\n else if(maxStdDev > params_.startUntrustedVelocityStd)\n {\n double uncertainVelocityScale = 1.0 - ((maxStdDev - params_.startUntrustedVelocityStd) /\n (params_.maxTrustedVelocityStd - params_.startUntrustedVelocityStd));\n initialObjectState_.xVel *= uncertainVelocityScale;\n initialObjectState_.yVel *= uncertainVelocityScale;\n }\n}\n\n\nvoid DynamicObjectFilter::visitPivotingObject(const tracker::PivotingObject& door)\n{\n std::cerr<<\"ERROR!!: DynamicObjectFilter: Unable to handle pivoting object model.\\n\\n\";\n assert(false);\n}\n\n\nvoid DynamicObjectFilter::visitSlidingObject(const tracker::SlidingObject& door)\n{\n std::cerr<<\"ERROR!!: DynamicObjectFilter: Unable to handle sliding object model.\\n\\n\";\n assert(false);\n}\n\n\ndynamic_object_state_t DynamicObjectFilter::createObjectState(const tracker::DynamicObject& trackedObject)\n{\n trackedObject.accept(*this);\n return initialObjectState_;\n}\n\n\nbool DynamicObjectFilter::isNearRobot(const dynamic_object_state_t& objectState,\n const motion_state_t& robotState)\n{\n return true; // temporary turn-off\n\n // TODO: the distance threshod and the lookahead time perhaps should be a function of maximum velocity of the robot and the planning horizon.\n const float DISTANCE_THRESHOLD = 7.5f; // meters\n const float LOOKAHEAD_TIME = 5.0f; // second\n\n // relative distance, speed and orientation\n float relativeX = objectState.x - robotState.pose.x;\n float relativeY = objectState.y - robotState.pose.y;\n float relativeDistance = std::sqrt(relativeX * relativeX + relativeY * relativeY);\n\n float normalizedRelativeX = relativeX / relativeDistance;\n float normalizedRelativeY = relativeY / relativeDistance;\n\n// // relative orientation\n// float lineOfSightOrientation = atan2(objectState.y - robotState.pose.y, objectState.x - robotState.pose.x);\n// float relativeOrientation = wrap_to_pi(lineOfSightOrientation - robotState.pose.theta);\n\n // relative speed\n float xVelRelative = objectState.xVel - (robotState.velocity.linear * cos(robotState.pose.theta));\n float yVelRelative = objectState.yVel - (robotState.velocity.linear * sin(robotState.pose.theta));\n\n // inner product of the relative velocity of an object toward the robot and the negative of the direction of the line of sight gives the approach speed of the object toward the robot.\n float approachSpeed = (xVelRelative * -normalizedRelativeX) + (yVelRelative * -normalizedRelativeY);\n\n return (relativeDistance - (approachSpeed * LOOKAHEAD_TIME)) < DISTANCE_THRESHOLD;\n}\n\n\nbool DynamicObjectFilter::isFarFromWalls(const dynamic_object_state_t& objectState, const ObstacleDistanceGrid& map)\n{\n return true; // temporary turn-off\n\n// Point objectLocationInCell = map.positionToCell(Point(objectState.x, objectState.y));\n//\n// return map.getObstacleDistance(objectLocationInCell) < 0.1; // TODO: remove this hard coded constant to config!\n}\n\n\ndynamic_object_state_t DynamicObjectFilter::slowdownObjectBehindRobot(const dynamic_object_state_t& objectState,\n const motion_state_t& robotState)\n{\n dynamic_object_state_t slowedState = objectState;\n\n // relative orientation in global reference frame (angle of line of sight)\n float lineOfSightOrientation = std::atan2(objectState.y - robotState.pose.y, objectState.x - robotState.pose.x);\n\n // relative distance and orientation in robot frame\n float distToObject = distance_between_points(objectState.x,\n objectState.y,\n robotState.pose.x,\n robotState.pose.y);\n // is 0 when the object is directly behind the robot.\n float headingToObject = M_PI - std::abs(wrap_to_pi(lineOfSightOrientation - robotState.pose.theta));\n\n // Is the object in the slowdown cone?\n if((headingToObject < params_.slowdownObjectConeAngle) && (distToObject < 10.0))\n {\n // underestimate velocities of objects within the slowdown cone\n float slowdownFactor = (0.5 * headingToObject) / (params_.slowdownObjectConeAngle + 0.5);\n slowedState.xVel *= slowdownFactor;\n slowedState.yVel *= slowdownFactor;\n\n // push back objects directly behind the robot by some amount so that it doesn't scare the robot.\n if(distToObject < params_.ignoreObjectConeRadius)\n {\n slowedState.x += params_.ignoreObjectConeRadius * std::cos(lineOfSightOrientation);\n slowedState.y += params_.ignoreObjectConeRadius * std::sin(lineOfSightOrientation);\n }\n }\n\n return slowedState;\n}\n\n\npose_t DynamicObjectFilter::estimateGoal(const tracker::DynamicObject& trackedObject)\n{\n auto objectGoal = trackedObject.goals().bestGoal();\n\n // Do we trust this goal?\n if(objectGoal.probability() > params_.minGoalProbability)\n {\n object_goal_visitor goalVisitor(trackedObject.position(),\n std::atan2(trackedObject.velocity().y, trackedObject.velocity().x),\n objectGoal.heading());\n return objectGoal.destination().apply_visitor(goalVisitor);\n }\n // Stick with ballistic velocity estimate\n else\n {\n auto state = trackedObject.motionState();\n return pose_t(state.x + (state.xVel * 10.0),\n state.y + (state.yVel * 10.0),\n std::atan2(state.yVel, state.xVel));\n }\n}\n\n\nPoint DynamicObjectFilter::estimatePreferredVelocity(const dynamic_object_state_t& objectState,\n const pose_t& objectGoal)\n{\n Point preferredVelocity;\n\n // The preferred velocity has the same heading as the goal state and the same magnitude as the object state\n double speed = std::sqrt((objectState.xVel * objectState.xVel) + (objectState.yVel * objectState.yVel));\n\n // TODO: preferred velocity vector should be computed using uncertainty weights, accelerations, and maybe slow states.\n preferredVelocity.x = speed * std::cos(objectGoal.theta);\n preferredVelocity.y = speed * std::sin(objectGoal.theta);\n\n return preferredVelocity;\n}\n\n\npose_t object_goal_visitor::operator()(const Line& goal)\n{\n // Assume that the object will travel through the right side of the gateway line. The right side is\n // determined by the goal heading\n\n Line headingLine;\n headingLine.a = objPosition;\n headingLine.b.x = headingLine.a.x + (std::cos(goalHeading) * 1000);\n headingLine.b.y = headingLine.a.y + (std::sin(goalHeading) * 1000);\n\n double dx = goal.b.x - goal.a.x;\n double dy = goal.b.y - goal.a.y;\n\n const int kNumSteps = 10;\n const double kOffset = 0.1;\n const double kStepX = dx * (1.0 - 2.0 * kOffset) / kNumSteps;\n const double kStepY = dy * (1.0 - 2.0 * kOffset) / kNumSteps;\n\n // Consider one of three possible goals along the boundary line\n // The agent is assumed to be going to the closest of the three\n std::vector> goals;\n for(int n = 0; n < kNumSteps; ++n)\n {\n goals.emplace_back(goal.a.x + (dx * kOffset) + (kStepX * n),\n goal.a.y + (dy * kOffset) + (kStepY * n));\n }\n\n pose_t goalPose;\n goalPose.theta = goalHeading;\n\n auto bestGoalIt = std::min_element(goals.begin(), goals.end(), [&](const auto& lhs, const auto& rhs) {\n return angle_diff_abs(angle_to_point(objPosition, lhs), objHeading)\n < angle_diff_abs(angle_to_point(objPosition, rhs), objHeading);\n });\n\n goalPose.x = bestGoalIt->x;\n goalPose.y = bestGoalIt->y;\n\n return goalPose;\n}\n\n\npose_t object_goal_visitor::operator()(const Point& goal)\n{\n return pose_t(goal, goalHeading);\n}\n\n} // namespace mpepc\n} // namespace vulcan\n", "meta": {"hexsha": "1603a414703885f619c49e2cb541c1befe55ff2e", "size": 13806, "ext": "cpp", "lang": "C++", "max_stars_repo_path": "src/mpepc/simulator/dynamic_object_filter.cpp", "max_stars_repo_name": "h2ssh/Vulcan", "max_stars_repo_head_hexsha": "cc46ec79fea43227d578bee39cb4129ad9bb1603", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 6.0, "max_stars_repo_stars_event_min_datetime": "2020-03-29T09:37:01.000Z", "max_stars_repo_stars_event_max_datetime": "2022-01-20T08:56:31.000Z", "max_issues_repo_path": "src/mpepc/simulator/dynamic_object_filter.cpp", "max_issues_repo_name": "h2ssh/Vulcan", "max_issues_repo_head_hexsha": "cc46ec79fea43227d578bee39cb4129ad9bb1603", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 1.0, "max_issues_repo_issues_event_min_datetime": "2021-03-05T08:00:50.000Z", "max_issues_repo_issues_event_max_datetime": "2021-03-05T08:00:50.000Z", "max_forks_repo_path": "src/mpepc/simulator/dynamic_object_filter.cpp", "max_forks_repo_name": "h2ssh/Vulcan", "max_forks_repo_head_hexsha": "cc46ec79fea43227d578bee39cb4129ad9bb1603", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 11.0, "max_forks_repo_forks_event_min_datetime": "2019-05-13T00:04:38.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-20T08:56:38.000Z", "avg_line_length": 39.1104815864, "max_line_length": 187, "alphanum_fraction": 0.6588439809, "num_tokens": 2997, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO\n\n", "lm_q1_score": 0.5621765155565326, "lm_q2_score": 0.2658804672827598, "lm_q1q2_score": 0.1494717546515646}} {"text": "/************************************\n \uc218\uc815\uc0ac\ud56d\n \uc218\uc815\ud55c \uc0ac\ub78c: bs\n \uc218\uc815\uc77c: 2004-11-18 \uc624\ud6c4 3:37:20\n \uc124\uba85: \uc2a4\ud0ef \ubcc0\ud654 \uc801\uc6a9\n ************************************/\n#include \n#include \"stdhdrs.h\"\n\n#include \"Server.h\"\n#include \"Skill.h\"\n#include \"Assist.h\"\n#include \"CmdMsg.h\"\n#include \"Log.h\"\n#include \"Artifact_Manager.h\"\n\n#define APPVAL(v)\t\t{ \\\n\t\t\t\t\t\t\tswitch (mp->m_damagetype) \\\n\t\t\t\t\t\t\t{ \\\n\t\t\t\t\t\t\tcase MDT_ADDITION: \\\n\t\t\t\t\t\t\t\taddition->v += mlp->m_nPowerValue * CalcSkillParam(ch, ch, SPARAM_NONE, mp->m_ptp) / 100; \\\n\t\t\t\t\t\t\t\tbreak; \\\n\t\t\t\t\t\t\tcase MDT_RATE: \\\n\t\t\t\t\t\t\t\trate->v += mlp->m_nPowerValue * CalcSkillParam(ch, ch, SPARAM_NONE, mp->m_ptp) / 100; \\\n\t\t\t\t\t\t\t\tif( rate->v < -90 ) rate->v = -90; \\\n\t\t\t\t\t\t\t\tbreak; \\\n\t\t\t\t\t\t\t} \\\n\t\t\t\t\t\t}\n////////////////////\n// class CAssistData\n\nCAssistData::CAssistData(MSG_CHAR_TYPE spellertype, int spellerindex, int itemidx, const CSkillProto* proto, int level, int remain,\n\t\t\t\t\t\t int remainCount,\n\t\t\t\t\t\t bool bHit[MAX_SKILL_MAGIC])\n\t\t\t\t\t\t : attr_rand(0)\n{\n\tif (itemidx < 0)\n\t\tm_index = -1;\n\telse\n\t\tm_index = itemidx;\n\n\tm_proto = proto;\n\tm_level = level;\n\tm_remain = remain;\n\tmemcpy(m_bHit, bHit, sizeof(bool) * MAX_SKILL_MAGIC);\n\n\tm_prev = NULL;\n\tm_next = NULL;\n\n\tm_spellerType = spellertype;\n\tm_spellerIndex = spellerindex;\n#ifdef ASSIST_DECREASE_TIME_BUG_FIX\n\tm_prevtime = 0;\n#endif\n\tm_remainCount = remainCount;\n}\n\n////////////////////\n// class CAssistList\n\nCAssistList::CAssistList()\n{\n\tm_head = NULL;\n\tm_tail = NULL;\n\tm_max = 0;\n\tm_count = 0;\n\tm_abscount = 0;\n}\n\nCAssistList::~CAssistList()\n{\n\twhile (m_head)\n\t{\n\t\tCAssistData* p = m_head->m_next;\n\t\tdelete m_head;\n\t\tm_head = p;\n\t}\n\n\tm_head = NULL;\n\tm_tail = NULL;\n}\n\nvoid CAssistList::Max(int n)\n{\n\tm_max = n;\n}\n\nbool CAssistList::Add(CCharacter* spellchar, int itemidx, const CSkillProto* proto, int level, bool bHit[MAX_SKILL_MAGIC], int& remain,\n\t\t\t\t\t int &remainCount,\n\t\t\t\t\t int param, int nBlessAdd, int nBlessRate, int decreaseDBufRemain)\n{\n\tif (proto && (proto->m_flag & SF_ABSTIME) && m_abscount >= MAX_ASSIST_ABS )\n\t\treturn false;\n\n\tif (m_count >= m_max && !(proto->m_flag & SF_ABSTIME))\n\t\treturn false;\n\n\tconst CSkillLevelProto* levelproto = proto->Level(level);\n\n\tif (levelproto == NULL)\n\t\treturn false;\n\n\tif (remain == -1 && decreaseDBufRemain > 0 && proto->m_flag == SF_NOTHELP)\n\t{\n\t\tremain = levelproto->m_durtime;\n\t\tremain = remain * (param / 100);\n\t\tremain += nBlessAdd\n\t\t\t\t + remain * nBlessRate / SKILL_RATE_UNIT;\n\t\tremain = remain - remain * decreaseDBufRemain / 10000;\n\t}\n\telse if (remain == -1)\n\t{\n\t\tremain = levelproto->m_durtime;\n\t\tremain = remain * (param / 100);\n\t\tremain += nBlessAdd\n\t\t\t\t + remain * nBlessRate / SKILL_RATE_UNIT;\n\t}\n\telse if ( itemidx>0 && remain > levelproto->m_durtime )\n\t{\n\t\tGAMELOG << init(\"ASSIST_HUGE_LUCKY \") << \"ITEM :\"\n\t\t\t\t<< itemidx << delim << remain << delim << levelproto->m_durtime << end;\n\t\tremain = levelproto->m_durtime;\n\t}\n#ifdef BUGFIX_HUGE_SKILL_ABSTIME\n\telse if ( proto && (proto->m_flag & SF_ABSTIME) && (remain > levelproto->m_durtime * 2) )\n\t{\n\t\tGAMELOG << init(\"ASSIST_HUGE_ABSTIME \") << \"ITEM :\"\n\t\t\t\t<< itemidx << delim << remain << delim << levelproto->m_durtime << end;\n\t\tremain = levelproto->m_durtime * 2;\n\t}\n#endif\n\n#ifdef ENABLE_ROGUE_SKILL125_BRZ\n\telse\n\t{\n\t\tif(proto->m_index == 125)\n\t\t{\n\t\t\tremain = remain * (param / 100);\n\t\t\tremain += nBlessAdd\n\t\t\t\t\t + remain * nBlessRate / SKILL_RATE_UNIT;\n\t\t}\n\t}\n#endif // ENABLE_ROGUE_SKILL125_BRZ\n\n\tif (remainCount < 0)\n\t{\n\t\tremainCount = levelproto->m_useCount;\n\t}\n\n\tMSG_CHAR_TYPE spellertype = (spellchar) ? spellchar->m_type : MSG_CHAR_UNKNOWN;\n\tint spellerindex = (spellchar) ? spellchar->m_index : 0;\n\tCAssistData* p = new CAssistData(spellertype, spellerindex, itemidx, proto, level, remain,\n\t\t\t\t\t\t\t\t\t remainCount,\n\t\t\t\t\t\t\t\t\t bHit);\n\n#ifdef ASSIST_DECREASE_TIME_BUG_FIX\n\tp->m_prevtime = gserver->getNowSecond();\n#endif\n\n\tif (m_head == NULL)\n\t{\n\t\t// \ud558\ub098\ub3c4 \uc5c6\uc73c\uba74\n\t\tm_head = m_tail = p;\n\t}\n\telse\n\t{\n\t\tm_tail->m_next = p;\n\t\tp->m_prev = m_tail;\n\t\tm_tail = p;\n\t}\n\n\tif (proto && (proto->m_flag & SF_ABSTIME) )\n\t\tm_abscount++;\n\telse\n\t\tm_count++;\n\n\treturn true;\n}\n\nbool CAssistList::CanApply(const CSkillProto* proto, int level)\n{\n\tconst CSkillLevelProto* inlevelproto = proto->Level(level);\n\tif (inlevelproto == NULL)\n\t\treturn false;\n\n\tCAssistData* data;\n\tconst CSkillLevelProto* listlevelproto;\n\tconst CMagicProto* inmagic;\n\tconst CMagicProto* listmagic;\n\tint i, j;\n\n\t// \ub9ac\uc2a4\ud2b8 \ub8e8\ud504\n\tfor (data = m_head; data; data = data->m_next)\n\t{\n\t\tlistlevelproto = data->m_proto->Level(data->m_level);\n\t\tif (listlevelproto == NULL)\n\t\t\tcontinue ;\n\n\t\t// \ub9ac\uc2a4\ud2b8\uc758 \uc2a4\ud0ac \ub8e8\ud504\n\t\tfor (i = 0; i < MAX_SKILL_MAGIC; i++)\n\t\t{\n\t\t\tlistmagic = listlevelproto->m_magic[i];\n\t\t\tif (listmagic == NULL)\n\t\t\t\tcontinue ;\n\n\t\t\t// \uc785\ub825 \uc2a4\ud0ac \ub8e8\ud504\n\t\t\tfor (j = 0; j < MAX_SKILL_MAGIC; j++)\n\t\t\t{\n\t\t\t\tinmagic = inlevelproto->m_magic[j];\n\t\t\t\tif (inmagic == NULL)\n\t\t\t\t\tcontinue ;\n\n\t\t\t\t// \ube44\uad50\n\t\t\t\tif (inmagic->m_index != listmagic->m_index)\n\t\t\t\t\tcontinue ;\n\t\t\t\tif( (inmagic->m_index == 518 || inmagic->m_index == 519 ) && gserver->isActiveEvent(A_EVENT_HALLOWEEN))\n\t\t\t\t\tcontinue;\n\n\t\t\t\tif( proto->m_index == 1756 || proto->m_index == 1757 )\n\t\t\t\t\tcontinue;\n\n\t\t\t\tif (inlevelproto->m_magicLevel[j] < listlevelproto->m_magicLevel[i])\n\t\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn true;\n}\n\n// 060227 : bs : \uc808\ub300\uc2dc\uac04 \ubc84\ud504 \ucd94\uac00\nvoid CAssistList::DelDuplicate(const CSkillProto* proto, int level, bool bSend, CCharacter* ch, bool bNoCancelType)\n{\n\tconst CSkillLevelProto* inlevelproto = proto->Level(level);\n\tif (inlevelproto == NULL)\n\t\treturn ;\n\n\tCAssistData* data;\n\tCAssistData* dataNext;\n\tconst CSkillLevelProto* listlevelproto;\n\tconst CMagicProto* inmagic;\n\tconst CMagicProto* listmagic;\n\tint i, j;\n\tbool bDelete;\n\tbool statusUpdate = true;\n\n\t// \ub9ac\uc2a4\ud2b8 \ub8e8\ud504\n\tdataNext = m_head;\n\twhile ((data = dataNext))\n\t{\n\t\tdataNext = data->m_next;\n\n\t\tlistlevelproto = data->m_proto->Level(data->m_level);\n\t\tif (listlevelproto == NULL)\n\t\t\tcontinue ;\n\n\t\tbDelete = false;\n\n\t\t// \ub9ac\uc2a4\ud2b8\uc758 \uc2a4\ud0ac \ub8e8\ud504\n\t\tfor (i = 0; i < MAX_SKILL_MAGIC && !bDelete; i++)\n\t\t{\n\t\t\tlistmagic = listlevelproto->m_magic[i];\n\t\t\tif (listmagic == NULL)\n\t\t\t\tcontinue ;\n\n\t\t\t// \uc785\ub825 \uc2a4\ud0ac \ub8e8\ud504\n\t\t\tfor (j = 0; j < MAX_SKILL_MAGIC; j++)\n\t\t\t{\n\t\t\t\tinmagic = inlevelproto->m_magic[j];\n\t\t\t\tif (inmagic == NULL)\n\t\t\t\t\tcontinue ;\n\n\t\t\t\t// \ube44\uad50\n\t\t\t\tif (inmagic->m_index != listmagic->m_index)\n\t\t\t\t\tcontinue ;\n\n\t\t\t\tif (inmagic->m_type == MT_STAT && inmagic->m_subtype == MST_STAT_MAXHP || inmagic->m_subtype == MST_STAT_MAXMP)\n\t\t\t\t{\n\t\t\t\t\tstatusUpdate = false;\n\t\t\t\t}\n\n\t\t\t\tif ( proto->m_index == 1756 || proto->m_index == 1757 )\n\t\t\t\t{\n\t\t\t\t\tbDelete = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif (listlevelproto->m_magicLevel[i] <= inlevelproto->m_magicLevel[j])\n\t\t\t\t{\n\t\t\t\t\tbDelete = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (!bDelete)\n\t\t\tcontinue ;\n\n\t\tDelAssist(data, bSend, ch, bNoCancelType, statusUpdate);\n\t}\n}\n\nbool CAssistList::DecreaseTime(CCharacter* ch, LONGLONG* changestate)\n{\n\tbool ret = false;\n\n\tCAssistData* data;\n\tCAssistData* dataNext = m_head;\n\n\tconst CSkillProto* sp;\n\tconst CSkillLevelProto* slp;\n\tconst CMagicProto* mp;\n\tconst CMagicLevelProto* mlp;\n\tbool bCancel;\n\tint i;\n\n\twhile ((data = dataNext))\n\t{\n\t\tdataNext = data->m_next;\n\n\t\tbool bSkip = false;\n\t\t// \uc99d\ud3ed\uc81c\ub294 \uc2dc\uac04 \uac10\uc18c \uc5c6\uc74c\n\t\tswitch (data->m_index)\n\t\t{\n\t\tcase 882:\n\t\tcase 883:\n\t\tcase 884:\n\t\tcase 885:\n\t\tcase 2875:\n\t\tcase 2855:\n\t\t//[100823: selo] \uc720\ub8cc \uc99d\ud3ed\uc81c\n\t\tcase 6094:\n\t\tcase 6095:\n\t\tcase 6096:\n\t\tcase 7344:\t\t// \ud3ab \uacbd\ud5d8\uce58 \uc99d\ud3ed\uc81c\n\t\tcase 7345:\n\t\tcase 7346:\t\t// \uc544\uc774\ub9ac\uc2a4\uc758 \uc5f4\uc815\n#ifdef REFORM_PK_PENALTY_201108 // \uc131\ud5a5 \uc218\uce58 \uc0c1\uc2b9 \uc99d\ud3ed\uc81c\ub294 \uc2dc\uac04 \uac10\uc18c \uc5c6\ub2e4.\n\t\tcase 7474:\t// \uc131\ud5a5 \uc218\uce58 \uc0c1\uc2b9 \uc99d\ud3ed\uc81c\n\t\tcase 7475:\t// \uc131\ud5a5 \uc218\uce58 \uc0c1\uc2b9 \uc99d\ud3ed\uc81c\n\t\tcase 7476:\t// \uc131\ud5a5 \uc218\uce58 \uc0c1\uc2b9 \uc99d\ud3ed\uc81c\n#endif\n\t\tcase 10804:\n\t\t\tbSkip = true;\n\t\t\tbreak;\n\t\t}\n\n\t\tswitch (data->m_proto->m_index)\n\t\t{\n\t\tcase 1756:\n\t\tcase 1757:\n\t\t\tbSkip = true;\n\t\t\tbreak;\n\t\t}\n\n\t\tif(data->m_proto->m_flag & SF_COMBO)\t\t// \uc2dc\uac04\uac10\uc18c\uc5c6\ub294\uc2a4\ud0ac\n\t\t\tcontinue;\n\n\t\t// \ud53c\ub2c9\uc2a4 \ubc84\ud504\uc77c \uacbd\uc6b0\n\t\tif ( data->m_proto->m_index == 516 )\n\t\t{\n\t\t\t// \ub808\ubca8 100 \uae4c\uc9c0\ub9cc \uc0ac\uc6a9\n\t\t\tif( ch->m_level < 100 )\n\t\t\t\tbSkip = true;\n\t\t}\n\n\t\tif (bSkip)\n\t\t\tcontinue ;\n\n\t\t// \ub9e4\ubc88 \uc801\uc6a9\ub418\ub294 \uc0c1\ud0dc \uac80\uc0ac\n\t\tsp = data->m_proto;\n\t\tif (!sp)\n\t\t\tcontinue;\n\t\tslp = sp->Level(data->m_level);\n\t\tif (!slp)\n\t\t\tcontinue;\n\t\ti = 0;\n\t\tbCancel = false;\n\t\twhile (i < MAX_SKILL_MAGIC && !bCancel)\n\t\t{\n\t\t\tmp = slp->m_magic[i];\n\t\t\tif (mp)\n\t\t\t{\n\t\t\t\tmlp = mp->Level(slp->m_magicLevel[i]);\n\t\t\t\tif (mlp)\n\t\t\t\t{\n\t\t\t\t\tint nPowerValue = mlp->m_nPowerValue * CalcSkillParam(ch, ch, SPARAM_NONE, mp->m_ptp) / 100;\n\n\t\t\t\t\tswitch (slp->m_magic[i]->m_type)\n\t\t\t\t\t{\n\t\t\t\t\tcase MT_ASSIST:\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tswitch (slp->m_magic[i]->m_subtype)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t// FREEZE \uc0c1\ud0dc\uc5d0 \uac78\ub9ac\uba74 \uad50\uac10 \uc911\uc9c0\n\t\t\t\t\t\t\tcase MST_ASSIST_FREEZE:\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tCDratanCastle * pCastle = CDratanCastle::CreateInstance();\n\t\t\t\t\t\t\t\t\tif (IS_PC(ch) && TO_PC(ch) != NULL)\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tpCastle->CheckRespond(TO_PC(ch));\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t// Dot Damage \uc8fd\uc9c0\ub294 \uc54a\ub294 \uc2dc\uac04\ub2f9 \ub370\ubbf8\uc9c0\n\t\t\t\t\t\t\tcase MST_ASSIST_POISON:\n\t\t\t\t\t\t\tcase MST_ASSIST_BLOOD:\n\t\t\t\t\t\t\tcase MST_ASSIST_DISEASE:\n\t\t\t\t\t\t\tcase MST_ASSIST_CURSE:\n\t\t\t\t\t\t\tcase MST_ASSIST_HP_DOT:\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tif (ch->m_hp > 1)\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tswitch (mp->m_damagetype)\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tcase MDT_RATE:\n\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t// yhj 090305 \uc720\uc800\uac00 \ub514\ubc84\ud504\ub97c \uac78\uc5c8\uc744 \uacbd\uc6b0 \uc2dc\uac04\ub2f9 \ub370\ubbf8\uc9c0\ub97c 1/5 \ub85c..\n\t\t\t\t\t\t\t\t\t\t\t\tswitch( ch->m_type )\n\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\tcase MSG_CHAR_PC:\n\t\t\t\t\t\t\t\t\t\t\t\t\tch->m_hp -= (int)ch->m_maxHP * ( (nPowerValue / SKILL_RATE_UNIT / 20) ) ;\n\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\t\t\t\t\t\t// yhj 090305 \uc720\uc800\ub97c \uc81c\uc678\ud55c \uac83\uc740 \ub514\ubc84\ud504\ub97c \uac78\uc5c8\uc744 \uacbd\uc6b0 \ucd08\ub2f9 \ub370\ubbf8\uc9c0 \uadf8\ub300\ub85c\uc784..\n\t\t\t\t\t\t\t\t\t\t\t\tcase MSG_CHAR_NPC:\n\t\t\t\t\t\t\t\t\t\t\t\tcase MSG_CHAR_PET:\n\t\t\t\t\t\t\t\t\t\t\t\tcase MSG_CHAR_ELEMENTAL:\n\t\t\t\t\t\t\t\t\t\t\t\tcase MSG_CHAR_APET:\n\t\t\t\t\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\t\t\t\t\t{\n#ifdef TLD_EVENT_SONG\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tint minusHp = (int)ch->m_maxHP * nPowerValue / SKILL_RATE_UNIT;\n\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (ch->m_type == MSG_CHAR_NPC)\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tCNPC* pNpc = TO_NPC(ch);\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (pNpc->m_proto->m_index == 1622 || pNpc->m_proto->m_index == 1623)\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tminusHp = 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tch->m_hp -= minusHp;\n#else\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tch->m_hp -= (int)ch->m_maxHP * nPowerValue / SKILL_RATE_UNIT;\n#endif\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\tswitch( ch->m_type )\n\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\tcase MSG_CHAR_PC:\n\t\t\t\t\t\t\t\t\t\t\t\t\tch->m_hp -= (int)( nPowerValue/20 );\n\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\t\t\t\t\t\t// yhj 090305 \uc720\uc800\ub97c \uc81c\uc678\ud55c \uac83\uc740 \ub514\ubc84\ud504\ub97c \uac78\uc5c8\uc744 \uacbd\uc6b0 \ucd08\ub2f9 \ub370\ubbf8\uc9c0 \uadf8\ub300\ub85c\uc784..\n\t\t\t\t\t\t\t\t\t\t\t\tcase MSG_CHAR_NPC:\n\t\t\t\t\t\t\t\t\t\t\t\tcase MSG_CHAR_PET:\n\t\t\t\t\t\t\t\t\t\t\t\tcase MSG_CHAR_ELEMENTAL:\n\t\t\t\t\t\t\t\t\t\t\t\tcase MSG_CHAR_APET:\n\t\t\t\t\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\t\t\t\t\t{\n#ifdef TLD_EVENT_SONG\n\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tint minusHp = nPowerValue;\n\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (ch->m_type == MSG_CHAR_NPC)\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tCNPC* pNpc = TO_NPC(ch);\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (pNpc->m_proto->m_index == 1622 || pNpc->m_proto->m_index == 1623)\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tminusHp = 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tch->m_hp -= minusHp;\n#else\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tch->m_hp -= nPowerValue;\n#endif\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t\tif (ch->m_hp <= 0)\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\tif(sp->m_index == ROYAL_RUMBLE_DEBUFF_SKILL)\n\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\tch->m_hp = 0;\n\t\t\t\t\t\t\t\t\t\t\t\tif(IS_PC(ch))\n\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\tCPC* evoPC = NULL;\n\t\t\t\t\t\t\t\t\t\t\t\t\tevoPC = TO_PC(ch);\n\t\t\t\t\t\t\t\t\t\t\t\t\tif(evoPC)\n\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif(evoPC->m_evocationIndex != EVOCATION_NONE)\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tevoPC->Unevocation();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t// \uac15\uc2e0 \uc2dc\uac04 \ucd08\uae30\ud654\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tevoPC->m_pulseEvocation[0] = 0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tevoPC->m_pulseEvocation[1] = 0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tGAMELOG << init(\"ROYAL RUMBLE DEAD PC\", TO_PC(ch)) << \"SKILL INDEX\" << delim << sp->m_index << end;\n\t\t\t\t\t\t\t\t\t\t\t\t\tCWaitPlayer* p = NULL;\n\t\t\t\t\t\t\t\t\t\t\t\t\tp = gserver->m_RoyalRumble.m_WaitPlayerList.GetNode(TO_PC(ch)->m_index);\n\t\t\t\t\t\t\t\t\t\t\t\t\tif(p)\n\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tint leveltype = p->GetLevelType();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tint leftcount = 0;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tCWaitPlayer* player = NULL;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tCWaitPlayer* playern = NULL;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tplayern = gserver->m_RoyalRumble.m_WaitPlayerList.GetHead();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\twhile((player = playern))\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tplayern = playern->GetNext();\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif( player->GetLevelType() == leveltype &&\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tplayer->GetCheckIn() == true )\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tleftcount++;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tleftcount -= 2;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tCNetMsg::SP rmsg(new CNetMsg);\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tRoyalRumbleLeftCount(rmsg, leftcount);\n\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tCNetMsg::SP killmsg(new CNetMsg);\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tRoyalRumbleKillPlayer(killmsg, TO_PC(ch), TO_PC(ch));\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tswitch(leveltype)\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcase LEVEL_TYPE_ROOKIE:\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tgserver->m_RoyalRumble.m_pRookieArea->SendToAllClient(rmsg);\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tgserver->m_RoyalRumble.m_pRookieArea->SendToAllClient(killmsg);\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcase LEVEL_TYPE_SENIOR:\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tgserver->m_RoyalRumble.m_pSeniorArea->SendToAllClient(rmsg);\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tgserver->m_RoyalRumble.m_pSeniorArea->SendToAllClient(killmsg);\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcase LEVEL_TYPE_MASTER:\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tgserver->m_RoyalRumble.m_pMasterArea->SendToAllClient(rmsg);\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tgserver->m_RoyalRumble.m_pMasterArea->SendToAllClient(killmsg);\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\tgserver->m_RoyalRumble.m_WaitPlayerList.DelNode(TO_PC(ch)->m_index);\n\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t\t\t\t\tch->m_hp = 1;\n\t\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\t\tswitch (slp->m_magic[i]->m_subtype)\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tcase MST_ASSIST_POISON:\n\t\t\t\t\t\t\t\t\t\t\t*changestate |= AST_POISON;\n\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\tcase MST_ASSIST_BLOOD:\n\t\t\t\t\t\t\t\t\t\t\t*changestate |= AST_BLOOD;\n\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\tcase MST_ASSIST_DISEASE:\n\t\t\t\t\t\t\t\t\t\t\t*changestate |= AST_DISEASE;\n\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\tcase MST_ASSIST_CURSE:\n\t\t\t\t\t\t\t\t\t\t\t*changestate |= AST_CURSE;\n\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\tcase MST_ASSIST_HP_DOT:\n\t\t\t\t\t\t\t\t\t\t\t*changestate |= AST_HP_DOT;\n\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t/*\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tcase MST_ASSIST_POISON:\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (ch->m_hp > 1)\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tswitch (mp->m_damagetype)\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcase MDT_RATE:\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tch->m_hp -= (int)ch->m_maxHP * nPowerValue / SKILL_RATE_UNIT;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tch->m_hp -= nPowerValue;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (ch->m_hp <= 0)\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tch->m_hp = 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t*changestate |= AST_POISON;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tcase MST_ASSIST_BLOOD:\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (ch->m_hp > 1)\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tswitch (mp->m_damagetype)\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcase MDT_RATE:\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tch->m_hp -= (int)ch->m_maxHP * nPowerValue / SKILL_RATE_UNIT;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tch->m_hp -= nPowerValue;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (ch->m_hp <= 0)\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tch->m_hp = 1;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t*changestate |= AST_BLOOD;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t*/\n\t\t\t\t\t\t\tcase MST_ASSIST_HP:\n\t\t\t\t\t\t\t\tswitch (mp->m_damagetype)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tcase MDT_RATE:\n\t\t\t\t\t\t\t\t\tch->m_hp += (int)ch->m_maxHP * nPowerValue / SKILL_RATE_UNIT;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\tch->m_hp += nPowerValue;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif (ch->m_hp > ch->m_maxHP)\n\t\t\t\t\t\t\t\t\tch->m_hp = ch->m_maxHP;\n\t\t\t\t\t\t\t\tif (ch->m_hp <= 0)\n\t\t\t\t\t\t\t\t\tch->m_hp = 1;\n\t\t\t\t\t\t\t\t*changestate |= AST_HP;\n\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\tcase MST_ASSIST_MP:\n\t\t\t\t\t\t\t\tswitch (mp->m_damagetype)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tcase MDT_RATE:\n\t\t\t\t\t\t\t\t\tch->m_mp += (int)ch->m_maxMP * nPowerValue / SKILL_RATE_UNIT;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\tch->m_mp += nPowerValue;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif (ch->m_mp > ch->m_maxMP)\n\t\t\t\t\t\t\t\t\tch->m_mp = ch->m_maxMP;\n\t\t\t\t\t\t\t\tif (ch->m_mp < 0)\n\t\t\t\t\t\t\t\t\tch->m_mp = 0;\n\t\t\t\t\t\t\t\t*changestate |= AST_MP;\n\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\tcase MST_ASSIST_HP_CANCEL:\n\t\t\t\t\t\t\t\tswitch (mp->m_damagetype)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tcase MDT_RATE:\n\t\t\t\t\t\t\t\t\tch->m_hp += (int)ch->m_maxHP * nPowerValue / SKILL_RATE_UNIT;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\tch->m_hp += nPowerValue;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif (ch->m_hp > ch->m_maxHP)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tch->m_hp = ch->m_maxHP;\n\t\t\t\t\t\t\t\t\tbCancel = true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif (ch->m_hp <= 0)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tch->m_hp = 1;\n\t\t\t\t\t\t\t\t\tbCancel = true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t*changestate |= AST_HP_CANCEL;\n\t\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\t\tcase MST_ASSIST_MP_CANCEL:\n\t\t\t\t\t\t\t\tswitch (mp->m_damagetype)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tcase MDT_RATE:\n\t\t\t\t\t\t\t\t\tch->m_mp += (int)ch->m_maxMP * nPowerValue / SKILL_RATE_UNIT;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\tch->m_mp += nPowerValue;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif (ch->m_mp > ch->m_maxMP)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tch->m_mp = ch->m_maxMP;\n\t\t\t\t\t\t\t\t\tbCancel = true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif (ch->m_mp < 0)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tch->m_mp = 0;\n\t\t\t\t\t\t\t\t\tbCancel = true;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t*changestate |= AST_MP_CANCEL;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase MST_ASSIST_INVINCIBILITY:\n\t\t\t\t\t\t\t\tif ( IS_PC(ch) )\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tCPC* pPC =\t TO_PC(ch);\n\t\t\t\t\t\t\t\t\tpPC->SetPlayerState( PLAYER_STATE_INVINCIBILITY );\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\ti++;\n\t\t}\n#ifdef ASSIST_DECREASE_TIME_BUG_FIX\n\t\tdata->m_remain -= ((gserver->getNowSecond() - data->m_prevtime) * 10);\n\t\tdata->m_prevtime = gserver->getNowSecond();\n#else\n\t\tdata->m_remain -= PULSE_ASSIST_CHECK;\n#endif\n\t\tif( IS_NPC(ch) && TO_NPC(ch)->GetOwner() &&\n\t\t\t\t( TO_NPC(ch)->Check_MobFlag(STATE_MONSTER_TOTEM_BUFF) || TO_NPC(ch)->Check_MobFlag(STATE_MONSTER_TOTEM_ATTK)) )\n\t\t{\n\t\t\tif( data->m_proto->Level(1)->m_magic[0] && data->m_proto->Level(1)->m_magic[0]->m_type == MT_ASSIST &&\n\t\t\t\t\t( data->m_proto->Level(1)->m_magic[0]->m_subtype == MST_ASSIST_SOUL_TOTEM_BUFF\n\t\t\t\t\t || data->m_proto->Level(1)->m_magic[0]->m_subtype == MST_ASSIST_SOUL_TOTEM_ATTK ) )\n\t\t\t{\n\t\t\t\tch->m_hp = data->m_remain * ch->m_maxHP / data->m_proto->Level(1)->m_durtime ;\n\t\t\t\tif( ch->m_hp < 0 )\n\t\t\t\t\tch->m_hp = 0;\n\t\t\t}\n\t\t}\n\n\t\tif (data->m_remain <= 0 || bCancel\n\t\t\t\t|| (slp->m_useCount > 0 && data->m_remainCount <= 0)\n\t\t )\n\t\t{\n\t\t\t// \uacbd\ud5d8\uce58 \ubd80\ud65c \uc219\ub828\ub3c4 \uc8fc\ubb38\uc11c\uc77c \uacbd\uc6b0 \ubc84\ud504\ub97c \uc0ad\uc81c\ud558\uc9c0 \uc54a\ub294\ub2e4.\n\t\t\tif( data->m_index == 844\n\t\t\t\t\t|| data->m_index == 845\n\t\t\t\t\t|| data->m_index == 846\t\t// \ubd80\ud65c \uc8fc\ubb38\uc11c\n\t\t\t\t\t|| data->m_index == 7056\t// \uc774\ubca4\ud2b8 \ubd80\ud65c \uc8fc\ubb38\uc11c\n\t\t\t\t\t|| data->m_index == 2667\t// \ucd08\ubcf4\uc790\uc6a9 \ubd80\ud65c \uc8fc\ubb38\uc11c\n\t\t\t\t\t|| data->m_index == 2371\n\t\t\t\t\t|| data->m_index == ONE_PERIOD_ITEM\n\t\t\t\t\t|| data->m_index == SEVEN_PERIOD_ITEM\n\t\t\t\t\t|| data->m_index == THIRTY_PERIOD_ITEM\n\t\t\t\t\t|| data->m_index == 2610\n\t\t\t\t\t|| data->m_index == 4940\n\t\t\t\t\t|| data->m_index == 4941\n\t\t\t\t\t|| data->m_index == 4942\n\t\t\t\t\t|| data->m_index == 3218\n\t\t\t )\n\t\t\t{\n\t\t\t\tdata->m_remain = 0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tint old_skillIndex;\n\t\t\t\t// \uc2dc\uac04\uc5d0 \uc758\ud55c \ud06c\ub9ac\uc2a4\ub9c8\uc2a4 \uc2a4\ud0ac \uc81c\uac70 ( SkillIndex : 490 )\n\t\t\t\t// NPC\ub97c \uc18c\ud658 \ud55c\ub2e4\n\t\t\t\told_skillIndex = data->m_proto->m_index;\n\t\t\t\tif( old_skillIndex == 490 )\n\t\t\t\t{\n\t\t\t\t\tif( gserver->isActiveEvent( A_EVENT_XMAS) )\n\t\t\t\t\t{\n\t\t\t\t\t\tif( !ch->m_pZone->IsPersonalDungeon() \n\t\t\t\t\t\t\t&& !(ch->GetMapAttr() & MATT_FREEPKZONE) && !(ch->GetMapAttr() & MATT_PEACE)\n\t\t\t\t\t\t\t&& !ch->m_pZone->IsGuildRoom() && !ch->m_pZone->IsOXQuizRoom() )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tCNPC* pBoxNpc = gserver->m_npcProtoList.Create( 483/*\ud06c\ub9ac\uc2a4\ub9c8\uc2a4 \uc120\ubb3c \uc0c1\uc790*/, NULL );\n\t\t\t\t\t\t\tif ( pBoxNpc )\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tGET_X(pBoxNpc) = GET_X(ch) + (GetRandom(0, 1) ? -1 : 1) * GetRandom(20, 50) / 10.0f;\n\t\t\t\t\t\t\t\tGET_Z(pBoxNpc) = GET_Z(ch) + (GetRandom(0, 1) ? -1 : 1) * GetRandom(20, 50) / 10.0f;\n\t\t\t\t\t\t\t\tGET_YLAYER(pBoxNpc) = GET_YLAYER(ch);\n\t\t\t\t\t\t\t\tGET_R(pBoxNpc) = GetRandom(0, (int) (PI_2 * 10000)) / 10000;\n\n\t\t\t\t\t\t\t\tif (ch->m_pArea->GetAttr(GET_YLAYER(pBoxNpc), GET_X(pBoxNpc), GET_Z(pBoxNpc)) & MATT_WALKABLE )\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tpBoxNpc->m_regenX = GET_X(pBoxNpc);\n\t\t\t\t\t\t\t\t\tpBoxNpc->m_regenY = GET_YLAYER(pBoxNpc);\n\t\t\t\t\t\t\t\t\tpBoxNpc->m_regenZ = GET_Z(pBoxNpc);\n\n\t\t\t\t\t\t\t\t\tpBoxNpc->m_regenTimeXmas2007 = gserver->m_pulse;\n\n\t\t\t\t\t\t\t\t\tint cx, cz;\n\t\t\t\t\t\t\t\t\tch->m_pArea->AddNPC(pBoxNpc);\n\t\t\t\t\t\t\t\t\tch->m_pArea->PointToCellNum(GET_X(pBoxNpc), GET_Z(pBoxNpc), &cx, &cz);\n\t\t\t\t\t\t\t\t\tch->m_pArea->CharToCell(pBoxNpc, GET_YLAYER(pBoxNpc), cx, cz);\n\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tCNetMsg::SP rmsg(new CNetMsg);\n\t\t\t\t\t\t\t\t\t\tAppearMsg(rmsg, pBoxNpc, true);\n\t\t\t\t\t\t\t\t\t\tch->m_pArea->SendToCell(rmsg, GET_YLAYER(pBoxNpc), cx, cz);\n\t\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t\tGAMELOG << init(\" EVENT XMAS XMAS BOX REGEN \" ) << ch->m_name << end;\t// \uc2a4\ud0ac \uc801\uc6a9 \uc2e4\ud328\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\told_skillIndex = data->m_proto->m_index;\n\n\t\t\t\tif( old_skillIndex == 1060 )\t\t// \ucd9c\uc11d\ub300\uae30 \uc0ad\uc81c\uc2dc \ucd9c\uc11d \uccb4\ud06c subtype 2\n\t\t\t\t{\n\t\t\t\t\t//\ucd9c\uc11d\ubc84\ud504\uac00 \ub05d\ub0ac\ub2e4\uba74 \ucd9c\uc11d \uc778\uc815\ud574\uc8fc\uae30\n\t\t\t\t\tCPC* pc = TO_PC(ch);\n\t\t\t\t\tpc->m_attendanceManager.finish();\n\t\t\t\t}\n\n\t\t\t\tbool\tbInfinite = false;\n\t\t\t\tint\t\told_skillLevel = data->m_level;\n\t\t\t\tint\t\told_itemIndex = data->m_index;\n\n\t\t\t\tif( data->m_proto->m_flag & SF_INFINITE )\n\t\t\t\t{\n\t\t\t\t\tbInfinite = true;\n\t\t\t\t}\n\n\t\t\t\ti = 0;\n\t\t\t\twhile (i < MAX_SKILL_MAGIC )\n\t\t\t\t{\n\t\t\t\t\tif( !slp->m_magic[i] )\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tint nPowerValue = -1;\n\n\t\t\t\t\tmp = slp->m_magic[i];\n\t\t\t\t\tif (mp)\n\t\t\t\t\t{\n\t\t\t\t\t\tmlp = mp->Level(slp->m_magicLevel[i]);\n\t\t\t\t\t\tif (mlp)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tnPowerValue = mlp->m_nPowerValue * CalcSkillParam(ch, ch, SPARAM_NONE, mp->m_ptp) / 100;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tif( nPowerValue < 1 )\n\t\t\t\t\t{\n\t\t\t\t\t\tif ( IS_PC(ch) && TO_PC(ch)->IsSetPlayerState(PLAYER_STATE_INVINCIBILITY))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tCPC* pPC =\t TO_PC(ch);\n\t\t\t\t\t\t\tpPC->ResetPlayerState( PLAYER_STATE_INVINCIBILITY );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\tif(slp->m_magic[i]->m_type == MT_OTHER )\n\t\t\t\t\t{\n\t\t\t\t\t\tswitch (slp->m_magic[i]->m_subtype )\n\t\t\t\t\t\t{\n\t\t\t\t\t\tcase MST_OTHER_ITEMDROP:\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tif( GetRandom(0,10000) < mlp->m_nHitrateValue )\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tCItem* pdropItem = gserver->m_itemProtoList.CreateItem( nPowerValue , -1, 0, 0, 1 );\n\t\t\t\t\t\t\t\t\tif( pdropItem && ch )\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tpdropItem->m_pos = CPos(GET_X(ch), GET_Z(ch), ch->m_pos.m_h, GET_R(ch), GET_YLAYER(ch));\n\n\t\t\t\t\t\t\t\t\t\t// \uc88c\ud45c \ubcf4\uc815\n\t\t\t\t\t\t\t\t\t\tif (GET_X(pdropItem) < 0)\t\tGET_X(pdropItem) = 0;\n\t\t\t\t\t\t\t\t\t\tif (GET_Z(pdropItem) < 0)\t\tGET_Z(pdropItem) = 0;\n\t\t\t\t\t\t\t\t\t\t// 050207 - bs : \uce35\uc5d0 \uad00\uacc4\uc5c6\uc774 \uc0ac\uc774\uc988\ub294 0\ubc88 \uce35\uc5d0\uc11c \ucc38\uc870\n\t\t\t\t\t\t\t\t\t\tif (GET_X(pdropItem) >= ch->m_pArea->m_zone->m_attrMap[0].m_size[0])\n\t\t\t\t\t\t\t\t\t\t\tGET_X(pdropItem) = ch->m_pArea->m_zone->m_attrMap[0].m_size[0];\n\t\t\t\t\t\t\t\t\t\tif (GET_Z(pdropItem) >= ch->m_pArea->m_zone->m_attrMap[0].m_size[1])\n\t\t\t\t\t\t\t\t\t\t\tGET_Z(pdropItem) = ch->m_pArea->m_zone->m_attrMap[0].m_size[1];\n\n\t\t\t\t\t\t\t\t\t\t// \uc140\uc5d0 \ub123\uae30\n\t\t\t\t\t\t\t\t\t\tpdropItem->m_pArea = ch->m_pArea;\n\t\t\t\t\t\t\t\t\t\tpdropItem->m_groundPulse = gserver->m_pulse;\n\n\t\t\t\t\t\t\t\t\t\tint cx, cz;\n\t\t\t\t\t\t\t\t\t\tch->m_pArea->PointToCellNum(GET_X(pdropItem), GET_Z(pdropItem), &cx, &cz);\n\t\t\t\t\t\t\t\t\t\tch->m_pArea->ItemToCell(pdropItem, GET_YLAYER(pdropItem), cx, cz);\n\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\tCNetMsg::SP rmsg(new CNetMsg);\n\t\t\t\t\t\t\t\t\t\t\tItemDropMsg( rmsg, ch, pdropItem );\n\t\t\t\t\t\t\t\t\t\t\tpdropItem->m_pArea->SendToCell( rmsg, GET_YLAYER( pdropItem ), pdropItem->m_cellX, pdropItem->m_cellZ );\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase MST_OTHER_SKILL:\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tCSkill *pSkill = gserver->m_skillProtoList.Create( nPowerValue , mlp->m_nHitrateValue );\n\t\t\t\t\t\t\t\tif( pSkill )\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tbool bApply = false ;\n\t\t\t\t\t\t\t\t\tApplySkill( ch, ch, pSkill, -1 , bApply );\n\t\t\t\t\t\t\t\t\tif(bApply == true)\n\t\t\t\t\t\t\t\t\t\treturn ret;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase MST_OTHER_INSTANTDEATH:\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tch->m_hp = 0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n#ifdef REFORM_PK_PENALTY_201108\n\t\t\t\t\t\tcase MST_OTHER_PK_DISPOSITION:\n\t\t\t\t\t\t\tswitch( slp->m_magic[i]->m_damagetype )\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcase MDT_ADDITION:\n\t\t\t\t\t\t\t\tch->m_assist.m_avAddition.pkDispositionPointValue = 0;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\tcase MDT_RATE:\n\t\t\t\t\t\t\t\tch->m_assist.m_avRate.pkDispositionPointValue = 0;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n#endif // REFORM_PK_PENALTY_201108\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse if(slp->m_magic[i]->m_type == MT_ATTRIBUTE && slp->m_magic[i]->m_subtype == AT_RANDOM)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(slp->m_magic[i]->m_damagetype == MDT_ATTACK)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tch->m_assist.m_avAddition.attratt_item = 0;\n\n\t\t\t\t\t\t\tif(IS_PC(ch) == true)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tCPC* pc = TO_PC(ch);\n\t\t\t\t\t\t\t\tpc->m_bChangeStatus = true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if(IS_NPC(ch) == true)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tCNPC* npc = TO_NPC(ch);\n\t\t\t\t\t\t\t\tunsigned char attr;\n\n\t\t\t\t\t\t\t\tif(ch->m_assist.getAttrAtt() > 0)\n\t\t\t\t\t\t\t\t\tattr = ch->m_assist.getAttrAtt();\n\t\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t\tattr = npc->m_proto->m_attratt;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\tCNetMsg::SP rmsg(new CNetMsg);\n\t\t\t\t\t\t\t\tUpdateClient::AttrNpcStateMsg(rmsg, MDT_ATTACK, attr, ch->m_index);\n\t\t\t\t\t\t\t\tch->m_pArea->SendToCell(rmsg, ch);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if(slp->m_magic[i]->m_damagetype == MDT_DEFENCE)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tch->m_assist.m_avAddition.attrdef_item = 0;\n\n\t\t\t\t\t\t\tif(IS_PC(ch) == true)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tCPC* pc = TO_PC(ch);\n\t\t\t\t\t\t\t\tpc->m_bChangeStatus = true;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if(IS_NPC(ch) == true)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tCNPC* npc = TO_NPC(ch);\n\t\t\t\t\t\t\t\tunsigned char attr;\n\n\t\t\t\t\t\t\t\tif(ch->m_assist.getAttrDef() > 0)\n\t\t\t\t\t\t\t\t\tattr = ch->m_assist.getAttrDef();\n\t\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t\tattr = npc->m_proto->m_attrdef;\n\n\t\t\t\t\t\t\t\tCNetMsg::SP rmsg(new CNetMsg);\n\t\t\t\t\t\t\t\tUpdateClient::AttrNpcStateMsg(rmsg, MDT_DEFENCE, attr, ch->m_index);\n\t\t\t\t\t\t\t\tch->m_pArea->SendToCell(rmsg, ch);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\ti++;\n\t\t\t\t}\n\n\t\t\t\tif(data->m_proto->m_index == 1759)\n\t\t\t\t{\n\t\t\t\t\tCPC* pc = TO_PC(ch);\n\t\t\t\t\tpc->m_gpsManager.deleteTarget();\n\t\t\t\t}\n\n\t\t\t\tDelAssist(data, true, ch, true);\n\t\t\t\tret = true;\n\n\t\t\t\tif( bInfinite )\n\t\t\t\t{\n\t\t\t\t\tCSkill *pSkill = gserver->m_skillProtoList.Create( old_skillIndex , old_skillLevel );\n\t\t\t\t\tif( pSkill )\n\t\t\t\t\t{\n\t\t\t\t\t\tbool bApply = false ;\n\t\t\t\t\t\tApplySkill( ch, ch, pSkill, old_itemIndex , bApply );\n\t\t\t\t\t\tif(bApply == true)\n\t\t\t\t\t\t\treturn ret;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif( old_skillIndex == 490 && gserver->isActiveEvent( A_EVENT_XMAS) )\n\t\t\t\t{\n\t\t\t\t\tCSkill *pSkill = gserver->m_skillProtoList.Create( old_skillIndex , 1 );\n\t\t\t\t\tif( pSkill )\n\t\t\t\t\t{\n\t\t\t\t\t\tbool bApply = false ;\n\t\t\t\t\t\tApplySkill( ch, ch, pSkill, -1 , bApply );\n\t\t\t\t\t\tif( !bApply )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tGAMELOG << init(\" EVENT XMAS SKILL FAILED \" ) << ch->m_name << end;\t// \uc2a4\ud0ac \uc801\uc6a9 \uc2e4\ud328\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\t\t\t\t\n\t\t\t}\n\t\t\t//\uc2dc\uac04\uc774 \ub05d\ub0ac\uace0 \uc5b4\ub514\uc5d0 \uc788\uc73c\uba74\n\t\t\tif( sp->m_index == 1751 )\n\t\t\t{\n\t\t\t\tif(IS_NPC(ch))\n\t\t\t\t{\n\t\t\t\t\tCNPC* npc = TO_NPC(ch);\n\t\t\t\t\tnpc->m_ctTime = IMMUN_SKILL_MCT_TIME;\n\t\t\t\t\tgserver->m_npc_ctTime.insert(std::pair(npc->m_index, npc));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif( sp->m_index == PVP_PROTECT_SKILL_INDEX )\n\t\t\t{\n\t\t\t\tCPC* pc = TO_PC(ch);\n\t\t\t\tCNetMsg::SP rmsg(new CNetMsg);\n\t\t\t\tSysMsg(rmsg, MSG_SYS_PVP_PROTECT_ITEM_END);\n\t\t\t\tSEND_Q(rmsg, pc->m_desc);\n\t\t\t}\n\t\t}\n\t}\n\treturn ret;\n}\n\nvoid CAssistList::Apply(CCharacter* ch, ASSISTVALUE* addition, ASSISTVALUE* rate, LONGLONG* state)\n{\n\tCAssistData* p;\n\tconst CSkillProto* sp;\n\tconst CSkillLevelProto* slp;\n\tconst CMagicProto* mp;\n\tconst CMagicLevelProto* mlp;\n\tint i;\n\n\tfor (p = m_head; p; p = p->m_next)\n\t{\n\t\tsp = p->m_proto;\n\t\tif (sp == NULL)\n\t\t\tcontinue;\n\t\tslp = sp->Level(p->m_level);\n\t\tif (slp == NULL)\n\t\t\tcontinue;\n\n\t\t// TODO : \ud558\ub4dc\ucf54\ub529\uc6a9\n\n\t\tbool bSkip = false;\n\n\t\t// \uc544\uc774\ud15c \uc778\ub371\uc2a4 \ud558\ub4dc \ucf54\ub529\n\t\tswitch (p->m_index)\n\t\t{\n\t\tcase 2388:\n\t\t\taddition->hcExpPlus_2388 += 100;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t// Poem book\n\t\tcase 2389:\n\t\t\taddition->hcExpPlus_2389 += 50;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t// Blessing of Mother( Blue )\n\t\tcase 2390:\n\t\t\taddition->hcSPPlus_2390 += 100;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t// Blessing of Mother( Yellow )\n\t\tcase 2391:\n\t\t\taddition->hcDropPlus_2391 = true;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t// Blessing of Mother( Red )\n\t\tcase 671:\n\t\tcase 7271:\n\t\t\taddition->hcDeathExpPlus = 1;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \ud558\uae09 \uacbd\ud5d8\uc758 \uacb0\uc815\n\t\tcase 672:\n\t\tcase 7272:\n\t\t\taddition->hcDeathExpPlus = 2;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \uc911\uae09 \uacbd\ud5d8\uc758 \uacb0\uc815\n\t\tcase 673:\n\t\tcase 7273:\n\t\t\taddition->hcDeathExpPlus = 3;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \uc0c1\uae09 \uacbd\ud5d8\uc758 \uacb0\uc815\n\t\tcase 674:\n\t\t\taddition->hcDeathSPPlus = true;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \ub178\ub825\uc758 \uacb0\uc815\n\t\tcase 508:\n\t\t\taddition->hcExpPlus = true;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \ub5a1\uad6d\n\t\tcase 509:\n\t\t\taddition->hcSPPlus = true;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \ub5a1\ub9cc\ub450\uad6d\n\t\tcase 836:\n\t\t\taddition->hcExpPlus_836 = true;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \uc218\ubc15\n\t\tcase 5082:\n\t\tcase 837:\n\t\t\taddition->hcSPPlus_837 = true;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \ucc38\uc678\n\t\tcase 838:\n\t\t\taddition->hcDropPlus_838 = true;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \uc790\ub450\n\t\tcase 884:\n\t\t\taddition->hcSepDrop = true;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\n\t\tcase 882:\n\t\t\taddition->hcSepExp = true;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\n\t\tcase 883:\n\t\t\taddition->hcSepSP = true;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\n\t\tcase 885:\n\t\t\taddition->hcSepNas = true;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\n\t\t// >> [100823: selo] \uc720\ub8cc \uc99d\ud3ed\uc81c\n\t\tcase 6094:\n\t\t\taddition->hcSepExp_Cash = true;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\n\t\tcase 6095:\n\t\t\taddition->hcSepSP_Cash = true;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\n\t\tcase 6096:\n\t\t\taddition->hcSepDrop_Cash = true;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\n\t\t// << [100823: selo] \uc720\ub8cc \uc99d\ud3ed\uc81c\n\t\tcase 971:\t\t// \uacbd\ud5d8\uc758\uc2a4\ud06c\ub864\n\t\tcase 2499:\t\t// \uc77c\ubcf8 \uacbd\ud5d8\uc758\uc2a4\ud06c\ub864 \ubcf5\uc0ac\ubcf8\n\t\t\taddition->hcScrollExp = true;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\n\t\tcase 5081:\n\t\t\taddition->hcScrollDrop_5081 = true;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t// \ubcf5\uc6b4\uc758 \uc2a4\ud06c\ub864\n\t\tcase 5080: // 5080\uac15\uc6b4\uc758 \uc2a4\ud06c\ub864\uacfc \ubcc0\uc218\ub97c \uac19\uc774 \uc0ac\uc6a9\ud55c\ub2e4.\n\t\tcase 972:\n\t\t\taddition->hcScrollDrop = true;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \ud589\uc6b4\uc758\uc2a4\ud06c\ub864\n\n\t\tcase 973:\n\t\t\taddition->hcScrollSP = true;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \ub178\ub825\uc758\uc2a4\ud06c\ub864\n\n\t\tcase 792:\n\t\t\taddition->hcAttackTower = true;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \uc11d\uc0c1 \uacf5\uaca9\uc2dc \ub300\ubbf8\uc9c0 2\ubc30\n\n\t\tcase 1628:\n\t\t\taddition->hcSPPlusPer100 += 50;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \ub2ec\ucf64\ud55c \ucc38\uc678\n\t\tcase 1629:\n\t\t\taddition->hcDropPlusPer100 += 100;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \uc0c8\ucf64\ud55c \uc790\ub450\n\t\tcase 1627:\n\t\tcase 2494:\t\t// \uc77c\ubcf8 \uc798\uc775\uc740 \uc218\ubc15 \ubcf5\uc0ac\ubcf8\n\t\t\taddition->hcExpPlusPer100 += 20;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \uc798\uc775\uc740 \uc218\ubc15\n\t\tcase 1630:\n\t\t\taddition->hcExpPlusPer100 += 20;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \ucd95\ubcf5\uc758 \ubb3c\ubcd1\n\t\tcase 1975:\t\t// \ucf00\uc774\ud06c\n\t\tcase 2495:\t\t// \uc77c\ubcf8 \ucf00\uc774\ud06c \ubcf5\uc0ac\ubcf8\n\t\tcase 5084:\n\t\t\taddition->hcExpPlus_1975 = 30;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \ucf00\uc774\ud06c : 2006 \ud06c\ub9ac\uc2a4\ub9c8\uc2a4\n\t\tcase 1976:\t\t// \ub208\uc0ac\ub78c\n\t\tcase 2498:\t\t// \uc77c\ubcf8 \ub208\uc0ac\ub78c \ubcf5\uc0ac\ubcf8\n\t\tcase 5083:\n\t\t\taddition->hcExpPlus_1976 = 100;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \ub208\uc0ac\ub78c : 2006 \ud06c\ub9ac\uc2a4\ub9c8\uc2a4\n\n\t\tcase 2582:\n\t\tcase 2583: // \ud6c8\ub828 \uc8fc\ubb38\uc11c\uc640 \ub3d9\uc77c\ud55c 15% \uc0c1\uc2b9.\n\t\tcase 2139:\n\t\t\taddition->hcSPPlusPer100 += 15;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \ud6c8\ub828\uc8fc\ubb38\uc11c\n\t\tcase 2140:\n\t\t\taddition->hcSPPlusPer100 += 50;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \ud50c\ub798\ud2f0\ub118 \ud6c8\ub828\uc8fc\ubb38\uc11c\n\t\tcase 4937:\n\t\t\taddition->hcSPPlusPer100 += 50;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// (\uc774\ubca4\ud2b8\uc6a9)\ud50c\ub798\ud2f0\ub118 \ud6c8\ub828\uc8fc\ubb38\uc11c\n\t\tcase 2141:\n\t\t\taddition->hcDropPlus_2141 = true;\n\t\t\tbSkip = true;\n\t\t\tbreak ;\t\t// \ud589\uc6b4 \uc8fc\ubb38\uc11c\n\n#ifdef PLATINUM_SKILL_POTION_ITEM\n\t\tcase 2453:\n\t\t\taddition->hcSPPlusPer100 += 200;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t\t// \ud50c\ub798\ud2f0\ub284 \uc219\ub828 \ubb18\uc57d\n#endif // PLATINUM_SKILL_POTION_ITEM\n\t\tcase 2659:\n\t\t\taddition->hcSPPlusPer100 += 200;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t\t// \ucd08\ubcf4\uc790\uc6a9 \ud50c\ub798\ud2f0\ub284 \uc219\ub828\uc758 \ubb18\uc57d\n\t\tcase 5088:\n\t\t\taddition->hcSPPlusPer100 += 200;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t\t// \ud50c\ub798\ud2f0\ub284 \uc219\ub828\uc758 \ubb18\uc57d (LV1)\n\t\tcase 5089:\n\t\t\taddition->hcSPPlusPer100 += 200;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t\t// \ud50c\ub798\ud2f0\ub284 \uc219\ub828\uc758 \ubb18\uc57d (LV31)\n\t\tcase 5090:\n\t\t\taddition->hcSPPlusPer100 += 200;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t\t// \ud50c\ub798\ud2f0\ub284 \uc219\ub828\uc758 \ubb18\uc57d (LV61)\n\t\tcase 7611:\n\t\t\taddition->hcSPPlusPer100 += 200;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t\t// [\uc774\ubca4\ud2b8]\ud50c\ub798\ud2f0\ub284 \uc219\ub828\uc758 \ubb18\uc57d\n#ifdef SKILL_POTION_ITEM\n\t\tcase 2452:\n\t\t\taddition->hcSPPlusPer100 += 100;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t\t// \uc219\ub828\uc758 \ubb18\uc57d\n#endif // SKILL_POTION_ITEM\n\t\tcase 2358:\n\t\t\taddition->hcCashPetExpUp_2358 = true;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t\t// \ud3ab \uacbd\ud5d8\uc758 \ubb18\uc57d\n\t\tcase 2359:\n\t\t\taddition->hcCashPetExpUp_2359 = true;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t\t// \ud50c\ub798\ud2f0\ub284 \ud3ab \uacbd\ud5d8\uc758 \ubb18\uc57d\n\t\tcase 2356:\n\t\tcase 2841:\n\t\tcase 6596:\n\t\t\taddition->hcMPSteelPotion = true;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t\t\t// \uc77c\ubc18 \uacf5\uaca9\uc2dc 30%\uc758 Max MP \uc911 10% \uac10\uc18c \ub418\uace0 \ub098\uc758 MP \uc99d\uac00\n\t\tcase 2357:\n\t\tcase 2842:\n\t\tcase 6597:\n\t\t\taddition->hcHPSteelPotion = true;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t\t\t// \uc77c\ubc18 \uacf5\uaca9\uc2dc 30%\uc758 Max HP \uc911 5% \uac10\uc18c \ub418\uace0 \ub098\uc758 HP \uc99d\uac00\n\t\tcase 2410:\n\t\tcase 2354:\n\t\t\taddition->hcExpSPPlus_2354\t= true;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t\t// \uc904\ubb34\ub2ac \uc131\uc870\uae30(\ube0c\ub77c\uc9c8 \uad6d\uae30): 50% EXP + 50% SP\n\t\tcase 2853:\n\t\t\taddition->hcAttackBerserker = true;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t\t// 10% \ud655\ub960\ub85c 2\ubc30 \ub370\ubbf8\uc9c0\n\t\tcase 2870:\n\t\t\taddition->hcExplimitPlus\t= 50;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t\t// 50% \uacbd\ud5d8\uce58 \uc81c\ud55c 50% \ud574\uc81c\n\t\tcase 2855:\n\t\t\taddition->hcPlatinumDrop\t= true;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t\t// \ub4dc\ub86d\uc728 20\ubc30 \uc99d\uac00\n\t\tcase 2856:\n\t\t\taddition->hcPlatinumScroll\t= true;\n\t\t\tbSkip = true;\n\t\t\tbreak;\n\t\tcase 7054:\n\t\t\taddition->hcCashPetExpUp_2359 = true;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t// [\uc774\ubca4\ud2b8] \ud50c\ub798\ud2f0\ub284 \ud3ab \uacbd\ud5d8\uc758 \ubb18\uc57d\n\t\tcase 7344:\n\t\t\taddition->hcPetExpBoost = true;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t// \ud3ab \uacbd\ud5d8\uce58 \uc99d\ud3ed\uc81c\n\t\tcase 7345:\n\t\tcase 7346:\n\t\t\taddition->hcIrisFervor = true;\n\t\t\tbSkip = true;\n\t\t\tbreak;\t// \uc544\uc774\ub9ac\uc2a4\uc758 \uc5f4\uc815\n\t\t}\n\n\t\t// 060227 : bs : \uc2a4\ud0ac \uc778\ub371\uc2a4 \ud558\ub4dc \ucf54\ub529\n\t\tswitch (p->m_proto->m_index)\n\t\t{\n\t\tcase 348:\n\t\tcase 349:\n\t\t\tmp = slp->m_magic[0];\t\t\t\t\t\t\t\t\t\t\t// 060227 : bs : \uc720\ub8cc\uc544\uc774\ud15c \uacbd\ud5d8\uce58 \uc0c1\uc2b9\n\t\t\tif (mp)\n\t\t\t{\n\t\t\t\tmlp = mp->Level(slp->m_magicLevel[0]);\n\t\t\t\tif (mlp)\n\t\t\t\t{\n\t\t\t\t\tif (rate->hcCashExpUp < mlp->m_nPowerValue)\n\t\t\t\t\t\trate->hcCashExpUp = mlp->m_nPowerValue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbSkip = true;\n\t\t\tbreak;\n\n\t\tcase 350:\n\t\t\tmp = slp->m_magic[0];\t\t\t\t\t\t\t\t\t\t\t// 060227 : bs : \uc720\ub8cc\uc544\uc774\ud15c HP \ud655\uc7a5\n\t\t\tif (mp)\n\t\t\t{\n\t\t\t\tmlp = mp->Level(slp->m_magicLevel[0]);\n\t\t\t\tif (mlp)\n\t\t\t\t{\n\t\t\t\t\tif (rate->hcCashMaxHPUp < mlp->m_nPowerValue)\n\t\t\t\t\t\trate->hcCashMaxHPUp = mlp->m_nPowerValue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbSkip = true;\n\t\t\tbreak;\n\n\t\tcase 351:\n\t\t\tmp = slp->m_magic[0];\t\t\t\t\t\t\t\t\t\t\t// 060227 : bs : \uc720\ub8cc\uc544\uc774\ud15c MP \ud655\uc7a5\n\t\t\tif (mp)\n\t\t\t{\n\t\t\t\tmlp = mp->Level(slp->m_magicLevel[0]);\n\t\t\t\tif (mlp)\n\t\t\t\t{\n\t\t\t\t\tif (rate->hcCashMaxMPUp < mlp->m_nPowerValue)\n\t\t\t\t\t\trate->hcCashMaxMPUp = mlp->m_nPowerValue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbSkip = true;\n\t\t\tbreak;\n\n\t\tcase 352:\n\t\t\tfor (i = 0; i < 2; i++)\t\t\t\t\t\t\t\t\t\t\t// 060227 : bs : \uc720\ub8cc\uc544\uc774\ud15c HP/MP \ud655\uc7a5\n\t\t\t{\n\t\t\t\tmp = slp->m_magic[i];\n\t\t\t\tif (mp)\n\t\t\t\t{\n\t\t\t\t\tmlp = mp->Level(slp->m_magicLevel[i]);\n\t\t\t\t\tif (mlp)\n\t\t\t\t\t{\n\t\t\t\t\t\tswitch (mp->m_subtype)\n\t\t\t\t\t\t{\n\t\t\t\t\t\tcase MST_STAT_MAXHP:\n\t\t\t\t\t\t\tif (rate->hcCashMaxHPUp < mlp->m_nPowerValue)\n\t\t\t\t\t\t\t\trate->hcCashMaxHPUp = mlp->m_nPowerValue;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase MST_STAT_MAXMP:\n\t\t\t\t\t\t\tif (rate->hcCashMaxMPUp < mlp->m_nPowerValue)\n\t\t\t\t\t\t\t\trate->hcCashMaxMPUp = mlp->m_nPowerValue;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tbSkip = true;\n\t\t\tbreak;\n\n\t\tcase 354:\n\t\t\taddition->hcExpPlus_S354 = true;\t\t\t\t\t\t\t\t// \uacbd\ud5d8\uce58 \ud3ec\uc158 : \uc2a4\ud0ac 354, 1.5\ubc30 \uc0c1\uc2b9\n\t\t\tbSkip = true;\n\t\t\tbreak;\n\n\t\tcase 355:\n\t\t\taddition->hcExpPlus_S355 = true;\t\t\t\t\t\t\t\t// \ucd94\ucc9c \uc11c\ubc84 \ud3ec\uc158 \uacbd\ud5d8\uce58 \uc0c1\uc2b9\n\t\t\tbSkip = true;\n\t\t\tbreak;\n\n\t\tcase 356:\n\t\t\taddition->hcSPPlus_S356 = true;\t\t\t\t\t\t\t\t\t// \ucd94\ucc9c \uc11c\ubc84 \ud3ec\uc158 SP \uc0c1\uc2b9\n\t\t\tbSkip = true;\n\t\t\tbreak;\n\n\t\tcase 360:\n\t\t\taddition->hcDropPlus_S360 = true;\t\t\t\t\t\t\t\t// \ucd94\ucc9c \uc11c\ubc84 \ud3ec\uc158 \ub4dc\ub86d\uc728 \uc0c1\uc2b9\n\t\t\tbSkip = true;\n\t\t\tbreak;\n\n\t\tcase 379:\n\t\t\tmp = slp->m_magic[0];\t\t\t\t\t\t\t\t\t\t\t// \ud0dc\uad6d \uacbd\ud5d8\uce58 \uc0c1\uc2b9 \ud3ec\uc158\n\t\t\tif (mp)\n\t\t\t{\n\t\t\t\tmlp = mp->Level(slp->m_magicLevel[0]);\n\t\t\t\tif (mlp)\n\t\t\t\t{\n\t\t\t\t\taddition->hcExpPlusPer100 += mlp->m_nPowerValue;\t\t\t\t// \ud0dc\uad6d \uacbd\ud5d8\uce58 \uc0c1\uc2b9 \ud3ec\uc158\n\t\t\t\t}\n\t\t\t}\n\t\t\tbSkip = true;\n\t\t\tbreak;\n\n\t\tcase 398:\n\t\t\tmp = slp->m_magic[0];\t\t\t\t\t\t\t\t\t\t\t// (\uc720\ub8cc)\uacbd\ud5d8\uce58 \ud3ec\uc158 : 1840, 1841, 1842\n\t\t\tif (mp)\n\t\t\t{\n\t\t\t\tmlp = mp->Level(slp->m_magicLevel[0]);\n\t\t\t\tif (mlp)\n\t\t\t\t{\n\t\t\t\t\taddition->hcExpPlus_398 = mlp->m_nPowerValue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbSkip = true;\n\t\t\tbreak;\n\n\t\tcase 418:\n\t\t\tmp = slp->m_magic[0];\t\t\t\t\t\t\t// \ub7ed\ud0a4 \uc18c\uc6b8 \ub2c9\uc2a4\n\t\t\tif( mp )\n\t\t\t{\n\t\t\t\tmlp = mp->Level(slp->m_magicLevel[0]);\n\t\t\t\tif( mlp )\n\t\t\t\t{\n\t\t\t\t\taddition->HitRate_2033 = mlp->m_nPowerValue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbSkip = true;\n\t\t\tbreak;\n\t\tcase 419:\n\t\t\tmp = slp->m_magic[0];\t\t//\ub7ed\ud0a4 \ub2e4\uc9c0 \ud53c\uc5b4\n\t\t\tif( mp )\n\t\t\t{\n\t\t\t\tmlp = mp->Level(slp->m_magicLevel[0]);\n\t\t\t\tif( mlp )\n\t\t\t\t{\n\t\t\t\t\taddition->Avoid_2034 = mlp->m_nPowerValue;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbSkip = true;\n\t\t\tbreak;\n\t\tcase 424 :\t\t//\ud798\uc758 \ub7ec\ube0c\ub9e4\uc9c1\n\t\t\tif( gserver->isActiveEvent(A_EVENT_WHITE_DAY) || gserver->isActiveEvent(A_EVENT_MAGIC_CARD) )\n\t\t\t\tCOption::ApplyOptionValue( (CPC*)ch, OPTION_STR_UP, 20, NULL);\n\t\t\tbSkip = true;\n\t\t\tbreak;\n\t\tcase 425 :\t\t//\ubbfc\ucca9\uc758 \ub7ec\ube0c\ub9e4\uc9c1\n\t\t\tif( gserver->isActiveEvent(A_EVENT_WHITE_DAY) || gserver->isActiveEvent(A_EVENT_MAGIC_CARD) )\n\t\t\t\tCOption::ApplyOptionValue( (CPC*)ch, OPTION_DEX_UP, 20, NULL);\n\t\t\tbSkip = true;\n\t\t\tbreak;\n\t\tcase 426 :\t\t//\uc9c0\ud574\uc758 \ub7ec\ube0c\ub9e4\uc9c1\n\t\t\tif( gserver->isActiveEvent(A_EVENT_WHITE_DAY) || gserver->isActiveEvent(A_EVENT_MAGIC_CARD) )\n\t\t\t\tCOption::ApplyOptionValue( (CPC*)ch, OPTION_INT_UP, 20, NULL);\n\t\t\tbSkip = true;\n\t\t\tbreak;\n\t\tcase 427 :\t\t//\uccb4\uc9c8\uc758 \ub7ec\ube0c\ub9e4\uc9c1\n\t\t\tif( gserver->isActiveEvent(A_EVENT_WHITE_DAY) || gserver->isActiveEvent(A_EVENT_MAGIC_CARD) )\n\t\t\t\tCOption::ApplyOptionValue( (CPC*)ch, OPTION_CON_UP, 50, NULL);\n\t\t\tbSkip = true;\n\t\t\tbreak;\n\t\tcase 428 :\n\t\t\tif( gserver->isActiveEvent(A_EVENT_WHITE_DAY) || gserver->isActiveEvent(A_EVENT_MAGIC_CARD) )\n\t\t\t\taddition->bRorainOfLoveMagic = true;\n\t\t\tbSkip = true;\n\t\t\tbreak;\n\n\t\tcase 433:\t// \uac74\uac15\uc758 \ubb3c\uc57d\n\t\t\tch->cooltime_2142 = gserver->getNowSecond() + 2*60*60;\n\t\t\tbreak;\n\t\tcase 434:\t// \uc9c0\ub825\uc758 \ubb3c\uc57d\n\t\t\tch->cooltime_2143 = gserver->getNowSecond() + 2*60*60;\n\t\t\tbreak;\n\t\tcase 465:\n\t\t\tch->m_cooltime_Competition = gserver->getNowSecond() + 30 * 60;\n\t\t\tbreak;\n\t\tcase 470:\t// \ud560\ub85c\uc708 \uc774\ubca4\ud2b8 \ucd5c\ub300 HP \ubcc0\ud654\n\t\t\tif( gserver->isActiveEvent(A_EVENT_HALLOWEEN) )\n\t\t\t{\n\t\t\t\tmp = slp->m_magic[0]; // \ucd5c\ub300 HP \uac10\uc18c\n\t\t\t\tif (mp)\n\t\t\t\t{\n\t\t\t\t\tmlp = mp->Level(slp->m_magicLevel[0]);\n\t\t\t\t\tif (mlp)\n\t\t\t\t\t{\n\t\t\t\t\t\trate->hcEventHalloweenMaxHP = mlp->m_nPowerValue;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tmp = slp->m_magic[1]; // \uc774\ub3d9\uc18d\ub3c4 \uac10\uc18c\n\t\t\t\tif (mp)\n\t\t\t\t{\n\t\t\t\t\tmlp = mp->Level(slp->m_magicLevel[1]);\n\t\t\t\t\tif (mlp)\n\t\t\t\t\t{\n\t\t\t\t\t\trate->hcEventHalloweenSpeed = mlp->m_nPowerValue;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbSkip = true;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 471:\n\t\t\tif( gserver->isActiveEvent(A_EVENT_HALLOWEEN) )\n\t\t\t{\n\t\t\t\tmp = slp->m_magic[0]; // \uc774\ub3d9\uc18d\ub3c4 \uac10\uc18c\n\t\t\t\tif (mp)\n\t\t\t\t{\n\t\t\t\t\tmlp = mp->Level(slp->m_magicLevel[0]);\n\t\t\t\t\tif (mlp)\n\t\t\t\t\t{\n\t\t\t\t\t\trate->hcEventHalloweenSpeed = mlp->m_nPowerValue;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbSkip = true;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 485:\n\t\tcase 486:\n\t\tcase 487:\n\t\tcase 488:\n\t\t\t{\n\t\t\t\tmp = slp->m_magic[0];\n\t\t\t\tif (mp)\n\t\t\t\t{\n\t\t\t\t\tmlp = mp->Level(slp->m_magicLevel[0]);\n\t\t\t\t\tif (mlp)\n\t\t\t\t\t{\n\t\t\t\t\t\t// \ub4dc\ub78d\ub960 \uc99d\uac00\n\t\t\t\t\t\taddition->hcDropPlus_Xmas2007 = mlp->m_nPowerValue / 100;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbSkip = true;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 550:\n\t\t\t{\n\t\t\t\tmp = slp->m_magic[0];\t\t\t\t\t\t\t\t\t\t\t// 060227 : bs : \uc720\ub8cc\uc544\uc774\ud15c \uacbd\ud5d8\uce58 \uc0c1\uc2b9\n\t\t\t\tif (mp)\n\t\t\t\t{\n\t\t\t\t\tmlp = mp->Level(slp->m_magicLevel[0]);\n\t\t\t\t\tif (mlp)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (addition->hcCashExpUp < mlp->m_nPowerValue)\n\t\t\t\t\t\t\taddition->hcCashExpUp = mlp->m_nPowerValue;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbSkip = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\n\t\tif (bSkip == true)\n\t\t\tcontinue ;\n\n\t\t// --- TODO : \ud558\ub4dc\ucf54\ub529\uc6a9\n\n\t\tfor (i = 0; i < MAX_SKILL_MAGIC; i++)\n\t\t{\n\t\t\tif (!p->m_bHit[i])\n\t\t\t\tcontinue ;\n\n\t\t\tmp = slp->m_magic[i];\n\t\t\tif (mp == NULL)\n\t\t\t\tcontinue ;\n\t\t\tmlp = mp->Level(slp->m_magicLevel[i]);\n\t\t\tif (mlp == NULL)\n\t\t\t\tcontinue ;\n\n\t\t\t// --- TODO : ASSIST \ud558\ub4dc \ucf54\ub529\n\t\t\tswitch( mp->m_index )\n\t\t\t{\n\t\t\tcase 841:\n\t\t\t\taddition->hcLimitEXP = mlp->m_nPowerValue;\n\t\t\t\tcontinue;\n\t\t\t\tbreak;\n\t\t\tcase 842:\n\t\t\t\taddition->hcLimitSP = mlp->m_nPowerValue;\n\t\t\t\tcontinue;\n\t\t\t\tbreak;\n\t\t\tcase 843:\n\t\t\t\taddition->hcRandomExpUp = mlp->m_nPowerValue;\n\t\t\t\tcontinue;\n\t\t\t\tbreak;\n\t\t\tcase 844:\n\t\t\t\taddition->hcRandomSpUp = mlp->m_nPowerValue;\n\t\t\t\tcontinue;\n\t\t\t\tbreak;\n\t\t\tcase 845:\n\t\t\t\taddition->hcRandomDropUp = mlp->m_nPowerValue;\n\t\t\t\tcontinue;\n\t\t\t\tbreak;\n\t\t\tcase 971:\n\t\t\t\taddition->hcHPSteelPotion = true;\n\t\t\t\tcontinue;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tswitch (mp->m_type)\n\t\t\t{\n\t\t\tcase MT_STAT:\n\t\t\t\tswitch (mp->m_subtype)\n\t\t\t\t{\n\t\t\t\tcase MST_STAT_ATTACK:\n\t\t\t\t\tAPPVAL(attack);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_DEFENSE:\n\t\t\t\t\tAPPVAL(defense);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_MAGIC:\n\t\t\t\t\tAPPVAL(magic);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_RESIST:\n\t\t\t\t\tAPPVAL(resist);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_HITRATE:\n\t\t\t\t\tAPPVAL(hitrate);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_AVOID:\n\t\t\t\t\tAPPVAL(avoid);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_CRITICAL:\n\t\t\t\t\tAPPVAL(critical);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_ATTACKSPD:\n\t\t\t\t\tAPPVAL(attackspeed);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_MAGICSPD:\n\t\t\t\t\tAPPVAL(magicspeed);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_MOVESPD:\n\t\t\t\t\tAPPVAL(movespeed);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_RECOVERHP:\n\t\t\t\t\tAPPVAL(recoverhp);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_RECOVERMP:\n\t\t\t\t\tAPPVAL(recovermp);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_MAXHP:\n\t\t\t\t\tAPPVAL(maxhp);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_MAXMP:\n\t\t\t\t\tAPPVAL(maxmp);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_DEADLY:\n\t\t\t\t\tAPPVAL(deadly);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_MAGICHITRATE:\n\t\t\t\t\tAPPVAL(magichitrate);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_MAGICAVOID:\n\t\t\t\t\tAPPVAL(magicavoid);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_ATTACKDIST:\n\t\t\t\t\tAPPVAL(attackdist);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_ATTACK_MELEE:\n\t\t\t\t\tAPPVAL(attack_dam_melee);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_ATTACK_RANGE:\n\t\t\t\t\tAPPVAL(attack_dam_range);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_HITRATE_SKILL:\n\t\t\t\t\tAPPVAL(hitrate_skill);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_ATTACK_80:\n\t\t\t\t\tAPPVAL(attack80);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_MAXHP_450:\n\t\t\t\t\tAPPVAL(maxhp450);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_HARD:\n\t\t\t\t\tAPPVAL(hard);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_SKILLSPD:\n\t\t\t\t\tAPPVAL(skillspd);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_NPCATTACK:\n\t\t\t\t\tAPPVAL(npcAttack);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_NPCMAGIC:\n\t\t\t\t\tAPPVAL(npcMagic);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_SKILLCOOLTIME:\n\t\t\t\t\tAPPVAL(SkillCooltime);\n\t\t\t\t\tbreak;\n#ifdef ASSIST_DECREASE_SKILL_MP\n\t\t\t\tcase MST_STAT_DECREASE_MANA_SPEND:\n\t\t\t\t\tAPPVAL(decreaseskillmp);\n\t\t\t\t\tbreak;\n#endif\n\t\t\t\tcase MST_STAT_VALOR:\n\t\t\t\t\t{\n\t\t\t\t\t\tif( IS_PC(ch) )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tCPC *pc = TO_PC(ch);\n\t\t\t\t\t\t\tif( pc->IsParty() && pc->m_party->GetNearPartyMemberCount(pc) > 1)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\taddition->attack += (mlp->m_nPowerValue * CalcSkillParam(ch, ch, SPARAM_NONE, mp->m_ptp) / 100) * pc->m_party->GetNearPartyMemberCount(pc) / 10;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if( pc->IsExped() && pc->m_Exped->GetNearExpeditionMemberCount(pc) > 1 )\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tconst CExpedMember *member = pc->m_Exped->GetMemberByCharIndex(pc->m_index);\n\t\t\t\t\t\t\t\tint group_type = 0;\n\t\t\t\t\t\t\t\tif( member )\n\t\t\t\t\t\t\t\t\tgroup_type = member->GetGroupType();\n\t\t\t\t\t\t\t\taddition->attack += (mlp->m_nPowerValue * CalcSkillParam(ch, ch, SPARAM_NONE, mp->m_ptp) / 100) * pc->m_Exped->GetGroupMemberCount(group_type) / 10;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_STATPALL:\n\t\t\t\t\tAPPVAL(statpall);\n\t\t\t\t\tbreak;\n\t\t\t\t// << 071211 kjban add\n\t\t\t\tcase MST_STAT_ATTACK_PER:\n\t\t\t\t\t{\n\t\t\t\t\t\tswitch (mp->m_damagetype)\n\t\t\t\t\t\t{\n\t\t\t\t\t\tcase MDT_ADDITION:\n\t\t\t\t\t\t\taddition->attack += ch->m_eqMelee * mlp->m_nPowerValue / 100;\n\t\t\t\t\t\t\taddition->attack += ch->m_eqRange * mlp->m_nPowerValue / 100;\n\t\t\t\t\t\t\taddition->magic += ch->m_eqMagic * mlp->m_nPowerValue / 100;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase MDT_RATE:\n\t\t\t\t\t\t\trate->attack += ch->m_eqMelee * mlp->m_nPowerValue / 100;\n\t\t\t\t\t\t\trate->attack += ch->m_eqRange * mlp->m_nPowerValue / 100;\n\t\t\t\t\t\t\trate->magic += ch->m_eqMagic * mlp->m_nPowerValue / 100;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase MST_STAT_DEFENSE_PER:\n\t\t\t\t\t{\n\t\t\t\t\t\tswitch (mp->m_damagetype)\n\t\t\t\t\t\t{\n\t\t\t\t\t\tcase MDT_ADDITION:\n\t\t\t\t\t\t\taddition->defense += ch->m_eqDefense * mlp->m_nPowerValue / 100;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase MDT_RATE:\n\t\t\t\t\t\t\trate->defense += ch->m_eqDefense * mlp->m_nPowerValue / 100;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase MST_STAT_STATPALL_PER:\n\t\t\t\t\t{\n\t\t\t\t\t\tswitch (mp->m_damagetype)\n\t\t\t\t\t\t{\n\t\t\t\t\t\tcase MDT_ADDITION:\n\t\t\t\t\t\t\taddition->statpall_per += mlp->m_nPowerValue;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase MDT_RATE:\n\t\t\t\t\t\t\trate->statpall_per += mlp->m_nPowerValue;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t// [5/15/2008 KwonYongDae]\n\t\t\t\tcase MST_STAT_STR:\n\t\t\t\t\t{\n\t\t\t\t\t\tCOption::ApplyOptionValue( (CPC*)ch, OPTION_STR_UP, mlp->m_nPowerValue, NULL);\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_DEX:\n\t\t\t\t\t{\n\t\t\t\t\t\tCOption::ApplyOptionValue( (CPC*)ch, OPTION_DEX_UP, mlp->m_nPowerValue, NULL);\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_INT:\n\t\t\t\t\t{\n\t\t\t\t\t\tCOption::ApplyOptionValue( (CPC*)ch, OPTION_INT_UP, mlp->m_nPowerValue, NULL);\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_STAT_CON:\n\t\t\t\t\t{\n\t\t\t\t\t\tCOption::ApplyOptionValue( (CPC*)ch, OPTION_CON_UP, mlp->m_nPowerValue, NULL);\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tbreak;\n\n// OLD ATTRIBUTE VARIABLE REUSE, Elenoa 2013.01.09\n\n\t\t\tcase MT_ATTRIBUTE:\n\t\t\t\tif (mp->m_subtype < 0 || mp->m_subtype > AT_RANDOM)\n\t\t\t\t\tbreak;\n\n\t\t\t\tswitch(mp->m_subtype)\n\t\t\t\t{\n\t\t\t\tcase AT_RANDOM:\n\t\t\t\t\t{\n\t\t\t\t\t\tint rand = p->attr_rand;\n\t\t\t\t\t\t\n\t\t\t\t\t\tif(p->attr_rand <= 0)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\trand = GetRandom(AT_FIRE, AT_LIGHT);\n\t\t\t\t\t\t\tp->attr_rand = rand;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif(mp->m_damagetype == MDT_ATTACK)\n\t\t\t\t\t\t\taddition->attratt_item = AT_MIX(rand, mlp->m_nPowerValue);\t\t\t\t\t\t\n\t\t\t\t\t\telse if(mp->m_damagetype == MDT_DEFENCE)\n\t\t\t\t\t\t\taddition->attrdef_item = AT_MIX(rand, mlp->m_nPowerValue);\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tswitch (mp->m_damagetype)\n\t\t\t\t\t{\n\t\t\t\t\tcase MDT_ATTACK: /* attr attack */\n\t\t\t\t\t\taddition->attratt =\n\t\t\t\t\t\t\tAT_MIX(mp->m_subtype, mlp->m_nPowerValue);\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase MDT_DEFENCE: /* attr defend */\n\t\t\t\t\t\taddition->attrdef =\n\t\t\t\t\t\t\tAT_MIX(mp->m_subtype, mlp->m_nPowerValue);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t\t\n\n\t\t\tcase MT_ASSIST:\n\t\t\t\tswitch (mp->m_subtype)\n\t\t\t\t{\n\t\t\t\tcase MST_ASSIST_POISON:\n\t\t\t\t\t*state |= AST_POISON;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_HOLD:\n\t\t\t\t\t*state |= AST_HOLD;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_CONFUSION:\n\t\t\t\t\t*state |= AST_CONFUSION;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_STONE:\n#ifdef RAID_MONSTER_SKIP_STONE\t\t// \ub808\uc774\ub4dc \ubab9 \uc2a4\ud1a4 \uc81c\uc678\n\t\t\t\t\tif( IS_NPC(ch) )\n\t\t\t\t\t{\n\t\t\t\t\t\tCNPC * pNpc = TO_NPC(ch);\n\t\t\t\t\t\tif( pNpc != NULL )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif( pNpc->m_proto->CheckFlag(NPC_RAID) )\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n#endif\t// RAID_MONSTER_SKIP_STONE\n\t\t\t\t\t*state |= AST_STONE;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase MST_ASSIST_SILENT:\n\t\t\t\t\t*state |= AST_SILENT;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_BLOOD:\n\t\t\t\t\t*state |= AST_BLOOD;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_BLIND:\n\t\t\t\t\t*state |= AST_BLIND;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_STURN:\n#ifdef RAID_MONSTER_SKIP_STURN\t\t// \ub808\uc774\ub4dc \ubab9 \uc2a4\ud134 \uc81c\uc678\n\t\t\t\t\tif( IS_NPC(ch) )\n\t\t\t\t\t{\n\t\t\t\t\t\tCNPC * pNpc = TO_NPC(ch);\n\t\t\t\t\t\tif( pNpc != NULL )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif( pNpc->m_proto->CheckFlag(NPC_BOSS | NPC_RAID) )\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n#endif\t// RAID_MONSTER_SKIP_STURN\n\t\t\t\t\t*state |= AST_STURN;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_SLEEP:\n\t\t\t\t\t*state |= AST_SLEEP;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_HP:\n\t\t\t\t\t*state |= AST_HP;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_MP:\n\t\t\t\t\t*state |= AST_MP;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_MOVESPD:\n\t\t\t\t\t*state |= AST_MOVESPD;\n\t\t\t\t\tAPPVAL(movespeed);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_DIZZY:\n\t\t\t\t\t*state |= AST_DIZZY;\n\t\t\t\t\tAPPVAL(movespeed);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_INVISIBLE:\n\t\t\t\t\t*state |= AST_INVISIBLE;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_SLOTH:\n\t\t\t\t\t*state |= AST_SLOTH;\n\t\t\t\t\tAPPVAL(attackspeed);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_FEAR:\n\t\t\t\t\t*state |= AST_FEAR;\n\t\t\t\t\taddition->hcFearType = p->m_spellerType;\n\t\t\t\t\taddition->hcFearIndex = p->m_spellerIndex;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_FAKEDEATH:\n\t\t\t\t\t*state |= AST_FAKEDEATH;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_PERFECTBODY:\n\t\t\t\t\t*state |= AST_PERFECTBODY;\n\t\t\t\t\tAPPVAL(defense);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_FRENZY:\n\t\t\t\t\t*state |= AST_FRENZY;\n\t\t\t\t\tAPPVAL(attack);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_DAMAGELINK:\n\t\t\t\t\t*state |= AST_DAMAGELINK;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_BERSERK:\n\t\t\t\t\t*state |= AST_BERSERK;\n\t\t\t\t\tAPPVAL(attackspeed);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_DESPAIR:\n\t\t\t\t\t*state |= AST_DESPAIR;\n\t\t\t\t\tAPPVAL(despair);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_MANASCREEN:\n\t\t\t\t\t*state |= AST_MANASCREEN;\n\t\t\t\t\tAPPVAL(manascreen);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_BLESS:\n\t\t\t\t\t*state |= AST_BLESS;\n\t\t\t\t\tAPPVAL(bless);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_SAFEGUARD:\n\t\t\t\t\t*state |= AST_SAFEGUARD;\n\t\t\t\t\tif(IS_PC(ch))\n\t\t\t\t\t{\n\t\t\t\t\t\tCPC* pc = TO_PC(ch);\n\t\t\t\t\t\tpc->m_bImmortal = true;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_MANTLE:\n\t\t\t\t\t*state |= AST_MANTLE;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_GUARD:\n\t\t\t\t\t*state |= AST_GUARD;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_CHARGEATC:\n\t\t\t\t\t//\uc131\uc218 \uc544\uc774\ud15c\uc774 \uc0ac\uc6a9\uc911\uc774\ub77c\uba74 \n\t\t\t\t\tif(IS_PC(ch))\n\t\t\t\t\t{\n\t\t\t\t\t\tCPC* pc = TO_PC(ch);\n\t\t\t\t\t\tif(pc->holy_water_item != NULL)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t//\ud1a0\uae00 \ud574\uc81c\n\t\t\t\t\t\t\tpc->changeToggleState(pc->holy_water_item->getVIndex(), TOGGLE_ITEM);\n\t\t\t\t\t\t\t//\uc131\uc218 \uc544\uc774\ud15c \ud574\uc81c\n\t\t\t\t\t\t\tpc->SendHolyWaterStateMsg(NULL);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tAPPVAL(charge_attack);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_CHARGEMGC:\n\t\t\t\t\t//\uc131\uc218 \uc544\uc774\ud15c\uc774 \uc0ac\uc6a9\uc911\uc774\ub77c\uba74 \ud1a0\uae00 \ud574\uc81c\n\t\t\t\t\tif(IS_PC(ch))\n\t\t\t\t\t{\n\t\t\t\t\t\tCPC* pc = TO_PC(ch);\n\t\t\t\t\t\tif(pc->holy_water_item != NULL)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t//\ud1a0\uae00 \ud574\uc81c\n\t\t\t\t\t\t\tpc->changeToggleState(pc->holy_water_item->getVIndex(), TOGGLE_ITEM);\n\t\t\t\t\t\t\t//\uc131\uc218 \uc544\uc774\ud15c \ud574\uc81c\n\t\t\t\t\t\t\tpc->SendHolyWaterStateMsg(NULL);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tAPPVAL(charge_magic);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_DISEASE:\n\t\t\t\t\t*state |= AST_DISEASE;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_CURSE:\n\t\t\t\t\t*state |= AST_CURSE;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_CONFUSED:\n\t\t\t\t\t*state |= AST_CONFUSED;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_TAMING:\n\t\t\t\t\t*state |= AST_TAMING;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_FREEZE:\n\t\t\t\t\t*state |= AST_FREEZE;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_INVERSE_DAMAGE:\n\t\t\t\t\t*state |= AST_INVERSE_DAMAGE;\n\t\t\t\t\tAPPVAL(inverse_damage);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_HP_DOT:\n\t\t\t\t\t*state |= AST_HP_DOT;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_DARKNESS_MODE:\n\t\t\t\t\t*state |= AST_DARKNESS_MODE;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_AURA_DARKNESS:\n\t\t\t\t\t*state |= AST_AURA_DARKNESS;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_AURA_WEAKNESS:\n\t\t\t\t\t*state |= AST_AURA_WEAKNESS;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_AURA_ILLUSION:\n\t\t\t\t\t*state |= AST_AURA_ILUSYON;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_MERCENARY:\n\t\t\t\t\t*state |= AST_MERCENARY;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_SOUL_TOTEM_BUFF:\n\t\t\t\t\t*state |= AST_SOUL_TOTEM_BUFF;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_SOUL_TOTEM_ATTK:\n\t\t\t\t\t*state |= AST_SOUL_TOTEM_ATTK;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_TRAP:\n\t\t\t\t\t*state |= AST_TRAP;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_PARASITE:\n\t\t\t\t\t*state |= AST_PARASITE;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_SUICIDE:\n\t\t\t\t\t*state |= AST_SUICIDE;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_INVINCIBILITY:\n\t\t\t\t\t*state |= AST_INVINCIBILITY;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_GPS:\n\t\t\t\t\tif(IS_PC(ch))\n\t\t\t\t\t{\n\t\t\t\t\t\tCPC* pc = TO_PC(ch);\n\t\t\t\t\t\tif(sp->m_index == 1759)\n\t\t\t\t\t\t\tpc->m_gpsManager.setIsGps(true);\n\t\t\t\t\t\telse if(sp->m_index == 1760)\n\t\t\t\t\t\t\tpc->m_gpsManager.setIsGpsInterrupt(true);\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_ATTACK_TOWER:\n\t\t\t\t\t*state |= AST_TOWER_ATTACK;\n\t\t\t\t\tAPPVAL(tower_attack);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_ARTIFACT_GPS:\n\t\t\t\t\t{\n\t\t\t\t\t\tif(IS_PC(ch))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tCPC* pc = TO_PC(ch);\n\t\t\t\t\t\t\tpc->m_arti_gpsManager.setIsGps(true);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase MT_OTHER:\n\t\t\t\tswitch (mp->m_subtype)\n\t\t\t\t{\n\t\t\t\tcase MST_OTHER_AFFINITY:\n\t\t\t\t\t{\n\t\t\t\t\t\tswitch (mp->m_damagetype)\n\t\t\t\t\t\t{\n\t\t\t\t\t\tcase MDT_ADDITION:\n\t\t\t\t\t\t\taddition->affinity += mlp->m_nPowerValue;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase MDT_RATE:\n\t\t\t\t\t\t\trate->affinity_rate += mlp->m_nPowerValue;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_OTHER_REFLEX:\n\t\t\t\t\tAPPVAL(hcReflex);\n\t\t\t\t\taddition->hcReflexProb += mlp->m_nHitrateValue;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_OTHER_EXP:\n\t\t\t\t\tswitch (mp->m_damagetype)\n\t\t\t\t\t{\n\t\t\t\t\tcase MDT_ADDITION:\n\t\t\t\t\t\taddition->exp += mlp->m_nPowerValue;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase MDT_RATE:\n\t\t\t\t\t\taddition->exp_rate += mlp->m_nPowerValue;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_OTHER_SP:\n\t\t\t\t\tswitch (mp->m_damagetype)\n\t\t\t\t\t{\n\t\t\t\t\tcase MDT_ADDITION:\n\t\t\t\t\t\taddition->sp += mlp->m_nPowerValue;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase MDT_RATE:\n\t\t\t\t\t\taddition->sp_rate += mlp->m_nPowerValue;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n#ifdef REFORM_PK_PENALTY_201108 // PK \ud328\ub110\ud2f0 \ub9ac\ud3fc\n\t\t\t\tcase MST_OTHER_PK_DISPOSITION:\n\t\t\t\t\tswitch (mp->m_damagetype)\n\t\t\t\t\t{\n\t\t\t\t\tcase MDT_ADDITION:\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tint durHour = sp->m_levelproto[0]->m_durtime / (60*60*10) ;\n\t\t\t\t\t\t\tint PkPointPerHour = ( PK_HUNTER_POINT_MAX * mlp->m_nPowerValue / 100 ) / durHour;\n\t\t\t\t\t\t\taddition->pkDispositionPointValue = PkPointPerHour;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase MDT_RATE:\n\t\t\t\t\t\trate->pkDispositionPointValue = mlp->m_nPowerValue;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n#endif // REFORM_PK_PENALTY_201108\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase MT_REDUCE:\n\t\t\t\tswitch (mp->m_subtype)\n\t\t\t\t{\n\t\t\t\tcase MST_REDUCE_MELEE:\n\t\t\t\t\tAPPVAL(reduceMelee);\n\t\t\t\t\taddition->reduceMeleeProb += mlp->m_nHitrateValue;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_REDUCE_RANGE:\n\t\t\t\t\tAPPVAL(reduceRange);\n\t\t\t\t\taddition->reduceRangeProb += mlp->m_nHitrateValue;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_REDUCE_MAGIC:\n\t\t\t\t\tAPPVAL(reduceMagic);\n\t\t\t\t\taddition->reduceMagicProb += mlp->m_nHitrateValue;\n\t\t\t\t\tbreak;\n#ifdef ASSIST_REDUCE_SKILL\n\t\t\t\tcase MST_REDUCE_SKILL:\n\t\t\t\t\tAPPVAL(reduceSkill);\n\t\t\t\t\taddition->reduceSkillProb += mlp->m_nHitrateValue;\n\t\t\t\t\tbreak;\n#endif\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase MT_IMMUNE:\n\t\t\t\tswitch (mp->m_subtype)\n\t\t\t\t{\n\t\t\t\tcase MST_IMMUNE_BLIND:\n\t\t\t\t\taddition->immune_blind = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase MT_CASTLE_WAR:\n\t\t\t\tswitch (mp->m_subtype)\n\t\t\t\t{\n\t\t\t\tcase MST_WAR_REDUCE_MELEE:\n\t\t\t\t\tAPPVAL(war_reduce_melee);\n\t\t\t\t\taddition->war_reduce_melee_prob += mlp->m_nHitrateValue;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_WAR_REDUCE_RANGE:\n\t\t\t\t\tAPPVAL(war_reduce_range);\n\t\t\t\t\taddition->war_reduce_range_prob += mlp->m_nHitrateValue;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_WAR_REDUCE_MAGIC:\n\t\t\t\t\tAPPVAL(war_reduce_magic);\n\t\t\t\t\taddition->war_reduce_magic_prob += mlp->m_nHitrateValue;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_WAR_MAX_HP:\n\t\t\t\t\tAPPVAL(war_max_hp);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_WAR_DEFENCE:\n\t\t\t\t\tAPPVAL(war_defence);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_WAR_RESIST:\n\t\t\t\t\tAPPVAL(war_resist);\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_WAR_TOWER_ATTACK:\n\t\t\t\t\tAPPVAL(war_tower_attack);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}\n\n// 060227 : bs : \uc808\ub300\uc2dc\uac04 \ubc84\ud504 \ucd94\uac00\nvoid CAssistList::DelAssist(CAssistData* d, bool bSend, CCharacter* ch, bool bNoCancelType, bool statusUpdate)\n{\n\t// 060317 : bs : SF_NOCANCEL \uac80\uc0ac\n\t// bNoCancelType \uc774 false\n\tif (!bNoCancelType && (d->m_proto->m_flag & SF_NOCANCEL))\n\t\treturn ;\n\n\t// data \uc81c\uac70\n\t// \ud5e4\ub354\ud3ec\uc778\ud130 \uc124\uc815\n\tif (m_head == d)\t\tm_head = m_head->m_next;\n\t// \ud14c\uc77c\ud3ec\uc778\ud130 \uc124\uc815\n\tif (m_tail == d)\t\tm_tail = m_tail->m_prev;\n\t// prev \ub9c1\ud06c \uc5f0\uacb0\n\tif (d->m_prev)\t\t\td->m_prev->m_next = d->m_next;\n\t// next \ub9c1\ud06c \uc5f0\uacb0\n\tif (d->m_next)\t\t\td->m_next->m_prev = d->m_prev;\n\t// \ub9c1\ud06c \uc81c\uac70\n\td->m_prev = NULL;\n\td->m_next = NULL;\n\n\tbool bIsDamageLink = false;\n\tconst CSkillLevelProto* pSkillLevelProto = d->m_proto->Level(d->m_level);\n\tif (pSkillLevelProto)\n\t{\n\t\tint i;\n\t\tfor (i = 0; i < MAX_SKILL_MAGIC; i++)\n\t\t{\n\t\t\tif (pSkillLevelProto->m_magic[i])\n\t\t\t{\n\t\t\t\tif (pSkillLevelProto->m_magic[i]->m_type == MT_ASSIST && pSkillLevelProto->m_magic[i]->m_subtype == MST_ASSIST_DAMAGELINK)\n\t\t\t\t{\n\t\t\t\t\tbIsDamageLink = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (pSkillLevelProto->m_magic[i]->m_type == MT_ASSIST\n\t\t\t\t\t\t&& pSkillLevelProto->m_magic[i]->m_subtype == MST_ASSIST_SAFEGUARD)\n\t\t\t\t{\n\t\t\t\t\tCPC * pc = TO_PC(ch);\n\t\t\t\t\tif (pc != NULL)\n\t\t\t\t\t{\n\t\t\t\t\t\tpc->m_bImmortal = false;\n\t\t\t\t\t\tpc->m_assist.m_state &= ~AST_SAFEGUARD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (pSkillLevelProto->m_magic[i]->m_type == MT_ASSIST\n\t\t\t\t\t\t&& pSkillLevelProto->m_magic[i]->m_subtype == MST_ASSIST_GUARD)\n\t\t\t\t{\n\t\t\t\t\tCPC * pc = TO_PC(ch);\n\t\t\t\t\tif (pc != NULL)\n\t\t\t\t\t{\n\t\t\t\t\t\tCElemental* pElemental = NULL;\n\t\t\t\t\t\tCElemental* pElementalNext = pc->m_elementalList;\n\t\t\t\t\t\twhile ((pElemental = pElementalNext))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tpElementalNext = pElemental->m_nextElemental;\n\t\t\t\t\t\t\tif(pElemental->GetElementalType() == ELEMENTAL_GUARD)\n\t\t\t\t\t\t\t\tpc->UnsummonElemental(pElemental);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (pSkillLevelProto->m_magic[i]->m_type == MT_ASSIST\n\t\t\t\t\t&& pSkillLevelProto->m_magic[i]->m_subtype == MST_ASSIST_GPS)\n\t\t\t\t{\n\t\t\t\t\tCPC * pc = TO_PC(ch);\n\t\t\t\t\tif (pc != NULL)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(d->m_proto->m_index == 1759)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tpc->m_gpsManager.setIsGps(false);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if(d->m_proto->m_index == 1760)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tpc->m_gpsManager.setIsGpsInterrupt(false);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (pSkillLevelProto->m_magic[i]->m_type == MT_ASSIST\n\t\t\t\t\t&& pSkillLevelProto->m_magic[i]->m_subtype == MST_ASSIST_ARTIFACT_GPS)\n\t\t\t\t{\n\t\t\t\t\tCPC * pc = TO_PC(ch);\n\t\t\t\t\tif (pc != NULL)\n\t\t\t\t\t{\n\t\t\t\t\t\tpc->m_arti_gpsManager.setIsGps(false);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (pSkillLevelProto->m_magic[i]->m_index == 520)\n\t\t\t\t{\n\t\t\t\t\tCPC * pc = TO_PC(ch);\n\t\t\t\t\tif (pc != NULL)\n\t\t\t\t\t{\n\t\t\t\t\t\tpc->setSearchLife(false);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t// \ud63c\ub780\uc774\ub098 \ud14c\uc774\ubc0d \uc911\uc778 \ubaac\uc2a4\ud130\uc774\uba74 \uc2dc\uac04\uc774 \uc9c0\ub098\uba74 \ud480\uc5b4\uc900\ub2e4.\n\t\t\t\tif (pSkillLevelProto->m_magic[i]->m_type == MT_ASSIST\n\t\t\t\t\t\t&& pSkillLevelProto->m_magic[i]->m_subtype == MST_ASSIST_CONFUSED)\n\t\t\t\t{\n\t\t\t\t\tif (IS_NPC(ch))\n\t\t\t\t\t{\n\t\t\t\t\t\tCNPC* pNPC = TO_NPC(ch);\n\t\t\t\t\t\tif (pNPC)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tpNPC->reSet_MobFlag( STATE_MONSTER_CONFUSION );\n\t\t\t\t\t\t\tDelAttackList(pNPC);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (pSkillLevelProto->m_magic[i]->m_type == MT_ASSIST\n\t\t\t\t\t\t&& pSkillLevelProto->m_magic[i]->m_subtype == MST_ASSIST_TAMING)\n\t\t\t\t{\n\t\t\t\t\tif (IS_NPC(ch))\n\t\t\t\t\t{\n\t\t\t\t\t\tCNPC* pNPC = TO_NPC(ch);\n\t\t\t\t\t\tif (pNPC)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tpNPC->reSet_MobFlag( STATE_MONSTER_TAMING );\n\t\t\t\t\t\t\tDelAttackList(pNPC);\n\n\t\t\t\t\t\t\t// \uc8fc\uc778\uc744 \ucc3e\ub294\ub2e4.\n\t\t\t\t\t\t\tCPC* owner = pNPC->GetOwner();\n\t\t\t\t\t\t\tif(owner != NULL)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\towner->DeleteSlave( pNPC );\n\t\t\t\t\t\t\t\t// npc\uc758 \uc8fc\uc778\ub3c4 \uc9c0\uc6cc \uc90c\n\t\t\t\t\t\t\t\tpNPC->SetOwner(NULL);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif (pSkillLevelProto->m_magic[i]->m_type == MT_ASSIST && IS_NPC(ch) )\n\t\t\t\t{\n\t\t\t\t\tswitch(pSkillLevelProto->m_magic[i]->m_subtype )\n\t\t\t\t\t{\n\t\t\t\t\tcase MST_ASSIST_SOUL_TOTEM_BUFF:\n\t\t\t\t\tcase MST_ASSIST_SOUL_TOTEM_ATTK:\n\t\t\t\t\tcase MST_ASSIST_TRAP:\n\t\t\t\t\tcase MST_ASSIST_SUICIDE:\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t// \ubc84\ud504\uac00 \uc0dd\uba85\ub839\uc744 \ub2e4\ud558\uba74 NPC\ub97c \ub9ac\uc2a4\ud2b8\uc5d0\uc11c \uc0ad\uc81c\ud55c\ub2e4.\n\t\t\t\t\t\t\tif( TO_NPC(ch)->GetOwner() )\n\t\t\t\t\t\t\t\tTO_NPC(ch)->GetOwner()->SummonNpcRemove(TO_NPC(ch));\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (bIsDamageLink/*(ch->m_assist.m_state & AST_DAMAGELINK) != 0*/)\n\t{\n\t\tCCharacter* plinkSource = ch->m_linkSource;\n\t\tCCharacter* plinkTarget = ch->m_linkTarget;\n\t\tch->m_linkSource = NULL;\n\t\tch->m_linkTarget = NULL;\n\t\tif (plinkSource)\n\t\t{\n\t\t\tplinkSource->m_linkTarget = NULL;\n\t\t\tplinkSource->CancelDamageLink();\n\t\t}\n\t\tif (plinkTarget)\n\t\t{\n\t\t\tplinkTarget->m_linkSource = NULL;\n\t\t\tplinkTarget->CancelDamageLink();\n\t\t}\n\t}\n\n\tif( d->m_proto->m_flag & SF_ABSTIME )\n\t\tm_abscount--;\n\telse\n\t\tm_count--;\n\n\tif(statusUpdate == true)\n\t\tch->CalcStatus(bSend);\n\n\tif( d->m_index != -1 )\n\t{\n\t\tif( IS_PC(ch) )\n\t\t{\n\t\t\tCItemProto* proto = gserver->m_itemProtoList.FindIndex(d->m_index);\n\t\t\tif( proto && proto->getItemFlag() & ITEM_FLAG_CASH )\n\t\t\t{\n\t\t\t\tGAMELOG << init(\"CASH_ASSIST_DEL\", TO_PC(ch))\n\t\t\t\t\t\t<< proto->getItemIndex() << delim\n\t\t\t\t\t\t<< proto->getItemName() << delim\n\t\t\t\t\t\t<< d->m_index << delim\n\t\t\t\t\t\t<< d->m_remain << delim\n\t\t\t\t\t\t<< d->m_proto->m_index << delim\n\t\t\t\t\t\t<< (d->m_proto->m_flag & SF_ABSTIME) << end;\n\t\t\t}\n\t\t}\n\t}\n\n\tswitch(d->m_proto->m_index)\n\t{\n\tcase 1062:\n\tcase 1063:\n\tcase 1064:\n\tcase 1065:\n\t\t{\n\t\t\tGAMELOG << init(\"EP SKILL END\", TO_PC(ch))\n\t\t\t\t\t<< \"Skill Index\" << delim << d->m_proto->m_index << delim\n\t\t\t\t\t<< \"Skill Level\" << delim << d->m_level << end;\n\t\t}\n\t\tbreak;\n\tdefault:\n\t\tbreak;\n\t}\n\n\tif (bSend)\n\t{\n\t\t{\n\t\t\tCNetMsg::SP rmsg(new CNetMsg);\n\t\t\tAssistDelMsg(rmsg, ch, d->m_index, d->m_proto->m_index);\n\t\t\tch->m_pArea->SendToCell(rmsg, ch, true);\n\t\t}\n\n\t\t{\n\t\t\tCNetMsg::SP rmsg(new CNetMsg);\n\t\t\tCharStatusMsg(rmsg, ch, 0);\n\t\t\tch->m_pArea->SendToCell(rmsg, ch, true);\n\t\t}\n\n\t\t// \ud33b\uc2a4\ud0ac \ud574\uc81c \uc2dc \uc2a4\ud14c\uc774\ud130\uc2a4\ub97c \ub0a0\ub9b0\ub2e4.\n\t\tif( IS_APET(ch) )\n\t\t{\n\t\t\tCAPet * pApet = TO_APET(ch);\n\t\t\tif(pApet->GetOwner() != NULL)\n\t\t\t{\n\t\t\t\tCNetMsg::SP rmsg(new CNetMsg);\n\t\t\t\tExAPetStatusMsg( rmsg, pApet );\n\t\t\t\tSEND_Q( rmsg, pApet->GetOwner()->m_desc );\n\t\t\t}\n\t\t}\n\t}\n\n\tdelete d;\n}\n\n////////////////\n// class CAssist\n\nCAssist::CAssist()\n{\n\tm_ch = NULL;\n\n\tm_help.Max(MAX_ASSIST_HELP);\n\tm_curse.Max(MAX_ASSIST_CURSE);\n\n\tm_delaycheck = gserver->getNowSecond();\n\n\tmemset(&m_avAddition, 0, sizeof(m_avAddition));\n\tmemset(&m_avRate, 0, sizeof(m_avRate));\n\tm_state = 0;\n}\n\nvoid CAssist::Init(CCharacter* ch)\n{\n\tm_ch = ch;\n}\n\nbool CAssist::Add(CCharacter* spellchar, int itemidx, const CSkillProto* proto, int level, bool bHit[MAX_SKILL_MAGIC], bool bSend, int remain,\n\t\t\t\t int remainCount,\n\t\t\t\t int param, int nBlessAdd, int nBlessRate)\n{\n\tif (!CanApply(proto, level))\n\t\treturn false;\n\n\tCAssistList* list = NULL;\n\n\tif (proto->m_flag & SF_HELP)\n\t\tlist = &m_help;\n\telse\n\t\tlist = &m_curse;\n\n\tbool bCancelBlind = false;\n\tbool isStone = false;\n\tbool isDamageLink = false;\n\n\tint i;\n\tint j = 0;\n\tfor (i = 0; i < MAX_SKILL_MAGIC; i++)\n\t{\n\t\tif (bHit[i] && proto->Level(level)->m_magic[i])\n\t\t{\n\t\t\tj++;\n\n\t\t\tswitch (proto->Level(level)->m_magic[i]->m_type)\n\t\t\t{\n\t\t\tcase MT_IMMUNE:\n\t\t\t\tswitch (proto->Level(level)->m_magic[i]->m_subtype)\n\t\t\t\t{\n\t\t\t\tcase MST_IMMUNE_BLIND:\n\t\t\t\t\tbCancelBlind = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tbreak;\n\n\t\t\tcase MT_ASSIST:\n\t\t\t\tswitch (proto->Level(level)->m_magic[i]->m_subtype)\n\t\t\t\t{\n\t\t\t\tcase MST_ASSIST_HOLD:\n\t\t\t\tcase MST_ASSIST_SILENT:\n\t\t\t\tcase MST_ASSIST_STONE:\n\t\t\t\tcase MST_ASSIST_STURN:\n\t\t\t\tcase MST_ASSIST_SLEEP:\n\t\t\t\t\tif( IS_NPC(m_ch) )\n\t\t\t\t\t{\n\t\t\t\t\t\tCNPC* pNpc = TO_NPC(m_ch);\n\t\t\t\t\t\t//\ud640\ub4dc\uc5d0 \ub300\ud55c \uba74\uc5ed \uc2a4\ud0ac \ubc1c\ub3d9 \ud50c\ub798\uadf8\uac00 \uc788\uc744 \uacbd\uc6b0\n\t\t\t\t\t\tif(pNpc->m_proto->CheckStateFlag( (1 << proto->Level(level)->m_magic[i]->m_subtype)) )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t//npc \uc5d0\uac8c \ud604\uc81c \ud640\ub4dc \uba74\uc5ed \ubc84\ud504\uac00 \uac78\ub824\uc788\ub294 \uacbd\uc6b0\n\t\t\t\t\t\t\tif(pNpc->m_assist.FindBySkillIndex(1751))\t\t//1751 : \uc544\uc774\uc5b8 \uc6d4 (NPC \uba74\uc5ed \uc2a4\ud0ac \uc778\ub371\uc2a4)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tconst CSkillProto* proto = gserver->m_skillProtoList.Find(1751);\n\t\t\t\t\t\t\tconst CSkillLevelProto* levelproto = proto->Level(1);\n\t\t\t\t\t\t\tbool bHit[MAX_SKILL_MAGIC] = {true, false, false};\n\t\t\t\t\t\t\tpNpc->m_assist.Add(m_ch, -1, proto, 1, bHit, true, ((pNpc->m_ctCount * 15) + 20) * 10, levelproto->m_useCount, 0, 0, 0);\n\t\t\t\t\t\t\tpNpc->m_ctCount++;\n\t\t\t\t\t\t\tif(pNpc->m_ctCount == 20)\n\t\t\t\t\t\t\t\tpNpc->m_ctCount = 20;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (proto->Level(level)->m_magic[i]->m_subtype == MST_ASSIST_STONE)\n\t\t\t\t\t\tisStone = true;\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_FEAR:\n\t\t\t\t\tif (spellchar == NULL)\n\t\t\t\t\t\treturn false;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase MST_ASSIST_DAMAGELINK:\n\t\t\t\t\tif (spellchar == NULL)\n\t\t\t\t\t\treturn false;\n\t\t\t\t\telse\n\t\t\t\t\t\tisDamageLink = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (j == 0)\n\t\treturn false;\n\n\tif (isStone)\n\t\tClearAssist(bSend, true, true, true, false);\n//\telse if (m_state & AST_STONE)\n//\t\treturn false;\n\n\t// \uc18c\uc11c\ub7ec\uc758 \uc18c\ub178\ubc14 \ube0c\ub808\uc774\ud06c \uc774\uba74\uc11c \uc11d\ud654\uac00 \uc2e4\ud328\ud588\ub2e4\uba74 \ub514\ubc84\ud504 \uba54\uc138\uc9c0\ub97c \uc8fc\uc9c0 \uc54a\ub294\ub2e4. yhj\n\tif ( proto->m_index == 311 && !isStone )\n\t{\n\t\treturn false;\n\t}\n\n\tif (isDamageLink)\n\t{\n\t\tif (m_ch->m_linkSource || m_ch->m_linkTarget)\n\t\t\tm_ch->CancelDamageLink();\n\n\t\tif (spellchar != m_ch)\n\t\t{\n\t\t\tint nTemp = remain;\n\t\t\tint nTemp2 = remainCount;\n\t\t\tif (!spellchar->m_assist.Add(spellchar, itemidx, proto, level, bHit, bSend, nTemp,\n\t\t\t\t\t\t\t\t\t\t nTemp2,\n\t\t\t\t\t\t\t\t\t\t param, nBlessAdd, nBlessRate))\n\t\t\t\treturn false;\n\t\t}\n\t}\n\n//\tDelDuplicate(proto, level, bSend, false);\n\tDelDuplicate(proto, level, bSend, true);\n\tCheckApplyConditions();\n\n\tif (bCancelBlind)\n\t\tCureAssist(MST_ASSIST_BLIND, 99);\n\n\tif (!list->Add(spellchar, itemidx, proto, level, bHit, remain,\n\t\t\t\t remainCount,\n\t\t\t\t param, nBlessAdd, nBlessRate, m_ch->m_decreaseDBufTimeRate))\n\t\treturn false;\n\n\tif (isDamageLink)\n\t{\n\t\tif (spellchar != m_ch)\n\t\t{\n\t\t\tm_ch->m_linkSource = spellchar;\n\t\t\tspellchar->m_linkTarget = m_ch;\n\t\t}\n\t}\n\n\tm_ch->CalcStatus(true);\n\n\tif (bSend)\n\t{\n\t\t{\n\t\t\tCNetMsg::SP rmsg(new CNetMsg);\n\t\t\tAssistAddMsg(rmsg, m_ch, itemidx, proto->m_index, level, remain\n\t\t\t\t\t\t , remainCount\n\t\t\t\t\t\t);\n\t\t\tm_ch->m_pArea->SendToCell(rmsg, m_ch, true);\n\t\t}\n\n\t\t{\n\t\t\tCNetMsg::SP rmsg(new CNetMsg);\n\t\t\tCharStatusMsg(rmsg, m_ch, 0);\n\t\t\tm_ch->m_pArea->SendToCell(rmsg, m_ch, true);\n\t\t}\n\n\t\t// \ud33b\uc2a4\ud0ac \ud574\uc81c \uc2dc \uc2a4\ud14c\uc774\ud130\uc2a4\ub97c \ub0a0\ub9b0\ub2e4.\n\t\tif( IS_APET(m_ch) )\n\t\t{\n\t\t\tCAPet * pApet = TO_APET(m_ch);\n\t\t\tCNetMsg::SP rmsg(new CNetMsg);\n\t\t\tExAPetStatusMsg( rmsg, pApet );\n\t\t\tSEND_Q( rmsg, pApet->GetOwner()->m_desc );\n\t\t}\n\t}\n\n\treturn true;\n}\n\nbool CAssist::CanApply(const CSkillProto* proto, int level)\n{\n\tif (proto == NULL)\n\t\treturn false;\n\tconst CSkillLevelProto* levelproto = proto->Level(level);\n\tif (levelproto == NULL)\n\t\treturn false;\n\n\tint i;\n\tfor (i = 0; i < MAX_SKILL_MAGIC; i++)\n\t{\n\t\tif (levelproto->m_magic[i])\n\t\t{\n\t\t\tswitch (levelproto->m_magic[i]->m_type)\n\t\t\t{\n\t\t\tcase MT_ASSIST:\n\t\t\t\tswitch (levelproto->m_magic[i]->m_subtype)\n\t\t\t\t{\n\t\t\t\tcase MST_ASSIST_BLIND:\n\t\t\t\t\tif (FindByType(MT_IMMUNE, MST_IMMUNE_BLIND) || m_ch->m_avPassiveAddition.immune_blind)\n\t\t\t\t\t{\n\t\t\t\t\t\t//100% \uc801\uc6a9 \uc81c\uac70 its : 18842 -> 80%\ud655\ub960\ub85c \uc801\uc6a9\ud558\ub3c4\ub85d \uc218\uc815\n\t\t\t\t\t\tint rand = GetRandom(1, 10000);\n\t\t\t\t\t\tif(rand > 8000)\n\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase MST_ASSIST_AURA_DARKNESS:\n\t\t\t\tcase MST_ASSIST_AURA_WEAKNESS:\n\t\t\t\tcase MST_ASSIST_AURA_ILLUSION:\n\t\t\t\t\t// AURA\ub294 \ud55c\uac00\uc9c0\ub9cc \uc0ac\uc6a9\ud560 \uc218 \uc788\ub2e4.\n\t\t\t\t\t// \uc624\uc624\ub77c\ub97c \uc0ac\uc6a9\ud558\uace0 \uc788\ub294\uc9c0 \ud655\uc778\n\t\t\t\t\tif(FindByType(MT_ASSIST, MST_ASSIST_AURA_DARKNESS)\n\t\t\t\t\t\t\t||FindByType(MT_ASSIST, MST_ASSIST_AURA_WEAKNESS)\n\t\t\t\t\t\t\t||FindByType(MT_ASSIST, MST_ASSIST_AURA_ILLUSION))\n\t\t\t\t\t\treturn false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn (m_help.CanApply(proto, level) && m_curse.CanApply(proto, level));\n}\n\n// 060227 : bs : \uc808\ub300\uc2dc\uac04 \ubc84\ud504 \ucd94\uac00\nvoid CAssist::DelDuplicate(const CSkillProto* proto, int level, bool bSend, bool bNoCancelType)\n{\n\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\tm_curse.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\n\t// \uc774\uc18d\ubb3c\uc57d\uacfc \ucc28\ud06c\ub77c\uc2e4\ub4dc\ub294 \ub354\ube14\ubb34\ube0c\uba3c\ud2b8\uc640 \ub3d9\uc2dc \uc801\uc6a9 \uc548\ub41c\ub2e4\n\tswitch (proto->m_index)\n\t{\n\tcase 155:\t\t// \ub354\ube14\ubb34\ube0c\uba3c\ud2b8\n\t\tproto = gserver->m_skillProtoList.Find(70);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\t\tm_curse.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\n\t\tproto = gserver->m_skillProtoList.Find(62);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\t\tm_curse.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\t\tbreak;\n\tcase 70:\t\t// \uc774\uc18d\ubb3c\uc57d\n\tcase 62:\t\t// \ucc60\ud06c\ub77c\n\t\tproto = gserver->m_skillProtoList.Find(155);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\t\tm_curse.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\t\tbreak;\n\tcase 470:\n\t\tif( !gserver->isActiveEvent(A_EVENT_HALLOWEEN) )\n\t\t\tbreak;\n\t\tproto = gserver->m_skillProtoList.Find(471);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\n\t\tproto = gserver->m_skillProtoList.Find(472);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\n\t\tproto = gserver->m_skillProtoList.Find(473);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\n\t\tproto = gserver->m_skillProtoList.Find(474);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\t\tbreak;\n\tcase 471:\n\t\tif( !gserver->isActiveEvent(A_EVENT_HALLOWEEN) )\n\t\t\tbreak;\n\t\tproto = gserver->m_skillProtoList.Find(470);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\n\t\tproto = gserver->m_skillProtoList.Find(472);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\n\t\tproto = gserver->m_skillProtoList.Find(473);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\n\t\tproto = gserver->m_skillProtoList.Find(474);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\t\tbreak;\n\tcase 472:\n\t\tif( !gserver->isActiveEvent(A_EVENT_HALLOWEEN) )\n\t\t\tbreak;\n\t\tproto = gserver->m_skillProtoList.Find(470);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\n\t\tproto = gserver->m_skillProtoList.Find(471);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\n\t\tproto = gserver->m_skillProtoList.Find(473);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\n\t\tproto = gserver->m_skillProtoList.Find(474);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\t\tbreak;\n\tcase 473:\n\t\tif( !gserver->isActiveEvent(A_EVENT_HALLOWEEN) )\n\t\t\tbreak;\n\t\tproto = gserver->m_skillProtoList.Find(470);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\n\t\tproto = gserver->m_skillProtoList.Find(471);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\n\t\tproto = gserver->m_skillProtoList.Find(472);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\n\t\tproto = gserver->m_skillProtoList.Find(474);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\t\tbreak;\n\tcase 474:\n\t\tif( !gserver->isActiveEvent(A_EVENT_HALLOWEEN) )\n\t\t\tbreak;\n\t\tproto = gserver->m_skillProtoList.Find(470);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\n\t\tproto = gserver->m_skillProtoList.Find(471);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\n\t\tproto = gserver->m_skillProtoList.Find(472);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\n\t\tproto = gserver->m_skillProtoList.Find(473);\n\t\tm_help.DelDuplicate(proto, level, bSend, m_ch, bNoCancelType);\n\t\tbreak;\n\t}\n}\n\nbool CAssist::DecreaseTime()\n{\n\tif ( m_delaycheck == gserver->getNowSecond())\n\t\treturn false;\n\n\tm_delaycheck = gserver->getNowSecond();\n\n\tLONGLONG changestate = 0;\n\n\tbool bret = m_help.DecreaseTime(m_ch, &changestate);\n\tif (m_curse.DecreaseTime(m_ch, &changestate))\n\t\tbret = true;\n\n\tif (bret || changestate)\n\t{\n\t\tm_ch->CalcStatus(true);\n\n\t\tCNetMsg::SP rmsg(new CNetMsg);\n\t\tCharStatusMsg(rmsg, m_ch, changestate);\n\n\t\tm_ch->m_pArea->SendToCell(rmsg, m_ch, true);\n\t}\n\n\treturn bret;\n}\n\nvoid CAssist::Apply()\n{\n\tmemset(&m_avAddition, 0, sizeof(m_avAddition));\n\tmemset(&m_avRate, 0, sizeof(m_avRate));\n\tm_state = 0;\n\tm_help.Apply(m_ch, &m_avAddition, &m_avRate, &m_state);\n\tm_curse.Apply(m_ch, &m_avAddition, &m_avRate, &m_state);\n\n\tm_ch->ApplyAssistData(&m_avAddition, &m_avRate);\n}\n\n// 060317 : bs : SF_NOCANCEL \uac80\uc0ac \ucd94\uac00\nvoid CAssist::ClearAssist(bool bSend, bool bByStone, bool bHelp, bool bCurse, bool bNoCancelType)\n{\n\tCAssistData* pAssist;\n\tCAssistData* pAssistNext;\n\n\tif(bHelp)\n\t{\n\t\tpAssistNext = m_help.m_head;\n\t\twhile ((pAssist = pAssistNext))\n\t\t{\n\t\t\tpAssistNext = pAssistNext->m_next;\n\t\t\t// 060317 : bs : SF_NOCANCEL \uac80\uc0ac\n\t\t\tif (!bNoCancelType && (pAssist->m_proto->m_flag & SF_NOCANCEL))\n\t\t\t\tcontinue ;\n\n\t\t\tif (bByStone)\n\t\t\t{\n\t\t\t\tswitch (pAssist->m_index)\n\t\t\t\t{\n\t\t\t\tcase 671:\t\t// \ud558\uae09 \uacbd\ud5d8\uc758 \uacb0\uc815\n\t\t\t\tcase 672:\t\t// \uc911\uae09 \uacbd\ud5d8\uc758 \uacb0\uc815\n\t\t\t\tcase 673:\t\t// \uc0c1\uae09 \uacbd\ud5d8\uc758 \uacb0\uc815\n\t\t\t\tcase 674:\t\t// \ub178\ub825\uc758 \uacb0\uc815\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tm_help.DelAssist(pAssist, bSend, m_ch, bNoCancelType);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t\tm_help.DelAssist(pAssist, bSend, m_ch, bNoCancelType);\n\t\t}\n\t}\n\tif(bCurse)\n\t{\n\t\tpAssistNext = m_curse.m_head;\n\t\twhile ((pAssist = pAssistNext))\n\t\t{\n\t\t\tpAssistNext = pAssistNext->m_next;\n\t\t\tif (bByStone)\n\t\t\t{\n\t\t\t\tswitch (pAssist->m_index)\n\t\t\t\t{\n\t\t\t\tcase 671:\t\t// \ud558\uae09 \uacbd\ud5d8\uc758 \uacb0\uc815\n\t\t\t\tcase 672:\t\t// \uc911\uae09 \uacbd\ud5d8\uc758 \uacb0\uc815\n\t\t\t\tcase 673:\t\t// \uc0c1\uae09 \uacbd\ud5d8\uc758 \uacb0\uc815\n\t\t\t\tcase 674:\t\t// \ub178\ub825\uc758 \uacb0\uc815\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tm_curse.DelAssist(pAssist, bSend, m_ch, bNoCancelType);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t\tm_curse.DelAssist(pAssist, bSend, m_ch, bNoCancelType);\n\t\t}\n\t}\n\n\tm_ch->CalcStatus(bSend);\n\n\tif (bSend)\n\t{\n\t\tCNetMsg::SP rmsg(new CNetMsg);\n\t\tCharStatusMsg(rmsg, m_ch, 0);\n\t\tm_ch->m_pArea->SendToCell(rmsg, m_ch, true);\n\t}\n}\n\nvoid CAssist::GetListString(bool bHelp, char* item, char* index, char* level, char* remain,\n\t\t\t\t\t\t\t char* remainCount,\n\t\t\t\t\t\t\t char* hit0, char* hit1, char* hit2)\n{\n\t*item = *index = *level = *remain =\n\t\t\t\t\t\t\t\t *remainCount =\n\t\t\t\t\t\t\t\t\t *hit0 = *hit1 = *hit2 = '\\0';\n\n\tCAssistData* p;\n\n\tif (bHelp)\n\t\tp = m_help.m_head;\n\telse\n\t\tp = m_curse.m_head;\n\n\twhile (p)\n\t{\n\t\tbool bSkip = false;\n\n\t\t// 060227 : bs : \uc808\ub300\uc2dc\uac04 \uc0ac\uc6a9 \uc2a4\ud0ac\uc740 t_assist\uc5d0 \uc800\uc7a5 \uc548\ud568\n\t\tif (p->m_proto->m_flag & SF_ABSTIME)\n\t\t\tbSkip = true;\n\t\t// 060227 : bs : \uc808\ub300\uc2dc\uac04 \uc0ac\uc6a9 \uc2a4\ud0ac\uc740 t_assist\uc5d0 \uc800\uc7a5 \uc548\ud568\n\n\t\tif(p->m_proto->m_flag & SF_COMBO)\n\t\t\tbSkip = true;\n\n#ifdef EVENT_PCBANG_2ND\n\t\tif(p->m_proto->m_index == 493 )\n\t\t{\n\t\t\t// PC\ubc29 \ubc84\ud504 \uc800\uc7a5 \uc548\ud568\n\t\t\tbSkip = true;\n\t\t}\n#endif // EVENT_PCBAG_2ND\n\n\t\tif( p->m_proto->m_index == 516 )\n\t\t{\n\t\t\t// \ud53c\ub2c9\uc2a4 \ubc84\ud504 \uc800\uc7a5 \uc548\ud568\n\t\t\tbSkip = true;\n\t\t}\n\n\t\t// \ub2e4\ud06c\ub2c8\uc2a4 \ubaa8\ub4dc \uc2a4\ud0ac(682)\uc740 \uc800\uc7a5 \uc548\ud568\n\t\tif( p->m_proto->m_index == 682 )\n\t\t{\n\t\t\tbSkip = true;\n\t\t}\n\n\t\tif (!bSkip)\n\t\t{\n\t\t\tIntCat(item, p->m_index, true);\n\t\t\tIntCat(index, p->m_proto->m_index, true);\n\t\t\tIntCat(level, p->m_level, true);\n\t\t\tIntCat(remain, p->m_remain, true);\n\t\t\tIntCat(remainCount, p->m_remainCount, true);\n\t\t\tIntCat(hit0, (p->m_bHit[0]) ? 1 : 0, true);\n\t\t\tIntCat(hit1, (p->m_bHit[1]) ? 1 : 0, true);\n\t\t\tIntCat(hit2, (p->m_bHit[2]) ? 1 : 0, true);\n\t\t}\n\n\t\tp = p->m_next;\n\t}\n}\n\n\nvoid CAssist::GetListString(bool bHelp, std::string& item, std::string& index, std::string& level, std::string& remain,\n\t\t\t\t\t\t\t std::string& remainCount,\n\t\t\t\t\t\t\t std::string& hit0, std::string& hit1, std::string& hit2)\n{\n\titem = \"\";\n\tindex = \"\";\n\tlevel = \"\";\n\tremain = \"\";\n\tremainCount = \"\";\n\thit0 = \"\";\n\thit1 = \"\";\n\thit2 = \"\";\n\n\tCAssistData* pAssist;\n\n\tif (bHelp)\n\t\tpAssist = m_help.m_head;\n\telse\n\t\tpAssist = m_curse.m_head;\n\n\twhile (pAssist)\n\t{\n\t\tbool bSkip = false;\n\n\t\t// 060227 : bs : \uc808\ub300\uc2dc\uac04 \uc0ac\uc6a9 \uc2a4\ud0ac\uc740 t_assist\uc5d0 \uc800\uc7a5 \uc548\ud568\n\t\tif (pAssist->m_proto->m_flag & SF_ABSTIME)\n\t\t\tbSkip = true;\n\t\t// 060227 : bs : \uc808\ub300\uc2dc\uac04 \uc0ac\uc6a9 \uc2a4\ud0ac\uc740 t_assist\uc5d0 \uc800\uc7a5 \uc548\ud568\n\n\t\tif(pAssist->m_proto->m_flag & SF_COMBO)\n\t\t\tbSkip = true;\n\n#ifdef EVENT_PCBANG_2ND\n\t\tif(pAssist->m_proto->m_index == 493 )\n\t\t{\n\t\t\t// PC\ubc29 \ubc84\ud504 \uc800\uc7a5 \uc548\ud568\n\t\t\tbSkip = true;\n\t\t}\n#endif // EVENT_PCBAG_2ND\n\n\t\tif( pAssist->m_proto->m_index == 516 )\n\t\t{\n\t\t\t// \ud53c\ub2c9\uc2a4 \ubc84\ud504 \uc800\uc7a5 \uc548\ud568\n\t\t\tbSkip = true;\n\t\t}\n\n\t\t// \ub2e4\ud06c\ub2c8\uc2a4 \ubaa8\ub4dc \uc2a4\ud0ac(682)\uc740 \uc800\uc7a5 \uc548\ud568\n\t\tif( pAssist->m_proto->m_index == 682 )\n\t\t{\n\t\t\tbSkip = true;\n\t\t}\n\n\t\tif (!bSkip)\n\t\t{\n\t\t\titem += boost::str(boost::format(\" %d\") % pAssist->m_index);\n\t\t\tindex += boost::str(boost::format(\" %d\") % pAssist->m_proto->m_index);\n\t\t\tlevel += boost::str(boost::format(\" %d\") % pAssist->m_level);\n\t\t\tremain += boost::str(boost::format(\" %d\") % pAssist->m_remain);\n\t\t\tremainCount += boost::str(boost::format(\" %d\") % pAssist->m_remainCount);\n\t\t\thit0 += boost::str(boost::format(\" %d\") % ((pAssist->m_bHit[0]) ? 1 : 0));\n\t\t\thit1 += boost::str(boost::format(\" %d\") % ((pAssist->m_bHit[1]) ? 1 : 0));\n\t\t\thit2 += boost::str(boost::format(\" %d\") % ((pAssist->m_bHit[2]) ? 1 : 0));\n\t\t}\n\n\t\tpAssist = pAssist->m_next;\n\t}\n}\n\nvoid CAssist::AppendAssistToNetMsg(CNetMsg::SP& msg)\n{\n\tCAssistData* p;\n\n\tRefMsg(msg) << m_state\n\t\t\t\t<< (char)GetAssistCount();\n\n\tp = m_help.m_head;\n\twhile (p)\n\t{\n\t\tRefMsg(msg) << p->m_index\n\t\t\t\t\t<< p->m_proto->m_index\n\t\t\t\t\t<< (char)p->m_level\n\t\t\t\t\t<< p->m_remain\n\t\t\t\t\t<< p->m_remainCount;\n\n\t\tp = p->m_next;\n\t}\n\n\tp = m_curse.m_head;\n\twhile (p)\n\t{\n\t\tRefMsg(msg) << p->m_index\n\t\t\t\t\t<< p->m_proto->m_index\n\t\t\t\t\t<< (char)p->m_level\n\t\t\t\t\t<< p->m_remain\n\t\t\t\t\t<< p->m_remainCount;\n\n\t\tp = p->m_next;\n\t}\n}\n\nvoid CAssist::AppendAssistToNetStructMsg(struct tag_assistinfo& info)\n{\n\tinfo.state = m_state;\n\tinfo.count = GetAssistCount();\n\n\tif (info.count == 0)\n\t\treturn;\n\n\tint listcount = 0;\n\tCAssistData* p = m_help.m_head;\n\twhile (p)\n\t{\n\t\tinfo.list[listcount].index = p->m_index;\n\t\tinfo.list[listcount].dbIndex = p->m_proto->m_index;\n\t\tinfo.list[listcount].level = p->m_level;\n\t\tinfo.list[listcount].remain = p->m_remain;\n\t\tinfo.list[listcount].remainCount = p->m_remainCount;\n\t\t++listcount;\n\n\t\tp = p->m_next;\n\t}\n\n\tp = m_curse.m_head;\n\twhile (p)\n\t{\n\t\tinfo.list[listcount].index = p->m_index;\n\t\tinfo.list[listcount].dbIndex = p->m_proto->m_index;\n\t\tinfo.list[listcount].level = p->m_level;\n\t\tinfo.list[listcount].remain = p->m_remain;\n\t\tinfo.list[listcount].remainCount = p->m_remainCount;\n\t\t++listcount;\n\n\t\tp = p->m_next;\n\t}\n}\n\nbool CAssist::Find(int magicindex, int magiclevel)\n{\n\tCAssistData* p;\n\tconst CSkillLevelProto* slp;\n\tint i;\n\n\tp = m_help.m_head;\n\twhile (p)\n\t{\n\t\tslp = p->m_proto->Level(p->m_level);\n\t\tif (slp)\n\t\t{\n\t\t\ti = 0;\n\t\t\twhile (i < MAX_SKILL_MAGIC)\n\t\t\t{\n\t\t\t\tif (slp->m_magic[i] && slp->m_magic[i]->m_index == magicindex && slp->m_magicLevel[i] >= magiclevel)\n\t\t\t\t\treturn true;\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t\tp = p->m_next;\n\t}\n\n\tp = m_curse.m_head;\n\twhile (p)\n\t{\n\t\tslp = p->m_proto->Level(p->m_level);\n\t\tif (slp)\n\t\t{\n\t\t\ti = 0;\n\t\t\twhile (i < MAX_SKILL_MAGIC)\n\t\t\t{\n\t\t\t\tif (slp->m_magic[i] && slp->m_magic[i]->m_index == magicindex && slp->m_magicLevel[i] >= magiclevel)\n\t\t\t\t\treturn true;\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t\tp = p->m_next;\n\t}\n\n\treturn false;\n}\n\nvoid CAssist::CancelSleep()\n{\n\tCureAssist(MST_ASSIST_SLEEP, 99);\n}\nvoid CAssist::CancelMantle()\n{\n\tCureAssist(MST_ASSIST_MANTLE, 99);\n}\n\nvoid CAssist::CureAssist(int flag)\n{\n\tCAssistData* p;\n\tCAssistData* pNext;\n\n\tpNext = m_help.m_head;\n\twhile((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\t\tif(p->m_proto->m_flag & flag)\n\t\t\tm_help.DelAssist(p, true, m_ch, true);\n\t}\n\n\tpNext = m_curse.m_head;\n\twhile((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\t\tif(p->m_proto->m_flag & flag)\n\t\t\tm_curse.DelAssist(p, true, m_ch, true);\n\t}\n}\n\nvoid CAssist::CureAssist(int type, int level)\n{\n\tCAssistData* p;\n\tCAssistData* pNext;\n\tconst CSkillLevelProto* slp;\n\tconst CMagicProto* mp;\n\tint i;\n\n\tpNext = m_help.m_head;\n\twhile ((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\t\tslp = p->m_proto->Level(p->m_level);\n\t\tif (slp)\n\t\t{\n\t\t\ti = 0;\n\t\t\twhile (i < MAX_SKILL_MAGIC)\n\t\t\t{\n\t\t\t\tmp = slp->m_magic[i];\n\t\t\t\tif (mp && mp->m_type == MT_ASSIST && mp->m_subtype == type && slp->m_magicLevel[i] <= level)\n\t\t\t\t{\n\t\t\t\t\tm_help.DelAssist(p, true, m_ch, true);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t}\n\n\tpNext = m_curse.m_head;\n\twhile ((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\t\tslp = p->m_proto->Level(p->m_level);\n\t\tif (slp)\n\t\t{\n\t\t\ti = 0;\n\t\t\twhile (i < MAX_SKILL_MAGIC)\n\t\t\t{\n\t\t\t\tmp = slp->m_magic[i];\n\t\t\t\tif (mp && mp->m_type == MT_ASSIST && mp->m_subtype == type && slp->m_magicLevel[i] <= level)\n\t\t\t\t{\n\t\t\t\t\tm_curse.DelAssist(p, true, m_ch, true);\n\t\t\t\t\tbreak ;\n\t\t\t\t}\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid CAssist::CureOtherAssist(int type, int subtype, int level)\n{\n\tCAssistData* p;\n\tCAssistData* pNext;\n\tconst CSkillLevelProto* slp;\n\tconst CMagicProto* mp;\n\tint i;\n\n\tpNext = m_help.m_head;\n\twhile ((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\t\tslp = p->m_proto->Level(p->m_level);\n\t\tif (slp)\n\t\t{\n\t\t\ti = 0;\n\t\t\twhile (i < MAX_SKILL_MAGIC)\n\t\t\t{\n\t\t\t\tmp = slp->m_magic[i];\n\t\t\t\tif (mp && mp->m_type == type && mp->m_subtype == subtype && slp->m_magicLevel[i] <= level)\n\t\t\t\t{\n\t\t\t\t\tm_help.DelAssist(p, true, m_ch, true);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t}\n\n\tpNext = m_curse.m_head;\n\twhile ((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\t\tslp = p->m_proto->Level(p->m_level);\n\t\tif (slp)\n\t\t{\n\t\t\ti = 0;\n\t\t\twhile (i < MAX_SKILL_MAGIC)\n\t\t\t{\n\t\t\t\tmp = slp->m_magic[i];\n\t\t\t\tif (mp && mp->m_type == type && mp->m_subtype == subtype && slp->m_magicLevel[i] <= level)\n\t\t\t\t{\n\t\t\t\t\tm_curse.DelAssist(p, true, m_ch, true);\n\t\t\t\t\tbreak ;\n\t\t\t\t}\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid CAssist::CancelInvisible()\n{\n\tCureAssist(MST_ASSIST_INVISIBLE, 99);\n}\n\nvoid CAssist::CheckApplyConditions()\n{\n\tm_help.CheckApplyConditions(m_ch);\n\tm_curse.CheckApplyConditions(m_ch);\n}\n\nvoid CAssistList::CheckApplyConditions(CCharacter* ch)\n{\n\tCAssistData* p;\n\tCAssistData* pNext;\n//\tbool bFinish = false;\n\n//\twhile (!bFinish)\n//\t{\n//\t\tbFinish = true;\n\tpNext = m_head;\n\twhile ((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\n\t\tif (!ch->CanApplySkill(p->m_proto, p->m_proto->Level(p->m_level)))\n\t\t{\n\t\t\tDelAssist(p, true, ch, false);\n//\t\t\t\tbFinish = false;\n\t\t}\n\t}\n//\t}\n}\n\nint CAssist::FindByType(int type, int subtype, bool* outHelp, CAssistData** outData)\n{\n\tCAssistData* p;\n\tCAssistData* pNext;\n\tconst CSkillLevelProto* slp;\n\tconst CMagicProto* mp;\n\tint i;\n\n\tpNext = m_help.m_head;\n\twhile ((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\t\tslp = p->m_proto->Level(p->m_level);\n\t\tif (slp)\n\t\t{\n\t\t\ti = 0;\n\t\t\twhile (i < MAX_SKILL_MAGIC)\n\t\t\t{\n\t\t\t\tmp = slp->m_magic[i];\n\t\t\t\tif (mp && mp->m_type == type && mp->m_subtype == subtype)\n\t\t\t\t{\n\t\t\t\t\tif (outHelp)\n\t\t\t\t\t\t*outHelp = true;\n\t\t\t\t\tif (outData)\n\t\t\t\t\t\t*outData = p;\n\t\t\t\t\treturn slp->m_magicLevel[i];\n\t\t\t\t}\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t}\n\n\tpNext = m_curse.m_head;\n\twhile ((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\t\tslp = p->m_proto->Level(p->m_level);\n\t\tif (slp)\n\t\t{\n\t\t\ti = 0;\n\t\t\twhile (i < MAX_SKILL_MAGIC)\n\t\t\t{\n\t\t\t\tmp = slp->m_magic[i];\n\t\t\t\tif (mp && mp->m_type == type && mp->m_subtype == subtype)\n\t\t\t\t{\n\t\t\t\t\tif (outHelp)\n\t\t\t\t\t\t*outHelp = false;\n\t\t\t\t\tif (outData)\n\t\t\t\t\t\t*outData = p;\n\t\t\t\t\treturn slp->m_magicLevel[i];\n\t\t\t\t}\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (outHelp)\n\t\t*outHelp = false;\n\tif (outData)\n\t\t*outData = NULL;\n\treturn 0;\n}\n\nint CAssist::GetSummonNpcIndex()\n{\n\tCAssistData* p;\n\tCAssistData* pNext;\n\tconst CSkillLevelProto* slp;\n\tconst CMagicProto* mp;\n\tint i;\n\n\tpNext = m_help.m_head;\n\twhile ((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\t\tslp = p->m_proto->Level(p->m_level);\n\t\tif (slp)\n\t\t{\n\t\t\ti = 0;\n\t\t\twhile (i < MAX_SKILL_MAGIC)\n\t\t\t{\n\t\t\t\tmp = slp->m_magic[i];\n\t\t\t\tif (mp && mp->m_type == MT_ASSIST && mp->m_subtype == MST_ASSIST_PARASITE)\n\t\t\t\t{\n\t\t\t\t\treturn mp->m_levelproto[slp->m_magicLevel[0]-1]->GetSummonNpcIndex();\n\t\t\t\t}\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t}\n\n\tpNext = m_curse.m_head;\n\twhile ((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\t\tslp = p->m_proto->Level(p->m_level);\n\t\tif (slp)\n\t\t{\n\t\t\ti = 0;\n\t\t\twhile (i < MAX_SKILL_MAGIC)\n\t\t\t{\n\t\t\t\tmp = slp->m_magic[i];\n\t\t\t\tif (mp && mp->m_type == MT_ASSIST && mp->m_subtype == MST_ASSIST_PARASITE)\n\t\t\t\t{\n\t\t\t\t\treturn mp->m_levelproto[slp->m_magicLevel[0]-1]->GetSummonNpcIndex();\n\t\t\t\t}\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn 0;\n}\n\nvoid CAssist::CancelFear()\n{\n\tCureAssist(MST_ASSIST_FEAR, 99);\n}\n\nvoid CAssist::CancelFakeDeath()\n{\n\tCureAssist(MST_ASSIST_FAKEDEATH, 99);\n}\n\nvoid CAssist::CureByItemIndex(int itemindex)\n{\n\tCAssistData* p;\n\tCAssistData* pNext;\n\n\tpNext = m_help.m_head;\n\twhile ((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\t\tif (p->m_index != -1 && p->m_index == itemindex)\n\t\t\tm_help.DelAssist(p, true, m_ch, true);\n\t}\n\n\tpNext = m_curse.m_head;\n\twhile ((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\t\tif (p->m_index != -1 && p->m_index == itemindex)\n\t\t\tm_curse.DelAssist(p, true, m_ch, true);\n\t}\n}\n\nvoid CAssist::CureBySkillIndex(int nSkillIndex)\n{\n\tCAssistData* p;\n\tCAssistData* pNext;\n\n\tpNext = m_help.m_head;\n\twhile ((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\t\tif (p->m_proto && p->m_proto->m_index == nSkillIndex)\n\t\t\tm_help.DelAssist(p, true, m_ch, true);\n\t}\n\n\tpNext = m_curse.m_head;\n\twhile ((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\t\tif (p->m_proto && p->m_proto->m_index == nSkillIndex)\n\t\t\tm_curse.DelAssist(p, true, m_ch, true);\n\t}\n}\n\nbool CAssist::FindByItemIndex(int itemindex, CAssistData** outData)\n{\n\tCAssistData* p;\n\tCAssistData* pNext;\n\n\tpNext = m_help.m_head;\n\twhile ((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\t\tif (p->m_index != -1 && p->m_index == itemindex)\n\t\t{\n\t\t\tif (outData)\n\t\t\t\t*outData = p;\n\t\t\treturn true;\n\t\t}\n\t}\n\n\tpNext = m_curse.m_head;\n\twhile ((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\t\tif (p->m_index != -1 && p->m_index == itemindex)\n\t\t{\n\t\t\tif (outData)\n\t\t\t\t*outData = p;\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nint CAssist::FindBySkillIndex(int skillindex)\n{\n\tCAssistData* p;\n\tCAssistData* pNext;\n\n\tpNext = m_help.m_head;\n\twhile ((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\t\tif (p->m_proto->m_index == skillindex)\n\t\t\treturn p->m_level;\n\t}\n\n\tpNext = m_curse.m_head;\n\twhile ((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\t\tif (p->m_proto->m_index == skillindex)\n\t\t\treturn p->m_level;\n\t}\n\n\treturn 0;\n}\n\n// 060227 : bs : \uc808\ub300\uc2dc\uac04 \uc0ac\uc6a9 \ubcf4\uc870\ud6a8\uacfc \ub9ac\uc2a4\ud2b8\nint CAssist::GetABSTimeTypeList(int* nAssistABSItemIndex, int* nAssistABSSkillIndex, int* nAssistABSSkillLevel, char* nAssistABSHit0, char* nAssistABSHit1, char* nAssistABSHit2, int* nAssistABSEndTime)\n{\n\tint ret = 0;\n\n\tCAssistData* p;\n\n\tp = m_help.m_head;\n\twhile (p)\n\t{\n\t\tif (p->m_proto && (p->m_proto->m_flag & SF_ABSTIME))\n\t\t{\n\t\t\tif (nAssistABSItemIndex)\n\t\t\t{\n#ifdef EVENT_PCBANG_2ND\n\t\t\t\tif(p->m_proto->m_index != 493)\n\t\t\t\t{\n\t\t\t\t\t// PC\ubc29 \ubc84\ud504 \uc800\uc7a5 \uc548\ud568\n#endif // EVENT_PCBANG_2ND\n\n\t\t\t\t\tif( p->m_proto->m_index != 516 )\n\t\t\t\t\t{\n\t\t\t\t\t\t// \ud53c\ub2c9\uc2a4 \ubc84\ud504 \uc800\uc7a5 \uc548\ud568\n\n\t\t\t\t\t\tnAssistABSItemIndex[ret] = p->m_index;\n\t\t\t\t\t\tnAssistABSSkillIndex[ret] = p->m_proto->m_index;\n\t\t\t\t\t\tnAssistABSSkillLevel[ret] = p->m_level;\n\t\t\t\t\t\tnAssistABSHit0[ret] = p->m_bHit[0];\n\t\t\t\t\t\tnAssistABSHit1[ret] = p->m_bHit[1];\n\t\t\t\t\t\tnAssistABSHit2[ret] = p->m_bHit[2];\n\t\t\t\t\t\tnAssistABSEndTime[ret] = gserver->getNowSecond() + (p->m_remain / PULSE_ASSIST_CHECK);\n\n\t\t\t\t\t}\n\n#ifdef EVENT_PCBANG_2ND\n\t\t\t\t}\n#endif // EVENT_PCBAG_2ND\n\t\t\t}\n\t\t\tret++;\n\t\t}\n\t\tp = p->m_next;\n\t}\n\n\tp = m_curse.m_head;\n\twhile (p)\n\t{\n\t\tif (p->m_proto && (p->m_proto->m_flag & SF_ABSTIME))\n\t\t{\n\t\t\tif (nAssistABSItemIndex)\n\t\t\t{\n#ifdef EVENT_PCBAG_2ND\n\t\t\t\tif(p->m_proto->m_index != 493)\n\t\t\t\t{\n\t\t\t\t\t// PC\ubc29 \ubc84\ud504 \uc800\uc7a5 \uc548\ud568\n#endif // EVENT_PCBAG_2ND\n\n\t\t\t\t\t//\t\t\tif( p->m_proto->m_index != 516 )\n\t\t\t\t\t//\t\t\t{\t// \ud53c\ub2c9\uc2a4 \ubc84\ud504 \uc800\uc7a5 \uc548\ud568\n\n\t\t\t\t\tnAssistABSItemIndex[ret] = p->m_index;\n\t\t\t\t\tnAssistABSSkillIndex[ret] = p->m_proto->m_index;\n\t\t\t\t\tnAssistABSSkillLevel[ret] = p->m_level;\n\t\t\t\t\tnAssistABSHit0[ret] = p->m_bHit[0];\n\t\t\t\t\tnAssistABSHit1[ret] = p->m_bHit[1];\n\t\t\t\t\tnAssistABSHit2[ret] = p->m_bHit[2];\n\t\t\t\t\tnAssistABSEndTime[ret] = gserver->getNowSecond() + (p->m_remain / PULSE_ASSIST_CHECK);\n\n#ifdef EVENT_PCBAG_2ND\n\t\t\t\t}\n#endif // EVENT_PCBAG_2ND\n\t\t\t}\n\t\t\tret++;\n\t\t}\n\t\tp = p->m_next;\n\t}\n\n\treturn ret;\n}\n// 060227 : bs : \uc808\ub300\uc2dc\uac04 \uc0ac\uc6a9 \ubcf4\uc870\ud6a8\uacfc \ub9ac\uc2a4\ud2b8\n\nvoid CAssist::CancelDespair()\n{\n\tCureAssist(MST_ASSIST_DESPAIR, 99);\n}\n\nvoid CAssist::CancelManaScreen()\n{\n\tCureAssist(MST_ASSIST_MANASCREEN, 99);\n}\n\nvoid CAssist::CancelBless()\n{\n\tCureAssist(MST_ASSIST_BLESS, 99);\n}\n\nvoid CAssist::DecreaseCount(int type, int subtype)\n{\n\tCAssistData* p;\n\tCAssistData* pNext;\n\tconst CSkillProto* sp;\n\tconst CSkillLevelProto* slp;\n\tconst CMagicProto* mp;\n\tint i;\n\n\tpNext = m_help.m_head;\n\twhile((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\n\t\tsp = p->m_proto;\n\t\tif (sp == NULL)\n\t\t\tcontinue;\n\n\t\tslp = sp->Level(p->m_level);\n\t\tif (slp == NULL)\n\t\t\tcontinue;\n\n\t\tfor (i = 0; i < MAX_SKILL_MAGIC; i++)\n\t\t{\n\t\t\tif (!p->m_bHit[i])\n\t\t\t\tcontinue;\n\n\t\t\tmp = slp->m_magic[i];\n\t\t\tif (mp == NULL)\n\t\t\t\tcontinue;\n\n\t\t\tif (mp->m_type == type && mp->m_subtype == subtype)\n\t\t\t{\n\t\t\t\tp->m_remainCount --;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (i >= MAX_SKILL_MAGIC)\n\t\t\tcontinue;\n\n\t\tif (p->m_remainCount <= 0)\n\t\t\tm_help.DelAssist(p, true, m_ch, true);\n\n\t\t{\n\t\t\tCNetMsg::SP rmsg(new CNetMsg);\n\t\t\tAssistModifyMsg(rmsg, m_ch, p->m_index, sp->m_index,\n\t\t\t\t\t\t\tp->m_level, p->m_remain, p->m_remainCount);\n\t\t\tm_ch->m_pArea->SendToCell(rmsg, m_ch, true);\n\t\t}\n\t}\n\n\tpNext = m_curse.m_head;\n\twhile((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\n\t\tsp = p->m_proto;\n\t\tif (sp == NULL)\n\t\t\tcontinue;\n\n\t\tslp = sp->Level(p->m_level);\n\t\tif (slp == NULL)\n\t\t\tcontinue;\n\n\t\tfor (i = 0; i < MAX_SKILL_MAGIC; i++)\n\t\t{\n\t\t\tif (!p->m_bHit[i])\n\t\t\t\tcontinue;\n\n\t\t\tmp = slp->m_magic[i];\n\t\t\tif (mp == NULL)\n\t\t\t\tcontinue;\n\n\t\t\tif (mp->m_type == type && mp->m_subtype == subtype)\n\t\t\t{\n\t\t\t\tp->m_remainCount --;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (i >= MAX_SKILL_MAGIC)\n\t\t\tcontinue;\n\n\t\tif (p->m_remainCount <= 0)\n\t\t\tm_curse.DelAssist(p, true, m_ch, true);\n\n\t\t{\n\t\t\tCNetMsg::SP rmsg(new CNetMsg);\n\t\t\tAssistModifyMsg(rmsg, m_ch, p->m_index, sp->m_index,\n\t\t\t\t\t\t\tp->m_level, p->m_remain, p->m_remainCount);\n\t\t\tm_ch->m_pArea->SendToCell(rmsg, m_ch, true);\n\t\t}\n\t}\n}\n\nvoid CAssist::CureByPetSkill()\n{\n\tCAssistData* p;\n\tCAssistData* pNext;\n\n\tpNext = m_help.m_head;\n\twhile ((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\t\tif (p->m_proto && (p->m_proto->getJob() == JOB_PET || p->m_proto->getJob() == JOB_APET))\n\t\t\tm_help.DelAssist(p, true, m_ch, true);\n\t}\n\n\tpNext = m_curse.m_head;\n\twhile ((p = pNext))\n\t{\n\t\tpNext = pNext->m_next;\n\t\tif (p->m_proto && (p->m_proto->getJob() == JOB_PET || p->m_proto->getJob() == JOB_APET))\n\t\t\tm_curse.DelAssist(p, true, m_ch, true);\n\t}\n}\n\nunsigned char CAssist::getAttrAtt()\n{\n\tif(this->m_avAddition.attratt_item > 0)\n\t{\n\t\treturn m_avAddition.attratt_item;\n\t}\n\telse if(GET_AT_ATT(this->m_avAddition.attratt) > 0)\n\t{\n\t\treturn m_avAddition.attratt;\n\t}\n\telse\n\t{\n\t\treturn AT_NONE;\n\t}\n}\n\nunsigned char CAssist::getAttrDef()\n{\n\tif(this->m_avAddition.attrdef_item > 0)\n\t{\n\t\treturn m_avAddition.attrdef_item;\n\t}\n\telse if(this->m_avAddition.attrdef > 0)\n\t{\n\t\treturn m_avAddition.attrdef;\n\t}\n\telse\n\t{\n\t\treturn AT_NONE;\n\t}\n}\n", "meta": {"hexsha": "c18fb02bfdec8b27dd7ff445020cc0be0aa3248f", "size": 86587, "ext": "cpp", "lang": "C++", "max_stars_repo_path": "GameServer/Assist.cpp", "max_stars_repo_name": "openlastchaos/lastchaos-source-server", "max_stars_repo_head_hexsha": "935b770fa857e67b705717d154b11b717741edeb", "max_stars_repo_licenses": ["Apache-2.0"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "GameServer/Assist.cpp", "max_issues_repo_name": "openlastchaos/lastchaos-source-server", "max_issues_repo_head_hexsha": "935b770fa857e67b705717d154b11b717741edeb", "max_issues_repo_licenses": ["Apache-2.0"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "GameServer/Assist.cpp", "max_forks_repo_name": "openlastchaos/lastchaos-source-server", "max_forks_repo_head_hexsha": "935b770fa857e67b705717d154b11b717741edeb", "max_forks_repo_licenses": ["Apache-2.0"], "max_forks_count": 1.0, "max_forks_repo_forks_event_min_datetime": "2022-01-17T09:34:39.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-17T09:34:39.000Z", "avg_line_length": 22.9369536424, "max_line_length": 201, "alphanum_fraction": 0.5879981983, "num_tokens": 30903, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.5078118642792044, "lm_q2_score": 0.2942149845400438, "lm_q1q2_score": 0.14940585979815696}} {"text": "#include \n\n#include \n\n#include \n\n#include \n\n#include \n\n#include \n#include \n#include \n\n#include \n\nextern \"C\" {\nvoid xrb_uint128_to_dec (xrb_uint128 source, char * destination)\n{\n\tauto const & number (*reinterpret_cast (source));\n\tstrncpy (destination, number.to_string_dec ().c_str (), 40);\n}\n\nvoid xrb_uint256_to_string (xrb_uint256 source, char * destination)\n{\n\tauto const & number (*reinterpret_cast (source));\n\tstrncpy (destination, number.to_string ().c_str (), 65);\n}\n\nvoid xrb_uint256_to_address (xrb_uint256 source, char * destination)\n{\n\tauto const & number (*reinterpret_cast (source));\n\tstrncpy (destination, number.to_account ().c_str (), 65);\n}\n\nvoid xrb_uint512_to_string (xrb_uint512 source, char * destination)\n{\n\tauto const & number (*reinterpret_cast (source));\n\tstrncpy (destination, number.to_string ().c_str (), 129);\n}\n\nint xrb_uint128_from_dec (const char * source, xrb_uint128 destination)\n{\n\tauto & number (*reinterpret_cast (destination));\n\tauto error (number.decode_dec (source));\n\treturn error ? 1 : 0;\n}\n\nint xrb_uint256_from_string (const char * source, xrb_uint256 destination)\n{\n\tauto & number (*reinterpret_cast (destination));\n\tauto error (number.decode_hex (source));\n\treturn error ? 1 : 0;\n}\n\nint xrb_uint512_from_string (const char * source, xrb_uint512 destination)\n{\n\tauto & number (*reinterpret_cast (destination));\n\tauto error (number.decode_hex (source));\n\treturn error ? 1 : 0;\n}\n\nint xrb_valid_address (const char * account_a)\n{\n\tnano::uint256_union account;\n\tauto error (account.decode_account (account_a));\n\treturn error ? 1 : 0;\n}\n\nvoid xrb_generate_random (xrb_uint256 seed)\n{\n\tauto & number (*reinterpret_cast (seed));\n\tnano::random_pool::generate_block (number.bytes.data (), number.bytes.size ());\n}\n\nvoid xrb_seed_key (xrb_uint256 seed, int index, xrb_uint256 destination)\n{\n\tauto & seed_l (*reinterpret_cast (seed));\n\tauto & destination_l (*reinterpret_cast (destination));\n\tnano::deterministic_key (seed_l, index, destination_l);\n}\n\nvoid xrb_key_account (const xrb_uint256 key, xrb_uint256 pub)\n{\n\ted25519_publickey (key, pub);\n}\n\nchar * xrb_sign_transaction (const char * transaction, const xrb_uint256 private_key)\n{\n\tchar * result (nullptr);\n\ttry\n\t{\n\t\tboost::property_tree::ptree block_l;\n\t\tstd::string transaction_l (transaction);\n\t\tstd::stringstream block_stream (transaction_l);\n\t\tboost::property_tree::read_json (block_stream, block_l);\n\t\tauto block (nano::deserialize_block_json (block_l));\n\t\tif (block != nullptr)\n\t\t{\n\t\t\tnano::uint256_union pub;\n\t\t\ted25519_publickey (private_key, pub.bytes.data ());\n\t\t\tnano::raw_key prv;\n\t\t\tprv.data = *reinterpret_cast (private_key);\n\t\t\tblock->signature_set (nano::sign_message (prv, pub, block->hash ()));\n\t\t\tauto json (block->to_json ());\n\t\t\tresult = reinterpret_cast (malloc (json.size () + 1));\n\t\t\tstrncpy (result, json.c_str (), json.size () + 1);\n\t\t}\n\t}\n\tcatch (std::runtime_error const &)\n\t{\n\t}\n\treturn result;\n}\n\nchar * xrb_work_transaction (const char * transaction)\n{\n\tchar * result (nullptr);\n\ttry\n\t{\n\t\tboost::property_tree::ptree block_l;\n\t\tstd::string transaction_l (transaction);\n\t\tstd::stringstream block_stream (transaction_l);\n\t\tboost::property_tree::read_json (block_stream, block_l);\n\t\tauto block (nano::deserialize_block_json (block_l));\n\t\tif (block != nullptr)\n\t\t{\n\t\t\tnano::work_pool pool (boost::thread::hardware_concurrency ());\n\t\t\tauto work (pool.generate (block->root ()));\n\t\t\tblock->block_work_set (work);\n\t\t\tauto json (block->to_json ());\n\t\t\tresult = reinterpret_cast (malloc (json.size () + 1));\n\t\t\tstrncpy (result, json.c_str (), json.size () + 1);\n\t\t}\n\t}\n\tcatch (std::runtime_error const &)\n\t{\n\t}\n\treturn result;\n}\n\n#include \nvoid ed25519_randombytes_unsafe (void * out, size_t outlen)\n{\n\tnano::random_pool::generate_block (reinterpret_cast (out), outlen);\n}\nvoid ed25519_hash_init (ed25519_hash_context * ctx)\n{\n\tctx->blake2 = new blake2b_state;\n\tblake2b_init (reinterpret_cast (ctx->blake2), 64);\n}\n\nvoid ed25519_hash_update (ed25519_hash_context * ctx, uint8_t const * in, size_t inlen)\n{\n\tblake2b_update (reinterpret_cast (ctx->blake2), in, inlen);\n}\n\nvoid ed25519_hash_final (ed25519_hash_context * ctx, uint8_t * out)\n{\n\tblake2b_final (reinterpret_cast (ctx->blake2), out, 64);\n\tdelete reinterpret_cast (ctx->blake2);\n}\n\nvoid ed25519_hash (uint8_t * out, uint8_t const * in, size_t inlen)\n{\n\ted25519_hash_context ctx;\n\ted25519_hash_init (&ctx);\n\ted25519_hash_update (&ctx, in, inlen);\n\ted25519_hash_final (&ctx, out);\n}\n}\n", "meta": {"hexsha": "0ea23266bb36a6b31e729ee55317250ae5666351", "size": 5059, "ext": "cpp", "lang": "C++", "max_stars_repo_path": "nano/lib/interface.cpp", "max_stars_repo_name": "SantiaGoMode/dynano", "max_stars_repo_head_hexsha": "8face685bb1a6b60930ada1bdfd8af490f51bb35", "max_stars_repo_licenses": ["BSD-2-Clause"], "max_stars_count": 2.0, "max_stars_repo_stars_event_min_datetime": "2020-08-07T01:10:51.000Z", "max_stars_repo_stars_event_max_datetime": "2021-07-17T04:01:54.000Z", "max_issues_repo_path": "nano/lib/interface.cpp", "max_issues_repo_name": "SantiaGoMode/dynano", "max_issues_repo_head_hexsha": "8face685bb1a6b60930ada1bdfd8af490f51bb35", "max_issues_repo_licenses": ["BSD-2-Clause"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "nano/lib/interface.cpp", "max_forks_repo_name": "SantiaGoMode/dynano", "max_forks_repo_head_hexsha": "8face685bb1a6b60930ada1bdfd8af490f51bb35", "max_forks_repo_licenses": ["BSD-2-Clause"], "max_forks_count": 1.0, "max_forks_repo_forks_event_min_datetime": "2021-05-27T03:23:25.000Z", "max_forks_repo_forks_event_max_datetime": "2021-05-27T03:23:25.000Z", "avg_line_length": 29.4127906977, "max_line_length": 87, "alphanum_fraction": 0.7268234829, "num_tokens": 1381, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.5078118642792044, "lm_q2_score": 0.2942149597859341, "lm_q1q2_score": 0.14940584722772635}} {"text": "#include \"builders/misc/BarrierBuilder.hpp\"\n#include \"entities/Way.hpp\"\n\n#include \n#include \"test_utils/DependencyProvider.hpp\"\n#include \"test_utils/ElementUtils.hpp\"\n\nusing namespace utymap;\nusing namespace utymap::builders;\nusing namespace utymap::entities;\nusing namespace utymap::math;\n\nnamespace {\n const std::string stylesheet = \"way|z16[barrier] {\" \n \"height:2m; min-height:0m;\"\n \"color:gradient(red);\"\n \"offset:0.2m;\"\n \"}\";\n struct Builders_Misc_BarrierBuilderFixture\n {\n DependencyProvider dependencyProvider;\n };\n}\n\nBOOST_FIXTURE_TEST_SUITE(Builders_Misc_BarrierBuilder, Builders_Misc_BarrierBuilderFixture)\n\nBOOST_AUTO_TEST_CASE(GivenBarrier_WhenVisitWay_ThenMeshIsBuilt)\n{\n bool isCalled = false;\n auto context = dependencyProvider.createBuilderContext(QuadKey(16, 1, 1), stylesheet,\n [&](const Mesh& mesh) {\n isCalled = true;\n BOOST_CHECK_GT(mesh.vertices.size(), 0);\n BOOST_CHECK_GT(mesh.triangles.size(), 0);\n BOOST_CHECK_GT(mesh.colors.size(), 0);\n });\n BarrierBuilder builder(*context);\n Way way = ElementUtils::createElement(*dependencyProvider.getStringTable(), 0,\n { { \"barrier\", \"yes\" } },\n { { 0, 0 }, { 0, 10 }, { 10, 10 }, { 10, 0 } });\n\n builder.visitWay(way);\n\n BOOST_CHECK(isCalled);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n", "meta": {"hexsha": "031e3551650d654b057a23aa64acc8f4f608d3e5", "size": 1522, "ext": "cpp", "lang": "C++", "max_stars_repo_path": "core/test/builders/misc/BarrierBuilderTest.cpp", "max_stars_repo_name": "lonnibesancon/utymap", "max_stars_repo_head_hexsha": "6d14a3d1386aade8c2755da4abc00269284c90d4", "max_stars_repo_licenses": ["Apache-2.0"], "max_stars_count": 1.0, "max_stars_repo_stars_event_min_datetime": "2019-04-04T14:20:37.000Z", "max_stars_repo_stars_event_max_datetime": "2019-04-04T14:20:37.000Z", "max_issues_repo_path": "core/test/builders/misc/BarrierBuilderTest.cpp", "max_issues_repo_name": "lonnibesancon/utymap", "max_issues_repo_head_hexsha": "6d14a3d1386aade8c2755da4abc00269284c90d4", "max_issues_repo_licenses": ["Apache-2.0"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "core/test/builders/misc/BarrierBuilderTest.cpp", "max_forks_repo_name": "lonnibesancon/utymap", "max_forks_repo_head_hexsha": "6d14a3d1386aade8c2755da4abc00269284c90d4", "max_forks_repo_licenses": ["Apache-2.0"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 31.7083333333, "max_line_length": 91, "alphanum_fraction": 0.6261498029, "num_tokens": 354, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.5078118642792044, "lm_q2_score": 0.2942149597859341, "lm_q1q2_score": 0.14940584722772635}} {"text": "/*\n==== Author:\n\nRelja Arandjelovic (relja@robots.ox.ac.uk)\nVisual Geometry Group,\nDepartment of Engineering Science\nUniversity of Oxford\n\n==== Copyright:\n\nThe library belongs to Relja Arandjelovic and the University of Oxford.\nNo usage or redistribution is allowed without explicit permission.\n*/\n\n#include \"register_images.h\"\n\n#include \n#include \n#include \n\n#include \n#include \n\n#include \n\n#include \"ellipse.h\"\n#include \"feat_getter.h\"\n#include \"feat_standard.h\"\n#include \"putative.h\"\n#include \"det_ransac.h\"\n#include \"macros.h\"\n\n\n\n//---- stuff for parallel feature extraction\n\nclass featWorker {\n\n public:\n\n featWorker( featGetter *aFeatGetterObj, const char aFn[], double aXl, double aXu, double aYl, double aYu, uint32_t &aNumFeats, std::vector &aRegions, float *&aDescs ) : featGetterObj(aFeatGetterObj), fn(aFn), xl(aXl), xu(aXu), yl(aYl), yu(aYu), numFeats(&aNumFeats), regions(&aRegions), descs(&aDescs)\n {}\n\n void\n operator()(){\n featGetterObj->getFeats( fn,\n static_cast(xl), static_cast(xu),\n static_cast(yl), static_cast(yu),\n *numFeats, *regions, *descs );\n }\n\n private:\n featGetter *featGetterObj;\n const char *fn;\n double xl, xu, yl, yu;\n uint32_t *numFeats;\n std::vector *regions;\n float **descs;\n\n};\n\n//----\n\n\n\nvoid\nregisterImages::registerFromGuess(\n sameRandomUint32 const &sameRandomObj,\n const char image_fn1[], const char image_fn2[],\n double xl, double xu, double yl, double yu,\n homography &Hinit,\n const char outFn1[], const char outFn2[], const char outFn2t[],\n const char *fullSizeFn1, const char *fullSizeFn2 ) {\n\n static const double expandOutBy= 0.1;\n featGetter *featGetterObj= new featGetter_standard( \"hesaff-rootsift\" );\n\n bool fullSizeExist= false;\n if (fullSizeFn1!=NULL || fullSizeFn2!=NULL)\n fullSizeExist= true;\n if (fullSizeFn1==NULL) fullSizeFn1= image_fn1;\n if (fullSizeFn2==NULL) fullSizeFn2= image_fn2;\n\n Magick::Image im1; im1.read( fullSizeFn1 );\n Magick::Image im2; im2.read( fullSizeFn2 );\n Magick::Image im2t;\n\n if (fullSizeExist) {\n // modify Hinit to account for scale change\n Magick::Image imSmall1; imSmall1.read( image_fn1 );\n Magick::Image imSmall2; imSmall2.read( image_fn2 );\n double sc1w= static_cast(im1.columns())/imSmall1.columns();\n double sc2w= static_cast(im2.columns())/imSmall2.columns();\n double sc1h= static_cast(im1.rows())/imSmall1.rows();\n double sc2h= static_cast(im2.rows())/imSmall2.rows();\n double sc21w= sc2w/sc1w, sc21h= sc2h/sc1h;\n Hinit.H[0]*= sc21w;\n Hinit.H[1]*= sc21w;\n Hinit.H[2]*= sc2w;\n Hinit.H[3]*= sc21h;\n Hinit.H[4]*= sc21h;\n Hinit.H[5]*= sc2h;\n xl*= sc1w; xu*= sc1w;\n yl*= sc1h; yu*= sc1h;\n }\n\n homography H= Hinit;\n\n uint32_t numFeats1, numFeats2, bestNInliers;\n float *descs1, *descs2;\n std::vector regions1, regions2;\n\n boost::thread *thread1, *thread2;\n\n // compute RootSIFT: image 1\n\n thread1= new boost::thread( featWorker( featGetterObj, fullSizeFn1, xl, xu, yl, yu, numFeats1, regions1, descs1 ) );\n\n\n bool firstGo= true, extractFinished1= false;\n uint32_t loopNum_= 0;\n\n boost::filesystem::path tmpdir = boost::filesystem::temp_directory_path();\n boost::filesystem::path tmpfn = tmpdir / boost::filesystem::unique_path(\"vise_rr_register_%%%%%%%%%%%%%%%%.jpg\");\n std::string fullSizeFn2_t = tmpfn.string();\n\n matchesType inlierInds;\n\n while (1){\n\n if (!firstGo){\n\n // compute RootSIFT: image 2\n\n thread2= new boost::thread( featWorker( featGetterObj, fullSizeFn2_t.c_str(), xl, xu, yl, yu, numFeats2, regions2, descs2 ) );\n\n // wait for feature extraction of image 1 to finish\n if (!extractFinished1){\n thread1->join();\n delete thread1;\n extractFinished1= true;\n }\n\n // wait for feature extraction of image 2 to finish\n thread2->join();\n delete thread2;\n\n // run RANSAC\n\n homography Hnew;\n\n detRansac::matchDesc(\n sameRandomObj,\n bestNInliers,\n descs1, regions1,\n descs2, regions2,\n featGetterObj->numDims(),\n loopNum_>1?1.0:5.0, 0.0, 1000.0, static_cast(4),\n true, 0.81f, 100.0f,\n &Hnew, &inlierInds\n );\n\n bool success= bestNInliers>9;\n\n if (!success)\n break;\n\n // apply new H to current H (i.e. H= H * Hnew)\n {\n double Happlied[9];\n for (int i= 0; i<3; ++i)\n for (int j=0; j<3; ++j)\n Happlied[i*3+j]= H.H[i*3 ] * Hnew.H[ j] +\n H.H[i*3+1] * Hnew.H[3+j] +\n H.H[i*3+2] * Hnew.H[6+j];\n H.set(Happlied);\n }\n\n }\n\n H.normLast();\n\n // im2 -> im1 transformation\n double Hinv[9];\n H.getInverse(Hinv);\n homography::normLast(Hinv);\n\n // warp image 2 into image 1\n im2t= im2;\n // AffineProjection(sx, rx, ry, sy, tx, ty) <=> H=[sx, ry, tx; sy, rx, ty; 0 0 1]\n double MagickAffine[6]={Hinv[0],Hinv[3],Hinv[1],Hinv[4],Hinv[2],Hinv[5]};\n im2t.virtualPixelMethod(Magick::BlackVirtualPixelMethod);\n im2t.distort(Magick::AffineProjectionDistortion, 6, MagickAffine, false);\n\n firstGo= false;\n\n ++loopNum_;\n if (loopNum_>1)\n break;\n\n im2t.write( fullSizeFn2_t.c_str() );\n }\n\n delete []descs1;\n delete []descs2;\n boost::filesystem::remove( fullSizeFn2_t );\n\n\n // draw resulting images\n\n double xl_= xl, xu_= xu, yl_= yl, yu_= yu;\n double dw_= expandOutBy*(xu-xl), dh_= expandOutBy*(yu-yl);\n xl_= std::max(0.0, xl_-dw_/2);\n yl_= std::max(0.0, yl_-dh_/2);\n xu_= std::min(static_cast(im1.columns() ), xu_+dw_/2);\n yu_= std::min(static_cast(im1.rows()), yu_+dh_/2);\n Magick::Geometry cropRect1(xu_-xl_, yu_-yl_, xl_, yl_);\n double xl2_, xu2_, yl2_, yu2_;\n findBBox2( xl_, xu_, yl_, yu_, H, xl2_, xu2_, yl2_, yu2_, im2.columns(), im2.rows() );\n Magick::Geometry cropRect2(xu2_-xl2_, yu2_-yl2_, xl2_, yl2_);\n\n im1.crop( cropRect1 );\n im1.write( outFn1 );\n im2.crop( cropRect2 );\n im2.write( outFn2 );\n im2t.crop( cropRect1 );\n im2t.write( outFn2t );\n\n delete featGetterObj;\n}\n\n\n\nvoid\nregisterImages::registerFromQuery(\n query const &query_obj,\n const char inFn1[], uint32_t docID2,\n datasetAbs const &datasetObj,\n spatialRetriever const &spatialRetriever_obj,\n const char outFn1[], const char outFn2[], const char outFn2t[],\n const char *fullSizeFn1, const char *fullSizeFn2 ) {\n homography H;\n std::vector< std::pair > matches;\n spatialRetriever_obj.get_matches_using_query( query_obj, docID2, H, matches );\n std::string image_fn1= inFn1;\n if (query_obj.isInternal)\n image_fn1= datasetObj.getFn( query_obj.docID );\n std::string image_fn2= datasetObj.getFn( docID2 );\n\n registerImages::registerFromGuess( *(spatialRetriever_obj.getSameRandom()), image_fn1.c_str(), image_fn2.c_str(), query_obj.xl, query_obj.xu, query_obj.yl, query_obj.yu, H, outFn1, outFn2, outFn2t, fullSizeFn1, fullSizeFn2 );\n\n}\n\n\nvoid\nregisterImages::findBBox2( double xl, double xu, double yl, double yu, homography const &H, double &xl2, double &xu2, double &yl2, double &yu2, uint32_t w2, uint32_t h2 ){\n\n ASSERT( fabs(H.H[8]-1.0)<1e-5 );\n\n xl2= 10000; xu2= -10000; yl2= 10000; yu2= -10000;\n double x_, y_;\n\n homography::affTransform(H.H, xl, yl, x_, y_);\n xl2= std::min(xl2,x_); xu2= std::max(xu2,x_); yl2= std::min(yl2,y_); yu2= std::max(yu2,y_);\n\n homography::affTransform(H.H, xl, yu, x_, y_);\n xl2= std::min(xl2,x_); xu2= std::max(xu2,x_); yl2= std::min(yl2,y_); yu2= std::max(yu2,y_);\n\n homography::affTransform(H.H, xu, yl, x_, y_);\n xl2= std::min(xl2,x_); xu2= std::max(xu2,x_); yl2= std::min(yl2,y_); yu2= std::max(yu2,y_);\n\n homography::affTransform(H.H, xu, yu, x_, y_);\n xl2= std::min(xl2,x_); xu2= std::max(xu2,x_); yl2= std::min(yl2,y_); yu2= std::max(yu2,y_);\n\n xl2= std::max(0.0,xl2);\n yl2= std::max(0.0,yl2);\n xu2= std::min(xu2,static_cast(w2));\n yu2= std::min(yu2,static_cast(h2));\n\n}\n", "meta": {"hexsha": "b240f6a6df3b316b7c205d03e8c6e23a39727cdd", "size": 8849, "ext": "cpp", "lang": "C++", "max_stars_repo_path": "src/search_engine/relja_retrival/matching/registration/register_images.cpp", "max_stars_repo_name": "alexanderwilkinson/visenew", "max_stars_repo_head_hexsha": "8e494355b0f88466c0abb4b8f3bfecc150b91111", "max_stars_repo_licenses": ["ImageMagick", "BSD-2-Clause"], "max_stars_count": 43.0, "max_stars_repo_stars_event_min_datetime": "2017-07-06T23:44:39.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-25T06:53:29.000Z", "max_issues_repo_path": "src/search_engine/relja_retrival/matching/registration/register_images.cpp", "max_issues_repo_name": "alexanderwilkinson/visenew", "max_issues_repo_head_hexsha": "8e494355b0f88466c0abb4b8f3bfecc150b91111", "max_issues_repo_licenses": ["ImageMagick", "BSD-2-Clause"], "max_issues_count": 2.0, "max_issues_repo_issues_event_min_datetime": "2018-11-09T03:52:14.000Z", "max_issues_repo_issues_event_max_datetime": "2020-03-25T14:08:33.000Z", "max_forks_repo_path": "src/search_engine/relja_retrival/matching/registration/register_images.cpp", "max_forks_repo_name": "alexanderwilkinson/visenew", "max_forks_repo_head_hexsha": "8e494355b0f88466c0abb4b8f3bfecc150b91111", "max_forks_repo_licenses": ["ImageMagick", "BSD-2-Clause"], "max_forks_count": 9.0, "max_forks_repo_forks_event_min_datetime": "2017-07-27T10:55:55.000Z", "max_forks_repo_forks_event_max_datetime": "2020-12-15T13:42:43.000Z", "avg_line_length": 31.4911032028, "max_line_length": 318, "alphanum_fraction": 0.5981466832, "num_tokens": 2766, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.5078118493816807, "lm_q2_score": 0.2942149659744614, "lm_q1q2_score": 0.1494058459872595}} {"text": "// --------------------------------------------------------------------------\n// OpenMS -- Open-Source Mass Spectrometry\n// --------------------------------------------------------------------------\n// Copyright The OpenMS Team -- Eberhard Karls University Tuebingen,\n// ETH Zurich, and Freie Universitaet Berlin 2002-2020.\n//\n// This software is released under a three-clause BSD license:\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above copyright\n// notice, this list of conditions and the following disclaimer in the\n// documentation and/or other materials provided with the distribution.\n// * Neither the name of any author or any participating institution\n// may be used to endorse or promote products derived from this software\n// without specific prior written permission.\n// For a full list of authors, refer to the file AUTHORS.\n// --------------------------------------------------------------------------\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n// ARE DISCLAIMED. IN NO EVENT SHALL ANY OF THE AUTHORS OR THE CONTRIBUTING\n// INSTITUTIONS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;\n// OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR\n// OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\n// ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n//\n// --------------------------------------------------------------------------\n// $Maintainer: Hannes Roest $\n// $Authors: Hannes Roest $\n// --------------------------------------------------------------------------\n\n#include \n\n#include \n#include \n#include \n\n#include \n#include \n\n#include \n\n#include \n\n// #define DEBUG_SONAR\n\nnamespace OpenMS\n{\n SONARScoring::SONARScoring() :\n DefaultParamHandler(\"SONARScoring\")\n {\n defaults_.setValue(\"dia_extraction_window\", 0.05, \"DIA extraction window in Th or ppm.\");\n defaults_.setMinFloat(\"dia_extraction_window\", 0.0);\n defaults_.setValue(\"dia_extraction_unit\", \"Th\", \"DIA extraction window unit\");\n defaults_.setValidStrings(\"dia_extraction_unit\", {\"Th\",\"ppm\"});\n defaults_.setValue(\"dia_centroided\", \"false\", \"Use centroided DIA data.\");\n defaults_.setValidStrings(\"dia_centroided\", {\"true\",\"false\"});\n\n // write defaults into Param object param_\n defaultsToParam_();\n }\n\n void SONARScoring::updateMembers_()\n {\n dia_extract_window_ = (double)param_.getValue(\"dia_extraction_window\");\n dia_extraction_ppm_ = param_.getValue(\"dia_extraction_unit\") == \"ppm\";\n dia_centroided_ = param_.getValue(\"dia_centroided\").toBool();\n }\n\n void SONARScoring::computeXCorr_(std::vector >& sonar_profiles,\n double& xcorr_coelution_score, double& xcorr_shape_score) const\n {\n /// Cross Correlation array\n typedef OpenSwath::Scoring::XCorrArrayType XCorrArrayType;\n /// Cross Correlation matrix\n typedef std::vector > XCorrMatrixType;\n\n XCorrMatrixType xcorr_matrix;\n xcorr_matrix.resize(sonar_profiles.size());\n for (std::size_t i = 0; i < sonar_profiles.size(); i++)\n {\n xcorr_matrix[i].resize(sonar_profiles.size());\n for (std::size_t j = i; j < sonar_profiles.size(); j++)\n {\n // compute normalized cross correlation\n xcorr_matrix[i][j] = OpenSwath::Scoring::normalizedCrossCorrelation(\n sonar_profiles[i], sonar_profiles[j], boost::numeric_cast(sonar_profiles[i].size()), 1);\n }\n }\n\n // coelution (lag score)\n std::vector deltas;\n for (std::size_t i = 0; i < xcorr_matrix.size(); i++)\n {\n for (std::size_t j = i; j < xcorr_matrix.size(); j++)\n {\n // first is the lag value, should be an int\n deltas.push_back(std::abs(OpenSwath::Scoring::xcorrArrayGetMaxPeak(xcorr_matrix[i][j])->first));\n }\n }\n\n {\n OpenSwath::mean_and_stddev msc;\n msc = std::for_each(deltas.begin(), deltas.end(), msc);\n double deltas_mean = msc.mean();\n double deltas_stdv = msc.sample_stddev();\n xcorr_coelution_score = deltas_mean + deltas_stdv;\n }\n\n // shape score (intensity)\n std::vector intensities;\n for (std::size_t i = 0; i < xcorr_matrix.size(); i++)\n {\n for (std::size_t j = i; j < xcorr_matrix.size(); j++)\n {\n // second is the Y value (intensity)\n intensities.push_back(OpenSwath::Scoring::xcorrArrayGetMaxPeak(xcorr_matrix[i][j])->second);\n }\n }\n {\n OpenSwath::mean_and_stddev msc;\n msc = std::for_each(intensities.begin(), intensities.end(), msc);\n xcorr_shape_score = msc.mean();\n }\n }\n\n void SONARScoring::computeSonarScores(OpenSwath::IMRMFeature* imrmfeature,\n const std::vector & transitions,\n const std::vector& swath_maps,\n OpenSwath_Scores & scores) const\n {\n if (transitions.empty()) {return;}\n\n double precursor_mz = transitions[0].getPrecursorMZ();\n\n#ifdef DEBUG_SONAR\n std::ofstream debug_file;\n debug_file.open(\"debug_sonar_profiles.tsv\", std::fstream::in | std::fstream::out | std::fstream::app);\n\n String native_id = 0;\n if (transitions.size() > 0)\n {\n native_id = transitions[0].getNativeID();\n }\n debug_file << native_id << \"\\t\" << imrmfeature->getRT() << \"\\tcentr\";\n for (Size it = 0; it < swath_maps.size(); it++)\n {\n debug_file << \"\\t\" << (swath_maps[it].lower + swath_maps[it].upper) / 2.0;\n }\n debug_file << \"\\n\";\n\n\n std::cout << \" doing RT \" << imrmfeature->getRT() << \" using maps: \";\n for (Size i = 0; i < swath_maps.size() ; i++)\n {\n std::cout << (swath_maps[i].lower + swath_maps[i].upper) / 2 << \" \";\n }\n std::cout << std::endl;\n\n // idea 1: check the elution profile of each SONAR scan ...\n for (Size kk = 0; kk < imrmfeature->getNativeIDs().size(); kk++)\n {\n std::vector rt;\n imrmfeature->getFeature(imrmfeature->getNativeIDs()[kk])->getRT(rt);\n }\n#endif\n\n\n // idea 2: check the SONAR profile (e.g. in the dimension of) of the best scan (RT apex)\n double RT = imrmfeature->getRT();\n\n // Aggregate sonar profiles (for each transition)\n std::vector > sonar_profiles;\n std::vector sn_score;\n std::vector diff_score;\n std::vector trend_score;\n std::vector rsq_score;\n std::vector mz_median_score;\n std::vector mz_stdev_score;\n for (Size k = 0; k < transitions.size(); k++)\n {\n String native_id = transitions[k].getNativeID();\n\n // Gather profiles across all SONAR maps\n std::vector sonar_profile;\n std::vector sonar_mz_profile;\n std::vector signal_exp;\n for (Size swath_idx = 0; swath_idx < swath_maps.size(); swath_idx++)\n {\n OpenSwath::SpectrumAccessPtr swath_map = swath_maps[swath_idx].sptr;\n\n bool expect_signal = false;\n if (swath_maps[swath_idx].ms1) {continue;} // skip MS1\n if (precursor_mz > swath_maps[swath_idx].lower && precursor_mz < swath_maps[swath_idx].upper)\n {\n expect_signal = true;\n }\n\n // find closest scan for current SONAR map (by retention time)\n std::vector indices = swath_map->getSpectraByRT(RT, 0.0);\n if (indices.empty() ) {continue;}\n int closest_idx = boost::numeric_cast(indices[0]);\n if (indices[0] != 0 &&\n std::fabs(swath_map->getSpectrumMetaById(boost::numeric_cast(indices[0]) - 1).RT - RT) <\n std::fabs(swath_map->getSpectrumMetaById(boost::numeric_cast(indices[0])).RT - RT))\n {\n closest_idx--;\n }\n OpenSwath::SpectrumPtr spectrum_ = swath_map->getSpectrumById(closest_idx);\n\n // integrate intensity within that scan\n double left = transitions[k].getProductMZ();\n double right = transitions[k].getProductMZ();\n if (dia_extraction_ppm_)\n {\n left -= left * dia_extract_window_ / 2e6;\n right += right * dia_extract_window_ / 2e6;\n }\n else\n {\n left -= dia_extract_window_ / 2.0;\n right += dia_extract_window_ / 2.0;\n }\n double mz, intensity;\n DIAHelpers::integrateWindow(spectrum_, left, right, mz, intensity, dia_centroided_);\n\n sonar_profile.push_back(intensity);\n sonar_mz_profile.push_back(mz);\n signal_exp.push_back(expect_signal);\n }\n sonar_profiles.push_back(sonar_profile);\n\n#ifdef DEBUG_SONAR\n std::cout << \" transition \" << native_id << \" at \" << RT << \" will analyze with \" << swath_maps.size() << \" maps\" << std::endl;\n debug_file << native_id << \"\\t\" << imrmfeature->getRT() << \"\\tint\";\n for (Size it = 0; it < sonar_profile.size(); it++)\n {\n debug_file << \"\\t\" << sonar_profile[it];\n }\n debug_file << \"\\n\";\n debug_file << native_id << \"\\t\" << imrmfeature->getRT() << \"\\tmz\";\n for (Size it = 0; it < sonar_mz_profile.size(); it++)\n {\n debug_file << \"\\t\" << sonar_mz_profile[it];\n }\n debug_file << \"\\n\";\n#endif\n\n // Analyze profiles\n std::vector sonar_profile_pos;\n std::vector sonar_mz_profile_pos;\n std::vector sonar_profile_neg;\n std::vector sonar_mz_profile_neg;\n for (Size it = 0; it < sonar_profile.size(); it++)\n {\n if (signal_exp[it])\n {\n sonar_profile_pos.push_back(sonar_profile[it]);\n sonar_mz_profile_pos.push_back(sonar_mz_profile[it]);\n }\n else\n {\n sonar_profile_neg.push_back(sonar_profile[it]);\n sonar_mz_profile_neg.push_back(sonar_mz_profile[it]);\n }\n }\n\n // try to find diff between first and last\n double sonar_trend = 1.0;\n if (sonar_profile_pos.size() > 1)\n {\n double int_end = sonar_profile_pos[sonar_profile_pos.size()-1] + sonar_profile_pos[sonar_profile_pos.size()-2];\n double int_start = sonar_profile_pos[0] + sonar_profile_pos[1];\n if (int_end > 0.0)\n {\n sonar_trend = int_start / int_end;\n }\n else\n {\n sonar_trend = 0.0;\n }\n }\n\n // try to find R^2 of a linear regression (optimally, there is no trend)\n std::vector xvals;\n for (Size pr_idx = 0; pr_idx < sonar_profile_pos.size(); pr_idx++) {xvals.push_back(pr_idx);}\n double rsq = OpenSwath::cor_pearson( xvals.begin(), xvals.end(), sonar_profile_pos.begin() );\n if (boost::math::isnan(rsq)) rsq = 0.0; // check for nan\n\n // try to find largest diff\n double sonar_largediff = 0.0;\n for (Size pr_idx = 0; pr_idx < sonar_profile_pos.size()-1; pr_idx++)\n {\n double diff = std::fabs(sonar_profile_pos[pr_idx] - sonar_profile_pos[pr_idx+1]);\n if (diff > sonar_largediff)\n {\n sonar_largediff = diff;\n }\n }\n\n double sonar_sn = 1.0;\n double pos_med = 1.0;\n // from here on, its not sorted any more !!\n if (!sonar_profile_pos.empty() && !sonar_profile_neg.empty())\n {\n double neg_med;\n\n pos_med = Math::median(sonar_profile_pos.begin(), sonar_profile_pos.end());\n neg_med = Math::median(sonar_profile_neg.begin(), sonar_profile_neg.end());\n\n // compute the relative difference between the medians (or if the\n // medians are zero, compute the difference to the max element)\n if (neg_med > 0.0)\n {\n sonar_sn = pos_med / neg_med;\n }\n else if (*std::max_element(sonar_profile_neg.begin(), sonar_profile_neg.end()) > 0.0)\n {\n sonar_sn = pos_med / *std::max_element(sonar_profile_neg.begin(), sonar_profile_neg.end());\n }\n\n }\n\n double median_mz = 0.0;\n double mz_stdev = -1.0;\n if (!sonar_mz_profile_pos.empty())\n {\n median_mz = Math::median(sonar_mz_profile_pos.begin(), sonar_mz_profile_pos.end());\n\n double sum = std::accumulate(sonar_mz_profile_pos.begin(), sonar_mz_profile_pos.end(), 0.0);\n double mean = sum / sonar_mz_profile_pos.size();\n\n double sq_sum = std::inner_product(sonar_mz_profile_pos.begin(), sonar_mz_profile_pos.end(), sonar_mz_profile_pos.begin(), 0.0);\n double stdev = std::sqrt(sq_sum / sonar_mz_profile_pos.size() - mean * mean);\n\n mz_stdev = stdev;\n }\n\n#ifdef DEBUG_SONAR\n std::cout << \" computed SN: \" << sonar_sn << \"(from \" << pos_med << \" and neg \" << neg_med << \")\"\n << \" large diff: \" << sonar_largediff << \" trend \" << sonar_trend << std::endl;\n#endif\n sn_score.push_back(sonar_sn);\n diff_score.push_back(sonar_largediff / pos_med);\n trend_score.push_back(sonar_trend);\n rsq_score.push_back(rsq);\n\n mz_median_score.push_back(median_mz);\n mz_stdev_score.push_back(mz_stdev);\n }\n\n double xcorr_coelution_score, xcorr_shape_score;\n computeXCorr_(sonar_profiles, xcorr_coelution_score, xcorr_shape_score);\n\n double sn_av = std::accumulate(sn_score.begin(), sn_score.end(), 0.0) / sn_score.size();\n double diff_av = std::accumulate(diff_score.begin(), diff_score.end(), 0.0) / diff_score.size();\n double trend_av = std::accumulate(trend_score.begin(), trend_score.end(), 0.0) / trend_score.size();\n double rsq_av = std::accumulate(rsq_score.begin(), rsq_score.end(), 0.0) / rsq_score.size();\n\n //double mz_median = std::accumulate(mz_median_score.begin(), mz_median_score.end(), 0.0) / mz_median_score.size();\n //double mz_stdev = std::accumulate(mz_stdev_score.begin(), mz_stdev_score.end(), 0.0) / mz_stdev_score.size();\n\n scores.sonar_sn = sn_av;\n scores.sonar_diff = diff_av;\n scores.sonar_trend = trend_av;\n scores.sonar_rsq = rsq_av;\n scores.sonar_lag = xcorr_coelution_score;\n scores.sonar_shape = xcorr_shape_score;\n\n#ifdef DEBUG_SONAR\n debug_file.close();\n#endif\n }\n\n\n}\n\n", "meta": {"hexsha": "d4deecb7e07b7ab05c1b8b994ee5bc47c8b54fd1", "size": 14892, "ext": "cpp", "lang": "C++", "max_stars_repo_path": "src/openms/source/ANALYSIS/OPENSWATH/SONARScoring.cpp", "max_stars_repo_name": "Togepitsch/OpenMS", "max_stars_repo_head_hexsha": "b4bd89fbbcc0d56143eb5a0145ba847210fb3aaa", "max_stars_repo_licenses": ["BSL-1.0", "Zlib", "Apache-2.0"], "max_stars_count": 1.0, "max_stars_repo_stars_event_min_datetime": "2017-12-18T09:01:54.000Z", "max_stars_repo_stars_event_max_datetime": "2017-12-18T09:01:54.000Z", "max_issues_repo_path": "src/openms/source/ANALYSIS/OPENSWATH/SONARScoring.cpp", "max_issues_repo_name": "Togepitsch/OpenMS", "max_issues_repo_head_hexsha": "b4bd89fbbcc0d56143eb5a0145ba847210fb3aaa", "max_issues_repo_licenses": ["BSL-1.0", "Zlib", "Apache-2.0"], "max_issues_count": 4.0, "max_issues_repo_issues_event_min_datetime": "2016-03-03T09:42:34.000Z", "max_issues_repo_issues_event_max_datetime": "2019-05-22T14:30:06.000Z", "max_forks_repo_path": "src/openms/source/ANALYSIS/OPENSWATH/SONARScoring.cpp", "max_forks_repo_name": "timosachsenberg/OpenMS", "max_forks_repo_head_hexsha": "fe62fff281daa2623977a1f2aafb4444b2c36513", "max_forks_repo_licenses": ["BSL-1.0", "Zlib", "Apache-2.0"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 39.0866141732, "max_line_length": 136, "alphanum_fraction": 0.6269137792, "num_tokens": 3870, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.5078118493816807, "lm_q2_score": 0.2942149659744614, "lm_q1q2_score": 0.1494058459872595}} {"text": "//\n//\nusing namespace std;\n#include \"EventDisplay/src/DataInterface.h\"\n\n#include \"CLHEP/Vector/LorentzVector.h\"\n#include \"CLHEP/Vector/Rotation.h\"\n#include \"CalorimeterGeom/inc/DiskCalorimeter.hh\"\n#include \"CalorimeterGeom/inc/Calorimeter.hh\"\n#include \"ConditionsService/inc/CrvParams.hh\"\n#include \"ConditionsService/inc/ConditionsHandle.hh\"\n#include \"CosmicRayShieldGeom/inc/CosmicRayShield.hh\"\n#include \"DetectorSolenoidGeom/inc/DetectorSolenoid.hh\"\n#include \"EventDisplay/src/Cube.h\"\n#include \"EventDisplay/src/Cylinder.h\"\n#include \"EventDisplay/src/Cone.h\"\n#include \"EventDisplay/src/EventDisplayFrame.h\"\n#include \"EventDisplay/src/Hexagon.h\"\n#include \"EventDisplay/src/Straw.h\"\n#include \"EventDisplay/src/Track.h\"\n#include \"EventDisplay/src/TrackColorSelector.h\"\n#include \"EventDisplay/src/dict_classes/ComponentInfo.h\"\n#include \"EventDisplay/src/dict_classes/EventDisplayViewSetup.h\"\n#include \"GeometryService/inc/GeomHandle.hh\"\n#include \"GeometryService/inc/DetectorSystem.hh\"\n#include \"HepPID/ParticleName.hh\"\n#include \"HepPDT/ParticleData.hh\"\n#include \"MCDataProducts/inc/PhysicalVolumeInfoMultiCollection.hh\"\n#include \"MCDataProducts/inc/MCTrajectoryCollection.hh\"\n#include \"MCDataProducts/inc/SimParticlePtrCollection.hh\"\n#include \"MCDataProducts/inc/StepPointMCCollection.hh\"\n#include \"Mu2eUtilities/inc/PhysicalVolumeMultiHelper.hh\"\n#include \"ConfigTools/inc/SimpleConfig.hh\"\n#include \"RecoDataProducts/inc/KalSeed.hh\"\n#include \"RecoDataProducts/inc/CrvDigiCollection.hh\"\n#include \"RecoDataProducts/inc/CaloHit.hh\"\n#include \"RecoDataProducts/inc/StrawHitCollection.hh\"\n#include \"RecoDataProducts/inc/StrawHitFlagCollection.hh\"\n#include \"RecoDataProducts/inc/TrkExtTrajCollection.hh\"\n#include \"RecoDataProducts/inc/TrkExtTraj.hh\"\n#include \"RecoDataProducts/inc/TrkExtTrajCollection.hh\"\n#include \"StoppingTargetGeom/inc/StoppingTarget.hh\"\n#include \"StoppingTargetGeom/inc/TargetFoil.hh\"\n#include \"TrkReco/inc/TrkUtilities.hh\"\n#include \"TrackerGeom/inc/Tracker.hh\"\n#include \"art/Framework/Principal/Run.h\"\n#include \"cetlib/map_vector.h\"\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n\nusing namespace CLHEP;\n#include \"RecoDataProducts/inc/KalRepCollection.hh\"\n#include \"BTrkData/inc/TrkStrawHit.hh\"\n#include \"BTrk/KalmanTrack/KalRep.hh\"\n#include \"BTrk/BaBar/ExternalInfo.hh\"\n\nnamespace mu2e_eventdisplay\n{\n\nDataInterface::DataInterface(EventDisplayFrame *mainframe):\n _geometrymanager(nullptr),_topvolume(nullptr),_mainframe(mainframe)\n{\n _minPoints=0;\n _minTime=NAN;\n _maxTime=NAN;\n _minMomentum=0;\n _showElectrons=true;\n _showMuons=true;\n _showGammas=true;\n _showNeutrinos=true;\n _showNeutrons=true;\n _showOthers=true;\n\n _particleInfo = make_unique();\n ExternalInfo::set(_particleInfo.get());\n}\n\nDataInterface::~DataInterface()\n{\n removeAllComponents();\n}\n\nvoid DataInterface::startComponents()\n{\n// removeNonGeometryComponents();\n}\n\nvoid DataInterface::updateComponents(double time, boost::shared_ptr contentSelector)\n{\n std::vector >::const_iterator track;\n for(track=_tracks.begin(); track!=_tracks.end(); track++)\n {\n (*track)->setFilter(_minPoints, _minTime, _maxTime, _minMomentum,\n _showElectrons, _showMuons, _showGammas, _showNeutrinos, _showNeutrons, _showOthers);\n (*track)->update(time);\n }\n\n const mu2e::StrawHitFlagCollection *hitFlagCollection=contentSelector->getStrawHitFlagCollection();\n std::vector >::const_iterator hit; //iterate only over hit straws\n for(hit=_hits.begin(); hit!=_hits.end(); hit++)\n {\n int hitnumber=(*hit)->getHitNumber();\n if(hitFlagCollection!=nullptr)\n {\n //flag collection selected --> show only hits which have certain hit flags\n (*hit)->setFilter(_minTime, _maxTime, true);\n if(hitnumber(hitFlagCollection->size()) && hitnumber>=0)\n {\n const mu2e::StrawHitFlag& hitFlag = (*hitFlagCollection)[hitnumber];\n if(hitFlag.hasAnyProperty(_hitFlagSetting))\n {\n (*hit)->setFilter(_minTime, _maxTime, false);\n }\n }\n }\n else\n {\n //no flag collection selected --> show all hits\n (*hit)->setFilter(_minTime, _maxTime, false);\n }\n (*hit)->update(time);\n }\n\n std::vector >::const_iterator crystalhit; //iterate only over hit crystals\n for(crystalhit=_crystalhits.begin(); crystalhit!=_crystalhits.end(); crystalhit++)\n {\n (*crystalhit)->setFilter(_minTime, _maxTime);\n (*crystalhit)->update(time);\n }\n\n std::vector >::const_iterator driftradius;\n for(driftradius=_driftradii.begin(); driftradius!=_driftradii.end(); driftradius++)\n {\n (*driftradius)->setFilter(_minTime, _maxTime);\n (*driftradius)->update(time);\n }\n\n std::vector >::const_iterator crvhit;\n for(crvhit=_crvhits.begin(); crvhit!=_crvhits.end(); crvhit++)\n {\n (*crvhit)->setFilter(_minTime, _maxTime);\n (*crvhit)->update(time);\n }\n}\n\nvoid DataInterface::getFilterValues(unsigned int &minPoints, double &minTime, double &maxTime, double &minMomentum,\n bool &showElectrons, bool &showMuons, bool &showGammas,\n bool &showNeutrinos, bool &showNeutrons, bool &showOthers,\n mu2e::StrawHitFlag &hitFlagSetting)\n{\n minPoints=_minPoints;\n minTime=_minTime;\n maxTime=_maxTime;\n minMomentum=_minMomentum;\n showElectrons=_showElectrons;\n showMuons=_showMuons;\n showGammas=_showGammas;\n showNeutrinos=_showNeutrinos;\n showNeutrons=_showNeutrons;\n showOthers=_showOthers;\n hitFlagSetting=_hitFlagSetting;\n}\n\nvoid DataInterface::setFilterValues(unsigned int minPoints, double minTime, double maxTime, double minMomentum,\n bool showElectrons, bool showMuons, bool showGammas,\n bool showNeutrinos, bool showNeutrons, bool showOthers,\n mu2e::StrawHitFlag hitFlagSetting)\n{\n _minPoints=minPoints;\n _minTime=minTime;\n _maxTime=maxTime;\n _minMomentum=minMomentum;\n _showElectrons=showElectrons;\n _showMuons=showMuons;\n _showGammas=showGammas;\n _showNeutrinos=showNeutrinos;\n _showNeutrons=showNeutrons;\n _showOthers=showOthers;\n _hitFlagSetting=hitFlagSetting;\n}\n\nDataInterface::timeminmax DataInterface::getHitsTimeBoundary()\n{\n DataInterface::timeminmax toReturn=_hitsTimeMinmax;\n if(_minTime>toReturn.mint) toReturn.mint=_minTime;\n if(_maxTimetoReturn.mint) toReturn.mint=_minTime;\n if(_maxTimeSetVerboseLevel(0);\n TGeoMaterial *matVacuum = new TGeoMaterial(\"Vacuum\", 0,0,0);\n TGeoMedium *Vacuum = new TGeoMedium(\"Vacuum\",1, matVacuum);\n _topvolume = _geometrymanager->MakeBox(\"TopVolume\", Vacuum, 1000, 1000, 1500);\n _geometrymanager->SetTopVolume(_topvolume);\n _geometrymanager->SetTopVisible(false);\n _geometrymanager->CloseGeometry();\n _geometrymanager->SetVisLevel(4);\n _topvolume->SetVisibility(0);\n _topvolume->SetLineColor(0);\n _topvolume->Draw(\"ogle\");\n EventDisplayViewSetup::setup();\n}\n\nvoid DataInterface::fillGeometry()\n{\n removeAllComponents();\n createGeometryManager();\n resetBoundaryP(_trackerMinmax);\n resetBoundaryP(_targetMinmax);\n resetBoundaryP(_calorimeterMinmax);\n resetBoundaryP(_tracksMinmax);\n\n art::ServiceHandle geom;\n\n const mu2e::SimpleConfig &config = geom->config();\n _detSysOrigin = mu2e::GeomHandle()->getOrigin();\n\n if(geom->hasElement())\n {\n//Straws\n mu2e::GeomHandle tracker;\n const auto& allStraws = tracker->getStraws();\n // for(const auto & elem : allStraws)\n for (size_t i = 0; inStraws(); ++i)\n {\n // const mu2e::Straw& s = elem;\n const mu2e::Straw& s = allStraws[i];\n const CLHEP::Hep3Vector& p = s.getMidPoint();\n const CLHEP::Hep3Vector& d = s.getDirection();\n double x = p.x();\n double y = p.y();\n double z = p.z();\n double theta = d.theta();\n double phi = d.phi();\n double l = s.halfLength();\n int idStraw = s.id().getStraw();\n int idLayer = s.id().getLayer();\n int idPanel = s.id().getPanel();\n int idPlane = s.id().getPlane();\n int id = s.id().asUint16();\n\n boost::shared_ptr info(new ComponentInfo());\n std::string c=Form(\"Straw %i Layer %i Panel %i Plane %i\",idStraw,idLayer,idPanel,idPlane);\n info->setName(c.c_str());\n info->setText(0,c.c_str());\n boost::shared_ptr shape(new Straw(x,y,z, NAN, theta, phi, l,\n _geometrymanager, _topvolume, _mainframe, info, true));\n _components.push_back(shape);\n _straws[id]=shape;\n }\n\n//Support Structure\n double innerRadius=tracker->g4Tracker()->getSupportParams().innerRadius();\n double outerRadius=tracker->g4Tracker()->getSupportParams().outerRadius();\n double zHalfLength=tracker->g4Tracker()->getInnerTrackerEnvelopeParams().zHalfLength();\n findBoundaryP(_trackerMinmax, outerRadius, outerRadius, zHalfLength);\n findBoundaryP(_trackerMinmax, -outerRadius, -outerRadius, -zHalfLength);\n\n boost::shared_ptr info(new ComponentInfo());\n info->setName(\"Tracker Support Structure\");\n info->setText(0,\"Tracker Support Structure\");\n info->setText(1,Form(\"Inner Radius %.f mm Outer Radius %.f mm\",innerRadius/CLHEP::mm,outerRadius/CLHEP::mm));\n info->setText(2,Form(\"Length %.f mm\",2.0*zHalfLength/CLHEP::mm));\n info->setText(3,Form(\"Center at x: 0 mm, y: 0 mm, z: 0 mm\"));\n boost::shared_ptr shape(new Cylinder(0,0,0, 0,0,0,\n zHalfLength,innerRadius,outerRadius, NAN,\n _geometrymanager, _topvolume, _mainframe, info, true));\n shape->makeGeometryVisible(true);\n _components.push_back(shape);\n _supportstructures.push_back(shape);\n\n//Envelope\n innerRadius=tracker->g4Tracker()->getInnerTrackerEnvelopeParams().innerRadius();\n outerRadius=tracker->g4Tracker()->getInnerTrackerEnvelopeParams().outerRadius();\n zHalfLength=tracker->g4Tracker()->getInnerTrackerEnvelopeParams().zHalfLength();\n\n boost::shared_ptr infoEnvelope(new ComponentInfo());\n infoEnvelope->setName(\"Tracker Envelope\");\n infoEnvelope->setText(0,\"Tracker Envelope\");\n infoEnvelope->setText(1,Form(\"Inner Radius %.f mm Outer Radius %.f mm\",innerRadius/CLHEP::mm,outerRadius/CLHEP::mm));\n infoEnvelope->setText(2,Form(\"Length %.f mm\",2.0*zHalfLength/CLHEP::mm));\n infoEnvelope->setText(3,Form(\"Center at x: 0 mm, y: 0 mm, z: 0 mm\"));\n boost::shared_ptr shapeEnvelope(new Cylinder(0,0,0, 0,0,0,\n zHalfLength,innerRadius,outerRadius, NAN,\n _geometrymanager, _topvolume, _mainframe, infoEnvelope, true));\n shapeEnvelope->makeGeometryVisible(true);\n _components.push_back(shapeEnvelope);\n _supportstructures.push_back(shapeEnvelope);\n }\n\n art::ServiceHandle geoservice;\n if(geoservice->hasElement())\n {\n mu2e::GeomHandle ds;\n\n double innerRadius=ds->rIn1();\n double outerRadius=ds->rOut2();\n double zHalfLength=ds->halfLength();\n double z=ds->position().z() - _detSysOrigin.z();\n\n boost::shared_ptr infoToyDS(new ComponentInfo());\n infoToyDS->setName(\"Toy DS\");\n infoToyDS->setText(0,\"Toy DS\");\n infoToyDS->setText(1,Form(\"Inner Radius %.f mm Outer Radius %.f mm\",innerRadius/CLHEP::mm,outerRadius/CLHEP::mm));\n infoToyDS->setText(2,Form(\"Length %.f mm\",2.0*zHalfLength/CLHEP::mm));\n infoToyDS->setText(3,Form(\"Center at x: 0 mm, y: 0 mm, z: %.f mm\",z/CLHEP::mm));\n boost::shared_ptr shapeToyDS(new Cylinder(0,0,z, 0,0,0,\n zHalfLength,innerRadius,outerRadius, NAN,\n _geometrymanager, _topvolume, _mainframe, infoToyDS, true));\n _components.push_back(shapeToyDS);\n _otherstructures.push_back(shapeToyDS);\n }\n\n if(geom->hasElement())\n {\n mu2e::GeomHandle target;\n unsigned int n=target->nFoils();\n for(unsigned int i=0; ifoil(i);\n int id = foil.id();\n double x = foil.centerInDetectorSystem().x();\n double y = foil.centerInDetectorSystem().y();\n double z = foil.centerInDetectorSystem().z();\n double radius = foil.rOut();\n double halfThickness = foil.halfThickness();\n\n findBoundaryP(_targetMinmax, x+radius, y+radius, z+halfThickness);\n findBoundaryP(_targetMinmax, x-radius, y-radius, z-halfThickness);\n\n boost::shared_ptr info(new ComponentInfo());\n std::string c=Form(\"Target Foil ID %i\",id);\n info->setName(c.c_str());\n info->setText(0,c.c_str());\n info->setText(1,Form(\"Outer Radius %.2f mm\",radius/CLHEP::mm));\n info->setText(2,Form(\"Half thickness %.2f mm\",halfThickness/CLHEP::mm));\n info->setText(3,Form(\"Center at x: %.2f mm, y: %.2f mm, z: %.2f mm\",x/CLHEP::mm,y/CLHEP::mm,z/CLHEP::mm));\n boost::shared_ptr shape(new Cylinder(x,y,z, 0,0,0, halfThickness,0,radius, NAN,\n _geometrymanager, _topvolume, _mainframe, info, true));\n shape->makeGeometryVisible(true);\n _components.push_back(shape);\n _supportstructures.push_back(shape);\n }\n }\n\n if(geom->hasElement())\n {\n mu2e::GeomHandle calo;\n\n double diskCaseDZLength = calo->caloInfo().getDouble(\"diskCaseZLength\")/2.0;\n double diskInnerRingIn = calo->caloInfo().getDouble(\"diskInnerRingIn\");\n double diskOuterRingOut = calo->caloInfo().getDouble(\"diskOuterRingOut\");\n double diskOuterRailOut = diskOuterRingOut + calo->caloInfo().getDouble(\"diskOutRingEdgeRLength\");\n\n\n\n double FPCarbonDZ = calo->caloInfo().getDouble(\"FPCarbonZLength\")/2.0;\n double FPFoamDZ = calo->caloInfo().getDouble(\"FPFoamZLength\")/2.0;\n double FPCoolPipeRadius = calo->caloInfo().getDouble(\"FPCoolPipeRadius\");\n double pipeRadius = calo->caloInfo().getDouble(\"pipeRadius\");\n double frontPanelHalfThick = (2.0*FPCarbonDZ+2.0*FPFoamDZ-pipeRadius+FPCoolPipeRadius)/2.0;\n double holeDZ = calo->caloInfo().getDouble(\"BPHoleZLength\")/2.0;\n\n double crystalDXY = calo->caloInfo().getDouble(\"crystalXYLength\")/2.0;\n double crystalDZ = calo->caloInfo().getDouble(\"crystalZLength\")/2.0; \n double crystalFrameDZ = calo->caloInfo().getDouble(\"crystalFrameZLength\")/2.0; \n double wrapperHalfThick = calo->caloInfo().getDouble(\"wrapperThickness\")/2.0; \n double wrapperDXY = crystalDXY + 2.0*wrapperHalfThick;\n double wrapperDZ = crystalDZ + 2.0*crystalFrameDZ;\n\n int icrystal=0;\n for(unsigned int idisk=0; idisknDisk(); idisk++)\n {\n CLHEP::Hep3Vector diskPos = calo->disk(idisk).geomInfo().origin() - _detSysOrigin;\n diskPos += CLHEP::Hep3Vector(0.0, 0.0, -holeDZ+frontPanelHalfThick);\n\n findBoundaryP(_calorimeterMinmax, diskPos.x()+diskOuterRailOut, diskPos.y()+diskOuterRailOut, diskPos.z()+diskCaseDZLength);\n findBoundaryP(_calorimeterMinmax, diskPos.x()-diskOuterRailOut, diskPos.y()-diskOuterRailOut, diskPos.z()-diskCaseDZLength);\n\n boost::shared_ptr diskInfo(new ComponentInfo());\n std::string c=Form(\"Disk %i\",idisk);\n diskInfo->setName(c.c_str());\n diskInfo->setText(0,c.c_str());\n diskInfo->setText(1,Form(\"Center at x: %.f mm, y: %.f mm, z: %.f mm\",diskPos.x(),diskPos.y(),diskPos.z()));\n diskInfo->setText(2,Form(\"Outer radius: %.f mm, Inner radius: %.f mm, Thickness: %.f mm\",diskOuterRailOut,diskInnerRingIn,2.0*diskCaseDZLength));\n boost::shared_ptr calodisk(new Cylinder(diskPos.x(),diskPos.y(),diskPos.z(), 0,0,0,\n diskCaseDZLength, diskInnerRingIn, diskOuterRailOut, NAN,\n _geometrymanager, _topvolume, _mainframe, diskInfo, true));\n calodisk->makeGeometryVisible(true);\n _components.push_back(calodisk);\n _supportstructures.push_back(calodisk);\n\n int nCrystalInThisDisk = calo->disk(idisk).nCrystals();\n for(int ic=0; icdisk(idisk).crystal(ic).localPosition();\n crystalPosition.setZ(diskCaseDZLength-wrapperDZ);\n crystalPosition += diskPos;\n\n boost::shared_ptr info(new ComponentInfo());\n std::string c=Form(\"Disk %i, Crystal %i\",idisk,ic);\n info->setName(c.c_str());\n info->setText(0,c.c_str());\n info->setText(1,Form(\"Center at x: %.f mm, y: %.f mm, z: %.f mm\",crystalPosition.x(),crystalPosition.y(),crystalPosition.z()));\n info->setText(2,Form(\"XYSize: %.f mm, Thickness: %.f mm\",2.0*wrapperDXY,2.0*wrapperDZ));\n boost::shared_ptr shape(new Hexagon(crystalPosition.x(),crystalPosition.y(),crystalPosition.z(),\n wrapperDXY,wrapperDZ,360, NAN,\n _geometrymanager, _topvolume, _mainframe, info, true));\n _components.push_back(shape);\n _crystals[icrystal]=shape;\n icrystal++;\n }\n }\n }\n\n\n //MBS\n/*\n if(config.getBool(\"hasMBS\", false)) \n {\n double mbsinr[3], mbsoutr[3], mbslen[3], mbsz[3];\n mbsinr[0] = config.getDouble(\"mbs.BSTCInnerRadius\");\n mbsoutr[0] = config.getDouble(\"mbs.BSTSOuterRadius\");\n mbsinr[1] = config.getDouble(\"mbs.BSBSInnerRadius\");\n mbsoutr[1] = config.getDouble(\"mbs.BSTSOuterRadius\");\n mbsinr[2] = config.getDouble(\"mbs.CLV2InnerRadius\");\n mbsoutr[2] = config.getDouble(\"mbs.CLV2OuterRadius\");\n mbslen[0] = config.getDouble(\"mbs.BSTCHLength\");\n mbslen[1] = config.getDouble(\"mbs.BSTSHLength\") - mbslen[0];\n mbslen[2] = config.getDouble(\"mbs.CLV2HLength\");\n double mbsbstsz = config.getDouble(\"mbs.BSTSZ\");\n double mbstotallen = (mbslen[0] + mbslen[1])*2.;\n double mbsstartz = mbsbstsz - mbstotallen/2. - _detSysOrigin.z();\n mbsz[0] = mbsstartz + mbslen[0] ;\n mbsz[1] = mbsstartz + mbslen[0]*2. + mbslen[1];\n mbsz[2] = mbsstartz +mbstotallen - mbslen[2];\n for (unsigned int i = 0 ; i <3 ; ++i) \n {\n boost::shared_ptr infoMBS(new ComponentInfo());\n std::string c=Form(c,\"MBS %d\", i);\n infoMBS->setName(c.c_str());\n infoMBS->setText(0,c.c_str());\n infoMBS->setText(1,Form(\"Inner Radius %.f mm Outer Radius %.f mm\",mbsinr[i]/CLHEP::mm,mbsoutr[i]/CLHEP::mm));\n infoMBS->setText(2,Form(\"Length %.f mm\",2.0*mbslen[i]/CLHEP::mm));\n infoMBS->setText(3,Form(\"Center at x: 0 mm, y: 0 mm, z: %.f mm\",mbsz[i]/CLHEP::mm));\n boost::shared_ptr shapeMBS(new Cylinder(0,0,mbsz[i], 0,0,0,\n mbslen[i], mbsinr[i], mbsoutr[i], NAN,\n _geometrymanager, _topvolume, _mainframe, infoMBS, true));\n _components.push_back(shapeMBS);\n _mbsstructures.push_back(shapeMBS);\n }\n }\n*/\n //MecoStyleProtonAbsorber\n if(config.getBool(\"hasProtonAbsorber\", false)) \n {\n if (!config.getBool(\"protonabsorber.isHelical\", false)) \n {\n double inr[2], outr[2], thickness, halflength, z;\n outr[0] = config.getDouble(\"protonabsorber.OutRadius0\");\n outr[1] = config.getDouble(\"protonabsorber.OutRadius1\");\n thickness = config.getDouble(\"protonabsorber.thickness\");\n inr[0] = outr[0] - thickness;\n inr[1] = outr[1] - thickness;\n halflength = config.getDouble(\"protonabsorber.halfLength\");\n mu2e::GeomHandle target;\n double stoppingtargetlength=target->cylinderLength();\n double stoppingtargetz=target->centerInMu2e().z() - _detSysOrigin.z();\n z = stoppingtargetz + stoppingtargetlength*0.5 + halflength;\n\n boost::shared_ptr infoMecoStylePA(new ComponentInfo());\n infoMecoStylePA->setName(\"MECOStyleProtonAbsorber\");\n infoMecoStylePA->setText(0,\"MECOStyleProtonAbsorber\");\n infoMecoStylePA->setText(1,Form(\"Inner Radius1 %.f mm Outer Radius1 %.f mm\",inr[0]/CLHEP::mm,outr[0]/CLHEP::mm));\n infoMecoStylePA->setText(2,Form(\"Inner Radius2 %.f mm Outer Radius2 %.f mm\",inr[1]/CLHEP::mm,outr[1]/CLHEP::mm));\n infoMecoStylePA->setText(3,Form(\"Length %.f mm\",2.0*halflength/CLHEP::mm));\n infoMecoStylePA->setText(4,Form(\"Center at x: 0 mm, y: 0 mm, z: %.f mm\",z/CLHEP::mm));\n boost::shared_ptr shapePA(new Cone(0,0,z, 0,0,0,\n halflength, inr[0], outr[0], inr[1], outr[1],\n NAN, _geometrymanager, _topvolume, _mainframe, infoMecoStylePA, true));\n _components.push_back(shapePA);\n _mecostylepastructures.push_back(shapePA);\n }\n }\n\n//CRV\n if( geom->hasElement() )\n {\n mu2e::GeomHandle CosmicRayShieldGeomHandle;\n std::vector const& shields = CosmicRayShieldGeomHandle->getCRSScintillatorShields();\n for(std::vector::const_iterator ishield=shields.begin(); ishield!=shields.end(); ++ishield)\n {\n mu2e::CRSScintillatorShield const& shield = *ishield;\n std::string const& shieldName = shield.getName();\n\n mu2e::CRSScintillatorBarDetail const& barDetail = shield.getCRSScintillatorBarDetail();\n double dx=barDetail.getHalfLengths()[0];\n double dy=barDetail.getHalfLengths()[1];\n double dz=barDetail.getHalfLengths()[2];\n\n int nModules = shield.nModules();\n for (int im = 0; im < nModules; ++im)\n {\n mu2e::CRSScintillatorModule const & module = shield.getModule(im);\n\n int nLayers = module.nLayers();\n for (int il = 0; il < nLayers; ++il)\n {\n mu2e::CRSScintillatorLayer const & layer = module.getLayer(il);\n\n int nBars = layer.nBars();\n for (int ib = 0; ib < nBars; ++ib)\n {\n mu2e::CRSScintillatorBar const & bar = layer.getBar(ib);\n int index = bar.index().asInt();\n CLHEP::Hep3Vector barOffset = bar.getPosition() - _detSysOrigin;\n double x=barOffset.x();\n double y=barOffset.y();\n double z=barOffset.z();\n\n boost::shared_ptr info(new ComponentInfo());\n std::string c=Form(\"CRV Scintillator %s module %i layer %i bar %i (index %i)\",shieldName.c_str(),im,il,ib, index);\n info->setName(c.c_str());\n info->setText(0,c.c_str());\n info->setText(1,Form(\"Dimension x: %.f mm, y: %.f mm, z: %.f mm\",2.0*dx/CLHEP::mm,2.0*dy/CLHEP::mm,2.0*dz/CLHEP::mm));\n info->setText(2,Form(\"Center at x: %.f mm, y: %.f mm, z: %.f mm\",x/CLHEP::mm,y/CLHEP::mm,z/CLHEP::mm));\n\n boost::shared_ptr shape(new Cube(x,y,z, dx,dy,dz, 0, 0, 0, NAN,\n _geometrymanager, _topvolume, _mainframe, info, true));\n _components.push_back(shape);\n _crvscintillatorbars[index]=(shape);\n }\n }\n }\n }\n }\n}\n\nvoid DataInterface::makeMuonBeamStopStructuresVisible(bool visible)\n{\n std::vector >::const_iterator structure;\n for(structure=_mbsstructures.begin(); structure!=_mbsstructures.end(); structure++)\n {\n (*structure)->makeGeometryVisible(visible);\n }\n\n //tracks and straws don't have to be pushed into the foreground if the structure is removed\n if(visible) toForeground();\n}\n\nvoid DataInterface::makeMecoStyleProtonAbsorberVisible(bool visible)\n{\n std::vector >::const_iterator structure;\n for(structure=_mecostylepastructures.begin(); structure!=_mecostylepastructures.end(); structure++)\n {\n (*structure)->makeGeometryVisible(visible);\n }\n\n //tracks and straws don't have to be pushed into the foreground if the structure is removed\n if(visible) toForeground();\n}\n\nvoid DataInterface::makeSupportStructuresVisible(bool visible)\n{\n std::vector >::const_iterator structure;\n for(structure=_supportstructures.begin(); structure!=_supportstructures.end(); structure++)\n {\n (*structure)->makeGeometryVisible(visible);\n }\n\n //tracks and straws don't have to be pushed into the foreground if the structure is removed\n if(visible) toForeground();\n}\n\nvoid DataInterface::makeOtherStructuresVisible(bool visible)\n{\n std::vector >::const_iterator structure;\n for(structure=_otherstructures.begin(); structure!=_otherstructures.end(); structure++)\n {\n (*structure)->makeGeometryVisible(visible);\n }\n\n //tracks and straws don't have to be pushed into the foreground if the structure is removed\n if(visible) toForeground();\n}\n\nvoid DataInterface::makeCrvScintillatorBarsVisible(bool visible)\n{\n std::map >::const_iterator crvbars;\n for(crvbars=_crvscintillatorbars.begin(); crvbars!=_crvscintillatorbars.end(); crvbars++)\n {\n crvbars->second->makeGeometryVisible(visible);\n }\n\n //tracks and straws don't have to be pushed into the foreground if the structure is removed\n if(visible) toForeground();\n}\n\nvoid DataInterface::toForeground()\n{\n std::map >::const_iterator straw;\n for(straw=_straws.begin(); straw!=_straws.end(); straw++)\n {\n straw->second->toForeground();\n }\n\n std::map >::const_iterator crystal;\n for(crystal=_crystals.begin(); crystal!=_crystals.end(); crystal++)\n {\n crystal->second->toForeground();\n }\n\n std::map >::const_iterator crvbar;\n for(crvbar=_crvscintillatorbars.begin(); crvbar!=_crvscintillatorbars.end(); crvbar++)\n {\n crvbar->second->toForeground();\n }\n\n std::vector >::const_iterator track;\n for(track=_tracks.begin(); track!=_tracks.end(); track++)\n {\n (*track)->toForeground();\n }\n}\n\nvoid DataInterface::useHitColors(bool hitcolors, bool whitebackground)\n{\n double mint=getHitsTimeBoundary().mint;\n double maxt=getHitsTimeBoundary().maxt;\n std::vector >::const_iterator hit;\n for(hit=_hits.begin(); hit!=_hits.end(); hit++)\n {\n double time=(*hit)->getStartTime();\n if(hitcolors)\n {\n int color=TMath::FloorNint(20.0*(time-mint)/(maxt-mint));\n if(color>=20) color=19;\n if(color<=0 || std::isnan(color)) color=0;\n color+=2000;\n (*hit)->setColor(color);\n }\n else (*hit)->setColor(whitebackground?1:0);\n }\n std::vector >::const_iterator crystalhit;\n for(crystalhit=_crystalhits.begin(); crystalhit!=_crystalhits.end(); crystalhit++)\n {\n double time=(*crystalhit)->getStartTime();\n if(hitcolors)\n {\n int color=TMath::FloorNint(20.0*(time-mint)/(maxt-mint));\n if(color>=20) color=19;\n if(color<=0 || std::isnan(color)) color=0;\n color+=2000;\n (*crystalhit)->setColor(color);\n }\n else (*crystalhit)->setColor(whitebackground?1:0);\n }\n std::vector >::const_iterator driftradius;\n for(driftradius=_driftradii.begin(); driftradius!=_driftradii.end(); driftradius++)\n {\n double time=(*driftradius)->getStartTime();\n if(hitcolors)\n {\n int color=TMath::FloorNint(20.0*(time-mint)/(maxt-mint));\n if(color>=20) color=19;\n if(color<=0 || std::isnan(color)) color=0;\n color+=2000;\n (*driftradius)->setColor(color);\n }\n else (*driftradius)->setColor(whitebackground?1:0);\n }\n std::vector >::const_iterator crvhit;\n for(crvhit=_crvhits.begin(); crvhit!=_crvhits.end(); crvhit++)\n {\n double time=(*crvhit)->getStartTime();\n if(hitcolors)\n {\n int color=TMath::FloorNint(20.0*(time-mint)/(maxt-mint));\n if(color>=20) color=19;\n if(color<=0 || std::isnan(color)) color=0;\n color+=2000;\n (*crvhit)->setColor(color);\n }\n else (*crvhit)->setColor(whitebackground?1:0);\n }\n}\n\nvoid DataInterface::useTrackColors(boost::shared_ptr const &contentSelector, bool trackcolors, bool whitebackground)\n{\n std::vector selectedTracks=contentSelector->getSelectedTrackNames();\n TrackColorSelector colorSelector(&selectedTracks, whitebackground);\n std::vector >::const_iterator track;\n for(track=_tracks.begin(); track!=_tracks.end(); track++)\n {\n if(trackcolors)\n {\n int color=colorSelector.getColor(*track);\n (*track)->setColor(color);\n }\n else (*track)->setColor(whitebackground?kBlack:kWhite);\n }\n}\n\nvoid DataInterface::resetBoundaryT(timeminmax &m)\n{\n m.mint=NAN;\n m.maxt=NAN;\n}\n\nvoid DataInterface::resetBoundaryP(spaceminmax &m)\n{\n m.minx=NAN;\n m.miny=NAN;\n m.minz=NAN;\n m.maxx=NAN;\n m.maxy=NAN;\n m.maxz=NAN;\n}\n\nDataInterface::spaceminmax DataInterface::getSpaceBoundary(bool useTarget, bool useCalorimeter, bool useTracks)\n{\n spaceminmax m;\n resetBoundaryP(m);\n findBoundaryP(m, _trackerMinmax.minx, _trackerMinmax.miny, _trackerMinmax.minz);\n findBoundaryP(m, _trackerMinmax.maxx, _trackerMinmax.maxy, _trackerMinmax.maxz);\n if(useTarget)\n {\n findBoundaryP(m, _targetMinmax.minx, _targetMinmax.miny, _targetMinmax.minz);\n findBoundaryP(m, _targetMinmax.maxx, _targetMinmax.maxy, _targetMinmax.maxz);\n }\n if(useCalorimeter)\n {\n findBoundaryP(m, _calorimeterMinmax.minx, _calorimeterMinmax.miny, _calorimeterMinmax.minz);\n findBoundaryP(m, _calorimeterMinmax.maxx, _calorimeterMinmax.maxy, _calorimeterMinmax.maxz);\n }\n if(useTracks)\n {\n findBoundaryP(m, _tracksMinmax.minx, _tracksMinmax.miny, _tracksMinmax.minz);\n findBoundaryP(m, _tracksMinmax.maxx, _tracksMinmax.maxy, _tracksMinmax.maxz);\n }\n\n if(std::isnan(m.minx)) m.minx=-1000;\n if(std::isnan(m.miny)) m.miny=-1000;\n if(std::isnan(m.minz)) m.minz=-1000;\n if(std::isnan(m.maxx)) m.maxx=1000;\n if(std::isnan(m.maxy)) m.maxy=1000;\n if(std::isnan(m.maxz)) m.maxz=1000;\n return m;\n}\n\nvoid DataInterface::findBoundaryT(timeminmax &m, double t)\n{\n if(std::isnan(m.mint) || tm.maxt) m.maxt=t;\n}\n\nvoid DataInterface::findBoundaryP(spaceminmax &m, double x, double y, double z)\n{\n if(std::isnan(m.minx) || xm.maxx) m.maxx=x;\n if(std::isnan(m.maxy) || y>m.maxy) m.maxy=y;\n if(std::isnan(m.maxz) || z>m.maxz) m.maxz=z;\n}\n\nvoid DataInterface::fillEvent(boost::shared_ptr const &contentSelector, const mu2e::SimParticleTimeOffset &timeOffsets)\n{\n auto const& ptable = mu2e::GlobalConstantsHandle();\n removeNonGeometryComponents();\n if(!_geometrymanager) createGeometryManager();\n resetBoundaryT(_hitsTimeMinmax);\n resetBoundaryT(_tracksTimeMinmax);\n\n _numberHits=0;\n _numberCrystalHits=0;\n\n const mu2e::StepPointMCCollection *steppointMChits=contentSelector->getSelectedHitCollection();\n if(steppointMChits!=nullptr)\n {\n _numberHits=steppointMChits->size();\n std::vector::const_iterator iter;\n for(iter=steppointMChits->begin(); iter!=steppointMChits->end(); iter++)\n {\n const mu2e::StepPointMC& hit = *iter;\n int sid = hit.strawId().asUint16();\n int trackid = hit.trackId().asInt();\n double time = timeOffsets.timeWithOffsetsApplied(hit);\n double energy = hit.eDep();\n std::map >::iterator straw=_straws.find(sid);\n if(straw!=_straws.end() && !std::isnan(time))\n {\n double previousStartTime=straw->second->getStartTime();\n if(std::isnan(previousStartTime))\n {\n findBoundaryT(_hitsTimeMinmax, time); //is it Ok to exclude all following hits from the time window?\n straw->second->setStartTime(time);\n straw->second->getComponentInfo()->setText(1,Form(\"hit time(s): %gns\",time/CLHEP::ns));\n straw->second->getComponentInfo()->setText(2,Form(\"deposited energy(s): %geV\",energy/CLHEP::eV));\n straw->second->getComponentInfo()->setText(3,Form(\"track id(s): %i\",trackid));\n _hits.push_back(straw->second);\n }\n else\n {\n straw->second->getComponentInfo()->expandLine(1,Form(\"%gns\",time/CLHEP::ns));\n straw->second->getComponentInfo()->expandLine(2,Form(\"%geV\",energy/CLHEP::eV));\n straw->second->getComponentInfo()->expandLine(3,Form(\"%i\",trackid));\n }\n }\n }\n }\n\n const mu2e::StrawHitCollection *strawhits=contentSelector->getSelectedHitCollection();\n if(strawhits!=nullptr)\n {\n _numberHits=strawhits->size();\n std::vector::const_iterator iter;\n int hitnumber=0;\n for(iter=strawhits->begin(); iter!=strawhits->end(); iter++, hitnumber++)\n {\n const mu2e::StrawHit& hit = *iter;\n int sid = hit.strawId().asUint16();\n double time = hit.time();\n double dt = hit.dt();\n double energy = hit.energyDep();\n std::map >::iterator straw=_straws.find(sid);\n if(straw!=_straws.end() && !std::isnan(time))\n {\n double previousStartTime=straw->second->getStartTime();\n if(std::isnan(previousStartTime))\n {\n findBoundaryT(_hitsTimeMinmax, time); //is it Ok to exclude all following hits from the time window?\n straw->second->setStartTime(time);\n straw->second->setHitNumber(hitnumber);\n straw->second->getComponentInfo()->setText(1,Form(\"hit time(s): %gns\",time/CLHEP::ns));\n straw->second->getComponentInfo()->setText(2,Form(\"deposited energy(s): %geV\",energy/CLHEP::eV));\n straw->second->getComponentInfo()->setText(3,Form(\"hit time interval(s): %gns\",dt/CLHEP::ns));\n _hits.push_back(straw->second);\n }\n else\n {\n straw->second->getComponentInfo()->expandLine(1,Form(\"%gns\",time/CLHEP::ns));\n straw->second->getComponentInfo()->expandLine(2,Form(\"%geV\",energy/CLHEP::eV));\n straw->second->getComponentInfo()->expandLine(3,Form(\"%gns\",dt/CLHEP::ns));\n }\n }\n }\n }\n\n const mu2e::KalRepCollection *kalRepHits=contentSelector->getSelectedHitCollection();\n if(kalRepHits!=nullptr)\n {\n boost::shared_ptr residualGraph(new TGraphErrors());\n residualGraph->SetTitle(\"Residual Graph\");\n\n for(unsigned int i=0; isize(); i++)\n {\n const KalRep &particle = kalRepHits->at(i);\n TrkHitVector const& hots = particle.hitVector();\n if(hots.size() > 0)\n {\n _numberHits+=hots.size();\n for(auto iter=hots.begin(); iter!=hots.end(); iter++)\n {\n const TrkHit *hitOnTrack = *iter;\n const mu2e::TrkStrawHit* strawHit = dynamic_cast(hitOnTrack);\n if(strawHit)\n {\n int sid=strawHit->straw().id().asUint16();\n double time = strawHit->time();\n double hitT0 = strawHit->hitT0()._t0; //this is the time the hit \"arrived at the straw\"\n //don't know what the other times are\n double strawtime = strawHit->comboHit().time();\n double driftRadius = strawHit->driftRadius();\n const HepPoint &p=strawHit->hitTraj()->position(strawHit->hitLen());\n double theta = strawHit->straw().getDirection().theta();\n double phi = strawHit->straw().getDirection().phi();\n\n double residual, residualError;\n if(strawHit->resid(residual, residualError))\n {\n int n=residualGraph->GetN();\n residualGraph->SetPoint(n,p.z(),residual);\n residualGraph->SetPointError(n,0,residualError);\n }\n\n std::map >::iterator straw=_straws.find(sid);\n if(straw!=_straws.end() && !std::isnan(time))\n {\n double previousStartTime=straw->second->getStartTime();\n if(std::isnan(previousStartTime))\n {\n findBoundaryT(_hitsTimeMinmax, hitT0); //is it Ok to exclude all following hits from the time window?\n straw->second->setStartTime(hitT0);\n straw->second->getComponentInfo()->setText(1,Form(\"hitT0(s): %gns\",hitT0/CLHEP::ns));\n straw->second->getComponentInfo()->setText(2,Form(\"hit time(s): %gns\",time/CLHEP::ns));\n straw->second->getComponentInfo()->setText(3,Form(\"strawhit time(s): %gns\",strawtime/CLHEP::ns));\n residualGraph->GetXaxis()->SetTitle(\"z [mm]\");\n residualGraph->GetYaxis()->SetTitle(\"Residual [??]\");\n straw->second->getComponentInfo()->getHistVector().push_back(boost::dynamic_pointer_cast(residualGraph));\n _hits.push_back(straw->second);\n }\n else\n {\n straw->second->getComponentInfo()->expandLine(1,Form(\"%gns\",hitT0/CLHEP::ns));\n straw->second->getComponentInfo()->expandLine(2,Form(\"%gns\",time/CLHEP::ns));\n straw->second->getComponentInfo()->expandLine(3,Form(\"%gns\",strawtime/CLHEP::ns));\n }\n\n const boost::shared_ptr strawname=straw->second->getComponentInfo()->getName();\n boost::shared_ptr info(new ComponentInfo());\n info->setName(Form(\"Drift Radius for %s\",strawname->c_str()));\n info->setText(0,strawname->c_str());\n info->setText(1,Form(\"Drift Radius %gcm\",driftRadius/CLHEP::cm));\n boost::shared_ptr driftradius(new Cylinder(p.x(),p.y(),p.z(),\n phi+TMath::Pi()/2.0,theta,0,\n 5, //the halflength of 5 has no meaning\n 0,driftRadius,hitT0,\n _geometrymanager, _topvolume, _mainframe, info, false));\n _components.push_back(driftradius);\n _driftradii.push_back(driftradius);\n }\n }\n }\n }\n }\n }\n\n // KalSeed hits\n const mu2e::KalSeedCollection *kalSeedsWithHits=contentSelector->getSelectedHitCollection();\n if(kalSeedsWithHits!=NULL)\n {\n for(size_t i=0; isize(); i++)\n {\n const mu2e::KalSeed &kalseed = kalSeedsWithHits->at(i);\n const std::vector &hits = kalseed.hits();\n for(size_t j=0; j >::iterator straw=_straws.find(sid);\n if(straw!=_straws.end() && !std::isnan(time))\n {\n double previousStartTime=straw->second->getStartTime();\n if(std::isnan(previousStartTime))\n {\n findBoundaryT(_hitsTimeMinmax, time); //is it Ok to exclude all following hits from the time window?\n straw->second->setStartTime(time);\n straw->second->getComponentInfo()->setText(1,Form(\"hit time(s): %gns\",time/CLHEP::ns));\n _hits.push_back(straw->second);\n }\n else\n {\n straw->second->getComponentInfo()->expandLine(1,Form(\"%gns\",time/CLHEP::ns));\n }\n }\n }\n }\n }\n\n // StepPoints at calorimeter\n const mu2e::StepPointMCCollection *calosteppoints=contentSelector->getSelectedCaloHitCollection();\n if(calosteppoints!=nullptr)\n {\n _numberCrystalHits=calosteppoints->size();\n std::vector::const_iterator iter;\n for(iter=calosteppoints->begin(); iter!=calosteppoints->end(); iter++)\n {\n const mu2e::StepPointMC& calohit = *iter;\n int crystalid = calohit.volumeId();\n int trackid = calohit.trackId().asInt();\n double time = timeOffsets.timeWithOffsetsApplied(calohit);\n double energy = calohit.eDep();\n std::map >::iterator crystal=_crystals.find(crystalid);\n if(crystal!=_crystals.end() && !std::isnan(time))\n {\n double previousStartTime=crystal->second->getStartTime();\n if(std::isnan(previousStartTime))\n {\n findBoundaryT(_hitsTimeMinmax, time); //is it Ok to exclude all following hits from the time window?\n crystal->second->setStartTime(time);\n crystal->second->getComponentInfo()->setText(2,Form(\"hit time(s): %gns\",time/CLHEP::ns));\n crystal->second->getComponentInfo()->setText(3,Form(\"deposited energy(s): %geV\",energy/CLHEP::eV));\n crystal->second->getComponentInfo()->setText(4,Form(\"track ID(s): %i\",trackid));\n _crystalhits.push_back(crystal->second);\n }\n else\n {\n crystal->second->getComponentInfo()->expandLine(2,Form(\"%gns\",time/CLHEP::ns));\n crystal->second->getComponentInfo()->expandLine(3,Form(\"%geV\",energy/CLHEP::eV));\n crystal->second->getComponentInfo()->expandLine(4,Form(\"%i\",trackid));\n }\n }\n }\n }\n\n const mu2e::CaloHitCollection *calohits=contentSelector->getSelectedCaloHitCollection();\n art::ServiceHandle geoservice;\n if(calohits!=nullptr && (geoservice->hasElement()))\n {\n _numberCrystalHits=calohits->size(); //this is not accurate since the return value gives the RO hits\n std::vector::const_iterator iter;\n for(iter=calohits->begin(); iter!=calohits->end(); iter++)\n {\n const mu2e::CaloHit& calohit = *iter;\n int roid = calohit.crystalID();\n int crystalid=0;\n\n if(geoservice->hasElement())\n {\n mu2e::GeomHandle diskCalo;\n crystalid=diskCalo->caloIDMapper().crystalIDFromSiPMID(roid);\n }\n double time = calohit.time();\n double energy = calohit.energyDep();\n std::map >::iterator crystal=_crystals.find(crystalid);\n if(crystal!=_crystals.end() && !std::isnan(time))\n {\n double previousStartTime=crystal->second->getStartTime();\n if(std::isnan(previousStartTime))\n {\n findBoundaryT(_hitsTimeMinmax, time); //is it Ok to exclude all following hits from the time window?\n crystal->second->setStartTime(time);\n crystal->second->getComponentInfo()->setText(2,Form(\"hit time(s): %gns\",time/CLHEP::ns));\n crystal->second->getComponentInfo()->setText(3,Form(\"deposited energy(s): %geV\",energy/CLHEP::eV));\n crystal->second->getComponentInfo()->setText(4,Form(\"RO ID(s): %i\",roid));\n _crystalhits.push_back(crystal->second);\n }\n else\n {\n crystal->second->getComponentInfo()->expandLine(2,Form(\"%gns\",time/CLHEP::ns));\n crystal->second->getComponentInfo()->expandLine(3,Form(\"%geV\",energy/CLHEP::eV));\n crystal->second->getComponentInfo()->expandLine(4,Form(\"%i\",roid));\n }\n }\n }\n }\n\n//CRV waveforms\n for(std::map >::iterator crvbar=_crvscintillatorbars.begin(); crvbar!=_crvscintillatorbars.end(); crvbar++)\n {\n crvbar->second->getComponentInfo()->getHistVector().clear();\n }\n\n mu2e::ConditionsHandle crvPar(\"ignored\");\n double digitizationPeriod = crvPar->digitizationPeriod;\n double recoPulsePedestal = crvPar->pedestal;\n\n double TDC0time = contentSelector->getTDC0time();\n const std::vector > &crvDigisVector = contentSelector->getSelectedCrvDigiCollection();\n for(size_t i=0; i &crvDigis = crvDigisVector[i];\n std::string moduleLabel = crvDigis.provenance()->moduleLabel();\n for(size_t j=0; jsize(); j++)\n {\n mu2e::CrvDigi const& digi(crvDigis->at(j));\n int index = digi.GetScintillatorBarIndex().asInt();\n int sipm = digi.GetSiPMNumber();\n std::string multigraphName = Form(\"Waveform (%s) SiPM %i\",moduleLabel.c_str(),sipm);\n std::map >::iterator crvbar=_crvscintillatorbars.find(index);\n if(crvbar!=_crvscintillatorbars.end())\n {\n //each digi collection and each SiPM gets its own multigraph\n bool newMultigraph=true;\n int multigraphIndex=0;\n std::vector > &v=crvbar->second->getComponentInfo()->getHistVector();\n for(size_t k=0; kGetName())==0) {newMultigraph=false; multigraphIndex=k; break;}\n }\n if(newMultigraph)\n {\n boost::shared_ptr waveform(new TMultiGraph(multigraphName.c_str(),multigraphName.c_str()));\n v.push_back(boost::dynamic_pointer_cast(waveform));\n multigraphIndex=v.size()-1;\n }\n\n TGraph *graph = new TGraph(mu2e::CrvDigi::NSamples);\n graph->SetMarkerStyle(20);\n graph->SetMarkerSize(2);\n for(size_t k=0; kSetPoint(k,TDC0time+(digi.GetStartTDC()+k)*digitizationPeriod,digi.GetADCs()[k]);\n }\n boost::dynamic_pointer_cast(v[multigraphIndex])->Add(graph,\"p\");\n }\n }\n }\n\n//CRV reco pulses\n const mu2e::CrvRecoPulseCollection *crvRecoPulses=contentSelector->getSelectedCrvHitCollection();\n if(crvRecoPulses!=nullptr)\n {\n for(size_t i=0; isize(); i++)\n {\n const mu2e::CrvRecoPulse &recoPulse = crvRecoPulses->at(i);\n int index = recoPulse.GetScintillatorBarIndex().asInt();\n int sipm = recoPulse.GetSiPMNumber();\n double time = recoPulse.GetPulseTime();\n int PEs = recoPulse.GetPEs();\n\n std::map >::iterator crvbar=_crvscintillatorbars.find(index);\n if(crvbar!=_crvscintillatorbars.end() && !std::isnan(time))\n {\n double previousStartTime=crvbar->second->getStartTime();\n if(std::isnan(previousStartTime)) _crvhits.push_back(crvbar->second); //first reco hit of this counter\n\n if(std::isnan(previousStartTime) || timesecond->setStartTime(time);\n\n if(std::isnan(previousStartTime))\n {\n findBoundaryT(_hitsTimeMinmax, time); //is it Ok to exclude all following hits from the time window?\n crvbar->second->getComponentInfo()->setText(3,\"Reco pulse SiPM0 PEs/time: \");\n crvbar->second->getComponentInfo()->setText(4,\"Reco pulse SiPM1 PEs/time: \");\n crvbar->second->getComponentInfo()->setText(5,\"Reco pulse SiPM2 PEs/time: \");\n crvbar->second->getComponentInfo()->setText(6,\"Reco pulse SiPM3 PEs/time: \");\n }\n crvbar->second->getComponentInfo()->expandLine(sipm+3,Form(\"%iPEs/%.1fns\",PEs,time/CLHEP::ns));\n\n //each digi collection and each SiPM gets its own multigraph\n std::vector > &v=crvbar->second->getComponentInfo()->getHistVector();\n for(size_t k=0; kGetName();\n int nameLength = strlen(multigraphName);\n if(nameLength<1) continue;\n if(atoi(multigraphName+nameLength-1)==sipm)\n {\n double fitParam0 = recoPulse.GetPulseHeight()*TMath::E();\n double fitParam1 = recoPulse.GetPulseTime();\n double fitParam2 = recoPulse.GetPulseBeta();\n\n TList *functionList = boost::dynamic_pointer_cast(v[k])->GetListOfFunctions();\n if(functionList->GetSize()==0) functionList->Add(new TF1(\"pedestal\",Form(\"%f\",recoPulsePedestal))); //TODO: Use compiled function\n TF1 *f = new TF1(Form(\"peakfitter%i\",functionList->GetSize()),\n Form(\"%f*(TMath::Exp(-(x-%f)/%f-TMath::Exp(-(x-%f)/%f)))\",\n fitParam0,fitParam1,fitParam2,fitParam1,fitParam2)); //TODO: Use compiled function\n f->SetLineWidth(2);\n f->SetLineColor(2);\n if(recoPulse.GetRecoPulseFlags().test(mu2e::CrvRecoPulseFlagEnums::failedFit)) f->SetLineStyle(2);\n functionList->Add(f);\n }\n }\n }\n }\n }\n\n\n const mu2e::PhysicalVolumeInfoMultiCollection *physicalVolumesMulti=contentSelector->getPhysicalVolumeInfoMultiCollection();\n\n resetBoundaryP(_tracksMinmax);\n std::vector trackInfos;\n std::vector simParticleCollectionVector=contentSelector->getSelectedTrackCollection(trackInfos);\n for(unsigned int i=0; i::const_iterator iter;\n for(iter=simParticles->begin(); iter!=simParticles->end(); iter++)\n {\n const mu2e::SimParticle& particle = iter->second;\n art::Ptr particlePtr(trackInfos[i].productId, &particle, iter->first.asUint());\n double timeOffset = timeOffsets.totalTimeOffset(particlePtr);\n int id = particle.id().asInt(); //is identical with cet::map_vector_key& particleKey = iter->first;\n int parentid = particle.parentId().asInt();\n int particleid=particle.pdgId();\n int trackclass=trackInfos[i].classID;\n int trackclassindex=trackInfos[i].index;\n std::string particlecollection=trackInfos[i].entryText;\n std::string particlename=HepPID::particleName(particle.pdgId());\n std::string startVolumeName=\"unknown volume\";\n std::string endVolumeName=\"unknown volume\";\n if(physicalVolumesMulti!=nullptr)\n {\n mu2e::PhysicalVolumeMultiHelper volumeMultiHelper(*physicalVolumesMulti);\n startVolumeName=volumeMultiHelper.startVolume(particle).name();\n endVolumeName=volumeMultiHelper.endVolume(particle).name();\n }\n double x1=particle.startPosition().x() - _detSysOrigin.x();\n double y1=particle.startPosition().y() - _detSysOrigin.y();\n double z1=particle.startPosition().z() - _detSysOrigin.z();\n double t1=particle.startGlobalTime()+timeOffset;\n double e1=particle.startMomentum().e();\n double x2=particle.endPosition().x() - _detSysOrigin.x();\n double y2=particle.endPosition().y() - _detSysOrigin.y();\n double z2=particle.endPosition().z() - _detSysOrigin.z();\n double t2=particle.endGlobalTime()+timeOffset;\n double e2=particle.endMomentum().e();\n findBoundaryT(_tracksTimeMinmax, t1);\n findBoundaryT(_tracksTimeMinmax, t2);\n findBoundaryP(_tracksMinmax, x1, y1, z1);\n findBoundaryP(_tracksMinmax, x2, y2, z2);\n\n boost::shared_ptr info(new ComponentInfo());\n info->setName(Form(\"Track %i %s (%s)\",id,particlename.c_str(),particlecollection.c_str()));\n if(parentid!=0) info->setText(0,Form(\"Track %i %s Parent %i (%s)\",id,particlename.c_str(),parentid,particlecollection.c_str()));\n else info->setText(0,Form(\"Track %i %s generated track (%s)\",id,particlename.c_str(),particlecollection.c_str()));\n info->setText(1,Form(\"Start Energy %gMeV End Energy %gMeV\",e1/CLHEP::MeV,e2/CLHEP::MeV));\n info->setText(2,Form(\"Created by %s in %s\",particle.creationCode().name().c_str(),startVolumeName.c_str()));\n info->setText(3,Form(\"Destroyed by %s in %s\",particle.stoppingCode().name().c_str(),endVolumeName.c_str()));\n info->setText(4,\"Daughter IDs:\");\n std::vector >::const_iterator daughter;\n for(daughter=particle.daughters().begin();\n daughter!=particle.daughters().end();\n daughter++)\n {\n info->expandLine(4,Form(\"%lu\",(*daughter)->id().asInt()));\n }\n boost::shared_ptr shape(new Track(x1,y1,z1,t1, x2,y2,z2,t2,\n particleid, trackclass, trackclassindex, e1,\n _geometrymanager, _topvolume, _mainframe, info, false));\n findTrajectory(contentSelector,shape,particle.id(), timeOffset, trackInfos[i]);\n _components.push_back(shape);\n _tracks.push_back(shape);\n }\n }\n\n trackInfos.clear();\n std::vector kalRepCollectionVector=contentSelector->getSelectedTrackCollection(trackInfos);\n for(unsigned int i=0; isize(); j++)\n {\n KalRep const* kalrep = kalReps->get(j);\n int trackclass=trackInfos[i].classID;\n int trackclassindex=trackInfos[i].index;\n std::string trackcollection=trackInfos[i].entryText;\n int particleid=kalrep->particleType().particleType();\n std::string particlename=HepPID::particleName(particleid);\n std::string c=Form(\"Kalman Track %i %s (%s)\",j,particlename.c_str(),trackcollection.c_str());\n boost::shared_ptr info(new ComponentInfo());\n info->setName(c.c_str());\n info->setText(0,c.c_str());\n\n double hitcount=0;\n double offset=0;\n TrkHitVector const& hots=kalrep->hitVector();\n if(hots.size()>0)\n {\n boost::shared_ptr residualGraph(new TGraphErrors());\n residualGraph->SetTitle(\"Residual Graph\");\n for(auto iter=hots.begin(); iter!=hots.end(); iter++)\n {\n const TrkHit *hitOnTrack = *iter;\n const mu2e::TrkStrawHit* strawHit = dynamic_cast(hitOnTrack);\n if(strawHit)\n {\n double strawTime = strawHit->hitT0()._t0/CLHEP::ns;\n double trackTime = strawTime*CLHEP::ns; //TODO: add correction for drift time\n double weight= strawHit->weight();\n double fltLen= strawHit->fltLen();\n const HepPoint &p=strawHit->hitTraj()->position(strawHit->hitLen());\n double t = kalrep->arrivalTime(fltLen);\n offset+=(trackTime-t)*weight;\n hitcount+=weight;\n\n double residual, residualError;\n if(strawHit->resid(residual, residualError))\n {\n int n=residualGraph->GetN();\n residualGraph->SetPoint(n,p.z(),residual);\n residualGraph->SetPointError(n,0,residualError);\n }\n }\n }\n residualGraph->GetXaxis()->SetTitle(\"z [mm]\");\n residualGraph->GetYaxis()->SetTitle(\"Residual [??]\");\n info->getHistVector().push_back(boost::dynamic_pointer_cast(residualGraph));\n }\n if(hitcount>0) offset/=hitcount; else offset=0;\n\n double fltLMin=kalrep->startValidRange();\n double fltLMax=kalrep->endValidRange();\n double p1=kalrep->momentum(fltLMin).mag();\n double p2=kalrep->momentum(fltLMax).mag();\n double x1=kalrep->position(fltLMin).x();\n double y1=kalrep->position(fltLMin).y();\n double z1=kalrep->position(fltLMin).z();\n double x2=kalrep->position(fltLMax).x();\n double y2=kalrep->position(fltLMax).y();\n double z2=kalrep->position(fltLMax).z();\n double t1=kalrep->arrivalTime(fltLMin)+offset;\n double t2=kalrep->arrivalTime(fltLMax)+offset;\n boost::shared_ptr track(new Track(x1,y1,z1,t1, x2,y2,z2,t2,\n particleid, trackclass, trackclassindex, p1,\n _geometrymanager, _topvolume, _mainframe, info, false));\n _components.push_back(track);\n _tracks.push_back(track);\n\n double fltStep = (fltLMax - fltLMin)/400.0;\n for(unsigned int step = 0; step <= 400.0; step++)\n {\n double fltL = fltLMin + step*fltStep;\n double t = kalrep->arrivalTime(fltL)+offset;\n HepPoint p = kalrep->position(fltL);\n findBoundaryT(_tracksTimeMinmax, t);\n findBoundaryP(_tracksMinmax, p.x(), p.y(), p.z());\n track->addTrajectoryPoint(p.x(), p.y(), p.z(), t);\n }\n\n\tint charge = kalrep->charge();\n double t0=kalrep->t0().t0();\n double firsthitfltlen = kalrep->lowFitRange();\n double lasthitfltlen = kalrep->hiFitRange();\n double entlen = min(firsthitfltlen,lasthitfltlen);\n double loclen(0.0);\n const TrkSimpTraj* ltraj = kalrep->localTrajectory(entlen,loclen);\n const CLHEP::HepVector ¶ms=ltraj->parameters()->parameter();\n double d0 = params[0];\n double om = params[2];\n double rmax = d0+2.0/om;\n\n\tinfo->setText(1,Form(\"Charge %i\",charge));\n\tinfo->setText(2,Form(\"Start Momentum %gMeV/c End Momentum %gMeV/c\",p1/CLHEP::MeV,p2/CLHEP::MeV));\n\tinfo->setText(3,Form(\"t0 %gns d0 %gmm rmax %gmm\",t0/CLHEP::ns,d0/CLHEP::mm,rmax/CLHEP::mm));\n }\n }\n\n // KalSeed tracks\n trackInfos.clear();\n std::vector kalSeedCollectionVector=contentSelector->getSelectedTrackCollection(trackInfos);\n for(size_t i=0; isize(); j++)\n {\n const mu2e::KalSeed &kalseed = kalSeeds->at(j);\n int trackclass=trackInfos[i].classID;\n int trackclassindex=trackInfos[i].index;\n std::string trackcollection=trackInfos[i].entryText;\n int particleid=kalseed.particle();\n std::string particlename=HepPID::particleName(particleid);\n\n const std::vector &segments = kalseed.segments();\n size_t nSegments=segments.size();\n if(nSegments==0) continue;\n const mu2e::KalSegment &segmentFirst = kalseed.segments().front();\n const mu2e::KalSegment &segmentLast = kalseed.segments().back();\n double fltLMin=segmentFirst.fmin();\n double fltLMax=segmentLast.fmax();\n XYZVec momvec1, momvec2;\n segmentFirst.mom(fltLMin, momvec1);\n segmentLast.mom(fltLMax, momvec2);\n double p1=Geom::Hep3Vec(momvec1).mag();\n double p2=Geom::Hep3Vec(momvec2).mag();\n\n double t0 = kalseed.t0().t0();\n double flt0 = kalseed.flt0();\n double mass = ptable->particle(kalseed.particle()).ref().mass().value(); \n double v = mu2e::TrkUtilities::beta(mass,(p1+p2)/2.0)*CLHEP::c_light;\n\n boost::shared_ptr info(new ComponentInfo());\n std::string c=Form(\"KalSeed Track %lu %s (%s)\",j,particlename.c_str(),trackcollection.c_str());\n info->setName(c.c_str());\n info->setText(0,c.c_str());\n info->setText(1,Form(\"Start Momentum %gMeV/c End Momentum %gMeV/c\",p1/CLHEP::MeV,p2/CLHEP::MeV));\n\n for(size_t k=0; k0)\n {\n double fltLMaxPrev=segments.at(k-1).fmax();\n fltLMin=(fltLMin+fltLMaxPrev)/2.0;\n }\n if(k+1 track(new Track(x1,y1,z1,t1, x2,y2,z2,t2,\n particleid, trackclass, trackclassindex, p1,\n _geometrymanager, _topvolume, _mainframe, info, false));\n _components.push_back(track);\n _tracks.push_back(track);\n\n for(double fltL=fltLMin; fltL<=fltLMax; fltL+=1.0)\n {\n double t=t0+(fltL-flt0)/v;\n XYZVec pos;\n segment.helix().position(fltL,pos);\n CLHEP::Hep3Vector p = Geom::Hep3Vec(pos);\n findBoundaryT(_tracksTimeMinmax, t);\n findBoundaryP(_tracksMinmax, p.x(), p.y(), p.z());\n track->addTrajectoryPoint(p.x(), p.y(), p.z(), t);\n }\n }\n }\n }\n\n\n // TrkExt track\n trackInfos.clear();\n std::vector trkExtTrajCollectionVector=contentSelector->getSelectedTrackCollection(trackInfos);\n for(unsigned int i=0; i info(new ComponentInfo());\n std::string c=Form(\"TrkExt Trajectory %i %s (%s)\", trkExtTraj.id(), particlename.c_str(),trackcollection.c_str());\n info->setName(c.c_str());\n info->setText(0,c.c_str());\n\n double p1 = trkExtTraj.front().momentum().mag();\n double x1 = trkExtTraj.front().x();\n double y1 = trkExtTraj.front().y();\n double z1 = trkExtTraj.front().z();\n double x2 = trkExtTraj.back().x();\n double y2 = trkExtTraj.back().y();\n double z2 = trkExtTraj.back().z();\n double t1 = 0;\n double t2 = 0;\n boost::shared_ptr track(new Track(x1,y1,z1,t1, x2,y2,z2,t2,\n particleid, trackclass, trackclassindex, p1,\n _geometrymanager, _topvolume, _mainframe, info, false));\n _components.push_back(track);\n _tracks.push_back(track);\n\n for (unsigned int k = 0 ; k < trkExtTraj.size() ; k+=10) {\n const mu2e::TrkExtTrajPoint & trkExtTrajPoint = trkExtTraj[k];\n track->addTrajectoryPoint(trkExtTrajPoint.x(), trkExtTrajPoint.y(), trkExtTrajPoint.z(), 0);\n }\n }\n }\n}\n\nvoid DataInterface::findTrajectory(boost::shared_ptr const &contentSelector,\n boost::shared_ptr const &track, const cet::map_vector_key &id,\n double timeOffset,\n const ContentSelector::trackInfoStruct &trackInfo)\n{\n const mu2e::MCTrajectoryCollection *mcTrajectories=contentSelector->getMCTrajectoryCollection(trackInfo);\n if(mcTrajectories!=nullptr)\n {\n std::map,mu2e::MCTrajectory>::const_iterator traj_iter;\n for(traj_iter=mcTrajectories->begin(); traj_iter!=mcTrajectories->end(); traj_iter++)\n {\n if(traj_iter->first->id()==id)\n// if(traj_iter->second.sim()->id()==id)\n {\n const auto& points = traj_iter->second.points();\n for(auto point_iter=points.begin(); point_iter!=points.end(); ++point_iter)\n {\n track->addTrajectoryPoint(point_iter->x()-_detSysOrigin.x(),\n point_iter->y()-_detSysOrigin.y(),\n point_iter->z()-_detSysOrigin.z(),\n point_iter->t()+timeOffset);\n }\n }\n }\n return;\n }\n}\n\nvoid DataInterface::removeNonGeometryComponents()\n{\n std::list >::iterator iter=_components.begin();\n while(iter!=_components.end())\n {\n if(!(*iter)->isGeometry()) {iter=_components.erase(iter);} //things like tracks and drift radii\n else iter++;\n }\n\n std::vector >::const_iterator hit;\n for(hit=_hits.begin(); hit!=_hits.end(); hit++)\n {\n for(int i=1; i<7; i++) (*hit)->getComponentInfo()->removeLine(i); //keep first line\n (*hit)->getComponentInfo()->getHistVector().clear();\n (*hit)->setHitNumber(-1);\n (*hit)->setStartTime(NAN);\n (*hit)->start();\n }\n std::vector >::const_iterator crystalhit;\n for(crystalhit=_crystalhits.begin(); crystalhit!=_crystalhits.end(); crystalhit++)\n {\n for(int i=1; i<7; i++) (*crystalhit)->getComponentInfo()->removeLine(i); //keep first line\n (*crystalhit)->getComponentInfo()->getHistVector().clear();\n (*crystalhit)->setStartTime(NAN);\n (*crystalhit)->start();\n }\n std::vector >::const_iterator crvhit;\n for(crvhit=_crvhits.begin(); crvhit!=_crvhits.end(); crvhit++)\n {\n for(int i=1; i<7; i++) (*crvhit)->getComponentInfo()->removeLine(i); //keep first line\n (*crvhit)->getComponentInfo()->getHistVector().clear();\n (*crvhit)->setStartTime(NAN);\n (*crvhit)->start();\n }\n\n _hits.clear();\n _crystalhits.clear();\n _crvhits.clear();\n _tracks.clear(); //will call the d'tors of all tracks, since they aren't used anywhere anymore\n _driftradii.clear(); //will call the d'tors of all driftradii, since they aren't used anywhere anymore\n\n _mainframe->getHistDrawVector().clear();\n}\n\nvoid DataInterface::removeAllComponents()\n{\n _components.clear();\n _straws.clear();\n _crystals.clear();\n _crvscintillatorbars.clear();\n _hits.clear();\n _crystalhits.clear();\n _crvhits.clear();\n _tracks.clear();\n _driftradii.clear();\n _supportstructures.clear();\n _otherstructures.clear();\n _crvscintillatorbars.clear();\n _mbsstructures.clear();\n _mecostylepastructures.clear();\n delete _geometrymanager;\n _geometrymanager=nullptr;\n\n _mainframe->getHistDrawVector().clear();\n}\n\n}\n", "meta": {"hexsha": "815916fcf119541c4274f9af19c3cb588337fb06", "size": 67657, "ext": "cc", "lang": "C++", "max_stars_repo_path": "EventDisplay/src/DataInterface.cc", "max_stars_repo_name": "lborrel/Offline", "max_stars_repo_head_hexsha": "db9f647bad3c702171ab5ffa5ccc04c82b3f8984", "max_stars_repo_licenses": ["Apache-2.0"], "max_stars_count": 1.0, "max_stars_repo_stars_event_min_datetime": "2021-06-23T22:09:28.000Z", "max_stars_repo_stars_event_max_datetime": "2021-06-23T22:09:28.000Z", "max_issues_repo_path": "EventDisplay/src/DataInterface.cc", "max_issues_repo_name": "lborrel/Offline", "max_issues_repo_head_hexsha": "db9f647bad3c702171ab5ffa5ccc04c82b3f8984", "max_issues_repo_licenses": ["Apache-2.0"], "max_issues_count": 125.0, "max_issues_repo_issues_event_min_datetime": "2020-04-03T13:44:30.000Z", "max_issues_repo_issues_event_max_datetime": "2021-10-15T21:29:57.000Z", "max_forks_repo_path": "EventDisplay/src/DataInterface.cc", "max_forks_repo_name": "lborrel/Offline", "max_forks_repo_head_hexsha": "db9f647bad3c702171ab5ffa5ccc04c82b3f8984", "max_forks_repo_licenses": ["Apache-2.0"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 43.0114431024, "max_line_length": 163, "alphanum_fraction": 0.6492011174, "num_tokens": 19041, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.523420348936324, "lm_q2_score": 0.2845760102840561, "lm_q1q2_score": 0.14895287460178758}} {"text": "#ifndef BOOST_GEOMETRY_PROJECTIONS_VANDG2_HPP\n#define BOOST_GEOMETRY_PROJECTIONS_VANDG2_HPP\n\n// Boost.Geometry - extensions-gis-projections (based on PROJ4)\n// This file is automatically generated. DO NOT EDIT.\n\n// Copyright (c) 2008-2015 Barend Gehrels, Amsterdam, the Netherlands.\n\n// Use, modification and distribution is subject to the Boost Software License,\n// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at\n// http://www.boost.org/LICENSE_1_0.txt)\n\n// This file is converted from PROJ4, http://trac.osgeo.org/proj\n// PROJ4 is originally written by Gerald Evenden (then of the USGS)\n// PROJ4 is maintained by Frank Warmerdam\n// PROJ4 is converted to Boost.Geometry by Barend Gehrels\n\n// Last updated version of proj: 4.9.1\n\n// Original copyright notice:\n\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the \"Software\"),\n// to deal in the Software without restriction, including without limitation\n// the rights to use, copy, modify, merge, publish, distribute, sublicense,\n// and/or sell copies of the Software, and to permit persons to whom the\n// Software is furnished to do so, subject to the following conditions:\n\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n// DEALINGS IN THE SOFTWARE.\n\n#include \n\n#include \n#include \n#include \n#include \n\nnamespace boost { namespace geometry { namespace projections\n{\n #ifndef DOXYGEN_NO_DETAIL\n namespace detail { namespace vandg2\n {\n\n static const double TOL = 1e-10;\n static const double TWORPI = 0.63661977236758134308;\n\n struct par_vandg2\n {\n int vdg3;\n };\n\n // template class, using CRTP to implement forward/inverse\n template \n struct base_vandg2_spheroid : public base_t_f,\n Geographic, Cartesian, Parameters>\n {\n\n typedef double geographic_type;\n typedef double cartesian_type;\n\n par_vandg2 m_proj_parm;\n\n inline base_vandg2_spheroid(const Parameters& par)\n : base_t_f,\n Geographic, Cartesian, Parameters>(*this, par) {}\n\n // FORWARD(s_forward) spheroid\n // Project coordinates from geographic (lon, lat) to cartesian (x, y)\n inline void fwd(geographic_type& lp_lon, geographic_type& lp_lat, cartesian_type& xy_x, cartesian_type& xy_y) const\n {\n double x1, at, bt, ct;\n\n bt = fabs(TWORPI * lp_lat);\n if ((ct = 1. - bt * bt) < 0.)\n ct = 0.;\n else\n ct = sqrt(ct);\n if (fabs(lp_lon) < TOL) {\n xy_x = 0.;\n xy_y = geometry::math::pi() * (lp_lat < 0. ? -bt : bt) / (1. + ct);\n } else {\n at = 0.5 * fabs(geometry::math::pi() / lp_lon - lp_lon / geometry::math::pi());\n if (this->m_proj_parm.vdg3) {\n x1 = bt / (1. + ct);\n xy_x = geometry::math::pi() * (sqrt(at * at + 1. - x1 * x1) - at);\n xy_y = geometry::math::pi() * x1;\n } else {\n x1 = (ct * sqrt(1. + at * at) - at * ct * ct) /\n (1. + at * at * bt * bt);\n xy_x = geometry::math::pi() * x1;\n xy_y = geometry::math::pi() * sqrt(1. - x1 * (x1 + 2. * at) + TOL);\n }\n if ( lp_lon < 0.) xy_x = -xy_x;\n if ( lp_lat < 0.) xy_y = -xy_y;\n }\n }\n\n static inline std::string get_name()\n {\n return \"vandg2_spheroid\";\n }\n\n };\n\n // van der Grinten II\n template \n void setup_vandg2(Parameters& par, par_vandg2& proj_parm)\n {\n proj_parm.vdg3 = 0;\n }\n\n // van der Grinten III\n template \n void setup_vandg3(Parameters& par, par_vandg2& proj_parm)\n {\n proj_parm.vdg3 = 1;\n par.es = 0.;\n }\n\n }} // namespace detail::vandg2\n #endif // doxygen\n\n /*!\n \\brief van der Grinten II projection\n \\ingroup projections\n \\tparam Geographic latlong point type\n \\tparam Cartesian xy point type\n \\tparam Parameters parameter type\n \\par Projection characteristics\n - Miscellaneous\n - Spheroid\n - no inverse\n \\par Example\n \\image html ex_vandg2.gif\n */\n template \n struct vandg2_spheroid : public detail::vandg2::base_vandg2_spheroid\n {\n inline vandg2_spheroid(const Parameters& par) : detail::vandg2::base_vandg2_spheroid(par)\n {\n detail::vandg2::setup_vandg2(this->m_par, this->m_proj_parm);\n }\n };\n\n /*!\n \\brief van der Grinten III projection\n \\ingroup projections\n \\tparam Geographic latlong point type\n \\tparam Cartesian xy point type\n \\tparam Parameters parameter type\n \\par Projection characteristics\n - Miscellaneous\n - Spheroid\n - no inverse\n \\par Example\n \\image html ex_vandg3.gif\n */\n template \n struct vandg3_spheroid : public detail::vandg2::base_vandg2_spheroid\n {\n inline vandg3_spheroid(const Parameters& par) : detail::vandg2::base_vandg2_spheroid(par)\n {\n detail::vandg2::setup_vandg3(this->m_par, this->m_proj_parm);\n }\n };\n\n #ifndef DOXYGEN_NO_DETAIL\n namespace detail\n {\n\n // Factory entry(s)\n template \n class vandg2_entry : public detail::factory_entry\n {\n public :\n virtual projection* create_new(const Parameters& par) const\n {\n return new base_v_f, Geographic, Cartesian, Parameters>(par);\n }\n };\n\n template \n class vandg3_entry : public detail::factory_entry\n {\n public :\n virtual projection* create_new(const Parameters& par) const\n {\n return new base_v_f, Geographic, Cartesian, Parameters>(par);\n }\n };\n\n template \n inline void vandg2_init(detail::base_factory& factory)\n {\n factory.add_to_factory(\"vandg2\", new vandg2_entry);\n factory.add_to_factory(\"vandg3\", new vandg3_entry);\n }\n\n } // namespace detail\n #endif // doxygen\n\n}}} // namespace boost::geometry::projections\n\n#endif // BOOST_GEOMETRY_PROJECTIONS_VANDG2_HPP\n\n", "meta": {"hexsha": "b4ff3140b866b48d649f867539e9fa2abc23a697", "size": 8779, "ext": "hpp", "lang": "C++", "max_stars_repo_path": "3party/boost/boost/geometry/extensions/gis/projections/proj/vandg2.hpp", "max_stars_repo_name": "bowlofstew/omim", "max_stars_repo_head_hexsha": "8045157c95244aa8f862d47324df42a19b87e335", "max_stars_repo_licenses": ["Apache-2.0"], "max_stars_count": 1.0, "max_stars_repo_stars_event_min_datetime": "2019-01-11T05:02:05.000Z", "max_stars_repo_stars_event_max_datetime": "2019-01-11T05:02:05.000Z", "max_issues_repo_path": "3party/boost/boost/geometry/extensions/gis/projections/proj/vandg2.hpp", "max_issues_repo_name": "bowlofstew/omim", "max_issues_repo_head_hexsha": "8045157c95244aa8f862d47324df42a19b87e335", "max_issues_repo_licenses": ["Apache-2.0"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "3party/boost/boost/geometry/extensions/gis/projections/proj/vandg2.hpp", "max_forks_repo_name": "bowlofstew/omim", "max_forks_repo_head_hexsha": "8045157c95244aa8f862d47324df42a19b87e335", "max_forks_repo_licenses": ["Apache-2.0"], "max_forks_count": 2.0, "max_forks_repo_forks_event_min_datetime": "2018-04-04T10:55:01.000Z", "max_forks_repo_forks_event_max_datetime": "2020-04-23T18:52:06.000Z", "avg_line_length": 40.8325581395, "max_line_length": 132, "alphanum_fraction": 0.6049663971, "num_tokens": 1998, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO\n\n", "lm_q1_score": 0.523420348936324, "lm_q2_score": 0.28457600421652673, "lm_q1q2_score": 0.14895287142591926}} {"text": "\n// Copyright (c) 2012 Christopher Lux \n// Distributed under the Modified BSD License, see license.txt.\n\n#include \n\n#include \n\n#include \n\nnamespace scm {\nnamespace gl {\nnamespace util {\n\ninline\nunsigned\ngl_internal_format(const data_format d)\n{\n static unsigned gl_int_fmts[] = {\n GL_NONE, // FORMAT_NULL = 0x00u,\n\n // normalized integer formats (NORM)\n GL_R8, // FORMAT_R_8,\n GL_RG8, // FORMAT_RG_8,\n GL_RGB8, // FORMAT_RGB_8,\n GL_RGBA8, // FORMAT_RGBA_8,\n\n GL_R16, // FORMAT_R_16,\n GL_RG16, // FORMAT_RG_16,\n GL_RGB16, // FORMAT_RGB_16,\n GL_RGBA16, // FORMAT_RGBA_16,\n\n GL_R8_SNORM, // FORMAT_R_8S,\n GL_RG8_SNORM, // FORMAT_RG_8S,\n GL_RGB8_SNORM, // FORMAT_RGB_8S,\n GL_RGBA8_SNORM, // FORMAT_RGBA_8S,\n\n GL_R16_SNORM, // FORMAT_R_16S,\n GL_RG16_SNORM, // FORMAT_RG_16S,\n GL_RGB16_SNORM, // FORMAT_RGB_16S,\n GL_RGBA16_SNORM,// FORMAT_RGBA_16S,\n\n // swizzled integer formats\n GL_RGB8, // FORMAT_BGR_8,\n GL_RGBA8, // FORMAT_BGRA_8,\n\n // srgb integer formats\n GL_SRGB8, // FORMAT_SRGB_8,\n GL_SRGB8_ALPHA8,// FORMAT_SRGBA_8,\n\n // unnormalized integer formats (UNORM)\n GL_R8I, // FORMAT_R_8I,\n GL_RG8I, // FORMAT_RG_8I,\n GL_RGB8I, // FORMAT_RGB_8I,\n GL_RGBA8I, // FORMAT_RGBA_8I,\n\n GL_R16I, // FORMAT_R_16I,\n GL_RG16I, // FORMAT_RG_16I,\n GL_RGB16I, // FORMAT_RGB_16I,\n GL_RGBA16I, // FORMAT_RGBA_16I,\n\n GL_R32I, // FORMAT_R_32I,\n GL_RG32I, // FORMAT_RG_32I,\n GL_RGB32I, // FORMAT_RGB_32I,\n GL_RGBA32I, // FORMAT_RGBA_32I,\n\n GL_R8UI, // FORMAT_R_8UI,\n GL_RG8UI, // FORMAT_RG_8UI,\n GL_RGB8UI, // FORMAT_RGB_8UI,\n GL_RGBA8UI, // FORMAT_RGBA_8UI,\n\n GL_R16UI, // FORMAT_R_16UI,\n GL_RG16UI, // FORMAT_RG_16UI,\n GL_RGB16UI, // FORMAT_RGB_16UI,\n GL_RGBA16UI, // FORMAT_RGBA_16UI,\n\n GL_R32UI, // FORMAT_R_32UI,\n GL_RG32UI, // FORMAT_RG_32UI,\n GL_RGB32UI, // FORMAT_RGB_32UI,\n GL_RGBA32UI, // FORMAT_RGBA_32UI,\n\n // floating point formats\n GL_R16F, // FORMAT_R_16F,\n GL_RG16F, // FORMAT_RG_16F,\n GL_RGB16F, // FORMAT_RGB_16F,\n GL_RGBA16F, // FORMAT_RGBA_16F,\n\n GL_R32F, // FORMAT_R_32F,\n GL_RG32F, // FORMAT_RG_32F,\n GL_RGB32F, // FORMAT_RGB_32F,\n GL_RGBA32F, // FORMAT_RGBA_32F,\n\n // special packed formats\n GL_RGB9_E5, // FORMAT_RGB9_E5,\n GL_R11F_G11F_B10F,// FORMAT_R11B11G10F,\n\n // compressed formats\n GL_COMPRESSED_RGBA_S3TC_DXT1_EXT, //FORMAT_BC1_RGBA, // DXT1\n GL_COMPRESSED_SRGB_ALPHA_S3TC_DXT1_EXT, //FORMAT_BC1_SRGBA, // DXT1\n GL_COMPRESSED_RGBA_S3TC_DXT3_EXT, //FORMAT_BC2_RGBA, // DXT3\n GL_COMPRESSED_SRGB_ALPHA_S3TC_DXT3_EXT, //FORMAT_BC2_SRGBA, // DXT3\n GL_COMPRESSED_RGBA_S3TC_DXT5_EXT, //FORMAT_BC3_RGBA, // DXT5\n GL_COMPRESSED_SRGB_ALPHA_S3TC_DXT5_EXT, //FORMAT_BC3_SRGBA, // DXT5\n GL_COMPRESSED_RED_RGTC1, //FORMAT_BC4_R, // RGTC1\n GL_COMPRESSED_SIGNED_RED_RGTC1, //FORMAT_BC4_R_S, // RGTC1\n GL_COMPRESSED_RG_RGTC2, //FORMAT_BC5_RG, // RGTC2\n GL_COMPRESSED_SIGNED_RG_RGTC2, //FORMAT_BC5_RG_S, // RGTC2\n GL_COMPRESSED_RGB_BPTC_SIGNED_FLOAT_ARB, //FORMAT_BC6H_RGB_F, // BPTC\n GL_COMPRESSED_RGB_BPTC_UNSIGNED_FLOAT_ARB, //FORMAT_BC6H_RGB_UF, // BPTC\n GL_COMPRESSED_RGBA_BPTC_UNORM_ARB, //FORMAT_BC7_RGBA, // BPTC\n GL_COMPRESSED_SRGB_ALPHA_BPTC_UNORM_ARB, //FORMAT_BC8_SRGBA, // BPTC\n\n // depth stencil formats\n GL_DEPTH_COMPONENT16, // FORMAT_D16,\n GL_DEPTH_COMPONENT24, // FORMAT_D24,\n GL_DEPTH_COMPONENT32, // FORMAT_D32,\n GL_DEPTH_COMPONENT32F, // FORMAT_D32F,\n GL_DEPTH24_STENCIL8, // FORMAT_D24_S8,\n GL_DEPTH32F_STENCIL8 // FORMAT_D32F_S8,\n };\n\n BOOST_STATIC_ASSERT((sizeof(gl_int_fmts) / sizeof(unsigned)) == FORMAT_COUNT);\n\n assert(FORMAT_NULL <= d && d < FORMAT_COUNT);\n\n return gl_int_fmts[d];\n}\n\ninline\nunsigned\ngl_base_format(const data_format d)\n{\n static unsigned gl_int_bfmts[] = {\n GL_NONE, // FORMAT_NULL = 0x00u,\n\n // normalized integer formats (NORM)\n GL_RED, // FORMAT_R_8,\n GL_RG, // FORMAT_RG_8,\n GL_RGB, // FORMAT_RGB_8,\n GL_RGBA, // FORMAT_RGBA_8,\n\n GL_RED, // FORMAT_R_16,\n GL_RG, // FORMAT_RG_16,\n GL_RGB, // FORMAT_RGB_16,\n GL_RGBA, // FORMAT_RGBA_16,\n\n GL_RED, // FORMAT_R_8S,\n GL_RG, // FORMAT_RG_8S,\n GL_RGB, // FORMAT_RGB_8S,\n GL_RGBA, // FORMAT_RGBA_8S,\n\n GL_RED, // FORMAT_R_16S,\n GL_RG, // FORMAT_RG_16S,\n GL_RGB, // FORMAT_RGB_16S,\n GL_RGBA, // FORMAT_RGBA_16S,\n\n // swizzled integer formats\n GL_BGR, // FORMAT_BGR_8,\n GL_BGRA, // FORMAT_BGRA_8,\n\n // srgb integer formats\n GL_RGB, // FORMAT_SRGB_8,\n GL_RGBA, // FORMAT_SRGBA_8,\n\n // unnormalized integer formats (UNORM)\n GL_RED_INTEGER, // FORMAT_R_8I,\n GL_RG_INTEGER, // FORMAT_RG_8I,\n GL_RGB_INTEGER, // FORMAT_RGB_8I,\n GL_RGBA_INTEGER,// FORMAT_RGBA_8I,\n\n GL_RED_INTEGER, // FORMAT_R_16I,\n GL_RG_INTEGER, // FORMAT_RG_16I,\n GL_RGB_INTEGER, // FORMAT_RGB_16I,\n GL_RGBA_INTEGER,// FORMAT_RGBA_16I,\n\n GL_RED_INTEGER, // FORMAT_R_32I,\n GL_RG_INTEGER, // FORMAT_RG_32I,\n GL_RGB_INTEGER, // FORMAT_RGB_32I,\n GL_RGBA_INTEGER,// FORMAT_RGBA_32I,\n\n GL_RED_INTEGER, // FORMAT_R_8UI,\n GL_RG_INTEGER, // FORMAT_RG_8UI,\n GL_RGB_INTEGER, // FORMAT_RGB_8UI,\n GL_RGBA_INTEGER,// FORMAT_RGBA_8UI,\n\n GL_RED_INTEGER, // FORMAT_R_16UI,\n GL_RG_INTEGER, // FORMAT_RG_16UI,\n GL_RGB_INTEGER, // FORMAT_RGB_16UI,\n GL_RGBA_INTEGER,// FORMAT_RGBA_16UI,\n\n GL_RED_INTEGER, // FORMAT_R_32UI,\n GL_RG_INTEGER, // FORMAT_RG_32UI,\n GL_RGB_INTEGER, // FORMAT_RGB_32UI,\n GL_RGBA_INTEGER,// FORMAT_RGBA_32UI,\n\n // floating point formats\n GL_RED, // FORMAT_R_16F,\n GL_RG, // FORMAT_RG_16F,\n GL_RGB, // FORMAT_RGB_16F,\n GL_RGBA, // FORMAT_RGBA_16F,\n\n GL_RED, // FORMAT_R_32F,\n GL_RG, // FORMAT_RG_32F,\n GL_RGB, // FORMAT_RGB_32F,\n GL_RGBA, // FORMAT_RGBA_32F,\n\n // special packed formats\n GL_RGB, // FORMAT_RGB9_E5,\n GL_RGB, // FORMAT_R11B11G10F,\n\n // compressed formats\n GL_RGBA, //FORMAT_BC1_RGBA, // DXT1\n GL_RGBA, //FORMAT_BC1_SRGBA, // DXT1\n GL_RGBA, //FORMAT_BC2_RGBA, // DXT3\n GL_RGBA, //FORMAT_BC2_SRGBA, // DXT3\n GL_RGBA, //FORMAT_BC3_RGBA, // DXT5\n GL_RGBA, //FORMAT_BC3_SRGBA, // DXT5\n GL_RED, //FORMAT_BC4_R, // RGTC1\n GL_RED, //FORMAT_BC4_R_S, // RGTC1\n GL_RG, //FORMAT_BC5_RG, // RGTC2\n GL_RG, //FORMAT_BC5_RG_S, // RGTC2\n GL_RGB, //FORMAT_BC6H_RGB_F, // BPTC\n GL_RGB, //FORMAT_BC6H_RGB_UF, // BPTC\n GL_RGBA, //FORMAT_BC7_RGBA, // BPTC\n GL_RGBA, //FORMAT_BC7_SRGBA, // BPTC\n\n // depth stencil formats\n GL_DEPTH_COMPONENT, // FORMAT_D16,\n GL_DEPTH_COMPONENT, // FORMAT_D24,\n GL_DEPTH_COMPONENT, // FORMAT_D32,\n GL_DEPTH_COMPONENT, // FORMAT_D32F,\n GL_DEPTH_STENCIL, // FORMAT_D24_S8,\n GL_DEPTH_STENCIL // FORMAT_D32F_S8,\n };\n\n BOOST_STATIC_ASSERT((sizeof(gl_int_bfmts) / sizeof(unsigned)) == FORMAT_COUNT);\n\n assert(FORMAT_NULL <= d && d < FORMAT_COUNT);\n\n return gl_int_bfmts[d];\n}\n\ninline\nunsigned\ngl_base_type(const data_format d)\n{\n static unsigned gl_btypes[] = {\n GL_NONE, // FORMAT_NULL = 0x00u,\n\n // normalized integer formats (NORM)\n GL_UNSIGNED_BYTE, // FORMAT_R_8,\n GL_UNSIGNED_BYTE, // FORMAT_RG_8,\n GL_UNSIGNED_BYTE, // FORMAT_RGB_8,\n GL_UNSIGNED_BYTE, // FORMAT_RGBA_8,\n\n GL_UNSIGNED_SHORT, // FORMAT_R_16,\n GL_UNSIGNED_SHORT, // FORMAT_RG_16,\n GL_UNSIGNED_SHORT, // FORMAT_RGB_16,\n GL_UNSIGNED_SHORT, // FORMAT_RGBA_16,\n\n GL_BYTE, // FORMAT_R_8S,\n GL_BYTE, // FORMAT_RG_8S,\n GL_BYTE, // FORMAT_RGB_8S,\n GL_BYTE, // FORMAT_RGBA_8S,\n\n GL_SHORT, // FORMAT_R_16S,\n GL_SHORT, // FORMAT_RG_16S,\n GL_SHORT, // FORMAT_RGB_16S,\n GL_SHORT,// FORMAT_RGBA_16S,\n\n // swizzled integer formats\n GL_UNSIGNED_BYTE, // FORMAT_BGR_8,\n GL_UNSIGNED_INT_8_8_8_8_REV, // FORMAT_BGRA_8,\n\n // srgb integer formats\n GL_UNSIGNED_BYTE, // FORMAT_SRGB_8,\n GL_UNSIGNED_BYTE,// FORMAT_SRGBA_8,\n\n // unnormalized integer formats (UNORM)\n GL_BYTE, // FORMAT_R_8I,\n GL_BYTE, // FORMAT_RG_8I,\n GL_BYTE, // FORMAT_RGB_8I,\n GL_BYTE, // FORMAT_RGBA_8I,\n\n GL_SHORT, // FORMAT_R_16I,\n GL_SHORT, // FORMAT_RG_16I,\n GL_SHORT, // FORMAT_RGB_16I,\n GL_SHORT, // FORMAT_RGBA_16I,\n\n GL_INT, // FORMAT_R_32I,\n GL_INT, // FORMAT_RG_32I,\n GL_INT, // FORMAT_RGB_32I,\n GL_INT, // FORMAT_RGBA_32I,\n\n GL_UNSIGNED_BYTE, // FORMAT_R_8UI,\n GL_UNSIGNED_BYTE, // FORMAT_RG_8UI,\n GL_UNSIGNED_BYTE, // FORMAT_RGB_8UI,\n GL_UNSIGNED_BYTE, // FORMAT_RGBA_8UI,\n\n GL_UNSIGNED_SHORT, // FORMAT_R_16UI,\n GL_UNSIGNED_SHORT, // FORMAT_RG_16UI,\n GL_UNSIGNED_SHORT, // FORMAT_RGB_16UI,\n GL_UNSIGNED_SHORT, // FORMAT_RGBA_16UI,\n\n GL_UNSIGNED_INT, // FORMAT_R_32UI,\n GL_UNSIGNED_INT, // FORMAT_RG_32UI,\n GL_UNSIGNED_INT, // FORMAT_RGB_32UI,\n GL_UNSIGNED_INT, // FORMAT_RGBA_32UI,\n\n // floating point formats\n GL_HALF_FLOAT, // FORMAT_R_16F,\n GL_HALF_FLOAT, // FORMAT_RG_16F,\n GL_HALF_FLOAT, // FORMAT_RGB_16F,\n GL_HALF_FLOAT, // FORMAT_RGBA_16F,\n\n GL_FLOAT, // FORMAT_R_32F,\n GL_FLOAT, // FORMAT_RG_32F,\n GL_FLOAT, // FORMAT_RGB_32F,\n GL_FLOAT, // FORMAT_RGBA_32F,\n\n // special packed formats\n GL_FLOAT, // FORMAT_RGB9_E5,\n GL_FLOAT,// FORMAT_R11B11G10F,\n\n // compressed formats\n GL_UNSIGNED_BYTE, //FORMAT_BC1_RGBA, // DXT1\n GL_UNSIGNED_BYTE, //FORMAT_BC1_SRGBA, // DXT1\n GL_UNSIGNED_BYTE, //FORMAT_BC2_RGBA, // DXT3\n GL_UNSIGNED_BYTE, //FORMAT_BC2_SRGBA, // DXT3\n GL_UNSIGNED_BYTE, //FORMAT_BC3_RGBA, // DXT5\n GL_UNSIGNED_BYTE, //FORMAT_BC3_SRGBA, // DXT5\n GL_UNSIGNED_BYTE, //FORMAT_BC4_R, // RGTC1\n GL_UNSIGNED_BYTE, //FORMAT_BC4_R_S, // RGTC1\n GL_UNSIGNED_BYTE, //FORMAT_BC5_RG, // RGTC2\n GL_UNSIGNED_BYTE, //FORMAT_BC5_RG_S, // RGTC2\n GL_FLOAT, // FORMAT_BC6H_RGB_F, // BPTC\n GL_FLOAT, // FORMAT_BC6H_RGB_UF, // BPTC\n GL_UNSIGNED_BYTE, //FORMAT_BC7_RGBA, // BPTC\n GL_UNSIGNED_BYTE, //FORMAT_BC7_SRGBA, // BPTC\n\n // depth stencil formats\n GL_UNSIGNED_SHORT, // FORMAT_D16,\n GL_UNSIGNED_INT, // FORMAT_D24,\n GL_UNSIGNED_INT, // FORMAT_D32,\n GL_FLOAT, // FORMAT_D32F,\n GL_UNSIGNED_INT_24_8, // FORMAT_D24_S8,\n GL_FLOAT_32_UNSIGNED_INT_24_8_REV// FORMAT_D32F_S8,\n };\n\n BOOST_STATIC_ASSERT((sizeof(gl_btypes) / sizeof(unsigned)) == FORMAT_COUNT);\n\n assert(FORMAT_NULL <= d && d < FORMAT_COUNT);\n\n return gl_btypes[d];\n}\n\n} // namespace util\n} // namespace gl\n} // namespace scm\n", "meta": {"hexsha": "0d91bfe2321f354e0d3813d1b7ea2d45bbe02cb4", "size": 12962, "ext": "inl", "lang": "C++", "max_stars_repo_path": "scm_gl_core/src/scm/gl_core/render_device/opengl/util/data_format_helper.inl", "max_stars_repo_name": "Nyran/schism", "max_stars_repo_head_hexsha": "c2cdb8884e3e6714a3b291f0f754220b7f5cbc7b", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 10.0, "max_stars_repo_stars_event_min_datetime": "2015-09-17T06:01:03.000Z", "max_stars_repo_stars_event_max_datetime": "2019-10-23T07:10:20.000Z", "max_issues_repo_path": "scm_gl_core/src/scm/gl_core/render_device/opengl/util/data_format_helper.inl", "max_issues_repo_name": "Nyran/schism", "max_issues_repo_head_hexsha": "c2cdb8884e3e6714a3b291f0f754220b7f5cbc7b", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 5.0, "max_issues_repo_issues_event_min_datetime": "2015-01-06T14:11:32.000Z", "max_issues_repo_issues_event_max_datetime": "2016-12-12T10:26:53.000Z", "max_forks_repo_path": "scm_gl_core/src/scm/gl_core/render_device/opengl/util/data_format_helper.inl", "max_forks_repo_name": "Nyran/schism", "max_forks_repo_head_hexsha": "c2cdb8884e3e6714a3b291f0f754220b7f5cbc7b", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 15.0, "max_forks_repo_forks_event_min_datetime": "2015-01-29T20:56:13.000Z", "max_forks_repo_forks_event_max_datetime": "2020-07-02T19:03:20.000Z", "avg_line_length": 36.0055555556, "max_line_length": 86, "alphanum_fraction": 0.5656534485, "num_tokens": 3653, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.546738151984614, "lm_q2_score": 0.2720245569956929, "lm_q1q2_score": 0.14872620358625843}} {"text": "// ====================================================================\n// This file is part of FlexibleSUSY.\n//\n// FlexibleSUSY is free software: you can redistribute it and/or modify\n// it under the terms of the GNU General Public License as published\n// by the Free Software Foundation, either version 3 of the License,\n// or (at your option) any later version.\n//\n// FlexibleSUSY is distributed in the hope that it will be useful, but\n// WITHOUT ANY WARRANTY; without even the implied warranty of\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n// General Public License for more details.\n//\n// You should have received a copy of the GNU General Public License\n// along with FlexibleSUSY. If not, see\n// .\n// ====================================================================\n\n// File generated at Thu 10 May 2018 14:59:59\n\n/**\n * @file MSSMNoFV_mass_eigenstates.hpp\n *\n * @brief contains class for model with routines needed to solve boundary\n * value problem using the two_scale solver by solving EWSB\n * and determine the pole masses and mixings\n *\n * This file was generated at Thu 10 May 2018 14:59:59 with FlexibleSUSY\n * 2.0.1 (git commit: unknown) and SARAH 4.12.2 .\n */\n\n#ifndef MSSMNoFV_MASS_EIGENSTATES_H\n#define MSSMNoFV_MASS_EIGENSTATES_H\n\n#include \"MSSMNoFV_info.hpp\"\n#include \"MSSMNoFV_physical.hpp\"\n#include \"MSSMNoFV_soft_parameters.hpp\"\n#include \"loop_corrections.hpp\"\n#include \"threshold_corrections.hpp\"\n#include \"error.hpp\"\n#include \"problems.hpp\"\n#include \"config.h\"\n\n#include \n#include \n#include \n\n#include \n\nnamespace flexiblesusy {\n\nclass MSSMNoFV_ewsb_solver_interface;\n/**\n * @class MSSMNoFV_mass_eigenstates\n * @brief model class with routines for determing masses and mixinga and EWSB\n */\nclass MSSMNoFV_mass_eigenstates : public MSSMNoFV_soft_parameters {\npublic:\n explicit MSSMNoFV_mass_eigenstates(const MSSMNoFV_input_parameters& input_ = MSSMNoFV_input_parameters());\n MSSMNoFV_mass_eigenstates(const MSSMNoFV_mass_eigenstates&) = default;\n MSSMNoFV_mass_eigenstates(MSSMNoFV_mass_eigenstates&&) = default;\n virtual ~MSSMNoFV_mass_eigenstates() = default;\n MSSMNoFV_mass_eigenstates& operator=(const MSSMNoFV_mass_eigenstates&) = default;\n MSSMNoFV_mass_eigenstates& operator=(MSSMNoFV_mass_eigenstates&&) = default;\n\n /// number of EWSB equations\n static const int number_of_ewsb_equations = 2;\n\n void calculate_DRbar_masses();\n void calculate_pole_masses();\n void check_pole_masses_for_tachyons();\n virtual void clear() override;\n void clear_DRbar_parameters();\n Eigen::ArrayXd get_DRbar_masses() const;\n Eigen::ArrayXd get_DRbar_masses_and_mixings() const;\n Eigen::ArrayXd get_extra_parameters() const;\n void do_calculate_sm_pole_masses(bool);\n bool do_calculate_sm_pole_masses() const;\n void do_calculate_bsm_pole_masses(bool);\n bool do_calculate_bsm_pole_masses() const;\n void do_force_output(bool);\n bool do_force_output() const;\n void reorder_DRbar_masses();\n void reorder_pole_masses();\n void set_ewsb_iteration_precision(double);\n void set_ewsb_loop_order(int);\n void set_loop_corrections(const Loop_corrections&);\n const Loop_corrections& get_loop_corrections() const;\n void set_threshold_corrections(const Threshold_corrections&);\n const Threshold_corrections& get_threshold_corrections() const;\n void set_DRbar_masses(const Eigen::ArrayXd&);\n void set_DRbar_masses_and_mixings(const Eigen::ArrayXd&);\n void set_extra_parameters(const Eigen::ArrayXd&);\n void set_pole_mass_loop_order(int);\n int get_pole_mass_loop_order() const;\n void set_physical(const MSSMNoFV_physical&);\n double get_ewsb_iteration_precision() const;\n double get_ewsb_loop_order() const;\n const MSSMNoFV_physical& get_physical() const;\n MSSMNoFV_physical& get_physical();\n const Problems& get_problems() const;\n Problems& get_problems();\n void set_ewsb_solver(const std::shared_ptr&);\n int solve_ewsb_tree_level();\n int solve_ewsb_one_loop();\n int solve_ewsb(); ///< solve EWSB at ewsb_loop_order level\n\n void calculate_spectrum();\n void clear_problems();\n std::string name() const;\n void run_to(double scale, double eps = -1.0) override;\n void print(std::ostream& out = std::cerr) const override;\n void set_precision(double);\n double get_precision() const;\n\n\n double get_MVG() const { return MVG; }\n double get_MGlu() const { return MGlu; }\n double get_MFd() const { return MFd; }\n double get_MFs() const { return MFs; }\n double get_MFb() const { return MFb; }\n double get_MFu() const { return MFu; }\n double get_MFc() const { return MFc; }\n double get_MFt() const { return MFt; }\n double get_MFve() const { return MFve; }\n double get_MFvm() const { return MFvm; }\n double get_MFvt() const { return MFvt; }\n double get_MFe() const { return MFe; }\n double get_MFm() const { return MFm; }\n double get_MFtau() const { return MFtau; }\n double get_MSveL() const { return MSveL; }\n double get_MSvmL() const { return MSvmL; }\n double get_MSvtL() const { return MSvtL; }\n const Eigen::Array& get_MSd() const { return MSd; }\n double get_MSd(int i) const { return MSd(i); }\n const Eigen::Array& get_MSu() const { return MSu; }\n double get_MSu(int i) const { return MSu(i); }\n const Eigen::Array& get_MSe() const { return MSe; }\n double get_MSe(int i) const { return MSe(i); }\n const Eigen::Array& get_MSm() const { return MSm; }\n double get_MSm(int i) const { return MSm(i); }\n const Eigen::Array& get_MStau() const { return MStau; }\n double get_MStau(int i) const { return MStau(i); }\n const Eigen::Array& get_MSs() const { return MSs; }\n double get_MSs(int i) const { return MSs(i); }\n const Eigen::Array& get_MSc() const { return MSc; }\n double get_MSc(int i) const { return MSc(i); }\n const Eigen::Array& get_MSb() const { return MSb; }\n double get_MSb(int i) const { return MSb(i); }\n const Eigen::Array& get_MSt() const { return MSt; }\n double get_MSt(int i) const { return MSt(i); }\n const Eigen::Array& get_Mhh() const { return Mhh; }\n double get_Mhh(int i) const { return Mhh(i); }\n const Eigen::Array& get_MAh() const { return MAh; }\n double get_MAh(int i) const { return MAh(i); }\n const Eigen::Array& get_MHpm() const { return MHpm; }\n double get_MHpm(int i) const { return MHpm(i); }\n const Eigen::Array& get_MChi() const { return MChi; }\n double get_MChi(int i) const { return MChi(i); }\n const Eigen::Array& get_MCha() const { return MCha; }\n double get_MCha(int i) const { return MCha(i); }\n double get_MVWm() const { return MVWm; }\n double get_MVP() const { return MVP; }\n double get_MVZ() const { return MVZ; }\n\n \n Eigen::Array get_MChargedHiggs() const;\n\n Eigen::Array get_MPseudoscalarHiggs() const;\n\n const Eigen::Matrix& get_ZD() const { return ZD; }\n double get_ZD(int i, int k) const { return ZD(i,k); }\n const Eigen::Matrix& get_ZU() const { return ZU; }\n double get_ZU(int i, int k) const { return ZU(i,k); }\n const Eigen::Matrix& get_ZE() const { return ZE; }\n double get_ZE(int i, int k) const { return ZE(i,k); }\n const Eigen::Matrix& get_ZM() const { return ZM; }\n double get_ZM(int i, int k) const { return ZM(i,k); }\n const Eigen::Matrix& get_ZTau() const { return ZTau; }\n double get_ZTau(int i, int k) const { return ZTau(i,k); }\n const Eigen::Matrix& get_ZS() const { return ZS; }\n double get_ZS(int i, int k) const { return ZS(i,k); }\n const Eigen::Matrix& get_ZC() const { return ZC; }\n double get_ZC(int i, int k) const { return ZC(i,k); }\n const Eigen::Matrix& get_ZB() const { return ZB; }\n double get_ZB(int i, int k) const { return ZB(i,k); }\n const Eigen::Matrix& get_ZT() const { return ZT; }\n double get_ZT(int i, int k) const { return ZT(i,k); }\n const Eigen::Matrix& get_ZH() const { return ZH; }\n double get_ZH(int i, int k) const { return ZH(i,k); }\n const Eigen::Matrix& get_ZA() const { return ZA; }\n double get_ZA(int i, int k) const { return ZA(i,k); }\n const Eigen::Matrix& get_ZP() const { return ZP; }\n double get_ZP(int i, int k) const { return ZP(i,k); }\n const Eigen::Matrix,4,4>& get_ZN() const { return ZN; }\n std::complex get_ZN(int i, int k) const { return ZN(i,k); }\n const Eigen::Matrix,2,2>& get_UM() const { return UM; }\n std::complex get_UM(int i, int k) const { return UM(i,k); }\n const Eigen::Matrix,2,2>& get_UP() const { return UP; }\n std::complex get_UP(int i, int k) const { return UP(i,k); }\n const Eigen::Matrix& get_ZZ() const { return ZZ; }\n double get_ZZ(int i, int k) const { return ZZ(i,k); }\n\n void set_PhaseGlu(std::complex PhaseGlu_) { PhaseGlu = PhaseGlu_; }\n std::complex get_PhaseGlu() const { return PhaseGlu; }\n\n\n\n double get_mass_matrix_VG() const;\n void calculate_MVG();\n double get_mass_matrix_Glu() const;\n void calculate_MGlu();\n double get_mass_matrix_Fd() const;\n void calculate_MFd();\n double get_mass_matrix_Fs() const;\n void calculate_MFs();\n double get_mass_matrix_Fb() const;\n void calculate_MFb();\n double get_mass_matrix_Fu() const;\n void calculate_MFu();\n double get_mass_matrix_Fc() const;\n void calculate_MFc();\n double get_mass_matrix_Ft() const;\n void calculate_MFt();\n double get_mass_matrix_Fve() const;\n void calculate_MFve();\n double get_mass_matrix_Fvm() const;\n void calculate_MFvm();\n double get_mass_matrix_Fvt() const;\n void calculate_MFvt();\n double get_mass_matrix_Fe() const;\n void calculate_MFe();\n double get_mass_matrix_Fm() const;\n void calculate_MFm();\n double get_mass_matrix_Ftau() const;\n void calculate_MFtau();\n double get_mass_matrix_SveL() const;\n void calculate_MSveL();\n double get_mass_matrix_SvmL() const;\n void calculate_MSvmL();\n double get_mass_matrix_SvtL() const;\n void calculate_MSvtL();\n Eigen::Matrix get_mass_matrix_Sd() const;\n void calculate_MSd();\n Eigen::Matrix get_mass_matrix_Su() const;\n void calculate_MSu();\n Eigen::Matrix get_mass_matrix_Se() const;\n void calculate_MSe();\n Eigen::Matrix get_mass_matrix_Sm() const;\n void calculate_MSm();\n Eigen::Matrix get_mass_matrix_Stau() const;\n void calculate_MStau();\n Eigen::Matrix get_mass_matrix_Ss() const;\n void calculate_MSs();\n Eigen::Matrix get_mass_matrix_Sc() const;\n void calculate_MSc();\n Eigen::Matrix get_mass_matrix_Sb() const;\n void calculate_MSb();\n Eigen::Matrix get_mass_matrix_St() const;\n void calculate_MSt();\n Eigen::Matrix get_mass_matrix_hh() const;\n void calculate_Mhh();\n Eigen::Matrix get_mass_matrix_Ah() const;\n void calculate_MAh();\n Eigen::Matrix get_mass_matrix_Hpm() const;\n void calculate_MHpm();\n Eigen::Matrix get_mass_matrix_Chi() const;\n void calculate_MChi();\n Eigen::Matrix get_mass_matrix_Cha() const;\n void calculate_MCha();\n double get_mass_matrix_VWm() const;\n void calculate_MVWm();\n Eigen::Matrix get_mass_matrix_VPVZ() const;\n void calculate_MVPVZ();\n\n double get_ewsb_eq_hh_1() const;\n double get_ewsb_eq_hh_2() const;\n\n std::complex CpSveLUSdconjSveLconjUSd(int gO1, int gO2) const;\n std::complex CpSvmLUSdconjSvmLconjUSd(int gO1, int gO2) const;\n std::complex CpSvtLUSdconjSvtLconjUSd(int gO1, int gO2) const;\n std::complex CpUSdconjUSdVZVZ(int gO1, int gO2) const;\n double CpUSdconjUSdconjVWmVWm(int gO1, int gO2) const;\n std::complex CpAhAhUSdconjUSd(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CphhhhUSdconjUSd(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CpHpmUSdconjHpmconjUSd(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpUSdconjUSdconjSbSb(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSdconjUSdconjScSc(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSdconjUSdconjSdSd(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSdconjUSdconjSsSs(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSdconjUSdconjStSt(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSdconjUSdconjSuSu(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSdSeconjUSdconjSe(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUSdSmconjUSdconjSm(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUSdStauconjUSdconjStau(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpAhSdconjUSd(int gI2, int gI1, int gO2) const;\n std::complex CphhSdconjUSd(int gI2, int gI1, int gO2) const;\n std::complex CpHpmSuconjUSd(int gI2, int gI1, int gO2) const;\n std::complex CpSdconjUSdVG(int gI2, int gO2) const;\n std::complex CpSdconjUSdVP(int gI2, int gO2) const;\n std::complex CpSdconjUSdVZ(int gI2, int gO2) const;\n std::complex CpSuconjUSdVWm(int gI2, int gO2) const;\n std::complex CpFuChaconjUSdPR(int gI2, int gO2) const;\n std::complex CpFuChaconjUSdPL(int gI2, int gO1) const;\n std::complex CpChiFdconjUSdPR(int gI2, int gO2) const;\n std::complex CpChiFdconjUSdPL(int gI2, int gO1) const;\n std::complex CpGluFdconjUSdPR(int gO2) const;\n std::complex CpGluFdconjUSdPL(int gO1) const;\n std::complex CpSveLUSuconjSveLconjUSu(int gO1, int gO2) const;\n std::complex CpSvmLUSuconjSvmLconjUSu(int gO1, int gO2) const;\n std::complex CpSvtLUSuconjSvtLconjUSu(int gO1, int gO2) const;\n std::complex CpUSuconjUSuVZVZ(int gO1, int gO2) const;\n double CpUSuconjUSuconjVWmVWm(int gO1, int gO2) const;\n std::complex CpAhAhUSuconjUSu(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CphhhhUSuconjUSu(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CpHpmUSuconjHpmconjUSu(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpSeUSuconjSeconjUSu(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpSmUSuconjSmconjUSu(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpStauUSuconjStauconjUSu(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpUSuconjUSuconjSbSb(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSuconjUSuconjScSc(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSuconjUSuconjSdSd(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSuconjUSuconjSsSs(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSuconjUSuconjStSt(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSuconjUSuconjSuSu(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpAhSuconjUSu(int gI2, int gI1, int gO2) const;\n std::complex CphhSuconjUSu(int gI2, int gI1, int gO2) const;\n std::complex CpSdconjHpmconjUSu(int gI2, int gI1, int gO2) const;\n std::complex CpbarChaFdconjUSuPR(int gI1, int gO2) const;\n std::complex CpbarChaFdconjUSuPL(int gI1, int gO1) const;\n std::complex CpSdconjUSuconjVWm(int gI2, int gO2) const;\n std::complex CpSuconjUSuVG(int gI2, int gO2) const;\n std::complex CpSuconjUSuVP(int gI2, int gO2) const;\n std::complex CpSuconjUSuVZ(int gI2, int gO2) const;\n std::complex CpChiFuconjUSuPR(int gI2, int gO2) const;\n std::complex CpChiFuconjUSuPL(int gI2, int gO1) const;\n std::complex CpGluFuconjUSuPR(int gO2) const;\n std::complex CpGluFuconjUSuPL(int gO1) const;\n std::complex CpSveLUSeconjSveLconjUSe(int gO1, int gO2) const;\n std::complex CpSvmLUSeconjSvmLconjUSe(int gO1, int gO2) const;\n std::complex CpSvtLUSeconjSvtLconjUSe(int gO1, int gO2) const;\n std::complex CpUSeconjUSeVZVZ(int gO1, int gO2) const;\n double CpUSeconjUSeconjVWmVWm(int gO1, int gO2) const;\n double CpSveLconjUSeVWm(int gO2) const;\n std::complex CpAhAhUSeconjUSe(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CphhhhUSeconjUSe(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CpHpmUSeconjHpmconjUSe(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpSbUSeconjSbconjUSe(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpScUSeconjScconjUSe(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpSdUSeconjSdconjUSe(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpSeUSeconjSeconjUSe(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpUSeSmconjUSeconjSm(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUSeSsconjUSeconjSs(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUSeStconjUSeconjSt(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUSeStauconjUSeconjStau(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUSeSuconjUSeconjSu(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpAhSeconjUSe(int gI2, int gI1, int gO2) const;\n std::complex CphhSeconjUSe(int gI2, int gI1, int gO2) const;\n std::complex CpSveLHpmconjUSe(int gI2, int gO2) const;\n std::complex CpSeconjUSeVP(int gI2, int gO2) const;\n std::complex CpSeconjUSeVZ(int gI2, int gO2) const;\n double CpFveChaconjUSePR(int , int ) const;\n std::complex CpFveChaconjUSePL(int gI2, int gO1) const;\n std::complex CpChiFeconjUSePR(int gI2, int gO2) const;\n std::complex CpChiFeconjUSePL(int gI2, int gO1) const;\n std::complex CpSveLUSmconjSveLconjUSm(int gO1, int gO2) const;\n std::complex CpSvmLUSmconjSvmLconjUSm(int gO1, int gO2) const;\n std::complex CpSvtLUSmconjSvtLconjUSm(int gO1, int gO2) const;\n std::complex CpUSmconjUSmVZVZ(int gO1, int gO2) const;\n double CpUSmconjUSmconjVWmVWm(int gO1, int gO2) const;\n double CpSvmLconjUSmVWm(int gO2) const;\n std::complex CpAhAhUSmconjUSm(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CphhhhUSmconjUSm(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CpHpmUSmconjHpmconjUSm(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpSbUSmconjSbconjUSm(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpScUSmconjScconjUSm(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpSdUSmconjSdconjUSm(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpSeUSmconjSeconjUSm(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpSmUSmconjSmconjUSm(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpUSmSsconjUSmconjSs(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUSmStconjUSmconjSt(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUSmStauconjUSmconjStau(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUSmSuconjUSmconjSu(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpAhSmconjUSm(int gI2, int gI1, int gO2) const;\n std::complex CphhSmconjUSm(int gI2, int gI1, int gO2) const;\n std::complex CpSvmLHpmconjUSm(int gI2, int gO2) const;\n std::complex CpSmconjUSmVP(int gI2, int gO2) const;\n std::complex CpSmconjUSmVZ(int gI2, int gO2) const;\n double CpFvmChaconjUSmPR(int , int ) const;\n std::complex CpFvmChaconjUSmPL(int gI2, int gO1) const;\n std::complex CpChiFmconjUSmPR(int gI2, int gO2) const;\n std::complex CpChiFmconjUSmPL(int gI2, int gO1) const;\n std::complex CpSveLUStauconjSveLconjUStau(int gO1, int gO2) const;\n std::complex CpSvmLUStauconjSvmLconjUStau(int gO1, int gO2) const;\n std::complex CpSvtLUStauconjSvtLconjUStau(int gO1, int gO2) const;\n std::complex CpUStauconjUStauVZVZ(int gO1, int gO2) const;\n double CpUStauconjUStauconjVWmVWm(int gO1, int gO2) const;\n double CpSvtLconjUStauVWm(int gO2) const;\n std::complex CpAhAhUStauconjUStau(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CphhhhUStauconjUStau(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CpHpmUStauconjHpmconjUStau(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpSbUStauconjSbconjUStau(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpScUStauconjScconjUStau(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpSdUStauconjSdconjUStau(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpSeUStauconjSeconjUStau(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpSmUStauconjSmconjUStau(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpSsUStauconjSsconjUStau(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpStUStauconjStconjUStau(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpStauUStauconjStauconjUStau(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpUStauSuconjUStauconjSu(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpAhStauconjUStau(int gI2, int gI1, int gO2) const;\n std::complex CphhStauconjUStau(int gI2, int gI1, int gO2) const;\n std::complex CpSvtLHpmconjUStau(int gI2, int gO2) const;\n std::complex CpStauconjUStauVP(int gI2, int gO2) const;\n std::complex CpStauconjUStauVZ(int gI2, int gO2) const;\n double CpFvtChaconjUStauPR(int , int ) const;\n std::complex CpFvtChaconjUStauPL(int gI2, int gO1) const;\n std::complex CpChiFtauconjUStauPR(int gI2, int gO2) const;\n std::complex CpChiFtauconjUStauPL(int gI2, int gO1) const;\n std::complex CpSveLUSsconjSveLconjUSs(int gO1, int gO2) const;\n std::complex CpSvmLUSsconjSvmLconjUSs(int gO1, int gO2) const;\n std::complex CpSvtLUSsconjSvtLconjUSs(int gO1, int gO2) const;\n std::complex CpUSsconjUSsVZVZ(int gO1, int gO2) const;\n double CpUSsconjUSsconjVWmVWm(int gO1, int gO2) const;\n std::complex CpAhAhUSsconjUSs(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CphhhhUSsconjUSs(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CpHpmUSsconjHpmconjUSs(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpSeUSsconjSeconjUSs(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpSmUSsconjSmconjUSs(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpUSsconjUSsconjSbSb(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSsconjUSsconjScSc(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSsconjUSsconjSdSd(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSsconjUSsconjSsSs(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSsconjUSsconjStSt(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSsconjUSsconjSuSu(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSsStauconjUSsconjStau(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpAhSsconjUSs(int gI2, int gI1, int gO2) const;\n std::complex CphhSsconjUSs(int gI2, int gI1, int gO2) const;\n std::complex CpHpmScconjUSs(int gI2, int gI1, int gO2) const;\n std::complex CpScconjUSsVWm(int gI2, int gO2) const;\n std::complex CpSsconjUSsVG(int gI2, int gO2) const;\n std::complex CpSsconjUSsVP(int gI2, int gO2) const;\n std::complex CpSsconjUSsVZ(int gI2, int gO2) const;\n std::complex CpFcChaconjUSsPR(int gI2, int gO2) const;\n std::complex CpFcChaconjUSsPL(int gI2, int gO1) const;\n std::complex CpChiFsconjUSsPR(int gI2, int gO2) const;\n std::complex CpChiFsconjUSsPL(int gI2, int gO1) const;\n std::complex CpGluFsconjUSsPR(int gO2) const;\n std::complex CpGluFsconjUSsPL(int gO1) const;\n std::complex CpSveLUScconjSveLconjUSc(int gO1, int gO2) const;\n std::complex CpSvmLUScconjSvmLconjUSc(int gO1, int gO2) const;\n std::complex CpSvtLUScconjSvtLconjUSc(int gO1, int gO2) const;\n std::complex CpUScconjUScVZVZ(int gO1, int gO2) const;\n double CpUScconjUScconjVWmVWm(int gO1, int gO2) const;\n std::complex CpAhAhUScconjUSc(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CphhhhUScconjUSc(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CpHpmUScconjHpmconjUSc(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpUScconjUScconjSbSb(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUScconjUScconjScSc(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUScconjUScconjSdSd(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUScconjUScconjSsSs(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUScconjUScconjStSt(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUScconjUScconjSuSu(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUScSeconjUScconjSe(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUScSmconjUScconjSm(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUScStauconjUScconjStau(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpAhScconjUSc(int gI2, int gI1, int gO2) const;\n std::complex CphhScconjUSc(int gI2, int gI1, int gO2) const;\n std::complex CpSsconjHpmconjUSc(int gI2, int gI1, int gO2) const;\n std::complex CpbarChaFsconjUScPR(int gI1, int gO2) const;\n std::complex CpbarChaFsconjUScPL(int gI1, int gO1) const;\n std::complex CpScconjUScVG(int gI2, int gO2) const;\n std::complex CpScconjUScVP(int gI2, int gO2) const;\n std::complex CpScconjUScVZ(int gI2, int gO2) const;\n std::complex CpSsconjUScconjVWm(int gI2, int gO2) const;\n std::complex CpChiFcconjUScPR(int gI2, int gO2) const;\n std::complex CpChiFcconjUScPL(int gI2, int gO1) const;\n std::complex CpGluFcconjUScPR(int gO2) const;\n std::complex CpGluFcconjUScPL(int gO1) const;\n std::complex CpSveLUSbconjSveLconjUSb(int gO1, int gO2) const;\n std::complex CpSvmLUSbconjSvmLconjUSb(int gO1, int gO2) const;\n std::complex CpSvtLUSbconjSvtLconjUSb(int gO1, int gO2) const;\n std::complex CpUSbconjUSbVZVZ(int gO1, int gO2) const;\n double CpUSbconjUSbconjVWmVWm(int gO1, int gO2) const;\n std::complex CpAhAhUSbconjUSb(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CphhhhUSbconjUSb(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CpHpmUSbconjHpmconjUSb(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpUSbconjUSbconjSbSb(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSbconjUSbconjScSc(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSbconjUSbconjSdSd(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSbconjUSbconjSsSs(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSbconjUSbconjStSt(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSbconjUSbconjSuSu(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUSbSeconjUSbconjSe(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUSbSmconjUSbconjSm(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUSbStauconjUSbconjStau(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpAhSbconjUSb(int gI2, int gI1, int gO2) const;\n std::complex CphhSbconjUSb(int gI2, int gI1, int gO2) const;\n std::complex CpHpmStconjUSb(int gI2, int gI1, int gO2) const;\n std::complex CpSbconjUSbVG(int gI2, int gO2) const;\n std::complex CpSbconjUSbVP(int gI2, int gO2) const;\n std::complex CpSbconjUSbVZ(int gI2, int gO2) const;\n std::complex CpStconjUSbVWm(int gI2, int gO2) const;\n std::complex CpFtChaconjUSbPR(int gI2, int gO2) const;\n std::complex CpFtChaconjUSbPL(int gI2, int gO1) const;\n std::complex CpChiFbconjUSbPR(int gI2, int gO2) const;\n std::complex CpChiFbconjUSbPL(int gI2, int gO1) const;\n std::complex CpGluFbconjUSbPR(int gO2) const;\n std::complex CpGluFbconjUSbPL(int gO1) const;\n std::complex CpSveLUStconjSveLconjUSt(int gO1, int gO2) const;\n std::complex CpSvmLUStconjSvmLconjUSt(int gO1, int gO2) const;\n std::complex CpSvtLUStconjSvtLconjUSt(int gO1, int gO2) const;\n std::complex CpUStconjUStVZVZ(int gO1, int gO2) const;\n double CpUStconjUStconjVWmVWm(int gO1, int gO2) const;\n std::complex CpAhAhUStconjUSt(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CphhhhUStconjUSt(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CpHpmUStconjHpmconjUSt(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpSeUStconjSeconjUSt(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpSmUStconjSmconjUSt(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpUStconjUStconjSbSb(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUStconjUStconjScSc(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUStconjUStconjSdSd(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUStconjUStconjSsSs(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUStconjUStconjStSt(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUStconjUStconjSuSu(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUStStauconjUStconjStau(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpAhStconjUSt(int gI2, int gI1, int gO2) const;\n std::complex CphhStconjUSt(int gI2, int gI1, int gO2) const;\n std::complex CpSbconjHpmconjUSt(int gI2, int gI1, int gO2) const;\n std::complex CpbarChaFbconjUStPR(int gI1, int gO2) const;\n std::complex CpbarChaFbconjUStPL(int gI1, int gO1) const;\n std::complex CpSbconjUStconjVWm(int gI2, int gO2) const;\n std::complex CpStconjUStVG(int gI2, int gO2) const;\n std::complex CpStconjUStVP(int gI2, int gO2) const;\n std::complex CpStconjUStVZ(int gI2, int gO2) const;\n std::complex CpChiFtconjUStPR(int gI2, int gO2) const;\n std::complex CpChiFtconjUStPL(int gI2, int gO1) const;\n std::complex CpGluFtconjUStPR(int gO2) const;\n std::complex CpGluFtconjUStPL(int gO1) const;\n std::complex CpSveLUhhconjSveL(int gO2) const;\n std::complex CpSvmLUhhconjSvmL(int gO2) const;\n std::complex CpSvtLUhhconjSvtL(int gO2) const;\n std::complex CpbargWmgWmUhh(int gO1) const;\n std::complex CpbargWmCgWmCUhh(int gO1) const;\n std::complex CpbargZgZUhh(int gO1) const;\n std::complex CpUhhVZVZ(int gO2) const;\n std::complex CpUhhconjVWmVWm(int gO2) const;\n std::complex CpSveLUhhUhhconjSveL(int gO1, int gO2) const;\n std::complex CpSvmLUhhUhhconjSvmL(int gO1, int gO2) const;\n std::complex CpSvtLUhhUhhconjSvtL(int gO1, int gO2) const;\n std::complex CpUhhUhhVZVZ(int gO1, int gO2) const;\n std::complex CpUhhUhhconjVWmVWm(int gO1, int gO2) const;\n std::complex CpAhAhUhhUhh(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CphhhhUhhUhh(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CpUhhUhhHpmconjHpm(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUhhUhhSbconjSb(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUhhUhhScconjSc(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUhhUhhSdconjSd(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUhhUhhSeconjSe(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUhhUhhSmconjSm(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUhhUhhSsconjSs(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUhhUhhStconjSt(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUhhUhhStauconjStau(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUhhUhhSuconjSu(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpAhAhUhh(int gI1, int gI2, int gO2) const;\n std::complex CphhhhUhh(int gI1, int gI2, int gO2) const;\n std::complex CpUhhHpmconjHpm(int gO2, int gI2, int gI1) const;\n std::complex CpUhhSbconjSb(int gO2, int gI2, int gI1) const;\n std::complex CpUhhScconjSc(int gO2, int gI2, int gI1) const;\n std::complex CpUhhSdconjSd(int gO2, int gI2, int gI1) const;\n std::complex CpUhhSeconjSe(int gO2, int gI2, int gI1) const;\n std::complex CpUhhSmconjSm(int gO2, int gI2, int gI1) const;\n std::complex CpUhhSsconjSs(int gO2, int gI2, int gI1) const;\n std::complex CpUhhStconjSt(int gO2, int gI2, int gI1) const;\n std::complex CpUhhStauconjStau(int gO2, int gI2, int gI1) const;\n std::complex CpUhhSuconjSu(int gO2, int gI2, int gI1) const;\n std::complex CpbarChaChaUhhPR(int gI1, int gI2, int gO2) const;\n std::complex CpbarChaChaUhhPL(int gI1, int gI2, int gO1) const;\n std::complex CpChiChiUhhPR(int gI1, int gI2, int gO2) const;\n std::complex CpChiChiUhhPL(int gI1, int gI2, int gO1) const;\n std::complex CpAhUhhVZ(int gI2, int gO2) const;\n std::complex CpUhhHpmconjVWm(int gO2, int gI2) const;\n double CpbarFbFbUhhPR(int gO2) const;\n double CpbarFbFbUhhPL(int gO1) const;\n double CpbarFcFcUhhPR(int gO2) const;\n double CpbarFcFcUhhPL(int gO1) const;\n double CpbarFdFdUhhPR(int gO2) const;\n double CpbarFdFdUhhPL(int gO1) const;\n double CpbarFeFeUhhPR(int gO2) const;\n double CpbarFeFeUhhPL(int gO1) const;\n double CpbarFmFmUhhPR(int gO2) const;\n double CpbarFmFmUhhPL(int gO1) const;\n double CpbarFsFsUhhPR(int gO2) const;\n double CpbarFsFsUhhPL(int gO1) const;\n double CpbarFtFtUhhPR(int gO2) const;\n double CpbarFtFtUhhPL(int gO1) const;\n double CpbarFtauFtauUhhPR(int gO2) const;\n double CpbarFtauFtauUhhPL(int gO1) const;\n double CpbarFuFuUhhPR(int gO2) const;\n double CpbarFuFuUhhPL(int gO1) const;\n std::complex CpbargWmgWmUAh(int gO1) const;\n std::complex CpbargWmCgWmCUAh(int gO1) const;\n std::complex CpSveLUAhUAhconjSveL(int gO1, int gO2) const;\n std::complex CpSvmLUAhUAhconjSvmL(int gO1, int gO2) const;\n std::complex CpSvtLUAhUAhconjSvtL(int gO1, int gO2) const;\n std::complex CpUAhUAhVZVZ(int gO1, int gO2) const;\n std::complex CpUAhUAhconjVWmVWm(int gO1, int gO2) const;\n std::complex CpAhAhUAhUAh(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CpUAhUAhhhhh(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUAhUAhHpmconjHpm(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUAhUAhSbconjSb(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUAhUAhScconjSc(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUAhUAhSdconjSd(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUAhUAhSeconjSe(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUAhUAhSmconjSm(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUAhUAhSsconjSs(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUAhUAhStconjSt(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUAhUAhStauconjStau(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpUAhUAhSuconjSu(int gO1, int gO2, int gI1, int gI2) const;\n std::complex CpAhUAhhh(int gI2, int gO2, int gI1) const;\n std::complex CpUAhHpmconjHpm(int gO2, int gI2, int gI1) const;\n std::complex CpUAhSbconjSb(int gO2, int gI2, int gI1) const;\n std::complex CpUAhScconjSc(int gO2, int gI2, int gI1) const;\n std::complex CpUAhSdconjSd(int gO2, int gI2, int gI1) const;\n std::complex CpUAhSeconjSe(int gO2, int gI2, int gI1) const;\n std::complex CpUAhSmconjSm(int gO2, int gI2, int gI1) const;\n std::complex CpUAhSsconjSs(int gO2, int gI2, int gI1) const;\n std::complex CpUAhStconjSt(int gO2, int gI2, int gI1) const;\n std::complex CpUAhStauconjStau(int gO2, int gI2, int gI1) const;\n std::complex CpUAhSuconjSu(int gO2, int gI2, int gI1) const;\n std::complex CpbarChaChaUAhPR(int gI1, int gI2, int gO2) const;\n std::complex CpbarChaChaUAhPL(int gI1, int gI2, int gO1) const;\n std::complex CpChiChiUAhPR(int gI1, int gI2, int gO2) const;\n std::complex CpChiChiUAhPL(int gI1, int gI2, int gO1) const;\n std::complex CpUAhhhVZ(int gO2, int gI2) const;\n std::complex CpUAhHpmconjVWm(int gO2, int gI2) const;\n std::complex CpbarFbFbUAhPR(int gO2) const;\n std::complex CpbarFbFbUAhPL(int gO1) const;\n std::complex CpbarFcFcUAhPR(int gO2) const;\n std::complex CpbarFcFcUAhPL(int gO1) const;\n std::complex CpbarFdFdUAhPR(int gO2) const;\n std::complex CpbarFdFdUAhPL(int gO1) const;\n std::complex CpbarFeFeUAhPR(int gO2) const;\n std::complex CpbarFeFeUAhPL(int gO1) const;\n std::complex CpbarFmFmUAhPR(int gO2) const;\n std::complex CpbarFmFmUAhPL(int gO1) const;\n std::complex CpbarFsFsUAhPR(int gO2) const;\n std::complex CpbarFsFsUAhPL(int gO1) const;\n std::complex CpbarFtFtUAhPR(int gO2) const;\n std::complex CpbarFtFtUAhPL(int gO1) const;\n std::complex CpbarFtauFtauUAhPR(int gO2) const;\n std::complex CpbarFtauFtauUAhPL(int gO1) const;\n std::complex CpbarFuFuUAhPR(int gO2) const;\n std::complex CpbarFuFuUAhPL(int gO1) const;\n std::complex CpbargWmgZUHpm(int gO2) const;\n std::complex CpbargZgWmconjUHpm(int gO1) const;\n std::complex CpbargWmCgZconjUHpm(int gO1) const;\n std::complex CpbargZgWmCUHpm(int gO2) const;\n std::complex CpconjUHpmVPVWm(int gO2) const;\n std::complex CpconjUHpmVWmVZ(int gO2) const;\n std::complex CpSveLUHpmconjSveLconjUHpm(int gO1, int gO2) const;\n std::complex CpSvmLUHpmconjSvmLconjUHpm(int gO1, int gO2) const;\n std::complex CpSvtLUHpmconjSvtLconjUHpm(int gO1, int gO2) const;\n std::complex CpUHpmconjUHpmVZVZ(int gO1, int gO2) const;\n std::complex CpUHpmconjUHpmconjVWmVWm(int gO1, int gO2) const;\n std::complex CpAhAhUHpmconjUHpm(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CphhhhUHpmconjUHpm(int gI1, int gI2, int gO1, int gO2) const;\n std::complex CpHpmUHpmconjHpmconjUHpm(int gI1, int gO1, int gI2, int gO2) const;\n std::complex CpUHpmSbconjUHpmconjSb(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUHpmScconjUHpmconjSc(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUHpmSdconjUHpmconjSd(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUHpmSeconjUHpmconjSe(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUHpmSmconjUHpmconjSm(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUHpmSsconjUHpmconjSs(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUHpmStconjUHpmconjSt(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUHpmStauconjUHpmconjStau(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpUHpmSuconjUHpmconjSu(int gO1, int gI1, int gO2, int gI2) const;\n std::complex CpAhHpmconjUHpm(int gI2, int gI1, int gO2) const;\n std::complex CphhHpmconjUHpm(int gI2, int gI1, int gO2) const;\n std::complex CpSbconjUHpmconjSt(int gI2, int gO2, int gI1) const;\n std::complex CpSdconjUHpmconjSu(int gI2, int gO2, int gI1) const;\n std::complex CpSsconjUHpmconjSc(int gI2, int gO2, int gI1) const;\n std::complex CpChiChaconjUHpmPR(int gI1, int gI2, int gO2) const;\n std::complex CpChiChaconjUHpmPL(int gI1, int gI2, int gO1) const;\n std::complex CpSeconjSveLconjUHpm(int gI2, int gO2) const;\n std::complex CpSmconjSvmLconjUHpm(int gI2, int gO2) const;\n std::complex CpStauconjSvtLconjUHpm(int gI2, int gO2) const;\n std::complex CpAhconjUHpmVWm(int gI2, int gO2) const;\n std::complex CphhconjUHpmVWm(int gI2, int gO2) const;\n std::complex CpHpmconjUHpmVP(int gI2, int gO2) const;\n std::complex CpHpmconjUHpmVZ(int gI2, int gO2) const;\n double CpbarFcFsconjUHpmPR(int gO2) const;\n double CpbarFcFsconjUHpmPL(int gO1) const;\n double CpbarFtFbconjUHpmPR(int gO2) const;\n double CpbarFtFbconjUHpmPL(int gO1) const;\n double CpbarFuFdconjUHpmPR(int gO2) const;\n double CpbarFuFdconjUHpmPL(int gO1) const;\n double CpbarFveFeconjUHpmPR(int gO2) const;\n double CpbarFveFeconjUHpmPL(int ) const;\n double CpbarFvmFmconjUHpmPR(int gO2) const;\n double CpbarFvmFmconjUHpmPL(int ) const;\n double CpbarFvtFtauconjUHpmPR(int gO2) const;\n double CpbarFvtFtauconjUHpmPL(int ) const;\n double CpSveLSveLconjSveLconjSveL() const;\n double CpSveLSvmLconjSveLconjSvmL() const;\n double CpSveLSvtLconjSveLconjSvtL() const;\n std::complex CpSveLconjSveLVZVZ() const;\n double CpSveLconjSveLconjVWmVWm() const;\n double CpSveLconjSveLVZ() const;\n std::complex CpSveLAhAhconjSveL(int gI1, int gI2) const;\n std::complex CpSveLhhhhconjSveL(int gI1, int gI2) const;\n std::complex CpSveLHpmconjSveLconjHpm(int gI1, int gI2) const;\n std::complex CpSveLSbconjSveLconjSb(int gI1, int gI2) const;\n std::complex CpSveLScconjSveLconjSc(int gI1, int gI2) const;\n std::complex CpSveLSdconjSveLconjSd(int gI1, int gI2) const;\n std::complex CpSveLSeconjSveLconjSe(int gI1, int gI2) const;\n std::complex CpSveLSmconjSveLconjSm(int gI1, int gI2) const;\n std::complex CpSveLSsconjSveLconjSs(int gI1, int gI2) const;\n std::complex CpSveLStconjSveLconjSt(int gI1, int gI2) const;\n std::complex CpSveLStauconjSveLconjStau(int gI1, int gI2) const;\n std::complex CpSveLSuconjSveLconjSu(int gI1, int gI2) const;\n std::complex CpSeconjSveLconjHpm(int gI2, int gI1) const;\n std::complex CpbarChaFeconjSveLPR(int gI1) const;\n std::complex CpbarChaFeconjSveLPL(int gI1) const;\n std::complex CpSveLhhconjSveL(int gI2) const;\n std::complex CpSeconjSveLconjVWm(int gI2) const;\n double CpChiFveconjSveLPR(int ) const;\n std::complex CpChiFveconjSveLPL(int gI2) const;\n double CpSvmLSvmLconjSvmLconjSvmL() const;\n double CpSvmLSvtLconjSvmLconjSvtL() const;\n std::complex CpSvmLconjSvmLVZVZ() const;\n double CpSvmLconjSvmLconjVWmVWm() const;\n double CpSvmLconjSvmLVZ() const;\n std::complex CpSvmLAhAhconjSvmL(int gI1, int gI2) const;\n std::complex CpSvmLhhhhconjSvmL(int gI1, int gI2) const;\n std::complex CpSvmLHpmconjSvmLconjHpm(int gI1, int gI2) const;\n std::complex CpSvmLSbconjSvmLconjSb(int gI1, int gI2) const;\n std::complex CpSvmLScconjSvmLconjSc(int gI1, int gI2) const;\n std::complex CpSvmLSdconjSvmLconjSd(int gI1, int gI2) const;\n std::complex CpSvmLSeconjSvmLconjSe(int gI1, int gI2) const;\n std::complex CpSvmLSmconjSvmLconjSm(int gI1, int gI2) const;\n std::complex CpSvmLSsconjSvmLconjSs(int gI1, int gI2) const;\n std::complex CpSvmLStconjSvmLconjSt(int gI1, int gI2) const;\n std::complex CpSvmLStauconjSvmLconjStau(int gI1, int gI2) const;\n std::complex CpSvmLSuconjSvmLconjSu(int gI1, int gI2) const;\n std::complex CpSmconjSvmLconjHpm(int gI2, int gI1) const;\n std::complex CpbarChaFmconjSvmLPR(int gI1) const;\n std::complex CpbarChaFmconjSvmLPL(int gI1) const;\n std::complex CpSvmLhhconjSvmL(int gI2) const;\n std::complex CpSmconjSvmLconjVWm(int gI2) const;\n double CpChiFvmconjSvmLPR(int ) const;\n std::complex CpChiFvmconjSvmLPL(int gI2) const;\n double CpSvtLSvtLconjSvtLconjSvtL() const;\n std::complex CpSvtLconjSvtLVZVZ() const;\n double CpSvtLconjSvtLconjVWmVWm() const;\n double CpSvtLconjSvtLVZ() const;\n std::complex CpSvtLAhAhconjSvtL(int gI1, int gI2) const;\n std::complex CpSvtLhhhhconjSvtL(int gI1, int gI2) const;\n std::complex CpSvtLHpmconjSvtLconjHpm(int gI1, int gI2) const;\n std::complex CpSvtLSbconjSvtLconjSb(int gI1, int gI2) const;\n std::complex CpSvtLScconjSvtLconjSc(int gI1, int gI2) const;\n std::complex CpSvtLSdconjSvtLconjSd(int gI1, int gI2) const;\n std::complex CpSvtLSeconjSvtLconjSe(int gI1, int gI2) const;\n std::complex CpSvtLSmconjSvtLconjSm(int gI1, int gI2) const;\n std::complex CpSvtLSsconjSvtLconjSs(int gI1, int gI2) const;\n std::complex CpSvtLStconjSvtLconjSt(int gI1, int gI2) const;\n std::complex CpSvtLStauconjSvtLconjStau(int gI1, int gI2) const;\n std::complex CpSvtLSuconjSvtLconjSu(int gI1, int gI2) const;\n std::complex CpStauconjSvtLconjHpm(int gI2, int gI1) const;\n std::complex CpbarChaFtauconjSvtLPR(int gI1) const;\n std::complex CpbarChaFtauconjSvtLPL(int gI1) const;\n std::complex CpSvtLhhconjSvtL(int gI2) const;\n std::complex CpStauconjSvtLconjVWm(int gI2) const;\n double CpChiFvtconjSvtLPR(int ) const;\n std::complex CpChiFvtconjSvtLPL(int gI2) const;\n std::complex CpVGVGVG() const;\n std::complex CpbargGgGVG() const;\n std::complex CpSbconjSbVGVG(int gI1, int gI2) const;\n std::complex CpScconjScVGVG(int gI1, int gI2) const;\n std::complex CpSdconjSdVGVG(int gI1, int gI2) const;\n std::complex CpSsconjSsVGVG(int gI1, int gI2) const;\n std::complex CpStconjStVGVG(int gI1, int gI2) const;\n std::complex CpSuconjSuVGVG(int gI1, int gI2) const;\n double CpSbconjSbVG(int gI2, int gI1) const;\n double CpScconjScVG(int gI2, int gI1) const;\n double CpSdconjSdVG(int gI2, int gI1) const;\n double CpSsconjSsVG(int gI2, int gI1) const;\n double CpStconjStVG(int gI2, int gI1) const;\n double CpSuconjSuVG(int gI2, int gI1) const;\n std::complex CpGluGluVGPL() const;\n std::complex CpGluGluVGPR() const;\n double CpbarFbFbVGPL() const;\n double CpbarFbFbVGPR() const;\n double CpbarFcFcVGPL() const;\n double CpbarFcFcVGPR() const;\n double CpbarFdFdVGPL() const;\n double CpbarFdFdVGPR() const;\n double CpbarFsFsVGPL() const;\n double CpbarFsFsVGPR() const;\n double CpbarFtFtVGPL() const;\n double CpbarFtFtVGPR() const;\n double CpbarFuFuVGPL() const;\n double CpbarFuFuVGPR() const;\n double CpVGVGVGVG1() const;\n double CpVGVGVGVG2() const;\n double CpVGVGVGVG3() const;\n double CpbargWmgWmVP() const;\n double CpbargWmCgWmCVP() const;\n double CpconjVWmVPVWm() const;\n double CpbarFeFeVPPL() const;\n double CpbarFeFeVPPR() const;\n double CpbarFmFmVPPL() const;\n double CpbarFmFmVPPR() const;\n double CpbarFtauFtauVPPL() const;\n double CpbarFtauFtauVPPR() const;\n std::complex CpHpmconjHpmVPVP(int gI1, int gI2) const;\n std::complex CpSbconjSbVPVP(int gI1, int gI2) const;\n std::complex CpScconjScVPVP(int gI1, int gI2) const;\n std::complex CpSdconjSdVPVP(int gI1, int gI2) const;\n std::complex CpSeconjSeVPVP(int gI1, int gI2) const;\n std::complex CpSmconjSmVPVP(int gI1, int gI2) const;\n std::complex CpSsconjSsVPVP(int gI1, int gI2) const;\n std::complex CpStconjStVPVP(int gI1, int gI2) const;\n std::complex CpStauconjStauVPVP(int gI1, int gI2) const;\n std::complex CpSuconjSuVPVP(int gI1, int gI2) const;\n double CpHpmconjHpmVP(int gI2, int gI1) const;\n std::complex CpSbconjSbVP(int gI2, int gI1) const;\n std::complex CpScconjScVP(int gI2, int gI1) const;\n std::complex CpSdconjSdVP(int gI2, int gI1) const;\n std::complex CpSeconjSeVP(int gI2, int gI1) const;\n std::complex CpSmconjSmVP(int gI2, int gI1) const;\n std::complex CpSsconjSsVP(int gI2, int gI1) const;\n std::complex CpStconjStVP(int gI2, int gI1) const;\n std::complex CpStauconjStauVP(int gI2, int gI1) const;\n std::complex CpSuconjSuVP(int gI2, int gI1) const;\n std::complex CpbarChaChaVPPL(int gI1, int gI2) const;\n std::complex CpbarChaChaVPPR(int gI1, int gI2) const;\n std::complex CpHpmconjVWmVP(int gI2) const;\n double CpbarFbFbVPPL() const;\n double CpbarFbFbVPPR() const;\n double CpbarFcFcVPPL() const;\n double CpbarFcFcVPPR() const;\n double CpbarFdFdVPPL() const;\n double CpbarFdFdVPPR() const;\n double CpbarFsFsVPPL() const;\n double CpbarFsFsVPPR() const;\n double CpbarFtFtVPPL() const;\n double CpbarFtFtVPPR() const;\n double CpbarFuFuVPPL() const;\n double CpbarFuFuVPPR() const;\n double CpconjVWmVPVPVWm1() const;\n double CpconjVWmVPVPVWm2() const;\n double CpconjVWmVPVPVWm3() const;\n double CpbargWmgWmVZ() const;\n double CpbargWmCgWmCVZ() const;\n double CpconjVWmVWmVZ() const;\n double CpbarFeFeVZPL() const;\n double CpbarFeFeVZPR() const;\n double CpbarFmFmVZPL() const;\n double CpbarFmFmVZPR() const;\n double CpbarFtauFtauVZPL() const;\n double CpbarFtauFtauVZPR() const;\n double CpbarFveFveVZPL() const;\n double CpbarFveFveVZPR() const;\n double CpbarFvmFvmVZPL() const;\n double CpbarFvmFvmVZPR() const;\n double CpbarFvtFvtVZPL() const;\n double CpbarFvtFvtVZPR() const;\n std::complex CpAhAhVZVZ(int gI1, int gI2) const;\n std::complex CphhhhVZVZ(int gI1, int gI2) const;\n std::complex CpHpmconjHpmVZVZ(int gI1, int gI2) const;\n std::complex CpSbconjSbVZVZ(int gI1, int gI2) const;\n std::complex CpScconjScVZVZ(int gI1, int gI2) const;\n std::complex CpSdconjSdVZVZ(int gI1, int gI2) const;\n std::complex CpSeconjSeVZVZ(int gI1, int gI2) const;\n std::complex CpSmconjSmVZVZ(int gI1, int gI2) const;\n std::complex CpSsconjSsVZVZ(int gI1, int gI2) const;\n std::complex CpStconjStVZVZ(int gI1, int gI2) const;\n std::complex CpStauconjStauVZVZ(int gI1, int gI2) const;\n std::complex CpSuconjSuVZVZ(int gI1, int gI2) const;\n std::complex CpAhhhVZ(int gI2, int gI1) const;\n double CpHpmconjHpmVZ(int gI2, int gI1) const;\n std::complex CpSbconjSbVZ(int gI2, int gI1) const;\n std::complex CpScconjScVZ(int gI2, int gI1) const;\n std::complex CpSdconjSdVZ(int gI2, int gI1) const;\n std::complex CpSeconjSeVZ(int gI2, int gI1) const;\n std::complex CpSmconjSmVZ(int gI2, int gI1) const;\n std::complex CpSsconjSsVZ(int gI2, int gI1) const;\n std::complex CpStconjStVZ(int gI2, int gI1) const;\n std::complex CpStauconjStauVZ(int gI2, int gI1) const;\n std::complex CpSuconjSuVZ(int gI2, int gI1) const;\n std::complex CpbarChaChaVZPL(int gI1, int gI2) const;\n std::complex CpbarChaChaVZPR(int gI1, int gI2) const;\n std::complex CpChiChiVZPL(int gI1, int gI2) const;\n std::complex CpChiChiVZPR(int gI1, int gI2) const;\n std::complex CphhVZVZ(int gI2) const;\n std::complex CpHpmconjVWmVZ(int gI2) const;\n double CpbarFbFbVZPL() const;\n double CpbarFbFbVZPR() const;\n double CpbarFcFcVZPL() const;\n double CpbarFcFcVZPR() const;\n double CpbarFdFdVZPL() const;\n double CpbarFdFdVZPR() const;\n double CpbarFsFsVZPL() const;\n double CpbarFsFsVZPR() const;\n double CpbarFtFtVZPL() const;\n double CpbarFtFtVZPR() const;\n double CpbarFuFuVZPL() const;\n double CpbarFuFuVZPR() const;\n double CpconjVWmVWmVZVZ1() const;\n double CpconjVWmVWmVZVZ2() const;\n double CpconjVWmVWmVZVZ3() const;\n double CpbargPgWmconjVWm() const;\n double CpbargWmCgPconjVWm() const;\n double CpbargWmCgZconjVWm() const;\n double CpbargZgWmconjVWm() const;\n double CpbarFveFeconjVWmPL() const;\n double CpbarFveFeconjVWmPR() const;\n double CpbarFvmFmconjVWmPL() const;\n double CpbarFvmFmconjVWmPR() const;\n double CpbarFvtFtauconjVWmPL() const;\n double CpbarFvtFtauconjVWmPR() const;\n std::complex CpAhAhconjVWmVWm(int gI1, int gI2) const;\n std::complex CphhhhconjVWmVWm(int gI1, int gI2) const;\n std::complex CpHpmconjHpmconjVWmVWm(int gI1, int gI2) const;\n std::complex CpSbconjSbconjVWmVWm(int gI1, int gI2) const;\n std::complex CpScconjScconjVWmVWm(int gI1, int gI2) const;\n std::complex CpSdconjSdconjVWmVWm(int gI1, int gI2) const;\n std::complex CpSeconjSeconjVWmVWm(int gI1, int gI2) const;\n std::complex CpSmconjSmconjVWmVWm(int gI1, int gI2) const;\n std::complex CpSsconjSsconjVWmVWm(int gI1, int gI2) const;\n std::complex CpStconjStconjVWmVWm(int gI1, int gI2) const;\n std::complex CpStauconjStauconjVWmVWm(int gI1, int gI2) const;\n std::complex CpSuconjSuconjVWmVWm(int gI1, int gI2) const;\n std::complex CpAhHpmconjVWm(int gI2, int gI1) const;\n std::complex CphhHpmconjVWm(int gI2, int gI1) const;\n std::complex CpSbconjStconjVWm(int gI2, int gI1) const;\n std::complex CpSdconjSuconjVWm(int gI2, int gI1) const;\n std::complex CpSsconjScconjVWm(int gI2, int gI1) const;\n std::complex CpChiChaconjVWmPL(int gI1, int gI2) const;\n std::complex CpChiChaconjVWmPR(int gI1, int gI2) const;\n std::complex CphhconjVWmVWm(int gI2) const;\n double CpbarFcFsconjVWmPL() const;\n double CpbarFcFsconjVWmPR() const;\n double CpbarFtFbconjVWmPL() const;\n double CpbarFtFbconjVWmPR() const;\n double CpbarFuFdconjVWmPL() const;\n double CpbarFuFdconjVWmPR() const;\n double CpconjVWmconjVWmVWmVWm1() const;\n double CpconjVWmconjVWmVWmVWm2() const;\n double CpconjVWmconjVWmVWmVWm3() const;\n std::complex CpbarChaUChiHpmPL(int gI1, int gO2, int gI2) const;\n std::complex CpbarChaUChiHpmPR(int gI1, int gO1, int gI2) const;\n std::complex CpUChiChaconjHpmPL(int gO2, int gI2, int gI1) const;\n std::complex CpUChiChaconjHpmPR(int gO1, int gI2, int gI1) const;\n std::complex CpChiUChihhPL(int gI2, int gO2, int gI1) const;\n std::complex CpChiUChihhPR(int gI2, int gO1, int gI1) const;\n std::complex CpbarChaUChiVWmPL(int gI1, int gO2) const;\n std::complex CpbarChaUChiVWmPR(int gI1, int gO1) const;\n std::complex CpUChiFbconjSbPL(int gO2, int gI1) const;\n std::complex CpUChiFbconjSbPR(int gO1, int gI1) const;\n std::complex CpUChiFcconjScPL(int gO2, int gI1) const;\n std::complex CpUChiFcconjScPR(int gO1, int gI1) const;\n std::complex CpUChiFdconjSdPL(int gO2, int gI1) const;\n std::complex CpUChiFdconjSdPR(int gO1, int gI1) const;\n std::complex CpUChiFeconjSePL(int gO2, int gI1) const;\n std::complex CpUChiFeconjSePR(int gO1, int gI1) const;\n std::complex CpUChiFmconjSmPL(int gO2, int gI1) const;\n std::complex CpUChiFmconjSmPR(int gO1, int gI1) const;\n std::complex CpUChiFsconjSsPL(int gO2, int gI1) const;\n std::complex CpUChiFsconjSsPR(int gO1, int gI1) const;\n std::complex CpUChiFtconjStPL(int gO2, int gI1) const;\n std::complex CpUChiFtconjStPR(int gO1, int gI1) const;\n std::complex CpUChiFtauconjStauPL(int gO2, int gI1) const;\n std::complex CpUChiFtauconjStauPR(int gO1, int gI1) const;\n std::complex CpUChiFuconjSuPL(int gO2, int gI1) const;\n std::complex CpUChiFuconjSuPR(int gO1, int gI1) const;\n std::complex CpChiUChiAhPL(int gI1, int gO2, int gI2) const;\n std::complex CpChiUChiAhPR(int gI1, int gO1, int gI2) const;\n std::complex CpbarFbUChiSbPL(int gO2, int gI2) const;\n std::complex CpbarFbUChiSbPR(int gO1, int gI2) const;\n std::complex CpbarFcUChiScPL(int gO2, int gI2) const;\n std::complex CpbarFcUChiScPR(int gO1, int gI2) const;\n std::complex CpbarFdUChiSdPL(int gO2, int gI2) const;\n std::complex CpbarFdUChiSdPR(int gO1, int gI2) const;\n std::complex CpbarFeUChiSePL(int gO2, int gI2) const;\n std::complex CpbarFeUChiSePR(int gO1, int gI2) const;\n std::complex CpbarFmUChiSmPL(int gO2, int gI2) const;\n std::complex CpbarFmUChiSmPR(int gO1, int gI2) const;\n std::complex CpbarFsUChiSsPL(int gO2, int gI2) const;\n std::complex CpbarFsUChiSsPR(int gO1, int gI2) const;\n std::complex CpbarFtUChiStPL(int gO2, int gI2) const;\n std::complex CpbarFtUChiStPR(int gO1, int gI2) const;\n std::complex CpbarFtauUChiStauPL(int gO2, int gI2) const;\n std::complex CpbarFtauUChiStauPR(int gO1, int gI2) const;\n std::complex CpbarFuUChiSuPL(int gO2, int gI2) const;\n std::complex CpbarFuUChiSuPR(int gO1, int gI2) const;\n std::complex CpUChiChaconjVWmPR(int gO2, int gI2) const;\n std::complex CpUChiChaconjVWmPL(int gO1, int gI2) const;\n std::complex CpChiUChiVZPL(int gI2, int gO2) const;\n std::complex CpChiUChiVZPR(int gI2, int gO1) const;\n double CpbarFveUChiSveLPL(int ) const;\n std::complex CpbarFveUChiSveLPR(int gO1) const;\n double CpbarFvmUChiSvmLPL(int ) const;\n std::complex CpbarFvmUChiSvmLPR(int gO1) const;\n double CpbarFvtUChiSvtLPL(int ) const;\n std::complex CpbarFvtUChiSvtLPR(int gO1) const;\n std::complex CpUChiFveconjSveLPL(int gO2) const;\n double CpUChiFveconjSveLPR(int ) const;\n std::complex CpUChiFvmconjSvmLPL(int gO2) const;\n double CpUChiFvmconjSvmLPR(int ) const;\n std::complex CpUChiFvtconjSvtLPL(int gO2) const;\n double CpUChiFvtconjSvtLPR(int ) const;\n std::complex CpbarUChaChaAhPL(int gO2, int gI1, int gI2) const;\n std::complex CpbarUChaChaAhPR(int gO1, int gI1, int gI2) const;\n std::complex CpbarUChaChahhPL(int gO2, int gI2, int gI1) const;\n std::complex CpbarUChaChahhPR(int gO1, int gI2, int gI1) const;\n std::complex CpbarUChaChiHpmPL(int gO2, int gI2, int gI1) const;\n std::complex CpbarUChaChiHpmPR(int gO1, int gI2, int gI1) const;\n std::complex CpbarUChaFbconjStPL(int gO2, int gI1) const;\n std::complex CpbarUChaFbconjStPR(int gO1, int gI1) const;\n std::complex CpbarUChaFdconjSuPL(int gO2, int gI1) const;\n std::complex CpbarUChaFdconjSuPR(int gO1, int gI1) const;\n std::complex CpbarUChaFsconjScPL(int gO2, int gI1) const;\n std::complex CpbarUChaFsconjScPR(int gO1, int gI1) const;\n std::complex CpbarFcbarUChaSsPL(int gO2, int gI2) const;\n std::complex CpbarFcbarUChaSsPR(int gO1, int gI2) const;\n std::complex CpbarFtbarUChaSbPL(int gO2, int gI2) const;\n std::complex CpbarFtbarUChaSbPR(int gO1, int gI2) const;\n std::complex CpbarFubarUChaSdPL(int gO2, int gI2) const;\n std::complex CpbarFubarUChaSdPR(int gO1, int gI2) const;\n double CpbarFvebarUChaSePL(int , int ) const;\n std::complex CpbarFvebarUChaSePR(int gO1, int gI2) const;\n double CpbarFvmbarUChaSmPL(int , int ) const;\n std::complex CpbarFvmbarUChaSmPR(int gO1, int gI2) const;\n double CpbarFvtbarUChaStauPL(int , int ) const;\n std::complex CpbarFvtbarUChaStauPR(int gO1, int gI2) const;\n std::complex CpbarUChaChaVPPR(int gO2, int gI2) const;\n std::complex CpbarUChaChaVPPL(int gO1, int gI2) const;\n std::complex CpbarUChaChaVZPR(int gO2, int gI2) const;\n std::complex CpbarUChaChaVZPL(int gO1, int gI2) const;\n std::complex CpbarUChaChiVWmPR(int gO2, int gI2) const;\n std::complex CpbarUChaChiVWmPL(int gO1, int gI2) const;\n double CpbarUChaFeconjSveLPL(int gO2) const;\n double CpbarUChaFeconjSveLPR(int gO1) const;\n double CpbarUChaFmconjSvmLPL(int gO2) const;\n double CpbarUChaFmconjSvmLPR(int gO1) const;\n double CpbarUChaFtauconjSvtLPL(int gO2) const;\n double CpbarUChaFtauconjSvtLPR(int gO1) const;\n std::complex CpGluFbconjSbPL(int gI1) const;\n std::complex CpGluFbconjSbPR(int gI1) const;\n std::complex CpGluFcconjScPL(int gI1) const;\n std::complex CpGluFcconjScPR(int gI1) const;\n std::complex CpGluFdconjSdPL(int gI1) const;\n std::complex CpGluFdconjSdPR(int gI1) const;\n std::complex CpGluFsconjSsPL(int gI1) const;\n std::complex CpGluFsconjSsPR(int gI1) const;\n std::complex CpGluFtconjStPL(int gI1) const;\n std::complex CpGluFtconjStPR(int gI1) const;\n std::complex CpGluFuconjSuPL(int gI1) const;\n std::complex CpGluFuconjSuPR(int gI1) const;\n std::complex CpbarFbGluSbPL(int gI2) const;\n std::complex CpbarFbGluSbPR(int gI2) const;\n std::complex CpbarFcGluScPL(int gI2) const;\n std::complex CpbarFcGluScPR(int gI2) const;\n std::complex CpbarFdGluSdPL(int gI2) const;\n std::complex CpbarFdGluSdPR(int gI2) const;\n std::complex CpbarFsGluSsPL(int gI2) const;\n std::complex CpbarFsGluSsPR(int gI2) const;\n std::complex CpbarFtGluStPL(int gI2) const;\n std::complex CpbarFtGluStPR(int gI2) const;\n std::complex CpbarFuGluSuPL(int gI2) const;\n std::complex CpbarFuGluSuPR(int gI2) const;\n std::complex CpbarFdChaSuPL(int gI2, int gI1) const;\n std::complex CpbarFdChaSuPR(int gI2, int gI1) const;\n std::complex CpbarFdChiSdPL(int gI2, int gI1) const;\n std::complex CpbarFdChiSdPR(int gI2, int gI1) const;\n std::complex CpbarFdFdhhPL(int gI1) const;\n std::complex CpbarFdFdhhPR(int gI1) const;\n std::complex CpbarFdFuHpmPL(int gI1) const;\n std::complex CpbarFdFuHpmPR(int gI1) const;\n std::complex CpbarFdFdAhPL(int gI2) const;\n std::complex CpbarFdFdAhPR(int gI2) const;\n double CpbarFdFuVWmPR() const;\n double CpbarFdFuVWmPL() const;\n std::complex CpbarFsChaScPL(int gI2, int gI1) const;\n std::complex CpbarFsChaScPR(int gI2, int gI1) const;\n std::complex CpbarFsChiSsPL(int gI2, int gI1) const;\n std::complex CpbarFsChiSsPR(int gI2, int gI1) const;\n std::complex CpbarFsFcHpmPL(int gI1) const;\n std::complex CpbarFsFcHpmPR(int gI1) const;\n std::complex CpbarFsFshhPL(int gI1) const;\n std::complex CpbarFsFshhPR(int gI1) const;\n std::complex CpbarFsFsAhPL(int gI2) const;\n std::complex CpbarFsFsAhPR(int gI2) const;\n double CpbarFsFcVWmPR() const;\n double CpbarFsFcVWmPL() const;\n std::complex CpbarFbChaStPL(int gI2, int gI1) const;\n std::complex CpbarFbChaStPR(int gI2, int gI1) const;\n std::complex CpbarFbChiSbPL(int gI2, int gI1) const;\n std::complex CpbarFbChiSbPR(int gI2, int gI1) const;\n std::complex CpbarFbFbhhPL(int gI1) const;\n std::complex CpbarFbFbhhPR(int gI1) const;\n std::complex CpbarFbFtHpmPL(int gI1) const;\n std::complex CpbarFbFtHpmPR(int gI1) const;\n std::complex CpbarFbFbAhPL(int gI2) const;\n std::complex CpbarFbFbAhPR(int gI2) const;\n double CpbarFbFtVWmPR() const;\n double CpbarFbFtVWmPL() const;\n std::complex CpbarFubarChaSdPL(int gI1, int gI2) const;\n std::complex CpbarFubarChaSdPR(int gI1, int gI2) const;\n std::complex CpbarFuChiSuPL(int gI2, int gI1) const;\n std::complex CpbarFuChiSuPR(int gI2, int gI1) const;\n std::complex CpbarFuFdconjHpmPL(int gI1) const;\n std::complex CpbarFuFdconjHpmPR(int gI1) const;\n std::complex CpbarFuFuhhPL(int gI1) const;\n std::complex CpbarFuFuhhPR(int gI1) const;\n std::complex CpbarFuFuAhPL(int gI2) const;\n std::complex CpbarFuFuAhPR(int gI2) const;\n std::complex CpbarFcbarChaSsPL(int gI1, int gI2) const;\n std::complex CpbarFcbarChaSsPR(int gI1, int gI2) const;\n std::complex CpbarFcChiScPL(int gI2, int gI1) const;\n std::complex CpbarFcChiScPR(int gI2, int gI1) const;\n std::complex CpbarFcFchhPL(int gI1) const;\n std::complex CpbarFcFchhPR(int gI1) const;\n std::complex CpbarFcFsconjHpmPL(int gI1) const;\n std::complex CpbarFcFsconjHpmPR(int gI1) const;\n std::complex CpbarFcFcAhPL(int gI2) const;\n std::complex CpbarFcFcAhPR(int gI2) const;\n std::complex CpbarFtbarChaSbPL(int gI1, int gI2) const;\n std::complex CpbarFtbarChaSbPR(int gI1, int gI2) const;\n std::complex CpbarFtChiStPL(int gI2, int gI1) const;\n std::complex CpbarFtChiStPR(int gI2, int gI1) const;\n std::complex CpbarFtFbconjHpmPL(int gI1) const;\n std::complex CpbarFtFbconjHpmPR(int gI1) const;\n std::complex CpbarFtFthhPL(int gI1) const;\n std::complex CpbarFtFthhPR(int gI1) const;\n std::complex CpbarFtFtAhPL(int gI2) const;\n std::complex CpbarFtFtAhPR(int gI2) const;\n double CpbarFvebarChaSePL(int , int ) const;\n std::complex CpbarFvebarChaSePR(int gI1, int gI2) const;\n double CpbarFveFeconjHpmPL(int ) const;\n std::complex CpbarFveFeconjHpmPR(int gI1) const;\n double CpbarFveChiSveLPL(int ) const;\n std::complex CpbarFveChiSveLPR(int gI2) const;\n double CpbarFvmbarChaSmPL(int , int ) const;\n std::complex CpbarFvmbarChaSmPR(int gI1, int gI2) const;\n double CpbarFvmFmconjHpmPL(int ) const;\n std::complex CpbarFvmFmconjHpmPR(int gI1) const;\n double CpbarFvmChiSvmLPL(int ) const;\n std::complex CpbarFvmChiSvmLPR(int gI2) const;\n double CpbarFvtbarChaStauPL(int , int ) const;\n std::complex CpbarFvtbarChaStauPR(int gI1, int gI2) const;\n double CpbarFvtFtauconjHpmPL(int ) const;\n std::complex CpbarFvtFtauconjHpmPR(int gI1) const;\n double CpbarFvtChiSvtLPL(int ) const;\n std::complex CpbarFvtChiSvtLPR(int gI2) const;\n std::complex CpbarFeChiSePL(int gI2, int gI1) const;\n std::complex CpbarFeChiSePR(int gI2, int gI1) const;\n std::complex CpbarFeFehhPL(int gI1) const;\n std::complex CpbarFeFehhPR(int gI1) const;\n std::complex CpbarFeFveHpmPL(int gI1) const;\n double CpbarFeFveHpmPR(int ) const;\n std::complex CpbarFeFeAhPL(int gI2) const;\n std::complex CpbarFeFeAhPR(int gI2) const;\n std::complex CpbarFeChaSveLPL(int gI2) const;\n std::complex CpbarFeChaSveLPR(int gI2) const;\n double CpbarFeFveVWmPR() const;\n double CpbarFeFveVWmPL() const;\n std::complex CpbarFmChiSmPL(int gI2, int gI1) const;\n std::complex CpbarFmChiSmPR(int gI2, int gI1) const;\n std::complex CpbarFmFmhhPL(int gI1) const;\n std::complex CpbarFmFmhhPR(int gI1) const;\n std::complex CpbarFmFvmHpmPL(int gI1) const;\n double CpbarFmFvmHpmPR(int ) const;\n std::complex CpbarFmFmAhPL(int gI2) const;\n std::complex CpbarFmFmAhPR(int gI2) const;\n std::complex CpbarFmChaSvmLPL(int gI2) const;\n std::complex CpbarFmChaSvmLPR(int gI2) const;\n double CpbarFmFvmVWmPR() const;\n double CpbarFmFvmVWmPL() const;\n std::complex CpbarFtauChiStauPL(int gI2, int gI1) const;\n std::complex CpbarFtauChiStauPR(int gI2, int gI1) const;\n std::complex CpbarFtauFtauhhPL(int gI1) const;\n std::complex CpbarFtauFtauhhPR(int gI1) const;\n std::complex CpbarFtauFvtHpmPL(int gI1) const;\n double CpbarFtauFvtHpmPR(int ) const;\n std::complex CpbarFtauFtauAhPL(int gI2) const;\n std::complex CpbarFtauFtauAhPR(int gI2) const;\n std::complex CpbarFtauChaSvtLPL(int gI2) const;\n std::complex CpbarFtauChaSvtLPR(int gI2) const;\n double CpbarFtauFvtVWmPR() const;\n double CpbarFtauFvtVWmPL() const;\n std::complex self_energy_Sd_1loop(double p , int gO1, int gO2) const;\n Eigen::Matrix,2,2> self_energy_Sd_1loop(double p) const;\n std::complex self_energy_Su_1loop(double p , int gO1, int gO2) const;\n Eigen::Matrix,2,2> self_energy_Su_1loop(double p) const;\n std::complex self_energy_Se_1loop(double p , int gO1, int gO2) const;\n Eigen::Matrix,2,2> self_energy_Se_1loop(double p) const;\n std::complex self_energy_Sm_1loop(double p , int gO1, int gO2) const;\n Eigen::Matrix,2,2> self_energy_Sm_1loop(double p) const;\n std::complex self_energy_Stau_1loop(double p , int gO1, int gO2) const;\n Eigen::Matrix,2,2> self_energy_Stau_1loop(double p) const;\n std::complex self_energy_Ss_1loop(double p , int gO1, int gO2) const;\n Eigen::Matrix,2,2> self_energy_Ss_1loop(double p) const;\n std::complex self_energy_Sc_1loop(double p , int gO1, int gO2) const;\n Eigen::Matrix,2,2> self_energy_Sc_1loop(double p) const;\n std::complex self_energy_Sb_1loop(double p , int gO1, int gO2) const;\n Eigen::Matrix,2,2> self_energy_Sb_1loop(double p) const;\n std::complex self_energy_St_1loop(double p , int gO1, int gO2) const;\n Eigen::Matrix,2,2> self_energy_St_1loop(double p) const;\n std::complex self_energy_hh_1loop(double p , int gO1, int gO2) const;\n Eigen::Matrix,2,2> self_energy_hh_1loop(double p) const;\n std::complex self_energy_Ah_1loop(double p , int gO1, int gO2) const;\n Eigen::Matrix,2,2> self_energy_Ah_1loop(double p) const;\n std::complex self_energy_Hpm_1loop(double p , int gO1, int gO2) const;\n Eigen::Matrix,2,2> self_energy_Hpm_1loop(double p) const;\n std::complex self_energy_SveL_1loop(double p ) const;\n std::complex self_energy_SvmL_1loop(double p ) const;\n std::complex self_energy_SvtL_1loop(double p ) const;\n std::complex self_energy_VG_1loop(double p ) const;\n std::complex self_energy_VP_1loop(double p ) const;\n std::complex self_energy_VZ_1loop(double p ) const;\n std::complex self_energy_VWm_1loop(double p ) const;\n std::complex self_energy_Chi_1loop_1(double p , int gO1, int gO2) const;\n Eigen::Matrix,4,4> self_energy_Chi_1loop_1(double p) const;\n std::complex self_energy_Chi_1loop_PR(double p , int gO1, int gO2) const;\n Eigen::Matrix,4,4> self_energy_Chi_1loop_PR(double p) const;\n std::complex self_energy_Chi_1loop_PL(double p , int gO1, int gO2) const;\n Eigen::Matrix,4,4> self_energy_Chi_1loop_PL(double p) const;\n std::complex self_energy_Cha_1loop_1(double p , int gO1, int gO2) const;\n Eigen::Matrix,2,2> self_energy_Cha_1loop_1(double p) const;\n std::complex self_energy_Cha_1loop_PR(double p , int gO1, int gO2) const;\n Eigen::Matrix,2,2> self_energy_Cha_1loop_PR(double p) const;\n std::complex self_energy_Cha_1loop_PL(double p , int gO1, int gO2) const;\n Eigen::Matrix,2,2> self_energy_Cha_1loop_PL(double p) const;\n std::complex self_energy_Glu_1loop_1(double p ) const;\n std::complex self_energy_Glu_1loop_PR(double p ) const;\n std::complex self_energy_Glu_1loop_PL(double p ) const;\n std::complex self_energy_Fd_1loop_1(double p ) const;\n std::complex self_energy_Fd_1loop_PR(double p ) const;\n std::complex self_energy_Fd_1loop_PL(double p ) const;\n std::complex self_energy_Fs_1loop_1(double p ) const;\n std::complex self_energy_Fs_1loop_PR(double p ) const;\n std::complex self_energy_Fs_1loop_PL(double p ) const;\n std::complex self_energy_Fb_1loop_1(double p ) const;\n std::complex self_energy_Fb_1loop_PR(double p ) const;\n std::complex self_energy_Fb_1loop_PL(double p ) const;\n std::complex self_energy_Fu_1loop_1(double p ) const;\n std::complex self_energy_Fu_1loop_PR(double p ) const;\n std::complex self_energy_Fu_1loop_PL(double p ) const;\n std::complex self_energy_Fc_1loop_1(double p ) const;\n std::complex self_energy_Fc_1loop_PR(double p ) const;\n std::complex self_energy_Fc_1loop_PL(double p ) const;\n std::complex self_energy_Ft_1loop_1(double p ) const;\n std::complex self_energy_Ft_1loop_PR(double p ) const;\n std::complex self_energy_Ft_1loop_PL(double p ) const;\n std::complex self_energy_Fve_1loop_1(double p ) const;\n std::complex self_energy_Fve_1loop_PR(double p ) const;\n std::complex self_energy_Fve_1loop_PL(double p ) const;\n std::complex self_energy_Fvm_1loop_1(double p ) const;\n std::complex self_energy_Fvm_1loop_PR(double p ) const;\n std::complex self_energy_Fvm_1loop_PL(double p ) const;\n std::complex self_energy_Fvt_1loop_1(double p ) const;\n std::complex self_energy_Fvt_1loop_PR(double p ) const;\n std::complex self_energy_Fvt_1loop_PL(double p ) const;\n std::complex self_energy_Fe_1loop_1(double p ) const;\n std::complex self_energy_Fe_1loop_PR(double p ) const;\n std::complex self_energy_Fe_1loop_PL(double p ) const;\n std::complex self_energy_Fm_1loop_1(double p ) const;\n std::complex self_energy_Fm_1loop_PR(double p ) const;\n std::complex self_energy_Fm_1loop_PL(double p ) const;\n std::complex self_energy_Ftau_1loop_1(double p ) const;\n std::complex self_energy_Ftau_1loop_PR(double p ) const;\n std::complex self_energy_Ftau_1loop_PL(double p ) const;\n std::complex self_energy_Fb_1loop_1_heavy_rotated(double p ) const;\n std::complex self_energy_Fb_1loop_PR_heavy_rotated(double p ) const;\n std::complex self_energy_Fb_1loop_PL_heavy_rotated(double p ) const;\n std::complex self_energy_Fe_1loop_1_heavy_rotated(double p ) const;\n std::complex self_energy_Fe_1loop_PR_heavy_rotated(double p ) const;\n std::complex self_energy_Fe_1loop_PL_heavy_rotated(double p ) const;\n std::complex self_energy_Fm_1loop_1_heavy_rotated(double p ) const;\n std::complex self_energy_Fm_1loop_PR_heavy_rotated(double p ) const;\n std::complex self_energy_Fm_1loop_PL_heavy_rotated(double p ) const;\n std::complex self_energy_Ftau_1loop_1_heavy_rotated(double p ) const;\n std::complex self_energy_Ftau_1loop_PR_heavy_rotated(double p ) const;\n std::complex self_energy_Ftau_1loop_PL_heavy_rotated(double p ) const;\n std::complex self_energy_Ft_1loop_1_heavy_rotated(double p ) const;\n std::complex self_energy_Ft_1loop_PR_heavy_rotated(double p ) const;\n std::complex self_energy_Ft_1loop_PL_heavy_rotated(double p ) const;\n std::complex self_energy_Ft_1loop_1_heavy(double p ) const;\n std::complex self_energy_Ft_1loop_PR_heavy(double p ) const;\n std::complex self_energy_Ft_1loop_PL_heavy(double p ) const;\n std::complex tadpole_hh_1loop(int gO1) const;\n\n\n /// calculates the tadpoles at current loop order\n void tadpole_equations(double[number_of_ewsb_equations]) const;\n /// calculates the tadpoles at current loop order\n Eigen::Matrix tadpole_equations() const;\n /// calculates the tadpoles divided by VEVs at current loop order\n Eigen::Matrix tadpole_equations_over_vevs() const;\n\n void calculate_MTopSquark_2nd_generation(double&, double&, double&) const;\n void calculate_MBottomSquark_2nd_generation(double&, double&, double&) const;\n void calculate_MSneutrino_2nd_generation(double&, double&, double&) const;\n void calculate_MSelectron_2nd_generation(double&, double&, double&) const;\n\n void calculate_MTopSquark_3rd_generation(double&, double&, double&) const;\n void calculate_MBottomSquark_3rd_generation(double&, double&, double&) const;\n void calculate_MSneutrino_3rd_generation(double&, double&, double&) const;\n void calculate_MSelectron_3rd_generation(double&, double&, double&) const;\n\n Eigen::Matrix self_energy_hh_2loop() const;\n Eigen::Matrix self_energy_Ah_2loop() const;\n\n Eigen::Matrix tadpole_hh_2loop() const;\n\n\n void calculate_MVG_pole();\n void calculate_MGlu_pole();\n void calculate_MVP_pole();\n void calculate_MVZ_pole();\n void calculate_MFd_pole();\n void calculate_MFs_pole();\n void calculate_MFb_pole();\n void calculate_MFu_pole();\n void calculate_MFc_pole();\n void calculate_MFt_pole();\n void calculate_MFve_pole();\n void calculate_MFvm_pole();\n void calculate_MFvt_pole();\n void calculate_MFe_pole();\n void calculate_MFm_pole();\n void calculate_MFtau_pole();\n void calculate_MSveL_pole();\n void calculate_MSvmL_pole();\n void calculate_MSvtL_pole();\n void calculate_MSd_pole();\n void calculate_MSu_pole();\n void calculate_MSe_pole();\n void calculate_MSm_pole();\n void calculate_MStau_pole();\n void calculate_MSs_pole();\n void calculate_MSc_pole();\n void calculate_MSb_pole();\n void calculate_MSt_pole();\n void calculate_Mhh_pole();\n void calculate_MAh_pole();\n void calculate_MHpm_pole();\n void calculate_MChi_pole();\n void calculate_MCha_pole();\n void calculate_MVWm_pole();\n double calculate_MVWm_pole(double);\n double calculate_MVZ_pole(double);\n\n double calculate_MFve_DRbar(double) const;\n double calculate_MFvm_DRbar(double) const;\n double calculate_MFvt_DRbar(double) const;\n double calculate_MFe_DRbar(double) const;\n double calculate_MFm_DRbar(double) const;\n double calculate_MFtau_DRbar(double) const;\n double calculate_MFu_DRbar(double) const;\n double calculate_MFc_DRbar(double) const;\n double calculate_MFt_DRbar(double) const;\n double calculate_MFd_DRbar(double) const;\n double calculate_MFs_DRbar(double) const;\n double calculate_MFb_DRbar(double) const;\n double calculate_MVP_DRbar(double);\n double calculate_MVZ_DRbar(double);\n double calculate_MVWm_DRbar(double);\n\n double v() const;\n double Betax() const;\n double Alpha() const;\n double ThetaW() const;\n\n\nprivate:\n int ewsb_loop_order{2}; ///< loop order for EWSB\n int pole_mass_loop_order{2}; ///< loop order for pole masses\n bool calculate_sm_pole_masses{false}; ///< switch to calculate the pole masses of the Standard Model particles\n bool calculate_bsm_pole_masses{true}; ///< switch to calculate the pole masses of the BSM particles\n bool force_output{false}; ///< switch to force output of pole masses\n double precision{1.e-3}; ///< RG running precision\n double ewsb_iteration_precision{1.e-5};///< precision goal of EWSB solution\n MSSMNoFV_physical physical{}; ///< contains the pole masses and mixings\n Problems problems{MSSMNoFV_info::model_name,\n &MSSMNoFV_info::particle_names_getter,\n &MSSMNoFV_info::parameter_names_getter}; ///< problems\n Loop_corrections loop_corrections{}; ///< used pole mass corrections\n std::shared_ptr ewsb_solver{};\n Threshold_corrections threshold_corrections{}; ///< used threshold corrections\n\n int get_number_of_ewsb_iterations() const;\n int get_number_of_mass_iterations() const;\n int solve_ewsb_tree_level_custom();\n void copy_DRbar_masses_to_pole_masses();\n\n // Passarino-Veltman loop functions\n double A0(double) const noexcept;\n double B0(double, double, double) const noexcept;\n double B1(double, double, double) const noexcept;\n double B00(double, double, double) const noexcept;\n double B22(double, double, double) const noexcept;\n double H0(double, double, double) const noexcept;\n double F0(double, double, double) const noexcept;\n double G0(double, double, double) const noexcept;\n\n // DR-bar masses\n double MVG{};\n double MGlu{};\n double MFd{};\n double MFs{};\n double MFb{};\n double MFu{};\n double MFc{};\n double MFt{};\n double MFve{};\n double MFvm{};\n double MFvt{};\n double MFe{};\n double MFm{};\n double MFtau{};\n double MSveL{};\n double MSvmL{};\n double MSvtL{};\n Eigen::Array MSd{Eigen::Array::Zero()};\n Eigen::Array MSu{Eigen::Array::Zero()};\n Eigen::Array MSe{Eigen::Array::Zero()};\n Eigen::Array MSm{Eigen::Array::Zero()};\n Eigen::Array MStau{Eigen::Array::Zero()};\n Eigen::Array MSs{Eigen::Array::Zero()};\n Eigen::Array MSc{Eigen::Array::Zero()};\n Eigen::Array MSb{Eigen::Array::Zero()};\n Eigen::Array MSt{Eigen::Array::Zero()};\n Eigen::Array Mhh{Eigen::Array::Zero()};\n Eigen::Array MAh{Eigen::Array::Zero()};\n Eigen::Array MHpm{Eigen::Array::Zero()};\n Eigen::Array MChi{Eigen::Array::Zero()};\n Eigen::Array MCha{Eigen::Array::Zero()};\n double MVWm{};\n double MVP{};\n double MVZ{};\n\n // DR-bar mixing matrices\n Eigen::Matrix ZD{Eigen::Matrix::Zero()};\n Eigen::Matrix ZU{Eigen::Matrix::Zero()};\n Eigen::Matrix ZE{Eigen::Matrix::Zero()};\n Eigen::Matrix ZM{Eigen::Matrix::Zero()};\n Eigen::Matrix ZTau{Eigen::Matrix::Zero()};\n Eigen::Matrix ZS{Eigen::Matrix::Zero()};\n Eigen::Matrix ZC{Eigen::Matrix::Zero()};\n Eigen::Matrix ZB{Eigen::Matrix::Zero()};\n Eigen::Matrix ZT{Eigen::Matrix::Zero()};\n Eigen::Matrix ZH{Eigen::Matrix::Zero()};\n Eigen::Matrix ZA{Eigen::Matrix::Zero()};\n Eigen::Matrix ZP{Eigen::Matrix::Zero()};\n Eigen::Matrix,4,4> ZN{Eigen::Matrix,4,4>::Zero()};\n Eigen::Matrix,2,2> UM{Eigen::Matrix,2,2>::Zero()};\n Eigen::Matrix,2,2> UP{Eigen::Matrix,2,2>::Zero()};\n Eigen::Matrix ZZ{Eigen::Matrix::Zero()};\n\n // phases\n std::complex PhaseGlu{1.,0.};\n\n // extra parameters\n\n};\n\nstd::ostream& operator<<(std::ostream&, const MSSMNoFV_mass_eigenstates&);\n\n} // namespace flexiblesusy\n\n#endif\n", "meta": {"hexsha": "16571237307df89cea751625f0a805f0b217a68b", "size": 84528, "ext": "hpp", "lang": "C++", "max_stars_repo_path": "contrib/MassSpectra/flexiblesusy/models/MSSMNoFV/MSSMNoFV_mass_eigenstates.hpp", "max_stars_repo_name": "sebhoof/gambit_1.5", "max_stars_repo_head_hexsha": "f9a3f788e3331067c555ae1a030420e903c6fdcd", "max_stars_repo_licenses": ["Unlicense"], "max_stars_count": 2.0, "max_stars_repo_stars_event_min_datetime": "2020-09-08T20:05:27.000Z", "max_stars_repo_stars_event_max_datetime": "2021-04-26T07:57:56.000Z", "max_issues_repo_path": "contrib/MassSpectra/flexiblesusy/models/MSSMNoFV/MSSMNoFV_mass_eigenstates.hpp", "max_issues_repo_name": "sebhoof/gambit_1.5", "max_issues_repo_head_hexsha": "f9a3f788e3331067c555ae1a030420e903c6fdcd", "max_issues_repo_licenses": ["Unlicense"], "max_issues_count": 9.0, "max_issues_repo_issues_event_min_datetime": "2020-10-19T09:56:17.000Z", "max_issues_repo_issues_event_max_datetime": "2021-05-28T06:12:03.000Z", "max_forks_repo_path": "contrib/MassSpectra/flexiblesusy/models/MSSMNoFV/MSSMNoFV_mass_eigenstates.hpp", "max_forks_repo_name": "patscott/gambit_1.4", "max_forks_repo_head_hexsha": "a50537419918089effc207e8b206489a5cfd2258", "max_forks_repo_licenses": ["Unlicense"], "max_forks_count": 5.0, "max_forks_repo_forks_event_min_datetime": "2020-09-08T02:23:34.000Z", "max_forks_repo_forks_event_max_datetime": "2021-03-23T08:48:04.000Z", "avg_line_length": 57.2682926829, "max_line_length": 114, "alphanum_fraction": 0.7379093318, "num_tokens": 31269, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.5926665999540697, "lm_q2_score": 0.2509127924867847, "lm_q1q2_score": 0.14870763160812372}} {"text": "/*\n * Sector file\n * \n * This file is part of the \"SoftPixel Engine\" (Copyright (c) 2008 by Lukas Hermanns)\n * See \"SoftPixelEngine.hpp\" for license information.\n */\n\n#include \"SceneGraph/spSceneSector.hpp\"\n\n#ifdef SP_COMPILE_WITH_SCENEGRAPH_PORTAL_BASED\n\n\n#include \"Base/spMemoryManagement.hpp\"\n#include \"Base/spMathCollisionLibrary.hpp\"\n#include \"SceneGraph/spScenePortal.hpp\"\n#include \"SceneGraph/spSceneCamera.hpp\"\n#include \"SceneGraph/spRenderNode.hpp\"\n\n#include \n\n\nnamespace sp\n{\nnamespace scene\n{\n\nSector::Sector()\n{\n}\nSector::~Sector()\n{\n}\n\nbool Sector::addPortal(Portal* PortalObj)\n{\n if (PortalObj && PortalObj->connect(this))\n {\n Portals_.push_back(PortalObj);\n return true;\n }\n return false;\n}\n\nbool Sector::removePortal(Portal* PortalObj)\n{\n if (PortalObj && PortalObj->disconnect(this))\n {\n MemoryManager::removeElement(Portals_, PortalObj);\n return true;\n }\n return false;\n}\n\nvoid Sector::clearPortals()\n{\n Portals_.clear();\n}\n\nvoid Sector::addRenderNode(RenderNode* NodeObj)\n{\n if (NodeObj && !MemoryManager::hasElement(RenderNodes_, NodeObj))\n RenderNodes_.push_back(NodeObj);\n}\n\nvoid Sector::removeRenderNode(RenderNode* NodeObj)\n{\n MemoryManager::removeElement(RenderNodes_, NodeObj);\n}\n\nvoid Sector::clearRenderNodes()\n{\n RenderNodes_.clear();\n}\n\nf32 Sector::getPointDistance(const dim::vector3df &Point) const\n{\n return math::CollisionLibrary::getPointBoxDistance(BoundBox_, Point);\n}\n\nbool Sector::isPointInside(const dim::vector3df &Point) const\n{\n return ConvexHull_.isPointInside(InvTransform_ * Point);\n}\n\nbool Sector::isBoundingVolumeInsideInv(const BoundingVolume &BoundVolume, const dim::matrix4f &InvMatrix) const\n{\n switch (BoundVolume.getType())\n {\n case BOUNDING_SPHERE:\n return ConvexHull_.isPointInside(InvTransform_ * (InvMatrix.getPosition()), BoundVolume.getRadius());\n case BOUNDING_BOX:\n return ConvexHull_.isBoundBoxInsideInv(BoundVolume.getBox(), InvMatrix * getTransformation());\n default:\n break;\n }\n return false;\n}\n\nbool Sector::isPortalNearby(const Portal* PortalObj, f32 Tolerance) const\n{\n if (PortalObj)\n {\n /* Check if one of the portal's corners are nearby this sector */\n for (u32 i = 0; i < 4; ++i)\n {\n if (getPointDistance(PortalObj->getPoint(i)) < Tolerance || isPointInside(PortalObj->getPoint(i)))\n return true;\n }\n }\n return false;\n}\n\nvoid Sector::setTransformation(const dim::matrix4f &Transform)\n{\n /* Store inverse transformation */\n InvTransform_ = Transform.getInverse();\n \n /* Store oriented-bounding box */\n BoundBox_ = dim::obbox3df(\n Transform.getPosition(),\n Transform.vecRotate(dim::vector3df(0.5f, 0, 0)),\n Transform.vecRotate(dim::vector3df(0, 0.5f, 0)),\n Transform.vecRotate(dim::vector3df(0, 0, 0.5f))\n );\n \n /* Setup convex polyhedron */\n for (u32 i = 0; i < 6; ++i)\n ConvexHull_.getPlane(i) = dim::aabbox3df::CUBE.getPlane(i);\n}\n\ndim::matrix4f Sector::getTransformation() const\n{\n return InvTransform_.getInverse();\n}\n\n\n/*\n * ======= Private: =======\n */\n\nvoid Sector::render(\n Sector* Predecessor, const dim::vector3df &GlobalViewOrigin,\n ViewFrustum &Frustum, const dim::matrix4f &BaseMatrix)\n{\n /* Find portals */\n const ViewFrustum OrigFrustum(Frustum);\n \n foreach (Portal* PortalObj, Portals_)\n {\n if (!PortalObj->getEnable())\n continue;\n \n /*Check if this sector has a neighbor within this portal */\n Sector* Neighbor = PortalObj->getNeighbor(this);\n \n if (!Neighbor || Neighbor == Predecessor)\n continue;\n \n /* Transform current view-frustum through the portal */\n if (!PortalObj->transformViewFrustum(GlobalViewOrigin, Frustum))\n continue;\n \n /* Render next sector */\n Neighbor->render(this, GlobalViewOrigin, Frustum, BaseMatrix);\n \n Frustum = OrigFrustum;\n }\n \n /* Draw render nodes of this sector */\n foreach (RenderNode* Node, RenderNodes_)\n {\n if (Node->getVisible())\n {\n Node->updateTransformationBase(BaseMatrix);\n Node->render();\n }\n }\n}\n\n\n} // /namespace scene\n\n} // /namespace sp\n\n\n#endif\n\n\n\n// ================================================================================\n \n", "meta": {"hexsha": "9131053f651a416d48f2f5450fb66f192da92af1", "size": 4478, "ext": "cpp", "lang": "C++", "max_stars_repo_path": "sources/SceneGraph/spSceneSector.cpp", "max_stars_repo_name": "rontrek/softpixel", "max_stars_repo_head_hexsha": "73a13a67e044c93f5c3da9066eedbaf3805d6807", "max_stars_repo_licenses": ["Zlib"], "max_stars_count": 14.0, "max_stars_repo_stars_event_min_datetime": "2015-08-16T21:05:20.000Z", "max_stars_repo_stars_event_max_datetime": "2019-08-21T17:22:01.000Z", "max_issues_repo_path": "sources/SceneGraph/spSceneSector.cpp", "max_issues_repo_name": "rontrek/softpixel", "max_issues_repo_head_hexsha": "73a13a67e044c93f5c3da9066eedbaf3805d6807", "max_issues_repo_licenses": ["Zlib"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "sources/SceneGraph/spSceneSector.cpp", "max_forks_repo_name": "rontrek/softpixel", "max_forks_repo_head_hexsha": "73a13a67e044c93f5c3da9066eedbaf3805d6807", "max_forks_repo_licenses": ["Zlib"], "max_forks_count": 3.0, "max_forks_repo_forks_event_min_datetime": "2016-10-31T06:08:44.000Z", "max_forks_repo_forks_event_max_datetime": "2019-08-02T16:12:33.000Z", "avg_line_length": 23.3229166667, "max_line_length": 113, "alphanum_fraction": 0.6353282715, "num_tokens": 1090, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.5156199157230156, "lm_q2_score": 0.28776780354463427, "lm_q1q2_score": 0.14837881061148162}} {"text": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"gdindex.h\"\n#include \"../local_descriptor/sift_reader.h\"\n#include \"../../../common/feature_set/feature_set.h\"\n#include \"../../../common/utils/io_utils.h\"\n#include \"definition.h\"\n\nextern \"C\" {\n#include \n#include \n}\n\nusing namespace std;\n\nnamespace vrs\n{\nnamespace components\n{\n\nvoid copy_floats(const uint n, float* in, float* out)\n{\n\tfor (uint d = 0; d < n; d++) {\n\t\tout[d] = in[d];\n\t}\n}\n\nvoid gdindex::write(const string index_path)\n{\n\t// Open file for writing\n\tFILE* index_file = fopen(index_path.c_str(), \"wb\");\n\tif (index_file == nullptr) {\n\t\tfprintf(stderr, \"gdindex::write : Cannot open: %s\\n\", index_path.c_str());\n\t\texit(EXIT_FAILURE);\n\t}\n\n\t// Write number of global descriptors\n\tint number_gd_to_write = static_cast(index_.number_global_descriptors);\n\tfwrite(&number_gd_to_write, sizeof(int), 1, index_file);\n\n\t// Assert that we have data in index_ and that it makes sense,\n\t// and allocate helper variables\n\tif (index_parameters_.gd_unbinarized) {\n\t\tassert(index_.fv.size() != 0);\n\t\tassert(index_.fv.size() == index_.number_global_descriptors);\n\t\tassert(index_.fv.size() == index_.word_l1_norms.size());\n\t\tassert(index_.fv.size() == index_.word_total_soft_assignment.size());\n\t} else {\n\t\tassert(index_.word_descriptor.size() != 0);\n\t\tassert(index_.word_descriptor.size() == index_.number_global_descriptors);\n\t\tassert(index_.word_descriptor.size() == index_.word_l1_norms.size());\n\t\tassert(index_.word_descriptor.size() == index_.word_total_soft_assignment.size());\n\t}\n\tuint* word_descriptor_to_write =\n\t new uint[index_parameters_.gd_number_gaussians];\n\tfloat* fv_to_write =\n\t new float[index_parameters_.gd_number_gaussians\n\t *index_parameters_.ld_pca_dim];\n\tfloat* word_l1_norms_to_write =\n\t new float[index_parameters_.gd_number_gaussians];\n\tfloat* word_total_soft_assignment_to_write =\n\t new float[index_parameters_.gd_number_gaussians];\n\n\t// Loop over items in index and write them out\n\tfor (int count_item = 0; count_item < number_gd_to_write; count_item++) {\n\t\t// Collect data that will be written\n\t\tfor (uint count_gaussian = 0;\n\t\t count_gaussian < index_parameters_.gd_number_gaussians;\n\t\t count_gaussian++) {\n\t\t\tword_l1_norms_to_write[count_gaussian] =\n\t\t\t index_.word_l1_norms.at(count_item).at(count_gaussian);\n\t\t\tword_total_soft_assignment_to_write[count_gaussian] =\n\t\t\t index_.word_total_soft_assignment.at(count_item).at(count_gaussian);\n\t\t\tif (index_parameters_.gd_unbinarized) {\n\t\t\t\t// Get ld_pca_dim-sized vector for this Gaussian\n\t\t\t\tfor (uint d = 0; d < index_parameters_.ld_pca_dim; d++) {\n\t\t\t\t\tfv_to_write[count_gaussian*index_parameters_.ld_pca_dim\n\t\t\t\t\t + d]\n\t\t\t\t\t = index_.fv.at(count_item).at(count_gaussian\n\t\t\t\t\t *index_parameters_.ld_pca_dim\n\t\t\t\t\t + d);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tword_descriptor_to_write[count_gaussian] =\n\t\t\t\t index_.word_descriptor.at(count_item).at(count_gaussian);\n\t\t\t}\n\t\t}\n\t\t// Write to file\n\t\tfwrite(word_l1_norms_to_write, sizeof(float),\n\t\t index_parameters_.gd_number_gaussians, index_file);\n\t\tfwrite(word_total_soft_assignment_to_write, sizeof(float),\n\t\t index_parameters_.gd_number_gaussians, index_file);\n\t\tif (index_parameters_.gd_unbinarized) {\n\t\t\tfwrite(fv_to_write, sizeof(float),\n\t\t\t index_parameters_.gd_number_gaussians\n\t\t\t *index_parameters_.ld_pca_dim, index_file);\n\t\t} else {\n\t\t\tfwrite(word_descriptor_to_write, sizeof(uint),\n\t\t\t index_parameters_.gd_number_gaussians, index_file);\n\t\t}\n\t}\n\n\t// Clean up\n\tif (word_l1_norms_to_write != nullptr) {\n\t\tdelete [] word_l1_norms_to_write;\n\t\tword_l1_norms_to_write = nullptr;\n\t}\n\tif (word_total_soft_assignment_to_write != nullptr) {\n\t\tdelete [] word_total_soft_assignment_to_write;\n\t\tword_total_soft_assignment_to_write = nullptr;\n\t}\n\tif (word_descriptor_to_write != nullptr) {\n\t\tdelete [] word_descriptor_to_write;\n\t\tword_descriptor_to_write = nullptr;\n\t}\n\tif (fv_to_write != nullptr) {\n\t\tdelete [] fv_to_write;\n\t\tfv_to_write = nullptr;\n\t}\n\n\t// Close file\n\tfclose(index_file);\n}\n\nvoid gdindex::read(const string index_path, const bool both_sel_modes)\n{\n\t// Check that word selection mode is valid\n\tif (query_parameters_.word_selection_mode != WORD_L1_NORM &&\n\t query_parameters_.word_selection_mode != WORD_SOFT_ASSGN) {\n\t\tcout << \"Error! Mode \" << query_parameters_.word_selection_mode\n\t\t << \" is not allowed. Quitting...\"\n\t\t << endl;\n\t\texit(EXIT_FAILURE);\n\t}\n\n\t// Open file for reading\n\tFILE* index_file = fopen(index_path.c_str(), \"rb\");\n\tif (index_file == nullptr) {\n\t\tfprintf(stderr, \"gdindex::read : Cannot open: %s\\n\", index_path.c_str());\n\t\texit(EXIT_FAILURE);\n\t}\n\n\t// Read number of global descriptors\n\tint number_gd_to_read = 0;\n\tfread(&number_gd_to_read, sizeof(int), 1, index_file);\n\n\t// Size of current index\n\tuint current_db_size = index_.number_global_descriptors;\n\n\t// Allocate helper variables\n\tuint* word_descriptor_to_read =\n\t new uint[index_parameters_.gd_number_gaussians];\n\tfloat* fv_to_read =\n\t new float[index_parameters_.gd_number_gaussians\n\t *index_parameters_.ld_pca_dim];\n\tfloat* word_l1_norms_to_read =\n\t new float[index_parameters_.gd_number_gaussians];\n\tfloat* word_total_soft_assignment_to_read =\n\t new float[index_parameters_.gd_number_gaussians];\n\n\tif (index_parameters_.gd_unbinarized) {\n\t\tindex_.fv.resize(current_db_size + number_gd_to_read);\n\t} else {\n\t\tindex_.word_descriptor.resize(current_db_size + number_gd_to_read);\n\t}\n\t// Depending on both_sel_modes and query_parameters_.word_selection_mode,\n\t// we will load either BOTH l1 norms and total soft assignment information,\n\t// or only one of them.\n\tif (both_sel_modes || query_parameters_.word_selection_mode == WORD_L1_NORM) {\n\t\tindex_.word_l1_norms.resize(current_db_size + number_gd_to_read);\n\t}\n\tif (both_sel_modes || query_parameters_.word_selection_mode == WORD_SOFT_ASSGN) {\n\t\tindex_.word_total_soft_assignment.resize(current_db_size + number_gd_to_read);\n\t}\n\n\t// Loop over items, read and insert them into index_\n\tfor (uint count_item = current_db_size;\n\t count_item < current_db_size + number_gd_to_read;\n\t count_item++) {\n\t\t// Read data\n\t\tfread(word_l1_norms_to_read, sizeof(float),\n\t\t index_parameters_.gd_number_gaussians, index_file);\n\t\tfread(word_total_soft_assignment_to_read, sizeof(float),\n\t\t index_parameters_.gd_number_gaussians, index_file);\n\t\tif (index_parameters_.gd_unbinarized) {\n\t\t\tfread(fv_to_read, sizeof(float),\n\t\t\t index_parameters_.gd_number_gaussians\n\t\t\t *index_parameters_.ld_pca_dim, index_file);\n\t\t} else {\n\t\t\tfread(word_descriptor_to_read, sizeof(uint),\n\t\t\t index_parameters_.gd_number_gaussians, index_file);\n\t\t}\n\n\t\t// Insert data into index_\n\t\tif (both_sel_modes ||\n\t\t query_parameters_.word_selection_mode == WORD_L1_NORM) {\n\t\t\tindex_.word_l1_norms.at(count_item)\n\t\t\t.resize(index_parameters_.gd_number_gaussians);\n\t\t\tfor (uint count_gaussian = 0;\n\t\t\t count_gaussian < index_parameters_.gd_number_gaussians;\n\t\t\t count_gaussian++) {\n\t\t\t\tindex_.word_l1_norms.at(count_item).at(count_gaussian)\n\t\t\t\t = word_l1_norms_to_read[count_gaussian];\n\t\t\t}\n\t\t}\n\t\tif (both_sel_modes ||\n\t\t query_parameters_.word_selection_mode == WORD_SOFT_ASSGN) {\n\t\t\tindex_.word_total_soft_assignment.at(count_item)\n\t\t\t.resize(index_parameters_.gd_number_gaussians);\n\t\t\tfor (uint count_gaussian = 0;\n\t\t\t count_gaussian < index_parameters_.gd_number_gaussians;\n\t\t\t count_gaussian++) {\n\t\t\t\tindex_.word_total_soft_assignment.at(count_item).at(count_gaussian)\n\t\t\t\t = word_total_soft_assignment_to_read[count_gaussian];\n\t\t\t}\n\t\t}\n\t\tif (index_parameters_.gd_unbinarized) {\n\t\t\tindex_.fv.at(count_item)\n\t\t\t.resize(index_parameters_.gd_number_gaussians\n\t\t\t *index_parameters_.ld_pca_dim);\n\t\t\tfor (uint count_gaussian = 0;\n\t\t\t count_gaussian < index_parameters_.gd_number_gaussians;\n\t\t\t count_gaussian++) {\n\t\t\t\t// Get ld_pca_dim-sized vector for this Gaussian\n\t\t\t\tfor (uint d = 0; d < index_parameters_.ld_pca_dim; d++) {\n\t\t\t\t\tindex_.fv.at(count_item).at(count_gaussian\n\t\t\t\t\t *index_parameters_.ld_pca_dim\n\t\t\t\t\t + d) =\n\t\t\t\t\t fv_to_read[count_gaussian*index_parameters_.ld_pca_dim\n\t\t\t\t\t + d];\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tindex_.word_descriptor.at(count_item)\n\t\t\t.resize(index_parameters_.gd_number_gaussians);\n\t\t\tfor (uint count_gaussian = 0;\n\t\t\t count_gaussian < index_parameters_.gd_number_gaussians;\n\t\t\t count_gaussian++) {\n\t\t\t\tindex_.word_descriptor.at(count_item).at(count_gaussian)\n\t\t\t\t = word_descriptor_to_read[count_gaussian];\n\t\t\t}\n\t\t}\n\t}\n\n\t// Clean up\n\tif (word_l1_norms_to_read != nullptr) {\n\t\tdelete [] word_l1_norms_to_read;\n\t\tword_l1_norms_to_read = nullptr;\n\t}\n\tif (word_total_soft_assignment_to_read != nullptr) {\n\t\tdelete [] word_total_soft_assignment_to_read;\n\t\tword_total_soft_assignment_to_read = nullptr;\n\t}\n\tif (word_descriptor_to_read != nullptr) {\n\t\tdelete [] word_descriptor_to_read;\n\t\tword_descriptor_to_read = nullptr;\n\t}\n\tif (fv_to_read != nullptr) {\n\t\tdelete [] fv_to_read;\n\t\tfv_to_read = nullptr;\n\t}\n\n\t// Close file\n\tfclose(index_file);\n\n\t// Update other index_ variables, since now index has changed\n\tupdate_index();\n}\n\nvoid gdindex::write_frame_list(const string file_path)\n{\n\tofstream out_file;\n\tout_file.open(file_path.c_str());\n\tuint number_frames_in_db = index_.frame_numbers_in_db.size();\n\tfor (uint count_line = 0; count_line < number_frames_in_db; count_line++) {\n\t\tout_file << index_.frame_numbers_in_db.at(count_line) << endl;\n\t}\n\tout_file.close();\n}\n\nvoid gdindex::clean_index()\n{\n\tindex_.word_descriptor.clear();\n\tindex_.fv.clear();\n\tindex_.word_l1_norms.clear();\n\tindex_.word_total_soft_assignment.clear();\n\tindex_.frame_numbers_in_db.clear();\n\n\tupdate_index();\n}\n\nuint gdindex::get_number_global_descriptors()\n{\n\treturn index_.number_global_descriptors;\n}\n\nvoid gdindex::generate_index(const vector& feature_files,\n const int verbose_level)\n{\n\tuint number_files_to_process = feature_files.size();\n\n\t// Allocate space in index_\n\tindex_.word_l1_norms.resize(number_files_to_process);\n\tindex_.word_total_soft_assignment.resize(number_files_to_process);\n\tif (index_parameters_.gd_unbinarized) {\n\t\tindex_.fv.resize(number_files_to_process);\n\t} else {\n\t\tindex_.word_descriptor.resize(number_files_to_process);\n\t}\n\n\tuint number_files_processed = 0;\n\t#pragma omp parallel for\n\tfor (uint count_file = 0; count_file < number_files_to_process; count_file++) {\n\t\t// Load feature set\n\t\tif (!common::io_utils::is_file_exist(feature_files.at(count_file))) {\n\t\t\tfprintf(stderr, \"Missing feature file: %s\\n\",\n\t\t\t feature_files.at(count_file).c_str());\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\t\tcommon::feature_set feat_set;\n\t\tconst char *feat_file_path = feature_files[count_file].c_str();\n\t\tif (index_parameters_.ld_name == SIFT_NAME) {\n\t\t\tcomponents::sift_reader::read_sift_file(feat_file_path,\n\t\t\t index_parameters_.ld_frame_length,\n\t\t\t index_parameters_.ld_length,feat_set);\n\t\t} else if (index_parameters_.ld_name == SIFTGEO_NAME) {\n\t\t\tcomponents::sift_reader::read_sift_geo_file(feat_file_path,\n\t\t\t index_parameters_.ld_frame_length,\n\t\t\t index_parameters_.ld_length,feat_set);\n\t\t} else {\n\t\t\tcout << \"Local feature \" << index_parameters_.ld_name\n\t\t\t << \" is not supported\" << endl;\n\t\t}\n\n\t\t// Generate global signature, put in index_\n\t\tindex_.word_l1_norms.at(count_file).resize(index_parameters_.gd_number_gaussians);\n\t\tindex_.word_total_soft_assignment.at(count_file).resize(index_parameters_.gd_number_gaussians);\n\t\t// -- auxiliary vectors\n\t\tvector aux_gd_word_descriptor(index_parameters_.gd_number_gaussians);\n\t\tvector aux_gd_fv(index_parameters_.gd_number_gaussians\n\t\t *index_parameters_.ld_pca_dim);\n\t\tgenerate_global_descriptor(&feat_set,\n\t\t aux_gd_word_descriptor,\n\t\t aux_gd_fv,\n\t\t index_.word_l1_norms.at(count_file),\n\t\t index_.word_total_soft_assignment.at(count_file));\n\t\tif (index_parameters_.gd_unbinarized) {\n\t\t\tindex_.fv.at(count_file) = aux_gd_fv;\n\t\t} else {\n\t\t\tindex_.word_descriptor.at(count_file) = aux_gd_word_descriptor;\n\t\t}\n\n\t\t// Report status\n\t\t#pragma omp critical\n\t\t{\n\t\t\tnumber_files_processed++;\n\t\t}\n\t\tif (verbose_level >= 2) {\n\t\t\tprintf(\"[%06d, %06d] %04d features \\n\",\n\t\t\t count_file, number_files_processed, feat_set.get_num_features());\n\t\t}\n\t}\n\n\tupdate_index();\n}\n\nvoid gdindex::generate_index_shot_based(const vector& feature_files,\n const vector& shot_beg_frames,\n const int shot_mode, const int shot_keyf,\n const int verbose_level)\n{\n\tif (verbose_level >= 4) cout << \"Starting generate_index_shot_based...\"\n\t\t << endl;\n\tuint number_shots = shot_beg_frames.size();\n\tif (verbose_level >= 3) cout << \"Using \" << number_shots << \" shots\" << endl;\n\n\tuint number_frames_in_db = feature_files.size();\n\tif (verbose_level >= 3) cout << \"There are \" << number_frames_in_db\n\t\t << \" frames in the database.\" << endl;\n\n\t// The number of entries in the generated index will vary depending\n\t// on mode and shot_keyf\n\tuint number_entries_in_index = 0;\n\n\t// This vector is used only if frames in shot are stored independently.\n\t// It contains, for each shot number (first entry), a vector with indices\n\t// which are the places in the index where each frame will be placed.\n\tvector < vector < uint > > inds_indep_mode;\n\n\tif (shot_mode == SHOT_MODE_INDEP_KEYF) {\n\t\t// The number of global signatures will vary for this mode,\n\t\t// it depends on the number of frames in each shot, so\n\t\t// we need to calculate\n\t\tfor (uint count_shot = 0; count_shot < number_shots; count_shot++) {\n\t\t\tuint number_frames_this_shot;\n\t\t\t// Note: the number calculated in the following lines is a simple\n\t\t\t// subtraction, since the next number is not part of the shot, so\n\t\t\t// there's no +1 at the end of the calculation\n\t\t\tif (count_shot != number_shots - 1) {\n\t\t\t\tnumber_frames_this_shot = shot_beg_frames.at(count_shot + 1)\n\t\t\t\t - shot_beg_frames.at(count_shot);\n\t\t\t} else {\n\t\t\t\tnumber_frames_this_shot = number_frames_in_db\n\t\t\t\t - shot_beg_frames.at(count_shot);\n\t\t\t}\n\n\t\t\tuint n;\n\t\t\tif (shot_keyf != -1) {\n\t\t\t\tn = min(number_frames_this_shot, static_cast(shot_keyf));\n\t\t\t} else {\n\t\t\t\tn = number_frames_this_shot;\n\t\t\t}\n\n\t\t\tvector < uint > shot_inds;\n\t\t\tfor (uint count_f = 0; count_f < n; count_f++) {\n\t\t\t\tshot_inds.push_back(number_entries_in_index + count_f);\n\t\t\t}\n\n\t\t\tnumber_entries_in_index += n;\n\t\t\tinds_indep_mode.push_back(shot_inds);\n\t\t}\n\t} else if (shot_mode == SHOT_MODE_SHOT_AGG) {\n\t\t// This will generate only a global signature per shot\n\t\tnumber_entries_in_index = number_shots;\n\t} else {\n\t\tcout << \"Indexing for shot_mode \" << shot_mode\n\t\t << \" is not currently implemented. Quitting...\" << endl;\n\t\texit(EXIT_FAILURE);\n\t}\n\n\tif (verbose_level >= 2) cout << \"GD index will contain \"\n\t\t << number_entries_in_index << \" entries\" << endl;\n\n\t// Allocate space in index_\n\tindex_.word_l1_norms.resize(number_entries_in_index);\n\tindex_.word_total_soft_assignment.resize(number_entries_in_index);\n\tif (index_parameters_.gd_unbinarized) {\n\t\tindex_.fv.resize(number_entries_in_index);\n\t} else {\n\t\tindex_.word_descriptor.resize(number_entries_in_index);\n\t}\n\n\t// We will loop over shots and aggregate features depending on the mode\n\tuint count_index = 0;\n\t#pragma omp parallel for\n\tfor (uint count_shot = 0; count_shot < number_shots; count_shot++) {\n\t\tuint number_frames_this_shot;\n\t\t// Note: the number calculated in the following lines is a simple\n\t\t// subtraction, since the next number is not part of the shot, so\n\t\t// there's no +1 at the end of the calculation\n\t\tif (count_shot != number_shots - 1) {\n\t\t\tnumber_frames_this_shot = shot_beg_frames.at(count_shot + 1)\n\t\t\t - shot_beg_frames.at(count_shot);\n\t\t} else {\n\t\t\tnumber_frames_this_shot = number_frames_in_db\n\t\t\t - shot_beg_frames.at(count_shot);\n\t\t}\n\n\t\tif (verbose_level >= 3) cout << \"Doing shot \" << count_shot\n\t\t\t << \" out of \" << number_shots << endl;\n\t\tuint number_frames_to_use;\n\t\tif (shot_keyf != -1) {\n\t\t\tnumber_frames_to_use = min(number_frames_this_shot,\n\t\t\t static_cast(shot_keyf));\n\t\t} else {\n\t\t\tnumber_frames_to_use = number_frames_this_shot;\n\t\t}\n\n\t\tif (verbose_level >= 3) cout << \"This shot will use \"\n\t\t\t << number_frames_to_use << \" frames\" << endl;\n\n\t\tvector frames_to_use;\n\t\tsample_frames_from_shot(number_frames_to_use,\n\t\t shot_beg_frames.at(count_shot),\n\t\t number_frames_this_shot,\n\t\t frames_to_use);\n\n\t\tif (shot_mode == SHOT_MODE_INDEP_KEYF) {\n\t\t\tfor (uint count_ind = 0; count_ind < number_frames_to_use;\n\t\t\t count_ind++) {\n\t\t\t\tuint frame_this_ind = frames_to_use.at(count_ind);\n\t\t\t\tuint ind_in_index = inds_indep_mode.at(count_shot).at(count_ind);\n\t\t\t\t// Load feature set\n\t\t\t\tif (!common::io_utils::is_file_exist(feature_files.at(frame_this_ind))) {\n\t\t\t\t\tfprintf(stderr, \"Missing feature file: %s\\n\",\n\t\t\t\t\t feature_files.at(frame_this_ind).c_str());\n\t\t\t\t\texit(EXIT_FAILURE);\n\t\t\t\t}\n\t\t\t\tconst char *feature_file_path = feature_files[frame_this_ind].c_str();\n\t\t\t\tcommon::feature_set feat_set;\n\t\t\t\tif (index_parameters_.ld_name == SIFT_NAME) {\n\t\t\t\t\tcomponents::sift_reader::read_sift_file(feature_file_path,\n\t\t\t\t\t index_parameters_.ld_frame_length,\n\t\t\t\t\t index_parameters_.ld_length,feat_set);\n\t\t\t\t} else if (index_parameters_.ld_name == SIFTGEO_NAME) {\n\t\t\t\t\tcomponents::sift_reader::read_sift_geo_file(feature_file_path,\n\t\t\t\t\t index_parameters_.ld_frame_length,\n\t\t\t\t\t index_parameters_.ld_length,feat_set);\n\t\t\t\t} else {\n\t\t\t\t\tcout << \"Local feature \" << index_parameters_.ld_name\n\t\t\t\t\t << \" is not supported\" << endl;\n\t\t\t\t}\n\t\t\t\t// Generate global signature, put in index_\n\t\t\t\tindex_.word_l1_norms.at(ind_in_index).resize(index_parameters_.gd_number_gaussians);\n\t\t\t\tindex_.word_total_soft_assignment.at(ind_in_index).resize(index_parameters_.gd_number_gaussians);\n\t\t\t\t// -- auxiliary vectors\n\t\t\t\tvector aux_gd_word_descriptor(index_parameters_.gd_number_gaussians);\n\t\t\t\tvector aux_gd_fv(index_parameters_.gd_number_gaussians\n\t\t\t\t *index_parameters_.ld_pca_dim);\n\t\t\t\tgenerate_global_descriptor(&feat_set,\n\t\t\t\t aux_gd_word_descriptor,\n\t\t\t\t aux_gd_fv,\n\t\t\t\t index_.word_l1_norms.at(ind_in_index),\n\t\t\t\t index_.word_total_soft_assignment.at(ind_in_index));\n\t\t\t\tif (index_parameters_.gd_unbinarized) {\n\t\t\t\t\tindex_.fv.at(ind_in_index) = aux_gd_fv;\n\t\t\t\t} else {\n\t\t\t\t\tindex_.word_descriptor.at(ind_in_index) = aux_gd_word_descriptor;\n\t\t\t\t}\n\n\t\t\t\t#pragma omp critical\n\t\t\t\t{\n\t\t\t\t\tcount_index++;\n\t\t\t\t\tindex_.frame_numbers_in_db.push_back(frame_this_ind);\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (shot_mode == SHOT_MODE_SHOT_AGG) {\n\t\t\t// Collect all features\n\t\t\tcommon::feature_set feat_set(index_parameters_.ld_length,\n\t\t\t index_parameters_.ld_frame_length);\n\t\t\tfor (uint count_ind = 0; count_ind < number_frames_to_use; count_ind++) {\n\t\t\t\tuint frame_this_ind = frames_to_use.at(count_ind);\n\t\t\t\tif (verbose_level >= 4) cout << \"Doing frame \" << frame_this_ind << endl;\n\n\t\t\t\t// Load feature set for this frame\n\t\t\t\tcommon::feature_set feat_set_this_frame;\n\t\t\t\tconst char *feat_path = feature_files[frame_this_ind].c_str();\n\t\t\t\tif (index_parameters_.ld_name == SIFT_NAME) {\n\t\t\t\t\tcomponents::sift_reader::read_sift_file(feat_path,\n\t\t\t\t\t index_parameters_.ld_frame_length,\n\t\t\t\t\t index_parameters_.ld_length,feat_set_this_frame);\n\t\t\t\t} else if (index_parameters_.ld_name == SIFTGEO_NAME) {\n\t\t\t\t\tcomponents::sift_reader::read_sift_geo_file(feat_path,\n\t\t\t\t\t index_parameters_.ld_frame_length,\n\t\t\t\t\t index_parameters_.ld_length,feat_set_this_frame);\n\t\t\t\t} else {\n\t\t\t\t\tcout << \"Local feature \" << index_parameters_.ld_name\n\t\t\t\t\t << \" is not supported\" << endl;\n\t\t\t\t}\n\n\t\t\t\tif (verbose_level >= 4) cout << \"Loaded features from this frame\"\n\t\t\t\t\t << endl;\n\n\t\t\t\t// Add this frame's features to collection of all shot's features\n\t\t\t\tuint number_features_this_frame =\n\t\t\t\t feat_set_this_frame.get_num_features();\n\t\t\t\tfor (uint count_f = 0; count_f < number_features_this_frame;\n\t\t\t\t count_f++) {\n\t\t\t\t\tfloat* aux_ld = new float[index_parameters_.ld_length];\n\t\t\t\t\tcopy_floats(index_parameters_.ld_length,\n\t\t\t\t\t feat_set_this_frame.get_descriptor_at(count_f), aux_ld);\n\t\t\t\t\tfloat* aux_f = new float[index_parameters_.ld_frame_length];\n\t\t\t\t\tcopy_floats(index_parameters_.ld_frame_length,\n\t\t\t\t\t feat_set_this_frame.get_frame_at(count_f), aux_f);\n\t\t\t\t\tfeat_set.add_feature(aux_ld, aux_f);\n\t\t\t\t}\n\t\t\t\tif (verbose_level >= 4) cout << \"Added these features to shot's features\" << endl;\n\t\t\t}\n\n\t\t\tif (verbose_level >= 4) cout << \"All features were collected, now shot contains \" << feat_set.get_num_features() << \" features\" << endl;\n\n\t\t\t// Generate global signature, put in index_\n\t\t\tindex_.word_l1_norms.at(count_shot).resize(index_parameters_.gd_number_gaussians);\n\t\t\tindex_.word_total_soft_assignment.at(count_shot).resize(index_parameters_.gd_number_gaussians);\n\t\t\t// -- auxiliary vectors\n\t\t\tvector aux_gd_word_descriptor(index_parameters_.gd_number_gaussians);\n\t\t\tvector aux_gd_fv(index_parameters_.gd_number_gaussians\n\t\t\t *index_parameters_.ld_pca_dim);\n\t\t\tgenerate_global_descriptor(&feat_set,\n\t\t\t aux_gd_word_descriptor,\n\t\t\t aux_gd_fv,\n\t\t\t index_.word_l1_norms.at(count_shot),\n\t\t\t index_.word_total_soft_assignment.at(count_shot));\n\t\t\tif (index_parameters_.gd_unbinarized) {\n\t\t\t\tindex_.fv.at(count_shot) = aux_gd_fv;\n\t\t\t} else {\n\t\t\t\tindex_.word_descriptor.at(count_shot) = aux_gd_word_descriptor;\n\t\t\t}\n\n\t\t\t#pragma omp critical\n\t\t\t{\n\t\t\t\tcount_index++;\n\t\t\t}\n\t\t}\n\t}\n\n\t// We need to sort frame_numbers_in_db, because it might not be in order\n\t// due to parallelization.\n\t// Note: this variable is used only if the mode is SHOT_MODE_INDEP_KEYF,\n\t// so if the mode is different it will just sort nothing, it doesnt matter\n\tstable_sort(index_.frame_numbers_in_db.begin(), index_.frame_numbers_in_db.end());\n\n\t// Make sure we processed the correct number of REVV signatures\n\tassert(count_index == number_entries_in_index);\n\tif (shot_mode == SHOT_MODE_INDEP_KEYF) {\n\t\tassert(count_index == index_.frame_numbers_in_db.size());\n\t}\n\n\tupdate_index();\n}\n\nvoid gdindex::generate_global_descriptor(const common::feature_set* feature_set,\n vector& gd_word_descriptor,\n vector& gd_fv,\n vector& gd_word_l1_norm,\n vector& gd_word_total_soft_assignment)\n{\n\t// Resize the vectors that will be returned\n\tgd_word_descriptor.resize(index_parameters_.gd_number_gaussians);\n\tgd_word_l1_norm.resize(index_parameters_.gd_number_gaussians);\n\tgd_word_total_soft_assignment.resize(index_parameters_.gd_number_gaussians);\n\n\tuint unbinarized_signature_length = index_parameters_.gd_number_gaussians\n\t *index_parameters_.ld_pca_dim;\n\tfloat* all_pca_desc = new float[feature_set->get_num_features()\n\t * index_parameters_.ld_pca_dim];\n\t// Project SIFT using PCA\n\tfor (uint count_feat = 0; count_feat < feature_set->get_num_features(); count_feat++) {\n\t\tproject_local_descriptor_pca(feature_set->get_descriptor_at(count_feat),\n\t\t all_pca_desc + count_feat*index_parameters_.ld_pca_dim);\n\t}\n\n\t// Compute Fisher vector\n\tint gmm_flags = GMM_FLAGS_MU;\n\tuint fisher_output_length = gmm_fisher_sizeof(index_parameters_.gd_gmm,\n\t gmm_flags);\n\tgd_fv.clear();\n\tgd_fv.resize(fisher_output_length, 0);\n\t// This will extract the FV with only the mean component and using FV normalization\n\t// but NOT the L2 normalization after the end nor the power normalization\n\tgmm_fisher_save_soft_assgn(feature_set->get_num_features(), all_pca_desc,\n\t index_parameters_.gd_gmm, gmm_flags, gd_fv.data(),\n\t gd_word_total_soft_assignment.data());\n\n\t// Compute L1Norm info\n\tfor (uint count_gaussian = 0;\n\t count_gaussian < index_parameters_.gd_number_gaussians;\n\t count_gaussian++) {\n\t\tdouble sum_abs = 0;\n\t\tfor (uint count_dim = count_gaussian*index_parameters_.ld_pca_dim;\n\t\t count_dim < (count_gaussian + 1)*index_parameters_.ld_pca_dim;\n\t\t count_dim++) {\n\t\t\tsum_abs += fabs(gd_fv.at(count_dim));\n\t\t}\n\t\tgd_word_l1_norm.at(count_gaussian) = static_cast(sum_abs);\n\t}\n\n\t// IN normalization (if selected)\n\tif (index_parameters_.gd_intra_normalization) {\n\t\tfor (uint count_gaussian = 0;\n\t\t count_gaussian < index_parameters_.gd_number_gaussians;\n\t\t count_gaussian++) {\n\t\t\t// Compute L2 norm for this Gaussian\n\t\t\tfloat l2_norm_sq_gaussian = 0;\n\t\t\tfor (uint count_dim = count_gaussian*index_parameters_.ld_pca_dim;\n\t\t\t count_dim < (count_gaussian + 1)*index_parameters_.ld_pca_dim;\n\t\t\t count_dim++) {\n\t\t\t\tl2_norm_sq_gaussian += gd_fv.at(count_dim) * gd_fv.at(count_dim);\n\t\t\t}\n\t\t\t// Normalize this Gaussian, if it has non-zero norm\n\t\t\tfloat l2_norm_gaussian = sqrt(l2_norm_sq_gaussian);\n\t\t\tif (l2_norm_gaussian > 0) {\n\t\t\t\tfor (uint count_dim = count_gaussian*index_parameters_.ld_pca_dim;\n\t\t\t\t count_dim < (count_gaussian + 1)*index_parameters_.ld_pca_dim;\n\t\t\t\t count_dim++) {\n\t\t\t\t\tgd_fv.at(count_dim) /= l2_norm_gaussian;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Apply power law (if using SSR normalization), and compute L2 norm\n\tfloat l2_norm_sq = 0;\n\tfor (uint count_dim = 0; count_dim < unbinarized_signature_length; count_dim++) {\n\t\tif (!index_parameters_.gd_intra_normalization) {\n\t\t\tPOWER_LAW_SAME(gd_fv.at(count_dim), index_parameters_.gd_power);\n\t\t}\n\t\tl2_norm_sq += gd_fv.at(count_dim) * gd_fv.at(count_dim);\n\t}\n\n\t// L2 normalize\n\tfloat l2_norm = sqrt(l2_norm_sq);\n\tif (l2_norm > L2_NORM_SQ_THRESH) {\n\t\tfor (uint count_dim = 0; count_dim < unbinarized_signature_length; count_dim++) {\n\t\t\tgd_fv.at(count_dim) /= l2_norm;\n\t\t}\n\t}\n\n\t// Sign binarize\n\tsign_binarize(gd_fv, gd_word_descriptor);\n}\n\nvoid gdindex::generate_point_index(const vector& feature_files,\n const int verbose_level,\n vector < vector < uint > >& vec_feat_assgns,\n vector < vector < float > >& vec_feat_assgn_weights,\n vector < vector < vector < float > > >& vec_feat_residuals)\n{\n\tuint number_files_to_process = feature_files.size();\n\n\tvec_feat_assgns.resize(number_files_to_process);\n\tvec_feat_assgn_weights.resize(number_files_to_process);\n\tvec_feat_residuals.resize(number_files_to_process);\n\n\tuint number_files_processed = 0;\n\t#pragma omp parallel for\n\tfor (uint count_file = 0; count_file < number_files_to_process; count_file++) {\n\t\t// Load feature set\n\t\tif (!common::io_utils::is_file_exist(feature_files.at(count_file))) {\n\t\t\tfprintf(stderr, \"Missing feature file: %s\\n\",\n\t\t\t feature_files.at(count_file).c_str());\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\t\tcommon::feature_set feat_set;\n\t\tconst char *feat_file_path = feature_files[count_file].c_str();\n\t\tif (index_parameters_.ld_name == SIFT_NAME) {\n\t\t\tcomponents::sift_reader::read_sift_file(feat_file_path,\n\t\t\t index_parameters_.ld_frame_length,\n\t\t\t index_parameters_.ld_length,feat_set);\n\t\t} else if (index_parameters_.ld_name == SIFTGEO_NAME) {\n\t\t\tcomponents::sift_reader::read_sift_geo_file(feat_file_path,\n\t\t\t index_parameters_.ld_frame_length,\n\t\t\t index_parameters_.ld_length,feat_set);\n\t\t} else {\n\t\t\tcout << \"Local feature \" << index_parameters_.ld_name\n\t\t\t << \" is not supported\" << endl;\n\t\t}\n\n\t\tgenerate_point_indexed_descriptor(&feat_set,\n\t\t verbose_level,\n\t\t vec_feat_assgns.at(count_file),\n\t\t vec_feat_assgn_weights.at(count_file),\n\t\t vec_feat_residuals.at(count_file));\n\n\t\t// Report status\n\t\t#pragma omp critical\n\t\t{\n\t\t\tnumber_files_processed++;\n\t\t}\n\t\tif (verbose_level >= 2) {\n\t\t\tprintf(\"[%06d, %06d] %04d features \\n\",\n\t\t\t count_file, number_files_processed, feat_set.get_num_features());\n\t\t}\n\t}\n}\n\nvoid gdindex::generate_point_indexed_descriptor(const common::feature_set* feature_set,\n const int verbose_level,\n vector& feat_assgns,\n vector& feat_assgn_weights,\n vector < vector < float > >& feat_residuals)\n{\n\tunsigned long num_features = feature_set->get_num_features();\n\tfloat* all_pca_desc = new float[num_features\n\t * index_parameters_.ld_pca_dim];\n\t// Project SIFT using PCA\n\tfor (uint count_feat = 0; count_feat < num_features; count_feat++) {\n\t\tproject_local_descriptor_pca(feature_set->get_descriptor_at(count_feat),\n\t\t all_pca_desc + count_feat*index_parameters_.ld_pca_dim);\n\t}\n\n\t// Compute point-indexed Fisher vector\n\tint gmm_flags = GMM_FLAGS_MU;\n\tuint* p_feat_assgns = new uint[num_features];\n\tfloat* p_feat_assgn_weights = new float[num_features];\n\tfloat* p_feat_residuals = new float[num_features * LD_PCA_DIM];\n\tif (verbose_level >= 4) cout << \"generate_point_indexed_descriptor: Starting gmm_fisher_point_indexed\" << endl;\n\tgmm_fisher_point_indexed(num_features, all_pca_desc,\n\t index_parameters_.gd_gmm,\n\t gmm_flags, p_feat_assgns,\n\t p_feat_assgn_weights,\n\t p_feat_residuals);\n\tif (verbose_level >= 4) cout << \"done!\" << endl;\n\n\t// --> Transfer values to output vectors\n\tfeat_assgns.resize(num_features);\n\tfeat_assgn_weights.resize(num_features);\n\tfeat_residuals.resize(num_features);\n\tfor (uint i = 0; i < num_features; i++) {\n\t\tfeat_assgns.at(i) = p_feat_assgns[i];\n\t\tfeat_assgn_weights.at(i) = p_feat_assgn_weights[i];\n\t\tfeat_residuals.at(i).resize(LD_PCA_DIM);\n\t\tfor (uint j = 0; j < LD_PCA_DIM; j++) {\n\t\t\tfeat_residuals.at(i).at(j) = p_feat_residuals[i*LD_PCA_DIM + j];\n\t\t}\n\t}\n\n\t// Clean up\n\tif (all_pca_desc != nullptr) {\n\t\tdelete [] all_pca_desc;\n\t\tall_pca_desc = nullptr;\n\t}\n\tif (p_feat_assgns != nullptr) {\n\t\tdelete [] p_feat_assgns;\n\t\tp_feat_assgns = nullptr;\n\t}\n\tif (p_feat_assgn_weights != nullptr) {\n\t\tdelete [] p_feat_assgn_weights;\n\t\tp_feat_assgn_weights = nullptr;\n\t}\n\tif (p_feat_residuals != nullptr) {\n\t\tdelete [] p_feat_residuals;\n\t\tp_feat_residuals = nullptr;\n\t}\n}\n\nvoid gdindex::perform_query(const string local_descriptors_path,\n const gdindex* query_index_ptr,\n const uint query_number,\n const vector& indices,\n vector< pair >& results,\n const uint number_2nd_stage_rerank,\n gdindex* gdindex_ptr_rerank,\n const vector < vector < uint > >& group_lists_rerank,\n const int verbose_level)\n{\n\tcommon::feature_set feat_set;\n\tvector gd_word_descriptor;\n\tvector gd_fv;\n\tvector gd_word_l1_norm, gd_word_total_soft_assignment;\n\tif (query_index_ptr != nullptr) {\n\t\t// Using pre-computed global descriptor from query_index_ptr\n\t\tif (index_parameters_.gd_unbinarized) {\n\t\t\tgd_fv = query_index_ptr->index_.fv.at(query_number);\n\t\t} else {\n\t\t\tgd_word_descriptor =\n\t\t\t query_index_ptr->index_.word_descriptor.at(query_number);\n\t\t}\n\t\tif (query_parameters_.word_selection_mode == WORD_L1_NORM) {\n\t\t\tgd_word_l1_norm =\n\t\t\t query_index_ptr->index_.word_l1_norms.at(query_number);\n\t\t} else {\n\t\t\tgd_word_total_soft_assignment =\n\t\t\t query_index_ptr->index_.word_total_soft_assignment.at(query_number);\n\t\t}\n\t} else {\n\t\t// Computing query global descriptor\n\n\t\t// --> Load local descriptors\n\t\tif (index_parameters_.ld_name == SIFT_NAME) {\n\t\t\tcomponents::sift_reader::read_sift_file(local_descriptors_path.c_str(),\n\t\t\t index_parameters_.ld_frame_length,\n\t\t\t index_parameters_.ld_length,feat_set);\n\t\t} else if (index_parameters_.ld_name == SIFTGEO_NAME) {\n\t\t\tcomponents::sift_reader::read_sift_geo_file(local_descriptors_path.c_str(),\n\t\t\t index_parameters_.ld_frame_length,\n\t\t\t index_parameters_.ld_length,feat_set);\n\t\t} else {\n\t\t\tcout << \"Local feature \" << index_parameters_.ld_name\n\t\t\t << \" is not supported\" << endl;\n\t\t}\n\n\t\t// --> Generate query global descriptor\n\t\tgenerate_global_descriptor(&feat_set,\n\t\t gd_word_descriptor,\n\t\t gd_fv,\n\t\t gd_word_l1_norm,\n\t\t gd_word_total_soft_assignment);\n\t}\n\n\t// If number_2nd_stage_rerank is 0, we're not using two-stage scoring\n\tif (!number_2nd_stage_rerank) {\n\t\tquery(gd_word_descriptor, gd_fv, gd_word_l1_norm,\n\t\t gd_word_total_soft_assignment, indices, results);\n\t} else {\n\t\t// Using two-stage scoring\n\t\t// -- First stage\n\t\tvector indices_2_stages(index_.number_global_descriptors);\n\t\tfor (uint count = 0; count < index_.number_global_descriptors; count++) {\n\t\t\t// Include indices corresponding to shot numbers\n\t\t\tindices_2_stages.at(count) = count;\n\t\t}\n\t\tvector< pair > results_1st_stage;\n\t\tquery(gd_word_descriptor, gd_fv, gd_word_l1_norm,\n\t\t gd_word_total_soft_assignment,\n\t\t indices_2_stages, results_1st_stage);\n\n\t\t// -- Second stage\n\t\tvector gd_word_descriptor_rerank;\n\t\tvector gd_fv_rerank;\n\t\tvector gd_word_l1_norm_rerank, gd_word_total_soft_assignment_rerank;\n\t\tgdindex_ptr_rerank->generate_global_descriptor(&feat_set,\n\t\t gd_word_descriptor_rerank,\n\t\t gd_fv_rerank,\n\t\t gd_word_l1_norm_rerank,\n\t\t gd_word_total_soft_assignment_rerank);\n\t\tgdindex_ptr_rerank->query_2nd_stage(gd_word_descriptor_rerank,\n\t\t gd_fv_rerank,\n\t\t gd_word_l1_norm_rerank,\n\t\t gd_word_total_soft_assignment_rerank,\n\t\t number_2nd_stage_rerank,\n\t\t group_lists_rerank,\n\t\t results_1st_stage, results);\n\t}\n}\n\nvoid gdindex::set_index_parameters(const uint ld_length, const uint ld_frame_length,\n const string ld_extension, const string ld_name,\n const uint ld_pca_dim, const float ld_pre_pca_power,\n const uint gd_number_gaussians, const float gd_power,\n const bool gd_intra_normalization,\n const bool gd_unbinarized,\n const string trained_parameters_path,\n const int verbose_level)\n{\n\t// Local descriptor information\n\tindex_parameters_.ld_length = ld_length;\n\tindex_parameters_.ld_frame_length = ld_frame_length;\n\tindex_parameters_.ld_extension = ld_extension;\n\tindex_parameters_.ld_name = ld_name;\n\n\t// Parameters for PCA-ing local descriptors\n\tindex_parameters_.ld_pca_dim = ld_pca_dim;\n\tindex_parameters_.ld_pre_pca_power = ld_pre_pca_power;\n\t// -- LD mean vector is stored in descriptor covariance file\n\tchar aux_mean_vector_path[1024];\n\tsprintf(aux_mean_vector_path, \"%s/%s.pre_alpha.%.2f.desc_covariance\",\n\t trained_parameters_path.c_str(),\n\t index_parameters_.ld_name.c_str(),\n\t index_parameters_.ld_pre_pca_power);\n\tstring ld_mean_vector_path = aux_mean_vector_path;\n\tload_ld_mean_vector(ld_mean_vector_path);\n\n\tchar aux_ld_pca_eigenvectors[1024];\n\tsprintf(aux_ld_pca_eigenvectors, \"%s/%s.pre_alpha.%.2f.desc_eigenvectors\",\n\t trained_parameters_path.c_str(),\n\t index_parameters_.ld_name.c_str(),\n\t index_parameters_.ld_pre_pca_power);\n\tstring ld_pca_eigenvectors_path = aux_ld_pca_eigenvectors;\n\tload_ld_pca_eigenvectors(ld_pca_eigenvectors_path);\n\n\t// Parameters used for global descriptor computation\n\tindex_parameters_.gd_number_gaussians = gd_number_gaussians;\n\tindex_parameters_.gd_power = gd_power;\n\tindex_parameters_.gd_intra_normalization = gd_intra_normalization;\n\tindex_parameters_.gd_unbinarized = gd_unbinarized;\n\n\tchar aux_gd_gmm[1024];\n\tsprintf(aux_gd_gmm, \"%s/%s.pre_alpha.%.2f.pca.%d.gmm.%d\",\n\t trained_parameters_path.c_str(),\n\t index_parameters_.ld_name.c_str(),\n\t index_parameters_.ld_pre_pca_power,\n\t index_parameters_.ld_pca_dim,\n\t index_parameters_.gd_number_gaussians);\n\tstring gd_gmm_path = aux_gd_gmm;\n\tload_gd_gmm(gd_gmm_path);\n}\n\nvoid gdindex::set_query_parameters(const uint min_number_words_selected,\n const int asym_scoring_mode,\n const int word_selection_mode,\n const float word_selection_thresh,\n const float score_den_power_norm,\n const string trained_parameters_path,\n const int verbose_level)\n{\n\tquery_parameters_.min_number_words_selected = min_number_words_selected;\n\tquery_parameters_.asym_scoring_mode = asym_scoring_mode;\n\tquery_parameters_.word_selection_mode = word_selection_mode;\n\tquery_parameters_.word_selection_thresh = word_selection_thresh;\n\tquery_parameters_.score_den_power_norm = score_den_power_norm;\n\n\tchar aux_corr_weights[1024];\n\tsprintf(aux_corr_weights, \"%s/%s.pre_alpha.%.2f.pca.%d.gmm.%d.pre_alpha.%.2f.corr_weights\",\n\t trained_parameters_path.c_str(),\n\t index_parameters_.ld_name.c_str(),\n\t index_parameters_.ld_pre_pca_power,\n\t index_parameters_.ld_pca_dim,\n\t index_parameters_.gd_number_gaussians,\n\t index_parameters_.gd_power);\n\tstring corr_weights_path = aux_corr_weights;\n\tload_corr_weights(corr_weights_path);\n\n\t// Precompute pop-counts for fast executions\n\tquery_parameters_.pop_count[0] = 0;\n\tfor (int i = 1; i < 65536; i++) {\n\t\tquery_parameters_.pop_count[i] = query_parameters_.pop_count[i>>1] + (i&1);\n\t}\n}\n\n/********************************\nPRIVATE FUNCTIONS\n********************************/\n\nvoid gdindex::update_index()\n{\n\t// Update number of global descriptors stored\n\tif (index_parameters_.gd_unbinarized) {\n\t\tindex_.number_global_descriptors = index_.fv.size();\n\t} else {\n\t\tindex_.number_global_descriptors = index_.word_descriptor.size();\n\t}\n\n\t// Update variables that are useful during retrieval; they will be ready\n\t// to serve a query, if perform_query() is called\n\tindex_.number_words_selected.resize(index_.number_global_descriptors, 0);\n\tif (index_parameters_.gd_unbinarized) {\n\t\tindex_.word_l2_norms_sq.resize(index_.number_global_descriptors,\n\t\t vector(index_parameters_.gd_number_gaussians,\n\t\t 0));\n\t}\n\tconst vector < vector < float > > *all_db_strengths;\n\tif (query_parameters_.word_selection_mode == WORD_L1_NORM) {\n\t\tall_db_strengths = &index_.word_l1_norms;\n\t} else {\n\t\tall_db_strengths = &index_.word_total_soft_assignment;\n\t}\n\tfor (uint count_elem = 0; count_elem < index_.number_global_descriptors;\n\t count_elem++) {\n\t\t// -- Find number of words (Gaussians) selected for this database element\n\t\tfor (uint count_gaussian = 0;\n\t\t count_gaussian < index_parameters_.gd_number_gaussians;\n\t\t count_gaussian++) {\n\t\t\tif (query_parameters_.asym_scoring_mode == ASYM_OFF\n\t\t\t || query_parameters_.asym_scoring_mode == ASYM_QAGS) {\n\t\t\t\tindex_.number_words_selected.at(count_elem)++;\n\t\t\t} else if (query_parameters_.asym_scoring_mode == ASYM_DAGS\n\t\t\t || query_parameters_.asym_scoring_mode == ASYM_SGS) {\n\t\t\t\tif (all_db_strengths->at(count_elem).at(count_gaussian) >\n\t\t\t\t query_parameters_.word_selection_thresh) {\n\t\t\t\t\tindex_.number_words_selected.at(count_elem)++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (index_parameters_.gd_unbinarized) {\n\t\t\t\tfor (uint d = 0; d < index_parameters_.ld_pca_dim; d++) {\n\t\t\t\t\tindex_.word_l2_norms_sq.at(count_elem).at(count_gaussian) +=\n\t\t\t\t\t index_.fv.at(count_elem).at(count_gaussian*\n\t\t\t\t\t index_parameters_.ld_pca_dim\n\t\t\t\t\t + d)\n\t\t\t\t\t *index_.fv.at(count_elem).at(count_gaussian*\n\t\t\t\t\t index_parameters_.ld_pca_dim\n\t\t\t\t\t + d);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid gdindex::sign_binarize(const vector& gd_word_residuals,\n vector& gd_word_descriptor)\n{\n\tgd_word_descriptor.resize(index_parameters_.gd_number_gaussians);\n\tfor (uint count_gaussian = 0;\n\t count_gaussian < index_parameters_.gd_number_gaussians;\n\t count_gaussian++) {\n\t\tuint packed_block = 0;\n\t\tuint start = count_gaussian*index_parameters_.ld_pca_dim;\n\t\tuint end = (count_gaussian + 1)*index_parameters_.ld_pca_dim;\n\t\t// Sign binarize\n\t\tfor (uint count_dim = start; count_dim < end; count_dim++) {\n\t\t\tuint bit = (gd_word_residuals.at(count_dim) > 0) ? 1 : 0;\n\t\t\tPUSH_BIT(packed_block, bit);\n\t\t}\n\t\tgd_word_descriptor.at(count_gaussian) = packed_block;\n\t}\n}\n\nvoid gdindex::project_local_descriptor_pca(const float* desc, float* pca_desc)\n{\n\tvector < float > desc_pow(index_parameters_.ld_length, 0);\n\t// Pre power law and normalization\n\tfloat l2_norm_sq = 0;\n\tfor (uint count_in_dim = 0; count_in_dim < index_parameters_.ld_length; count_in_dim++) {\n\t\tPOWER_LAW(desc[count_in_dim], index_parameters_.ld_pre_pca_power,\n\t\t desc_pow.at(count_in_dim));\n\t\tl2_norm_sq += desc_pow.at(count_in_dim) * desc_pow.at(count_in_dim);\n\t}\n\tfloat l2_norm = sqrt(l2_norm_sq);\n\tif (l2_norm > 0) {\n\t\tfor (uint count_in_dim = 0; count_in_dim < index_parameters_.ld_length; count_in_dim++) {\n\t\t\tdesc_pow.at(count_in_dim) /= l2_norm;\n\t\t}\n\t}\n\n\t// Projection onto eigenvectors\n\tfor (uint count_out_dim = 0; count_out_dim < index_parameters_.ld_pca_dim;\n\t count_out_dim++) {\n\t\tpca_desc[count_out_dim] = 0;\n\t\tfor (uint count_in_dim = 0; count_in_dim < index_parameters_.ld_length;\n\t\t count_in_dim++) {\n\t\t\tpca_desc[count_out_dim] +=\n\t\t\t (desc_pow.at(count_in_dim) - index_parameters_.ld_mean_vector[count_in_dim])\n\t\t\t * index_parameters_.ld_pca_eigenvectors.at(count_out_dim)[count_in_dim];\n\t\t}\n\t}\n}\n\nvoid gdindex::sample_frames_from_shot(const uint number_frames_out,\n const uint first_frame,\n const uint number_frames_this_shot,\n vector& out_frames)\n{\n\t// Note: number_frames_this_shot must be bigger than number_frames_out\n\tout_frames.clear();\n\tif (number_frames_out == 1) {\n\t\tuint middle_frame = first_frame\n\t\t + static_cast(floor(static_cast(number_frames_this_shot)/2));\n\t\tout_frames.push_back(middle_frame);\n\t} else {\n\t\tdouble rate_float = static_cast(number_frames_this_shot)\n\t\t /static_cast(number_frames_out);\n\t\tuint rate;\n\t\tif ((number_frames_this_shot % number_frames_out) == 0) {\n\t\t\trate = static_cast(rate_float);\n\t\t\tfor (uint count_sample = 0; count_sample < number_frames_this_shot;\n\t\t\t count_sample += rate) {\n\t\t\t\tout_frames.push_back(first_frame + count_sample);\n\t\t\t}\n\t\t} else {\n\t\t\tif ((number_frames_out - 1)*static_cast(ceil(rate_float))\n\t\t\t < number_frames_this_shot) {\n\t\t\t\trate = static_cast(ceil(rate_float));\n\t\t\t\tfor (uint count_sample = 0; count_sample < number_frames_this_shot;\n\t\t\t\t count_sample += rate) {\n\t\t\t\t\tout_frames.push_back(first_frame + count_sample);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\trate = static_cast(floor(rate_float));\n\t\t\t\tvector out_frames_aux;\n\t\t\t\tfor (uint count_sample = 0; count_sample < number_frames_this_shot;\n\t\t\t\t count_sample += rate) {\n\t\t\t\t\tout_frames_aux.push_back(first_frame + count_sample);\n\t\t\t\t}\n\t\t\t\tuint start_ind, end_ind;\n\t\t\t\tuint extra_frames = (out_frames_aux.size() - number_frames_out);\n\n\t\t\t\tif (extra_frames) {\n\t\t\t\t\t// In this case, we'll keep the middle ones, in order not to unbalance\n\t\t\t\t\t// the selection too much\n\t\t\t\t\tif (extra_frames % 2) {\n\t\t\t\t\t\t// Odd: keep one more at the beginning\n\t\t\t\t\t\tstart_ind = (extra_frames - 1)/2;\n\t\t\t\t\t\tend_ind = out_frames_aux.size() - 1\n\t\t\t\t\t\t - static_cast(ceil((static_cast(extra_frames)/2)));\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// Even\n\t\t\t\t\t\tstart_ind = extra_frames/2;\n\t\t\t\t\t\tend_ind = out_frames_aux.size() - 1 - extra_frames/2;\n\t\t\t\t\t}\n\n\t\t\t\t\tfor (uint count_sample = start_ind; count_sample < end_ind + 1;\n\t\t\t\t\t count_sample++) {\n\t\t\t\t\t\tout_frames.push_back(out_frames_aux.at(count_sample));\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tout_frames = out_frames_aux;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t// Make sure we've collected the correct number\n\tassert(number_frames_out == out_frames.size());\n}\n\nvoid gdindex::score_database_item(const vector& query_word_descriptor,\n const vector& query_fv,\n const vector& query_word_l1_norm,\n const vector& query_word_total_soft_assignment,\n const vector& query_word_l2_norm_sq,\n const uint db_ind,\n float& score)\n{\n\t// Check that the database item has at least the minimum number of\n\t// selected words that we require; if not, just set it to FLT_MAX\n\tif (index_.number_words_selected.at(db_ind)\n\t <= query_parameters_.min_number_words_selected) {\n\t\tscore = FLT_MAX;\n\t\treturn;\n\t}\n\n\t// Figure out parameters for asymmetric scoring\n\tconst vector *q_strengths, *db_strengths;\n\tif (query_parameters_.word_selection_mode == WORD_L1_NORM) {\n\t\tq_strengths = &query_word_l1_norm;\n\t\tdb_strengths = &index_.word_l1_norms.at(db_ind);\n\t} else {\n\t\tq_strengths = &query_word_total_soft_assignment;\n\t\tdb_strengths = &index_.word_total_soft_assignment.at(db_ind);\n\t}\n\n\tfloat total_inner_product = 0;\n\tfloat query_norm_factor = 0;\n\tfloat db_norm_factor = 0;\n\tfloat qags_db_norm_factor = 0;\n\tfor (uint count_gaussian = 0;\n\t count_gaussian < index_parameters_.gd_number_gaussians;\n\t count_gaussian++) {\n\t\tbool use_curr_gaussian = false;\n\t\tif (query_parameters_.asym_scoring_mode == ASYM_OFF) {\n\t\t\tif (index_parameters_.gd_unbinarized) {\n\t\t\t\tquery_norm_factor += query_word_l2_norm_sq.at(count_gaussian);\n\t\t\t\tdb_norm_factor += index_.word_l2_norms_sq.at(db_ind)\n\t\t\t\t .at(count_gaussian);\n\t\t\t} else {\n\t\t\t\tquery_norm_factor += index_parameters_.ld_pca_dim;\n\t\t\t\tdb_norm_factor += index_parameters_.ld_pca_dim;\n\t\t\t}\n\t\t\tuse_curr_gaussian = true;\n\t\t} else if (query_parameters_.asym_scoring_mode == ASYM_QAGS) {\n\t\t\tif (q_strengths->at(count_gaussian) >\n\t\t\t query_parameters_.word_selection_thresh) {\n\t\t\t\tif (index_parameters_.gd_unbinarized) {\n\t\t\t\t\tquery_norm_factor += query_word_l2_norm_sq.at(count_gaussian);\n\t\t\t\t\tdb_norm_factor += index_.word_l2_norms_sq.at(db_ind)\n\t\t\t\t\t .at(count_gaussian);\n\t\t\t\t} else {\n\t\t\t\t\tquery_norm_factor += index_parameters_.ld_pca_dim;\n\t\t\t\t\tdb_norm_factor += index_parameters_.ld_pca_dim;\n\t\t\t\t}\n\t\t\t\tuse_curr_gaussian = true;\n\t\t\t}\n\t\t\tif (db_strengths->at(count_gaussian) >\n\t\t\t query_parameters_.word_selection_thresh) {\n\t\t\t\tif (index_parameters_.gd_unbinarized) {\n\t\t\t\t\tqags_db_norm_factor += index_.word_l2_norms_sq.at(db_ind)\n\t\t\t\t\t .at(count_gaussian);\n\t\t\t\t} else {\n\t\t\t\t\tqags_db_norm_factor += index_parameters_.ld_pca_dim;\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (query_parameters_.asym_scoring_mode == ASYM_DAGS) {\n\t\t\tif (db_strengths->at(count_gaussian) >\n\t\t\t query_parameters_.word_selection_thresh) {\n\t\t\t\tif (index_parameters_.gd_unbinarized) {\n\t\t\t\t\tquery_norm_factor += query_word_l2_norm_sq.at(count_gaussian);\n\t\t\t\t\tdb_norm_factor += index_.word_l2_norms_sq.at(db_ind)\n\t\t\t\t\t .at(count_gaussian);\n\t\t\t\t} else {\n\t\t\t\t\tquery_norm_factor += index_parameters_.ld_pca_dim;\n\t\t\t\t\tdb_norm_factor += index_parameters_.ld_pca_dim;\n\t\t\t\t}\n\t\t\t\tuse_curr_gaussian = true;\n\t\t\t}\n\t\t} else if (query_parameters_.asym_scoring_mode == ASYM_SGS) {\n\t\t\tif (q_strengths->at(count_gaussian) >\n\t\t\t query_parameters_.word_selection_thresh) {\n\t\t\t\tif (index_parameters_.gd_unbinarized) {\n\t\t\t\t\tquery_norm_factor += query_word_l2_norm_sq.at(count_gaussian);\n\t\t\t\t} else {\n\t\t\t\t\tquery_norm_factor += index_parameters_.ld_pca_dim;\n\t\t\t\t}\n\t\t\t\tif (db_strengths->at(count_gaussian) >\n\t\t\t\t query_parameters_.word_selection_thresh) {\n\t\t\t\t\tif (index_parameters_.gd_unbinarized) {\n\t\t\t\t\t\tdb_norm_factor += index_.word_l2_norms_sq.at(db_ind)\n\t\t\t\t\t\t .at(count_gaussian);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tdb_norm_factor += index_parameters_.ld_pca_dim;\n\t\t\t\t\t}\n\t\t\t\t\tuse_curr_gaussian = true;\n\t\t\t\t}\n\t\t\t} else if (db_strengths->at(count_gaussian) >\n\t\t\t query_parameters_.word_selection_thresh) {\n\t\t\t\tif (index_parameters_.gd_unbinarized) {\n\t\t\t\t\tdb_norm_factor += index_.word_l2_norms_sq.at(db_ind)\n\t\t\t\t\t .at(count_gaussian);\n\t\t\t\t} else {\n\t\t\t\t\tdb_norm_factor += index_parameters_.ld_pca_dim;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (use_curr_gaussian) {\n\t\t\tif (index_parameters_.gd_unbinarized) {\n\t\t\t\tfor (uint d = count_gaussian*index_parameters_.ld_pca_dim;\n\t\t\t\t d < (count_gaussian+1)*index_parameters_.ld_pca_dim;\n\t\t\t\t d++) {\n\t\t\t\t\ttotal_inner_product += query_fv.at(d)\n\t\t\t\t\t *index_.fv.at(db_ind).at(d);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// Compute Hamming distance\n\t\t\t\tuint aux = query_word_descriptor.at(count_gaussian)\n\t\t\t\t ^ index_.word_descriptor.at(db_ind).at(count_gaussian);\n\t\t\t\tuint h = query_parameters_.pop_count[aux >> 16]\n\t\t\t\t + query_parameters_.pop_count[aux & 65535];\n\t\t\t\t// Add to correlation\n\t\t\t\ttotal_inner_product += query_parameters_.fast_corr_weights[h];\n\t\t\t}\n\t\t}\n\t}\n\n\t// Compute final score, taking into account normalizations\n\tif (query_parameters_.asym_scoring_mode == ASYM_QAGS) {\n\t\tif (query_norm_factor != 0\n\t\t && qags_db_norm_factor != 0\n\t\t && db_norm_factor != 0) {\n\t\t\tfloat score_den = pow(query_norm_factor*db_norm_factor,\n\t\t\t 0.5);\n\t\t\ttotal_inner_product /= score_den;\n\t\t\ttotal_inner_product *= pow(qags_db_norm_factor,\n\t\t\t 0.5 - query_parameters_.score_den_power_norm);\n\t\t} else {\n\t\t\ttotal_inner_product = -FLT_MAX;\n\t\t}\n\t} else {\n\t\tif (query_norm_factor != 0\n\t\t && db_norm_factor != 0) {\n\t\t\tfloat score_den = pow(query_norm_factor*db_norm_factor,\n\t\t\t query_parameters_.score_den_power_norm);\n\t\t\ttotal_inner_product /= score_den;\n\t\t} else {\n\t\t\ttotal_inner_product = -FLT_MAX;\n\t\t}\n\t}\n\n\t// Change sign such that smaller is better\n\tscore = -total_inner_product;\n}\n\nvoid gdindex::query(const vector& query_word_descriptor,\n const vector& query_fv,\n const vector& query_word_l1_norm,\n const vector& query_word_total_soft_assignment,\n const vector& database_indices,\n vector< pair >& database_scores_indices)\n{\n\tassert(index_.number_global_descriptors == database_indices.size());\n\t// Resize vector that will be passed back\n\tdatabase_scores_indices.resize(index_.number_global_descriptors);\n\n\t// If using FV, compute per-Gaussian L2 norm\n\tvector query_word_l2_norm_sq(index_parameters_.gd_number_gaussians, 0);\n\tif (index_parameters_.gd_unbinarized) {\n\t\tfor (uint count_gaussian = 0;\n\t\t count_gaussian < index_parameters_.gd_number_gaussians;\n\t\t count_gaussian++) {\n\t\t\tfor (uint d = count_gaussian*index_parameters_.ld_pca_dim;\n\t\t\t d < (count_gaussian+1)*index_parameters_.ld_pca_dim;\n\t\t\t d++) {\n\t\t\t\tquery_word_l2_norm_sq.at(count_gaussian) +=\n\t\t\t\t query_fv.at(d)*query_fv.at(d);\n\t\t\t}\n\t\t}\n\t}\n\n\t// Loop over database items and get their scores\n\tfor (uint count_elem = 0; count_elem < index_.number_global_descriptors;\n\t count_elem++) {\n\t\tuint number_item = database_indices.at(count_elem);\n\t\tdatabase_scores_indices.at(count_elem).second = number_item;\n\n\t\tscore_database_item(query_word_descriptor,\n\t\t query_fv,\n\t\t query_word_l1_norm,\n\t\t query_word_total_soft_assignment,\n\t\t query_word_l2_norm_sq,\n\t\t count_elem,\n\t\t database_scores_indices.at(count_elem).first);\n\t}\n\t// Sort scores\n\tsort(database_scores_indices.begin(), database_scores_indices.end(),\n\t cmp_float_uint_ascend);\n}\n\nvoid gdindex::query_2nd_stage(const vector& query_word_descriptor,\n const vector& query_fv,\n const vector& query_word_l1_norm,\n const vector& query_word_total_soft_assignment,\n const uint number_2nd_stage_rerank,\n const vector < vector < uint > >& group_lists_rerank,\n const vector< pair >& first_stage_scores_indices,\n vector< pair >& database_scores_indices)\n{\n\t// Resize vector that will be passed back\n\tdatabase_scores_indices.clear();\n\n\t// If using FV, compute per-Gaussian L2 norm\n\tvector query_word_l2_norm_sq(index_parameters_.gd_number_gaussians, 0);\n\tif (index_parameters_.gd_unbinarized) {\n\t\tfor (uint count_gaussian = 0;\n\t\t count_gaussian < index_parameters_.gd_number_gaussians;\n\t\t count_gaussian++) {\n\t\t\tfor (uint d = count_gaussian*index_parameters_.ld_pca_dim;\n\t\t\t d < (count_gaussian+1)*index_parameters_.ld_pca_dim;\n\t\t\t d++) {\n\t\t\t\tquery_word_l2_norm_sq.at(count_gaussian) +=\n\t\t\t\t query_fv.at(d)*query_fv.at(d);\n\t\t\t}\n\t\t}\n\t}\n\n\t// Figure out number of first stage items (groups) to re-rank\n\tuint number_rerank = min(number_2nd_stage_rerank,\n\t static_cast(first_stage_scores_indices.size()));\n\n\t// Loop over top number_rerank items from first stage and get score\n\t// of the constituent second stage items\n\tfor (uint count_top = 0; count_top < number_rerank;\n\t count_top++) {\n\t\tuint this_group_ind = first_stage_scores_indices.at(count_top).second;\n\n\t\t// Get number of 2nd stage items in this group\n\t\tuint number_items_this_group = group_lists_rerank.at(this_group_ind).size();\n\n\t\t// Loop over 2nd stage items in this group, get their signatures and score them\n\t\tfor (uint count_item = 0; count_item < number_items_this_group;\n\t\t count_item++) {\n\t\t\tuint this_item_number = group_lists_rerank.at(this_group_ind).at(count_item);\n\t\t\tpair < float, uint > score_this_item;\n\t\t\tscore_this_item.second = this_item_number;\n\n\t\t\tscore_database_item(query_word_descriptor,\n\t\t\t query_fv,\n\t\t\t query_word_l1_norm,\n\t\t\t query_word_total_soft_assignment,\n\t\t\t query_word_l2_norm_sq,\n\t\t\t this_item_number,\n\t\t\t score_this_item.first);\n\t\t\tdatabase_scores_indices.push_back(score_this_item);\n\t\t}\n\t}\n\t// Sort scores\n\tsort(database_scores_indices.begin(), database_scores_indices.end(),\n\t cmp_float_uint_ascend);\n}\n\nvoid gdindex::load_ld_mean_vector(string path)\n{\n\tFILE* mv_file = fopen(path.c_str(), \"rb\");\n\tif (mv_file == nullptr) {\n\t\tprintf(\"gdindex::load_ld_mean_vector: Error opening: \\n%s \\n\", path.c_str());\n\t\texit(EXIT_FAILURE);\n\t}\n\tindex_parameters_.ld_mean_vector = new float[index_parameters_.ld_length];\n\tfread(index_parameters_.ld_mean_vector, sizeof(float),\n\t index_parameters_.ld_length, mv_file);\n\tfclose(mv_file);\n}\n\nvoid gdindex::load_ld_pca_eigenvectors(string path)\n{\n\tFILE* eig_file = fopen(path.c_str(), \"rb\");\n\tif (eig_file == nullptr) {\n\t\tprintf(\"gdindex::load_ld_pca_eigenvectors: Error opening: \\n%s \\n\", path.c_str());\n\t\texit(EXIT_FAILURE);\n\t}\n\tindex_parameters_.ld_pca_eigenvectors.resize(index_parameters_.ld_length, nullptr);\n\tfor (uint n = 0; n < index_parameters_.ld_length; n++) {\n\t\tindex_parameters_.ld_pca_eigenvectors.at(n)\n\t\t = new float[index_parameters_.ld_length];\n\t\tfread(index_parameters_.ld_pca_eigenvectors.at(n), sizeof(float),\n\t\t index_parameters_.ld_length, eig_file);\n\t}\n\tfclose(eig_file);\n}\n\nvoid gdindex::load_gd_gmm(string path)\n{\n\tFILE* gmm_file = fopen(path.c_str(), \"rb\");\n\tif (gmm_file == nullptr) {\n\t\tprintf(\"gdindex::load_gd_gmm: Error opening: \\n%s \\n\", path.c_str());\n\t\texit(EXIT_FAILURE);\n\t}\n\tindex_parameters_.gd_gmm = gmm_read(gmm_file);\n\tfclose(gmm_file);\n}\n\nvoid gdindex::load_corr_weights(string path)\n{\n\tFILE* cw_file = fopen(path.c_str(), \"rb\");\n\tif (cw_file == nullptr) {\n\t\tprintf(\"gdindex::load_corr_weights: Error opening: \\n%s \\n\", path.c_str());\n\t\texit(EXIT_FAILURE);\n\t}\n\tfloat* weights = new float[index_parameters_.ld_pca_dim + 1];\n\tfread(weights, sizeof(float), index_parameters_.ld_pca_dim + 1,\n\t cw_file);\n\tfclose(cw_file);\n\n\t// Build fast_corr_weights\n\tquery_parameters_.fast_corr_weights = new float[index_parameters_.ld_pca_dim + 1];\n\t// -- initialize them to zero\n\tfor (uint i = 0; i < index_parameters_.ld_pca_dim + 1; i++) {\n\t\tquery_parameters_.fast_corr_weights[i] = 0;\n\t}\n\n\tfor (uint count_bin = 0; count_bin < index_parameters_.ld_pca_dim + 1; count_bin++) {\n\t\tfloat prob = weights[index_parameters_.ld_pca_dim - count_bin]/2.0; // normalize to 1\n\t\tfloat corr = index_parameters_.ld_pca_dim - 2*count_bin;\n\t\tif (count_bin < CORR_WEIGHTS_CLIPPING) {\n\t\t\tquery_parameters_.fast_corr_weights[count_bin] = prob * corr;\n\t\t}\n\t}\n\n\t// Clean up\n\tif (weights != nullptr) {\n\t\tdelete [] weights;\n\t\tweights = nullptr;\n\t}\n}\n\n}\n} /* namespace vrs */\n", "meta": {"hexsha": "6b4361fe1a9267e3666795f1199570a79355b5d6", "size": 58407, "ext": "cpp", "lang": "C++", "max_stars_repo_path": "base_engine/src/components/indexer/global_descriptor/gdindex.cpp", "max_stars_repo_name": "AiPratice/VideoAnalysisEngine", "max_stars_repo_head_hexsha": "e6aa67e5b0d08d6b3ae1b63988982ef31e60bf7a", "max_stars_repo_licenses": ["Apache-2.0"], "max_stars_count": 23.0, "max_stars_repo_stars_event_min_datetime": "2018-09-12T10:04:32.000Z", "max_stars_repo_stars_event_max_datetime": "2022-02-13T12:07:53.000Z", "max_issues_repo_path": "base_engine/src/components/indexer/global_descriptor/gdindex.cpp", "max_issues_repo_name": "AiPratice/VideoAnalysisTool", "max_issues_repo_head_hexsha": "e6aa67e5b0d08d6b3ae1b63988982ef31e60bf7a", "max_issues_repo_licenses": ["Apache-2.0"], "max_issues_count": 1.0, "max_issues_repo_issues_event_min_datetime": "2021-03-24T03:37:28.000Z", "max_issues_repo_issues_event_max_datetime": "2021-03-24T03:37:28.000Z", "max_forks_repo_path": "base_engine/src/components/indexer/global_descriptor/gdindex.cpp", "max_forks_repo_name": "AiPratice/VideoAnalysisTool", "max_forks_repo_head_hexsha": "e6aa67e5b0d08d6b3ae1b63988982ef31e60bf7a", "max_forks_repo_licenses": ["Apache-2.0"], "max_forks_count": 12.0, "max_forks_repo_forks_event_min_datetime": "2018-09-12T10:04:33.000Z", "max_forks_repo_forks_event_max_datetime": "2021-12-20T12:47:07.000Z", "avg_line_length": 38.6034368804, "max_line_length": 139, "alphanum_fraction": 0.6799698666, "num_tokens": 14186, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.5039061705290805, "lm_q2_score": 0.2942149783515162, "lm_q1q2_score": 0.14825674305340886}} {"text": "//==================================================================================================\n/**\n Copyright 2016 NumScale SAS\n\n Distributed under the Boost Software License, Version 1.0.\n (See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)\n**/\n//==================================================================================================\n#ifndef BOOST_SIMD_ARCH_X86_XOP_SIMD_FUNCTION_SHIFT_RIGHT_HPP_INCLUDED\n#define BOOST_SIMD_ARCH_X86_XOP_SIMD_FUNCTION_SHIFT_RIGHT_HPP_INCLUDED\n\n#include \n#include \n#include \n\n#if BOOST_HW_SIMD_X86_AMD_XOP\nnamespace boost { namespace simd { namespace ext\n{\n namespace bd = boost::dispatch;\n namespace bs = boost::simd;\n\n BOOST_DISPATCH_OVERLOAD_IF( shift_right_\n , (typename A0, typename A1)\n , (brigand::bool_)\n , bs::avx_\n , bs::pack_< bd::integer_, bs::sse_>\n , bs::pack_< bd::integer_, bs::sse_>\n )\n {\n BOOST_FORCEINLINE A0 operator()(A0 const& a0,A1 const& a1) const\n {\n BOOST_ASSERT_MSG( assert_good_shift(a1)\n , \"boost::simd::shift_right: shift value is out of range\"\n );\n\n return rshr(a0,a1);\n }\n };\n} } }\n#endif\n\n#endif\n", "meta": {"hexsha": "6e6da97ad221d213f399cb5281950faf0d200a6f", "size": 1484, "ext": "hpp", "lang": "C++", "max_stars_repo_path": "third_party/boost/simd/arch/x86/xop/simd/function/shift_right.hpp", "max_stars_repo_name": "xmar/pythran", "max_stars_repo_head_hexsha": "dbf2e8b70ed1e4d4ac6b5f26ead4add940a72592", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 5.0, "max_stars_repo_stars_event_min_datetime": "2018-02-20T11:21:12.000Z", "max_stars_repo_stars_event_max_datetime": "2019-11-12T13:45:09.000Z", "max_issues_repo_path": "third_party/boost/simd/arch/x86/xop/simd/function/shift_right.hpp", "max_issues_repo_name": "xmar/pythran", "max_issues_repo_head_hexsha": "dbf2e8b70ed1e4d4ac6b5f26ead4add940a72592", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "third_party/boost/simd/arch/x86/xop/simd/function/shift_right.hpp", "max_forks_repo_name": "xmar/pythran", "max_forks_repo_head_hexsha": "dbf2e8b70ed1e4d4ac6b5f26ead4add940a72592", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 2.0, "max_forks_repo_forks_event_min_datetime": "2017-12-12T12:29:52.000Z", "max_forks_repo_forks_event_max_datetime": "2019-04-08T15:55:25.000Z", "avg_line_length": 34.511627907, "max_line_length": 100, "alphanum_fraction": 0.5296495957, "num_tokens": 320, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.5312093733737563, "lm_q2_score": 0.2782567817320044, "lm_q1q2_score": 0.14781261066085613}} {"text": "#include \"extractor/guidance/turn_handler.hpp\"\n#include \"extractor/guidance/constants.hpp\"\n#include \"extractor/guidance/intersection_scenario_three_way.hpp\"\n#include \"extractor/guidance/toolkit.hpp\"\n\n#include \"util/guidance/toolkit.hpp\"\n\n#include \n#include \n\n#include \n\nusing EdgeData = osrm::util::NodeBasedDynamicGraph::EdgeData;\nusing osrm::util::guidance::getTurnDirection;\nusing osrm::util::guidance::angularDeviation;\n\nnamespace osrm\n{\nnamespace extractor\n{\nnamespace guidance\n{\n\nTurnHandler::TurnHandler(const util::NodeBasedDynamicGraph &node_based_graph,\n const std::vector &node_info_list,\n const util::NameTable &name_table,\n const SuffixTable &street_name_suffix_table)\n : IntersectionHandler(node_based_graph, node_info_list, name_table, street_name_suffix_table)\n{\n}\n\nbool TurnHandler::canProcess(const NodeID, const EdgeID, const Intersection &) const\n{\n return true;\n}\n\nIntersection TurnHandler::\noperator()(const NodeID, const EdgeID via_edge, Intersection intersection) const\n{\n if (intersection.size() == 1)\n return handleOneWayTurn(std::move(intersection));\n\n if (intersection[0].entry_allowed)\n {\n intersection[0].turn.instruction = {findBasicTurnType(via_edge, intersection[0]),\n DirectionModifier::UTurn};\n }\n\n if (intersection.size() == 2)\n return handleTwoWayTurn(via_edge, std::move(intersection));\n\n if (intersection.size() == 3)\n return handleThreeWayTurn(via_edge, std::move(intersection));\n\n return handleComplexTurn(via_edge, std::move(intersection));\n}\n\nIntersection TurnHandler::handleOneWayTurn(Intersection intersection) const\n{\n BOOST_ASSERT(intersection[0].turn.angle < 0.001);\n return intersection;\n}\n\nIntersection TurnHandler::handleTwoWayTurn(const EdgeID via_edge, Intersection intersection) const\n{\n BOOST_ASSERT(intersection[0].turn.angle < 0.001);\n intersection[1].turn.instruction =\n getInstructionForObvious(intersection.size(), via_edge, false, intersection[1]);\n\n return intersection;\n}\n\nbool TurnHandler::isObviousOfTwo(const EdgeID via_edge,\n const ConnectedRoad &road,\n const ConnectedRoad &other) const\n{\n const auto &in_data = node_based_graph.GetEdgeData(via_edge);\n\n const auto &first_data = node_based_graph.GetEdgeData(road.turn.eid);\n const auto &second_data = node_based_graph.GetEdgeData(other.turn.eid);\n const auto &first_classification = first_data.road_classification;\n const auto &second_classification = second_data.road_classification;\n const bool is_ramp = first_classification.IsRampClass();\n const bool is_obvious_by_road_class =\n (!is_ramp &&\n (2 * first_classification.GetPriority() < second_classification.GetPriority()) &&\n in_data.road_classification == first_classification) ||\n (!first_classification.IsLowPriorityRoadClass() &&\n second_classification.IsLowPriorityRoadClass());\n\n if (is_obvious_by_road_class)\n return true;\n\n const bool other_is_obvious_by_road_class =\n (!second_classification.IsRampClass() &&\n (2 * second_classification.GetPriority() < first_classification.GetPriority()) &&\n in_data.road_classification == second_classification) ||\n (!second_classification.IsLowPriorityRoadClass() &&\n first_classification.IsLowPriorityRoadClass());\n\n if (other_is_obvious_by_road_class)\n return false;\n\n const bool turn_is_perfectly_straight =\n angularDeviation(road.turn.angle, STRAIGHT_ANGLE) < std::numeric_limits::epsilon();\n\n if (turn_is_perfectly_straight && in_data.name_id != EMPTY_NAMEID &&\n in_data.name_id == node_based_graph.GetEdgeData(road.turn.eid).name_id)\n return true;\n\n const bool is_much_narrower_than_other =\n angularDeviation(other.turn.angle, STRAIGHT_ANGLE) /\n angularDeviation(road.turn.angle, STRAIGHT_ANGLE) >\n INCREASES_BY_FOURTY_PERCENT &&\n angularDeviation(angularDeviation(other.turn.angle, STRAIGHT_ANGLE),\n angularDeviation(road.turn.angle, STRAIGHT_ANGLE)) >\n FUZZY_ANGLE_DIFFERENCE;\n\n return is_much_narrower_than_other;\n}\n\nIntersection TurnHandler::handleThreeWayTurn(const EdgeID via_edge, Intersection intersection) const\n{\n const auto &in_data = node_based_graph.GetEdgeData(via_edge);\n const auto &first_data = node_based_graph.GetEdgeData(intersection[1].turn.eid);\n const auto &second_data = node_based_graph.GetEdgeData(intersection[2].turn.eid);\n BOOST_ASSERT(intersection[0].turn.angle < 0.001);\n /* Two nearly straight turns -> FORK\n OOOOOOO\n /\n IIIIII\n \\\n OOOOOOO\n */\n const auto fork_range = findFork(via_edge, intersection);\n if (fork_range.first == 1 && fork_range.second == 2)\n assignFork(via_edge, intersection[2], intersection[1]);\n\n /* T Intersection\n\n OOOOOOO T OOOOOOOO\n I\n I\n I\n */\n else if (isEndOfRoad(intersection[0], intersection[1], intersection[2]) &&\n !isObviousOfTwo(via_edge, intersection[1], intersection[2]) &&\n !isObviousOfTwo(via_edge, intersection[2], intersection[1]))\n {\n if (intersection[1].entry_allowed)\n {\n if (TurnType::OnRamp != findBasicTurnType(via_edge, intersection[1]))\n intersection[1].turn.instruction = {TurnType::EndOfRoad, DirectionModifier::Right};\n else\n intersection[1].turn.instruction = {TurnType::OnRamp, DirectionModifier::Right};\n }\n if (intersection[2].entry_allowed)\n {\n if (TurnType::OnRamp != findBasicTurnType(via_edge, intersection[2]))\n\n intersection[2].turn.instruction = {TurnType::EndOfRoad, DirectionModifier::Left};\n else\n intersection[2].turn.instruction = {TurnType::OnRamp, DirectionModifier::Left};\n }\n }\n else\n {\n if (isObviousOfTwo(via_edge, intersection[1], intersection[2]) &&\n (in_data.name_id != second_data.name_id || first_data.name_id == second_data.name_id))\n {\n intersection[1].turn.instruction = getInstructionForObvious(\n 3, via_edge, isThroughStreet(1, intersection), intersection[1]);\n }\n else\n {\n intersection[1].turn.instruction = {findBasicTurnType(via_edge, intersection[1]),\n getTurnDirection(intersection[1].turn.angle)};\n }\n\n if (isObviousOfTwo(via_edge, intersection[2], intersection[1]) &&\n (in_data.name_id != first_data.name_id || first_data.name_id == second_data.name_id))\n {\n intersection[2].turn.instruction = getInstructionForObvious(\n 3, via_edge, isThroughStreet(2, intersection), intersection[2]);\n }\n else\n {\n intersection[2].turn.instruction = {findBasicTurnType(via_edge, intersection[2]),\n getTurnDirection(intersection[2].turn.angle)};\n }\n }\n return intersection;\n}\n\nIntersection TurnHandler::handleComplexTurn(const EdgeID via_edge, Intersection intersection) const\n{\n const std::size_t obvious_index = findObviousTurn(via_edge, intersection);\n const auto fork_range = findFork(via_edge, intersection);\n std::size_t straightmost_turn = 0;\n double straightmost_deviation = 180;\n for (std::size_t i = 0; i < intersection.size(); ++i)\n {\n const double deviation = angularDeviation(intersection[i].turn.angle, STRAIGHT_ANGLE);\n if (deviation < straightmost_deviation)\n {\n straightmost_deviation = deviation;\n straightmost_turn = i;\n }\n }\n\n // check whether there is a turn of the same name\n const auto &in_data = node_based_graph.GetEdgeData(via_edge);\n\n const bool has_same_name_turn = [&]() {\n for (std::size_t i = 1; i < intersection.size(); ++i)\n {\n if (node_based_graph.GetEdgeData(intersection[i].turn.eid).name_id == in_data.name_id)\n return true;\n }\n return false;\n }();\n\n // check whether the obvious choice is actually a through street\n if (obvious_index != 0)\n {\n intersection[obvious_index].turn.instruction =\n getInstructionForObvious(intersection.size(),\n via_edge,\n isThroughStreet(obvious_index, intersection),\n intersection[obvious_index]);\n if (has_same_name_turn &&\n node_based_graph.GetEdgeData(intersection[obvious_index].turn.eid).name_id !=\n in_data.name_id &&\n intersection[obvious_index].turn.instruction.type == TurnType::NewName)\n {\n // this is a special case that is necessary to correctly handle obvious turns on\n // continuing streets. Right now osrm does not know about right of way. If a street\n // turns to the left just like:\n //\n // a\n // a\n // aaaaaaa b b\n //\n // And another road exits here, we don't want to call it a new name, even though the\n // turn is obvious and does not require steering. To correctly handle these situations\n // in turn collapsing, we use the turn + straight combination here\n intersection[obvious_index].turn.instruction.type = TurnType::Turn;\n intersection[obvious_index].turn.instruction.direction_modifier =\n DirectionModifier::Straight;\n }\n\n // assign left/right turns\n intersection = assignLeftTurns(via_edge, std::move(intersection), obvious_index + 1);\n intersection = assignRightTurns(via_edge, std::move(intersection), obvious_index);\n }\n else if (fork_range.first != 0 && fork_range.second - fork_range.first <= 2) // found fork\n {\n if (fork_range.second - fork_range.first == 1)\n {\n auto &left = intersection[fork_range.second];\n auto &right = intersection[fork_range.first];\n const auto left_classification =\n node_based_graph.GetEdgeData(left.turn.eid).road_classification;\n const auto right_classification =\n node_based_graph.GetEdgeData(right.turn.eid).road_classification;\n if (canBeSeenAsFork(left_classification, right_classification))\n assignFork(via_edge, left, right);\n else if (left_classification.GetPriority() > right_classification.GetPriority())\n {\n right.turn.instruction =\n getInstructionForObvious(intersection.size(), via_edge, false, right);\n left.turn.instruction = {findBasicTurnType(via_edge, left),\n DirectionModifier::SlightLeft};\n }\n else\n {\n left.turn.instruction =\n getInstructionForObvious(intersection.size(), via_edge, false, left);\n right.turn.instruction = {findBasicTurnType(via_edge, right),\n DirectionModifier::SlightRight};\n }\n }\n else if (fork_range.second - fork_range.first == 2)\n {\n assignFork(via_edge,\n intersection[fork_range.second],\n intersection[fork_range.first + 1],\n intersection[fork_range.first]);\n }\n // assign left/right turns\n intersection = assignLeftTurns(via_edge, std::move(intersection), fork_range.second + 1);\n intersection = assignRightTurns(via_edge, std::move(intersection), fork_range.first);\n }\n else if (straightmost_deviation < FUZZY_ANGLE_DIFFERENCE &&\n !intersection[straightmost_turn].entry_allowed)\n {\n // invalid straight turn\n intersection = assignLeftTurns(via_edge, std::move(intersection), straightmost_turn + 1);\n intersection = assignRightTurns(via_edge, std::move(intersection), straightmost_turn);\n }\n // no straight turn\n else if (intersection[straightmost_turn].turn.angle > 180)\n {\n // at most three turns on either side\n intersection = assignLeftTurns(via_edge, std::move(intersection), straightmost_turn);\n intersection = assignRightTurns(via_edge, std::move(intersection), straightmost_turn);\n }\n else if (intersection[straightmost_turn].turn.angle < 180)\n {\n intersection = assignLeftTurns(via_edge, std::move(intersection), straightmost_turn + 1);\n intersection = assignRightTurns(via_edge, std::move(intersection), straightmost_turn + 1);\n }\n else\n {\n assignTrivialTurns(via_edge, intersection, 1, intersection.size());\n }\n return intersection;\n}\n\n// Assignment of left turns hands of to right turns.\n// To do so, we mirror every road segment and reverse the order.\n// After the mirror and reversal / we assign right turns and\n// mirror again and restore the original order.\nIntersection TurnHandler::assignLeftTurns(const EdgeID via_edge,\n Intersection intersection,\n const std::size_t starting_at) const\n{\n BOOST_ASSERT(starting_at <= intersection.size());\n const auto switch_left_and_right = [](Intersection &intersection) {\n BOOST_ASSERT(!intersection.empty());\n\n for (auto &road : intersection)\n road = mirror(std::move(road));\n\n std::reverse(intersection.begin() + 1, intersection.end());\n };\n\n switch_left_and_right(intersection);\n // account for the u-turn in the beginning\n const auto count = intersection.size() - starting_at + 1;\n intersection = assignRightTurns(via_edge, std::move(intersection), count);\n switch_left_and_right(intersection);\n\n return intersection;\n}\n\n// can only assign three turns\nIntersection TurnHandler::assignRightTurns(const EdgeID via_edge,\n Intersection intersection,\n const std::size_t up_to) const\n{\n BOOST_ASSERT(up_to <= intersection.size());\n const auto count_valid = [&intersection, up_to]() {\n std::size_t count = 0;\n for (std::size_t i = 1; i < up_to; ++i)\n if (intersection[i].entry_allowed)\n ++count;\n return count;\n };\n if (up_to <= 1 || count_valid() == 0)\n return intersection;\n // handle single turn\n if (up_to == 2)\n {\n assignTrivialTurns(via_edge, intersection, 1, up_to);\n }\n // Handle Turns 1-3\n else if (up_to == 3)\n {\n const auto first_direction = getTurnDirection(intersection[1].turn.angle);\n const auto second_direction = getTurnDirection(intersection[2].turn.angle);\n if (first_direction == second_direction)\n {\n // conflict\n handleDistinctConflict(via_edge, intersection[2], intersection[1]);\n }\n else\n {\n assignTrivialTurns(via_edge, intersection, 1, up_to);\n }\n }\n // Handle Turns 1-4\n else if (up_to == 4)\n {\n const auto first_direction = getTurnDirection(intersection[1].turn.angle);\n const auto second_direction = getTurnDirection(intersection[2].turn.angle);\n const auto third_direction = getTurnDirection(intersection[3].turn.angle);\n if (first_direction != second_direction && second_direction != third_direction)\n {\n // due to the circular order, the turn directions are unique\n // first_direction != third_direction is implied\n BOOST_ASSERT(first_direction != third_direction);\n assignTrivialTurns(via_edge, intersection, 1, up_to);\n }\n else if (2 >= (intersection[1].entry_allowed + intersection[2].entry_allowed +\n intersection[3].entry_allowed))\n {\n // at least a single invalid\n if (!intersection[3].entry_allowed)\n {\n handleDistinctConflict(via_edge, intersection[2], intersection[1]);\n }\n else if (!intersection[1].entry_allowed)\n {\n handleDistinctConflict(via_edge, intersection[3], intersection[2]);\n }\n else // handles one-valid as well as two valid (1,3)\n {\n handleDistinctConflict(via_edge, intersection[3], intersection[1]);\n }\n }\n // From here on out, intersection[1-3].entry_allowed has to be true (Otherwise we would have\n // triggered 2>= ...)\n //\n // Conflicting Turns, but at least farther than what we call a narrow turn\n else if (angularDeviation(intersection[1].turn.angle, intersection[2].turn.angle) >=\n NARROW_TURN_ANGLE &&\n angularDeviation(intersection[2].turn.angle, intersection[3].turn.angle) >=\n NARROW_TURN_ANGLE)\n {\n BOOST_ASSERT(intersection[1].entry_allowed && intersection[2].entry_allowed &&\n intersection[3].entry_allowed);\n\n intersection[1].turn.instruction = {findBasicTurnType(via_edge, intersection[1]),\n DirectionModifier::SharpRight};\n intersection[2].turn.instruction = {findBasicTurnType(via_edge, intersection[2]),\n DirectionModifier::Right};\n intersection[3].turn.instruction = {findBasicTurnType(via_edge, intersection[3]),\n DirectionModifier::SlightRight};\n }\n else if (((first_direction == second_direction && second_direction == third_direction) ||\n (first_direction == second_direction &&\n angularDeviation(intersection[2].turn.angle, intersection[3].turn.angle) <\n GROUP_ANGLE) ||\n (second_direction == third_direction &&\n angularDeviation(intersection[1].turn.angle, intersection[2].turn.angle) <\n GROUP_ANGLE)))\n {\n BOOST_ASSERT(intersection[1].entry_allowed && intersection[2].entry_allowed &&\n intersection[3].entry_allowed);\n // count backwards from the slightest turn\n assignTrivialTurns(via_edge, intersection, 1, up_to);\n }\n else if (((first_direction == second_direction &&\n angularDeviation(intersection[2].turn.angle, intersection[3].turn.angle) >=\n GROUP_ANGLE) ||\n (second_direction == third_direction &&\n angularDeviation(intersection[1].turn.angle, intersection[2].turn.angle) >=\n GROUP_ANGLE)))\n {\n BOOST_ASSERT(intersection[1].entry_allowed && intersection[2].entry_allowed &&\n intersection[3].entry_allowed);\n\n if (angularDeviation(intersection[2].turn.angle, intersection[3].turn.angle) >=\n GROUP_ANGLE)\n {\n handleDistinctConflict(via_edge, intersection[2], intersection[1]);\n intersection[3].turn.instruction = {findBasicTurnType(via_edge, intersection[3]),\n third_direction};\n }\n else\n {\n intersection[1].turn.instruction = {findBasicTurnType(via_edge, intersection[1]),\n first_direction};\n handleDistinctConflict(via_edge, intersection[3], intersection[2]);\n }\n }\n else\n {\n assignTrivialTurns(via_edge, intersection, 1, up_to);\n }\n }\n else\n {\n assignTrivialTurns(via_edge, intersection, 1, up_to);\n }\n return intersection;\n}\n\nstd::pair TurnHandler::findFork(const EdgeID via_edge,\n const Intersection &intersection) const\n{\n\n std::size_t best = 0;\n double best_deviation = 180;\n\n // TODO handle road classes\n for (std::size_t i = 1; i < intersection.size(); ++i)\n {\n const double deviation = angularDeviation(intersection[i].turn.angle, STRAIGHT_ANGLE);\n if (intersection[i].entry_allowed && deviation < best_deviation)\n {\n best_deviation = deviation;\n best = i;\n }\n }\n if (best_deviation <= NARROW_TURN_ANGLE)\n {\n std::size_t left = best, right = best;\n while (left + 1 < intersection.size() &&\n (angularDeviation(intersection[left + 1].turn.angle, STRAIGHT_ANGLE) <=\n NARROW_TURN_ANGLE ||\n (angularDeviation(intersection[left].turn.angle,\n intersection[left + 1].turn.angle) <= NARROW_TURN_ANGLE &&\n angularDeviation(intersection[left].turn.angle, STRAIGHT_ANGLE) <= GROUP_ANGLE)))\n ++left;\n while (\n right > 1 &&\n (angularDeviation(intersection[right - 1].turn.angle, STRAIGHT_ANGLE) <=\n NARROW_TURN_ANGLE ||\n (angularDeviation(intersection[right].turn.angle, intersection[right - 1].turn.angle) <\n NARROW_TURN_ANGLE &&\n angularDeviation(intersection[right - 1].turn.angle, STRAIGHT_ANGLE) <= GROUP_ANGLE)))\n --right;\n\n if (left == right)\n return std::make_pair(std::size_t{0}, std::size_t{0});\n\n const bool valid_indices = 0 < right && right < left;\n const bool separated_at_left_side =\n angularDeviation(intersection[left].turn.angle,\n intersection[(left + 1) % intersection.size()].turn.angle) >=\n GROUP_ANGLE;\n const bool separated_at_right_side =\n right > 0 &&\n angularDeviation(intersection[right].turn.angle, intersection[right - 1].turn.angle) >=\n GROUP_ANGLE;\n\n const bool not_more_than_three = (left - right) <= 2;\n const bool has_obvious = [&]() {\n if (left - right == 1)\n {\n return isObviousOfTwo(via_edge, intersection[left], intersection[right]) ||\n isObviousOfTwo(via_edge, intersection[right], intersection[left]);\n }\n else if (left - right == 2)\n {\n return isObviousOfTwo(via_edge, intersection[right + 1], intersection[right]) ||\n isObviousOfTwo(via_edge, intersection[right], intersection[right + 1]) ||\n isObviousOfTwo(via_edge, intersection[left], intersection[right + 1]) ||\n isObviousOfTwo(via_edge, intersection[right + 1], intersection[left]);\n }\n return false;\n }();\n\n const bool has_compatible_classes = [&]() {\n const bool ramp_class = node_based_graph.GetEdgeData(intersection[right].turn.eid)\n .road_classification.IsLinkClass();\n for (std::size_t index = right + 1; index <= left; ++index)\n if (ramp_class !=\n node_based_graph.GetEdgeData(intersection[index].turn.eid)\n .road_classification.IsLinkClass())\n return false;\n return true;\n }();\n\n // TODO check whether 2*NARROW_TURN is too large\n if (valid_indices && separated_at_left_side && separated_at_right_side &&\n not_more_than_three && !has_obvious && has_compatible_classes)\n return std::make_pair(right, left);\n }\n return std::make_pair(std::size_t{0}, std::size_t{0});\n}\n\nvoid TurnHandler::handleDistinctConflict(const EdgeID via_edge,\n ConnectedRoad &left,\n ConnectedRoad &right) const\n{\n // single turn of both is valid (don't change the valid one)\n // or multiple identical angles -> bad OSM intersection\n if ((!left.entry_allowed || !right.entry_allowed) || (left.turn.angle == right.turn.angle))\n {\n if (left.entry_allowed)\n left.turn.instruction = {findBasicTurnType(via_edge, left),\n getTurnDirection(left.turn.angle)};\n if (right.entry_allowed)\n right.turn.instruction = {findBasicTurnType(via_edge, right),\n getTurnDirection(right.turn.angle)};\n return;\n }\n\n if (getTurnDirection(left.turn.angle) == DirectionModifier::Straight ||\n getTurnDirection(left.turn.angle) == DirectionModifier::SlightLeft ||\n getTurnDirection(right.turn.angle) == DirectionModifier::SlightRight)\n {\n const auto left_classification =\n node_based_graph.GetEdgeData(left.turn.eid).road_classification;\n const auto right_classification =\n node_based_graph.GetEdgeData(right.turn.eid).road_classification;\n if (canBeSeenAsFork(left_classification, right_classification))\n assignFork(via_edge, left, right);\n else if (left_classification.GetPriority() > right_classification.GetPriority())\n {\n // FIXME this should possibly know about the actual roads?\n // here we don't know about the intersection size. To be on the save side,\n // we declare it\n // as complex (at least size 4)\n right.turn.instruction = getInstructionForObvious(4, via_edge, false, right);\n left.turn.instruction = {findBasicTurnType(via_edge, left),\n DirectionModifier::SlightLeft};\n }\n else\n {\n // FIXME this should possibly know about the actual roads?\n // here we don't know about the intersection size. To be on the save side,\n // we declare it\n // as complex (at least size 4)\n left.turn.instruction = getInstructionForObvious(4, via_edge, false, left);\n right.turn.instruction = {findBasicTurnType(via_edge, right),\n DirectionModifier::SlightRight};\n }\n }\n const auto left_type = findBasicTurnType(via_edge, left);\n const auto right_type = findBasicTurnType(via_edge, right);\n // Two Right Turns\n if (angularDeviation(left.turn.angle, 90) < MAXIMAL_ALLOWED_NO_TURN_DEVIATION)\n {\n // Keep left perfect, shift right\n left.turn.instruction = {left_type, DirectionModifier::Right};\n right.turn.instruction = {right_type, DirectionModifier::SharpRight};\n return;\n }\n if (angularDeviation(right.turn.angle, 90) < MAXIMAL_ALLOWED_NO_TURN_DEVIATION)\n {\n // Keep Right perfect, shift left\n left.turn.instruction = {left_type, DirectionModifier::SlightRight};\n right.turn.instruction = {right_type, DirectionModifier::Right};\n return;\n }\n // Two Right Turns\n if (angularDeviation(left.turn.angle, 270) < MAXIMAL_ALLOWED_NO_TURN_DEVIATION)\n {\n // Keep left perfect, shift right\n left.turn.instruction = {left_type, DirectionModifier::Left};\n right.turn.instruction = {right_type, DirectionModifier::SlightLeft};\n return;\n }\n if (angularDeviation(right.turn.angle, 270) < MAXIMAL_ALLOWED_NO_TURN_DEVIATION)\n {\n // Keep Right perfect, shift left\n left.turn.instruction = {left_type, DirectionModifier::SharpLeft};\n right.turn.instruction = {right_type, DirectionModifier::Left};\n return;\n }\n // Shift the lesser penalty\n if (getTurnDirection(left.turn.angle) == DirectionModifier::SharpLeft)\n {\n left.turn.instruction = {left_type, DirectionModifier::SharpLeft};\n right.turn.instruction = {right_type, DirectionModifier::Left};\n return;\n }\n if (getTurnDirection(right.turn.angle) == DirectionModifier::SharpRight)\n {\n left.turn.instruction = {left_type, DirectionModifier::Right};\n right.turn.instruction = {right_type, DirectionModifier::SharpRight};\n return;\n }\n\n if (getTurnDirection(left.turn.angle) == DirectionModifier::Right)\n {\n if (angularDeviation(left.turn.angle, 90) > angularDeviation(right.turn.angle, 90))\n {\n left.turn.instruction = {left_type, DirectionModifier::SlightRight};\n right.turn.instruction = {right_type, DirectionModifier::Right};\n }\n else\n {\n left.turn.instruction = {left_type, DirectionModifier::Right};\n right.turn.instruction = {right_type, DirectionModifier::SharpRight};\n }\n }\n else\n {\n if (angularDeviation(left.turn.angle, 270) > angularDeviation(right.turn.angle, 270))\n {\n left.turn.instruction = {left_type, DirectionModifier::SharpLeft};\n right.turn.instruction = {right_type, DirectionModifier::Left};\n }\n else\n {\n left.turn.instruction = {left_type, DirectionModifier::Left};\n right.turn.instruction = {right_type, DirectionModifier::SlightLeft};\n }\n }\n}\n\n} // namespace guidance\n} // namespace extractor\n} // namespace osrm\n", "meta": {"hexsha": "e86276ebcb3334ac4dc8d13f7ff33edda05bb5e5", "size": 29568, "ext": "cpp", "lang": "C++", "max_stars_repo_path": "src/extractor/guidance/turn_handler.cpp", "max_stars_repo_name": "AccessMap/accessmaplite-osrm-backend", "max_stars_repo_head_hexsha": "1a7586b7cc33c6ba7bff63c418df5b4822fd7f27", "max_stars_repo_licenses": ["BSD-2-Clause"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "src/extractor/guidance/turn_handler.cpp", "max_issues_repo_name": "AccessMap/accessmaplite-osrm-backend", "max_issues_repo_head_hexsha": "1a7586b7cc33c6ba7bff63c418df5b4822fd7f27", "max_issues_repo_licenses": ["BSD-2-Clause"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/extractor/guidance/turn_handler.cpp", "max_forks_repo_name": "AccessMap/accessmaplite-osrm-backend", "max_forks_repo_head_hexsha": "1a7586b7cc33c6ba7bff63c418df5b4822fd7f27", "max_forks_repo_licenses": ["BSD-2-Clause"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 42.852173913, "max_line_length": 100, "alphanum_fraction": 0.613771645, "num_tokens": 6273, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.5078118791767282, "lm_q2_score": 0.2909808600663598, "lm_q1q2_score": 0.14776353735475878}} {"text": "/*\n Copyright (C) 2016 Quaternion Risk Management Ltd\n All rights reserved.\n\n This file is part of ORE, a free-software/open-source library\n for transparent pricing and risk analysis - http://opensourcerisk.org\n\n ORE is free software: you can redistribute it and/or modify it\n under the terms of the Modified BSD License. You should have received a\n copy of the license along with this program.\n The license is also available online at \n\n This program is distributed on the basis that it will form a useful\n contribution to risk analytics and model standardisation, but WITHOUT\n ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n FITNESS FOR A PARTICULAR PURPOSE. See the license for more details.\n*/\n\n/*! \\file ored/utilities/indexparser.cpp\n \\brief\n \\ingroup utilities\n*/\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nusing namespace QuantLib;\nusing namespace QuantExt;\nusing namespace std;\nusing ore::data::Convention;\n\nnamespace ore {\nnamespace data {\n\n// Helper build classes for static map\n\nclass IborIndexParser {\npublic:\n virtual ~IborIndexParser() {}\n virtual boost::shared_ptr build(Period p, const Handle& h) const = 0;\n};\n\ntemplate class IborIndexParserWithPeriod : public IborIndexParser {\npublic:\n boost::shared_ptr build(Period p, const Handle& h) const override {\n QL_REQUIRE(p != 1 * Days, \"must have a period longer than 1D\");\n return boost::make_shared(p, h);\n }\n};\n\n// Specialise for MXN-TIIE. If tenor equates to 28 Days, i.e. tenor is 4W or 28D, ensure that the index is created\n// with a tenor of 4W under the hood. Things work better this way especially cap floor stripping.\ntemplate <> class IborIndexParserWithPeriod : public IborIndexParser {\npublic:\n boost::shared_ptr build(Period p, const Handle& h) const override {\n QL_REQUIRE(p != 1 * Days, \"must have a period longer than 1D\");\n if (p.units() == Days && p.length() == 28) {\n return boost::make_shared(4 * Weeks, h);\n } else {\n return boost::make_shared(p, h);\n }\n }\n};\n\ntemplate class IborIndexParserOIS : public IborIndexParser {\npublic:\n boost::shared_ptr build(Period p, const Handle& h) const override {\n QL_REQUIRE(p == 1 * Days, \"must have period 1D\");\n return boost::make_shared(h);\n }\n};\n\ntemplate class IborIndexParserBMA : public IborIndexParser {\npublic:\n boost::shared_ptr build(Period p, const Handle& h) const override {\n QL_REQUIRE((p.length() == 7 && p.units() == Days) || (p.length() == 1 && p.units() == Weeks),\n \"BMA indexes are uniquely available with a tenor of 1 week.\");\n const boost::shared_ptr bma = boost::make_shared(h);\n return boost::make_shared(bma);\n }\n};\n\nboost::shared_ptr parseFxIndex(const string& s) {\n std::vector tokens;\n split(tokens, s, boost::is_any_of(\"-\"));\n QL_REQUIRE(tokens.size() == 4, \"four tokens required in \" << s << \": FX-TAG-CCY1-CCY2\");\n QL_REQUIRE(tokens[0] == \"FX\", \"expected first token to be FX\");\n return boost::make_shared(tokens[0] + \"/\" + tokens[1], 0, parseCurrency(tokens[2]),\n parseCurrency(tokens[3]), NullCalendar());\n}\n\nboost::shared_ptr parseEquityIndex(const string& s) {\n std::vector tokens;\n split(tokens, s, boost::is_any_of(\"-\"));\n QL_REQUIRE(tokens.size() == 2, \"two tokens required in \" << s << \": EQ-NAME\");\n QL_REQUIRE(tokens[0] == \"EQ\", \"expected first token to be EQ\");\n if (tokens.size() == 2) {\n return boost::make_shared(tokens[1], NullCalendar(), Currency());\n } else {\n QL_FAIL(\"Error parsing equity string \" + s);\n }\n}\n\nbool tryParseIborIndex(const string& s, boost::shared_ptr& index) {\n try {\n index = parseIborIndex(s);\n } catch (...) {\n return false;\n }\n return true;\n}\n\nboost::shared_ptr parseIborIndex(const string& s, const Handle& h) {\n string dummy;\n return parseIborIndex(s, dummy, h);\n}\n\nboost::shared_ptr parseIborIndex(const string& s, string& tenor, const Handle& h) {\n\n std::vector tokens;\n split(tokens, s, boost::is_any_of(\"-\"));\n\n QL_REQUIRE(tokens.size() == 2 || tokens.size() == 3,\n \"Two or three tokens required in \" << s << \": CCY-INDEX or CCY-INDEX-TERM\");\n\n Period p;\n if (tokens.size() == 3) {\n tenor = tokens[2];\n p = parsePeriod(tokens[2]);\n } else {\n tenor = \"\";\n p = 1 * Days;\n }\n\n static map> m = {\n {\"EUR-EONIA\", boost::make_shared>()},\n {\"GBP-SONIA\", boost::make_shared>()},\n {\"JPY-TONAR\", boost::make_shared>()},\n {\"CHF-TOIS\", boost::make_shared>()},\n {\"CHF-SARON\", boost::make_shared>()},\n {\"USD-FedFunds\", boost::make_shared>()},\n {\"AUD-AONIA\", boost::make_shared>()},\n {\"CAD-CORRA\", boost::make_shared>()},\n {\"DKK-DKKOIS\", boost::make_shared>()},\n {\"DKK-TNR\", boost::make_shared>()},\n {\"SEK-SIOR\", boost::make_shared>()},\n {\"AUD-BBSW\", boost::make_shared>()},\n {\"AUD-LIBOR\", boost::make_shared>()},\n {\"EUR-EURIBOR\", boost::make_shared>()},\n {\"EUR-EURIB\", boost::make_shared>()},\n {\"CAD-CDOR\", boost::make_shared>()},\n {\"CAD-BA\", boost::make_shared>()},\n {\"CZK-PRIBOR\", boost::make_shared>()},\n {\"EUR-LIBOR\", boost::make_shared>()},\n {\"USD-LIBOR\", boost::make_shared>()},\n {\"GBP-LIBOR\", boost::make_shared>()},\n {\"JPY-LIBOR\", boost::make_shared>()},\n {\"JPY-TIBOR\", boost::make_shared>()},\n {\"CAD-LIBOR\", boost::make_shared>()},\n {\"CHF-LIBOR\", boost::make_shared>()},\n {\"SEK-LIBOR\", boost::make_shared>()},\n {\"SEK-STIBOR\", boost::make_shared>()},\n {\"NOK-NIBOR\", boost::make_shared>()},\n {\"HKD-HIBOR\", boost::make_shared>()},\n {\"SAR-SAIBOR\", boost::make_shared>()},\n {\"SGD-SIBOR\", boost::make_shared>()},\n {\"SGD-SOR\", boost::make_shared>()},\n {\"DKK-CIBOR\", boost::make_shared>()},\n {\"DKK-LIBOR\", boost::make_shared>()},\n {\"HUF-BUBOR\", boost::make_shared>()},\n {\"IDR-IDRFIX\", boost::make_shared>()},\n {\"IDR-JIBOR\", boost::make_shared>()},\n {\"ILS-TELBOR\", boost::make_shared>()},\n {\"INR-MIFOR\", boost::make_shared>()},\n {\"MXN-TIIE\", boost::make_shared>()},\n {\"PLN-WIBOR\", boost::make_shared>()},\n {\"SKK-BRIBOR\", boost::make_shared>()},\n {\"NZD-BKBM\", boost::make_shared>()},\n {\"TRY-TRLIBOR\", boost::make_shared>()},\n {\"TWD-TAIBOR\", boost::make_shared>()},\n {\"MYR-KLIBOR\", boost::make_shared>()},\n {\"KRW-CD\", boost::make_shared>()},\n {\"KRW-KORIBOR\", boost::make_shared>()},\n {\"ZAR-JIBAR\", boost::make_shared>()},\n {\"RUB-MOSPRIME\", boost::make_shared>()},\n {\"USD-SIFMA\", boost::make_shared>()},\n {\"THB-BIBOR\", boost::make_shared>()},\n {\"PHP-PHIREF\", boost::make_shared>()},\n {\"COP-IBR\", boost::make_shared>()},\n {\"DEM-LIBOR\", boost::make_shared>()},\n {\"BRL-CDI\", boost::make_shared>()},\n {\"NOK-NOWA\", boost::make_shared>()},\n {\"CLP-CAMARA\", boost::make_shared>()},\n {\"NZD-OCR\", boost::make_shared>()},\n {\"PLN-POLONIA\", boost::make_shared>()}};\n\n auto it = m.find(tokens[0] + \"-\" + tokens[1]);\n if (it != m.end()) {\n return it->second->build(p, h);\n } else if (tokens[1] == \"GENERIC\") {\n // We have a generic index\n auto ccy = parseCurrency(tokens[0]);\n return boost::make_shared(p, ccy, h);\n } else {\n QL_FAIL(\"parseIborIndex \\\"\" << s << \"\\\" not recognized\");\n }\n}\n\nbool isGenericIndex(const string& indexName) { \n return indexName.find(\"-GENERIC-\") != string::npos;\n}\n\nbool isInflationIndex(const string& indexName) {\n try {\n // Currently, only way to have an inflation index is to have a ZeroInflationIndex\n parseZeroInflationIndex(indexName);\n } catch (...) {\n return false;\n }\n return true;\n}\n\n// Swap Index Parser base\nclass SwapIndexParser {\npublic:\n virtual ~SwapIndexParser() {}\n virtual boost::shared_ptr build(Period p, const Handle& f,\n const Handle& d) const = 0;\n};\n\n// We build with both a forwarding and discounting curve\ntemplate class SwapIndexParserDualCurve : public SwapIndexParser {\npublic:\n boost::shared_ptr build(Period p, const Handle& f,\n const Handle& d) const override {\n return boost::make_shared(p, f, d);\n }\n};\n\nboost::shared_ptr parseSwapIndex(const string& s, const Handle& f,\n const Handle& d,\n boost::shared_ptr convention) {\n\n std::vector tokens;\n split(tokens, s, boost::is_any_of(\"-\"));\n\n QL_REQUIRE(tokens.size() == 3, \"three tokens required in \" << s << \": CCY-CMS-TENOR\");\n QL_REQUIRE(tokens[0].size() == 3, \"invalid currency code in \" << s);\n QL_REQUIRE(tokens[1] == \"CMS\", \"expected CMS as middle token in \" << s);\n\n Period p = parsePeriod(tokens[2]);\n\n string familyName = tokens[0] + \"LiborSwapIsdaFix\";\n Currency ccy = parseCurrency(tokens[0]);\n\n boost::shared_ptr index =\n f.empty() || !convention ? boost::shared_ptr() : convention->index()->clone(f);\n QuantLib::Natural settlementDays = index ? index->fixingDays() : 0;\n QuantLib::Calendar calender = convention ? convention->fixedCalendar() : NullCalendar();\n Period fixedLegTenor = convention ? Period(convention->fixedFrequency()) : Period(1, Months);\n BusinessDayConvention fixedLegConvention = convention ? convention->fixedConvention() : ModifiedFollowing;\n DayCounter fixedLegDayCounter = convention ? convention->fixedDayCounter() : ActualActual();\n\n if (d.empty())\n return boost::make_shared(familyName, p, settlementDays, ccy, calender, fixedLegTenor,\n fixedLegConvention, fixedLegDayCounter, index);\n else\n return boost::make_shared(familyName, p, settlementDays, ccy, calender, fixedLegTenor,\n fixedLegConvention, fixedLegDayCounter, index, d);\n}\n\n// Zero Inflation Index Parser\nclass ZeroInflationIndexParserBase {\npublic:\n virtual ~ZeroInflationIndexParserBase() {}\n virtual boost::shared_ptr build(bool isInterpolated,\n const Handle& h) const = 0;\n};\n\ntemplate class ZeroInflationIndexParser : public ZeroInflationIndexParserBase {\npublic:\n boost::shared_ptr build(bool isInterpolated,\n const Handle& h) const override {\n return boost::make_shared(isInterpolated, h);\n }\n};\n\nboost::shared_ptr parseZeroInflationIndex(const string& s, bool isInterpolated,\n const Handle& h) {\n\n static map> m = {\n {\"EUHICP\", boost::make_shared>()},\n {\"EU HICP\", boost::make_shared>()},\n {\"EUHICPXT\", boost::make_shared>()},\n {\"EU HICPXT\", boost::make_shared>()},\n {\"FRHICP\", boost::make_shared>()},\n {\"FR HICP\", boost::make_shared>()},\n {\"UKRPI\", boost::make_shared>()},\n {\"UK RPI\", boost::make_shared>()},\n {\"USCPI\", boost::make_shared>()},\n {\"US CPI\", boost::make_shared>()},\n {\"ZACPI\", boost::make_shared>()},\n {\"ZA CPI\", boost::make_shared>()},\n {\"SECPI\", boost::make_shared>()},\n {\"DKCPI\", boost::make_shared>()}};\n\n auto it = m.find(s);\n if (it != m.end()) {\n return it->second->build(isInterpolated, h);\n } else {\n QL_FAIL(\"parseZeroInflationIndex: \\\"\" << s << \"\\\" not recognized\");\n }\n}\n\nboost::shared_ptr parseIndex(const string& s, const data::Conventions& conventions) {\n boost::shared_ptr ret_idx;\n try {\n ret_idx = parseIborIndex(s);\n } catch (...) {\n }\n if (!ret_idx) {\n try {\n auto c = boost::dynamic_pointer_cast(conventions.get(s));\n QL_REQUIRE(c, \"no swap index convention\");\n auto c2 = boost::dynamic_pointer_cast(conventions.get(c->conventions()));\n QL_REQUIRE(c2, \"no swap convention\");\n ret_idx = parseSwapIndex(s, Handle(), Handle(), c2);\n } catch (...) {\n }\n }\n if (!ret_idx) {\n try {\n ret_idx = parseZeroInflationIndex(s);\n } catch (...) {\n }\n }\n if (!ret_idx) {\n try {\n ret_idx = parseFxIndex(s);\n } catch (...) {\n }\n }\n if (!ret_idx) {\n try {\n ret_idx = parseEquityIndex(s);\n } catch (...) {\n }\n }\n QL_REQUIRE(ret_idx, \"parseIndex \\\"\" << s << \"\\\" not recognized\");\n return ret_idx;\n}\n\nbool isOvernightIndex(const string& indexName) {\n\n boost::shared_ptr index;\n if (tryParseIborIndex(indexName, index)) {\n auto onIndex = boost::dynamic_pointer_cast(index);\n if (onIndex)\n return true;\n }\n\n return false;\n}\n\n} // namespace data\n} // namespace ore\n", "meta": {"hexsha": "032324c54039543f132d76730f632f2580a6eb83", "size": 18591, "ext": "cpp", "lang": "C++", "max_stars_repo_path": "OREData/ored/utilities/indexparser.cpp", "max_stars_repo_name": "chennssol/Engine", "max_stars_repo_head_hexsha": "d87a6bb2349419cf3575c8f9d698b4b1597cb4ae", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "OREData/ored/utilities/indexparser.cpp", "max_issues_repo_name": "chennssol/Engine", "max_issues_repo_head_hexsha": "d87a6bb2349419cf3575c8f9d698b4b1597cb4ae", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "OREData/ored/utilities/indexparser.cpp", "max_forks_repo_name": "chennssol/Engine", "max_forks_repo_head_hexsha": "d87a6bb2349419cf3575c8f9d698b4b1597cb4ae", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 1.0, "max_forks_repo_forks_event_min_datetime": "2022-02-07T02:04:10.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-07T02:04:10.000Z", "avg_line_length": 44.476076555, "max_line_length": 114, "alphanum_fraction": 0.666128772, "num_tokens": 5140, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO\n\n", "lm_q1_score": 0.5078118642792044, "lm_q2_score": 0.2909808600663598, "lm_q1q2_score": 0.1477635330198645}} {"text": "#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nnamespace bf = boost::filesystem;\nnamespace po = boost::program_options;\n\nnamespace std {\nstd::ostream &operator<<(std::ostream &, const std::vector &);\n\nstd::ostream &operator<<(std::ostream &os, const std::vector &vec) {\n for (auto item : vec) {\n os << item << \" \";\n }\n return os;\n}\n} // namespace std\n\nstruct CamConnect {\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n Eigen::Matrix4f transformation_;\n float edge_weight;\n size_t source_id_, target_id_;\n\n CamConnect() : edge_weight(0.f) {}\n\n bool operator<(const CamConnect &e) const {\n return edge_weight < e.edge_weight;\n }\n\n bool operator<=(const CamConnect &e) const {\n return edge_weight <= e.edge_weight;\n }\n\n bool operator>(const CamConnect &e) const {\n return edge_weight > e.edge_weight;\n }\n\n bool operator>=(const CamConnect &e) const {\n return edge_weight >= e.edge_weight;\n }\n};\n\nstruct View {\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n typedef pcl::PointXYZRGB PointT;\n cv::Mat descriptors_;\n std::vector keypoint_indices_;\n Eigen::Matrix4f camera_pose_;\n pcl::PointCloud::ConstPtr cloud_;\n};\n\nclass ViewRegistration {\n private:\n typedef pcl::PointXYZRGB PointT;\n std::vector> grph_;\n\n typedef boost::property EdgeWeightProperty;\n typedef boost::adjacency_list Graph;\n typedef boost::graph_traits::vertex_descriptor Vertex;\n typedef boost::graph_traits::edge_descriptor Edge;\n typedef boost::graph_traits::vertex_iterator vertex_iter;\n typedef boost::property_map::type IndexMap;\n\n Graph gs_;\n\n std::vector> absolute_poses_;\n\n v4r::Intrinsics cam_;\n\n public:\n EIGEN_MAKE_ALIGNED_OPERATOR_NEW\n\n ViewRegistration() {}\n\n void calcEdgeWeightAndRefineTf(const typename pcl::PointCloud::ConstPtr &cloud_src,\n const typename pcl::PointCloud::ConstPtr &cloud_dst,\n const Eigen::Matrix4f &transform, float ®istration_quality,\n Eigen::Matrix4f &refined_transform) {\n const float best_overlap_ = 0.75f;\n\n v4r::FastIterativeClosestPointWithGC icp;\n\n bool use_normals = true;\n // compute normals\n if (use_normals) {\n pcl::PointCloud::Ptr src_normals(new pcl::PointCloud);\n pcl::PointCloud::Ptr dst_normals(new pcl::PointCloud);\n pcl::IntegralImageNormalEstimation normal_estimation;\n normal_estimation.setNormalEstimationMethod(\n pcl::IntegralImageNormalEstimation::AVERAGE_3D_GRADIENT);\n normal_estimation.setNormalSmoothingSize(10.0);\n normal_estimation.setBorderPolicy(pcl::IntegralImageNormalEstimation::BORDER_POLICY_MIRROR);\n normal_estimation.setInputCloud(cloud_src);\n normal_estimation.compute(*src_normals);\n normal_estimation.setInputCloud(cloud_dst);\n normal_estimation.compute(*dst_normals);\n icp.setSourceNormals(src_normals);\n icp.setTargetNormals(dst_normals);\n }\n\n icp.setCameraIntrinsics(cam_);\n icp.setMaxCorrespondenceDistance(0.02f);\n icp.setInputSource(cloud_src);\n icp.setInputTarget(cloud_dst);\n icp.useStandardCG(true);\n icp.setNoCG(true);\n icp.setOverlapPercentage(best_overlap_);\n icp.setKeepMaxHypotheses(5);\n icp.setMaximumIterations(10);\n icp.align(transform);\n float w_after_icp_ = icp.getFinalTransformation(refined_transform);\n\n if (w_after_icp_ < 0 || !pcl_isfinite(w_after_icp_))\n w_after_icp_ = std::numeric_limits::max();\n else\n w_after_icp_ = best_overlap_ - w_after_icp_;\n\n // transform = icp_trans; // refined transformation\n registration_quality = w_after_icp_;\n }\n\n void computeAbsolutePosesRecursive(\n const Graph &grph, const Vertex start, const Eigen::Matrix4f &accum,\n std::vector> &absolute_poses,\n std::vector &hop_list) {\n boost::property_map::type weightmap = boost::get(boost::edge_weight, gs_);\n boost::graph_traits::out_edge_iterator ei, ei_end;\n for (boost::tie(ei, ei_end) = boost::out_edges(start, grph); ei != ei_end; ++ei) {\n Vertex targ = boost::target(*ei, grph);\n size_t target_id = boost::target(*ei, grph);\n\n if (hop_list[target_id])\n continue;\n\n hop_list[target_id] = true;\n CamConnect my_e = weightmap[*ei];\n Eigen::Matrix4f intern_accum;\n Eigen::Matrix4f trans = my_e.transformation_;\n if (my_e.target_id_ != target_id) {\n Eigen::Matrix4f trans_inv;\n trans_inv = trans.inverse();\n trans = trans_inv;\n }\n intern_accum = accum * trans;\n absolute_poses[target_id] = intern_accum;\n computeAbsolutePosesRecursive(grph, targ, intern_accum, absolute_poses, hop_list);\n }\n }\n\n void computeAbsolutePoses(const Graph &grph,\n std::vector> &absolute_poses,\n const Eigen::Matrix4f &initial_transform = Eigen::Matrix4f::Identity()) {\n size_t num_frames = boost::num_vertices(grph);\n absolute_poses.resize(num_frames);\n std::vector hop_list(num_frames, false);\n Vertex source_view = 0;\n hop_list[0] = true;\n Eigen::Matrix4f accum = initial_transform;\n absolute_poses[0] = accum;\n computeAbsolutePosesRecursive(grph, source_view, accum, absolute_poses, hop_list);\n }\n\n void addView(const pcl::PointCloud::ConstPtr &cloud) {\n View view;\n view.cloud_ = cloud;\n\n v4r::PCLOpenCVConverter pcl_opencv_converter;\n pcl_opencv_converter.setInputCloud(view.cloud_);\n auto color_image = pcl_opencv_converter.getRGBImage();\n\n std::vector keypoints;\n v4r::FeatureDetector_KD_SIFTGPU sift;\n sift.detectAndCompute(color_image, keypoints, view.descriptors_);\n view.keypoint_indices_ = sift.getKeypointIndices();\n\n grph_.push_back(view);\n }\n\n void buildGraph() {\n for (size_t view_a = 0; view_a < grph_.size(); view_a++) {\n for (size_t view_b = 0; view_b < view_a; view_b++) {\n std::vector transforms;\n CamConnect edge;\n edge.source_id_ = view_b;\n edge.target_id_ = view_a;\n\n const auto tfs = v4r::Registration::FeatureBasedRegistration::estimateViewTransformationBySIFT(\n *grph_[view_a].cloud_, *grph_[view_b].cloud_, grph_[view_a].keypoint_indices_,\n grph_[view_b].keypoint_indices_, grph_[view_a].descriptors_, grph_[view_b].descriptors_);\n\n for (const auto &tf : tfs) {\n edge.transformation_ = tf;\n transforms.push_back(edge);\n }\n\n for (CamConnect &c : transforms) {\n Eigen::Matrix4f icp_refined_trans;\n calcEdgeWeightAndRefineTf(grph_[view_a].cloud_, grph_[view_b].cloud_, c.transformation_, c.edge_weight,\n icp_refined_trans);\n c.transformation_ = icp_refined_trans;\n LOG(INFO) << \"Edge weight is \" << c.edge_weight << \" for edge connecting vertex \" << c.source_id_ << \" and \"\n << c.target_id_;\n }\n\n if (!transforms.empty()) {\n std::sort(transforms.begin(), transforms.end());\n boost::add_edge(transforms[0].source_id_, transforms[0].target_id_, transforms[0], gs_);\n }\n }\n }\n }\n\n void compute_mst() {\n boost::property_map::type weightmap = boost::get(boost::edge_weight, gs_);\n std::vector spanning_tree;\n boost::kruskal_minimum_spanning_tree(gs_, std::back_inserter(spanning_tree));\n\n Graph grph_mst;\n std::cout << \"Print the edges in the MST:\" << std::endl;\n for (std::vector::iterator ei = spanning_tree.begin(); ei != spanning_tree.end(); ++ei) {\n CamConnect my_e = weightmap[*ei];\n std::cout << \"[\" << source(*ei, gs_) << \"->\" << target(*ei, gs_) << \"] with weight \" << my_e.edge_weight\n << std::endl;\n boost::add_edge(source(*ei, gs_), target(*ei, gs_), weightmap[*ei], grph_mst);\n }\n\n computeAbsolutePoses(grph_mst, absolute_poses_);\n\n for (size_t view_id = 0; view_id < absolute_poses_.size(); view_id++) {\n grph_[view_id].camera_pose_ = absolute_poses_[view_id];\n }\n }\n\n std::vector> getAbsolutePoses() const {\n return absolute_poses_;\n }\n\n void setCameraIntrinsics(const v4r::Intrinsics &cam) {\n cam_ = cam;\n }\n};\n\nint main(int argc, char **argv) {\n typedef pcl::PointXYZRGB PointT;\n bf::path input_dir;\n bool save_pose = false;\n double chop_z = std::numeric_limits::max();\n int verbosity = 0;\n bf::path camera_calibration_file;\n\n po::options_description desc(\n \"Feature-based View Registration via Minimum Spanning Tree\\n======================================\\n**Allowed \"\n \"options\");\n desc.add_options()(\"help,h\", \"produce help message\");\n desc.add_options()(\"input_dir,i\", po::value(&input_dir)->required(),\n \"Directory with point clouds to be registered\");\n desc.add_options()(\"chop_z,z\", po::value(&chop_z)->default_value(chop_z),\n \"Cut-off distance in meter in z direction.\");\n desc.add_options()(\"save_pose,s\", po::bool_switch(&save_pose),\n \"save computed camera pose in sensor header fields of input point clouds.\");\n desc.add_options()(\"camera_calibration,c\", po::value(&camera_calibration_file),\n \"Camera calibration file with intrinsic parameters\");\n po::variables_map vm;\n po::parsed_options parsed = po::command_line_parser(argc, argv).options(desc).run();\n po::store(parsed, vm);\n if (vm.count(\"help\")) {\n std::cout << desc << std::endl;\n return -1;\n }\n try {\n po::notify(vm);\n } catch (std::exception &e) {\n std::cerr << \"Error: \" << e.what() << std::endl << std::endl << desc << std::endl;\n }\n\n if (verbosity >= 0) {\n FLAGS_v = verbosity;\n std::cout << \"Enabling verbose logging.\" << std::endl;\n }\n FLAGS_logtostderr = 1;\n google::InitGoogleLogging(argv[0]);\n\n LOG(INFO) << \"Processing all point clouds in folder \" << input_dir.string();\n\n const auto files_intern = v4r::io::getFilesInDirectory(input_dir, \".*.pcd\", false);\n if (files_intern.empty()) {\n LOG(ERROR) << \"No files in directory: \" << input_dir.string();\n return -1;\n }\n\n v4r::Intrinsics cam = v4r::Intrinsics::PrimeSense();\n\n if (bf::exists(camera_calibration_file)) {\n try {\n cam = v4r::Intrinsics::load(camera_calibration_file.string());\n } catch (const std::runtime_error &e) {\n LOG(WARNING) << \"Failed to load camera calibration file from \" << camera_calibration_file.string()\n << \"! Will use Primesense default camera intrinsics parameters!\";\n }\n }\n\n ViewRegistration view_reg;\n view_reg.setCameraIntrinsics(cam);\n for (const auto &fn : files_intern) {\n const bf::path full_path = input_dir / fn;\n pcl::PointCloud::Ptr cloud(new pcl::PointCloud);\n pcl::io::loadPCDFile(full_path.string(), *cloud);\n\n pcl::PointCloud::Ptr cloud_filtered(new pcl::PointCloud);\n\n pcl::PassThrough pass;\n pass.setFilterLimits(0.f, chop_z);\n pass.setFilterFieldName(\"z\");\n pass.setInputCloud(cloud);\n pass.setKeepOrganized(true);\n pass.filter(*cloud_filtered);\n\n view_reg.addView(cloud_filtered);\n }\n\n view_reg.buildGraph();\n view_reg.compute_mst();\n\n const auto abs_poses = view_reg.getAbsolutePoses();\n\n if (save_pose) {\n for (size_t i = 0; i < files_intern.size(); i++) {\n const bf::path full_path = input_dir / files_intern[i];\n pcl::PointCloud::Ptr cloud(new pcl::PointCloud);\n pcl::io::loadPCDFile(full_path.string(), *cloud);\n v4r::setCloudPose(abs_poses.at(i), *cloud);\n pcl::io::savePCDFileBinaryCompressed(full_path.string(), *cloud);\n }\n }\n}\n", "meta": {"hexsha": "836b92d6a91125ebdc887b3e41f62fec7d4d75b7", "size": 13102, "ext": "cpp", "lang": "C++", "max_stars_repo_path": "apps/FeatureBasedViewRegistrationByMST/main.cpp", "max_stars_repo_name": "v4r-tuwien/v4r", "max_stars_repo_head_hexsha": "ff3fbd6d2b298b83268ba4737868bab258262a40", "max_stars_repo_licenses": ["BSD-1-Clause", "BSD-2-Clause"], "max_stars_count": 2.0, "max_stars_repo_stars_event_min_datetime": "2021-02-22T11:36:33.000Z", "max_stars_repo_stars_event_max_datetime": "2021-07-20T11:31:08.000Z", "max_issues_repo_path": "apps/FeatureBasedViewRegistrationByMST/main.cpp", "max_issues_repo_name": "v4r-tuwien/v4r", "max_issues_repo_head_hexsha": "ff3fbd6d2b298b83268ba4737868bab258262a40", "max_issues_repo_licenses": ["BSD-1-Clause", "BSD-2-Clause"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "apps/FeatureBasedViewRegistrationByMST/main.cpp", "max_forks_repo_name": "v4r-tuwien/v4r", "max_forks_repo_head_hexsha": "ff3fbd6d2b298b83268ba4737868bab258262a40", "max_forks_repo_licenses": ["BSD-1-Clause", "BSD-2-Clause"], "max_forks_count": 3.0, "max_forks_repo_forks_event_min_datetime": "2018-10-19T10:39:23.000Z", "max_forks_repo_forks_event_max_datetime": "2021-04-07T13:39:03.000Z", "avg_line_length": 36.8033707865, "max_line_length": 119, "alphanum_fraction": 0.6814226836, "num_tokens": 3368, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.5428632831725052, "lm_q2_score": 0.2720245451923523, "lm_q1q2_score": 0.1476721377066279}} {"text": "/*\n * This file is a part of the TChecker project.\n *\n * See files AUTHORS and LICENSE for copyright details.\n *\n */\n\n#ifndef TCHECKER_REFZG_SEMANTICS_HH\n#define TCHECKER_REFZG_SEMANTICS_HH\n\n#include \n\n#include \"tchecker/basictypes.hh\"\n#include \"tchecker/dbm/db.hh\"\n#include \"tchecker/variables/clocks.hh\"\n\n/*!\n \\file semantics.hh\n \\brief Operational semantics on DBMs with reference clocks\n */\n\nnamespace tchecker {\n\nnamespace refzg {\n\n/*!\n \\class semantics_t\n \\brief Semantics for zone graphs implemented by DBMs with reference clocks\n */\nclass semantics_t {\npublic:\n /*!\n \\brief Destructor\n */\n virtual ~semantics_t() = default;\n\n /*!\n \\brief Compute initial zone with reference clocks\n \\param rdbm : a DBM\n \\param r : reference clocks for rdbm\n \\param delay_allowed : set of reference clocks allowed to delay\n \\param invariant : invariant\n \\param spread : reference clocks spread\n \\pre rdbm is not nullptr (checked by assertion).\n rdbm is a r.size()*r.size() array of difference bounds.\n rdbm is tight and consistent.\n the size of delay_allowed is the number of reference clocks in r\n \\post dbm is the initial zone w.r.t. delay_allowed, invariant and spread\n \\return STATE_OK if the resulting DBM is not empty, other values if the\n resulting DBM is empty (see details in implementations)\n */\n virtual tchecker::state_status_t initial(tchecker::dbm::db_t * rdbm, tchecker::reference_clock_variables_t const & r,\n boost::dynamic_bitset<> const & delay_allowed,\n tchecker::clock_constraint_container_t const & invariant) = 0;\n\n /*!\n \\brief Compute next zone with reference clocks\n \\param rdbm : a DBM\n \\param r : reference clocks for rdbm\n \\param src_delay_allowed : set of reference clocks allowed to delay in source\n state\n \\param src_invariant : invariant in source state\n \\param sync_ref_clocks : set of reference clocks to synchronize\n \\param guard : transition guard\n \\param clkreset : transition reset\n \\param tgt_delay_allowed : set of reference clocks allowed to delay in target\n state\n \\param tgt_invariant : invariant in target state\n \\pre rdbm is not nullptr (checked by assertion).\n rdbm is a r.size()*r.size() array of difference bounds.\n rdbm is tight and consistent.\n the size of src_delay_allowed is the number of reference clocks in r.\n the size of sync_ref_clocks is the number of reference clocks in r.\n the size of tgt_delay_allowed is the number of reference clocks in r\n \\post rdbm has been updated to its strongest postcondition w.r.t. src_delay_allowed,\n src_invariant, sync_ref_clocks, guard, clkreset, tgt_delay_allowed and tgt_invariant\n \\return STATE_OK if the resulting DBM is not empty, other values if the resulting\n DBM is empty (see details in implementations)\n */\n virtual tchecker::state_status_t\n next(tchecker::dbm::db_t * rdbm, tchecker::reference_clock_variables_t const & r,\n boost::dynamic_bitset<> const & src_delay_allowed, tchecker::clock_constraint_container_t const & src_invariant,\n boost::dynamic_bitset<> const & sync_ref_clocks, tchecker::clock_constraint_container_t const & guard,\n tchecker::clock_reset_container_t const & clkreset, boost::dynamic_bitset<> const & tgt_delay_allowed,\n tchecker::clock_constraint_container_t const & tgt_invariant) = 0;\n};\n\n/*!\n\\class standard_semantics_t\n\\brief Standard semantics: each transition in the zone graph consists of a delay\n(if allowed) followed by a transition from the timed automaton\n*/\nclass standard_semantics_t final : public tchecker::refzg::semantics_t {\npublic:\n /*!\n \\brief Destructor\n */\n virtual ~standard_semantics_t() = default;\n\n /*!\n \\brief Compute initial zone with reference clocks\n \\param rdbm : a DBM\n \\param r : reference clocks for rdbm\n \\param delay_allowed : set of reference clocks allowed to delay\n \\param invariant : invariant\n \\pre rdbm is not nullptr (checked by assertion).\n rdbm is a r.size()*r.size() array of difference bounds.\n rdbm is tight and consistent.\n the size of delay_allowed is the number of reference clocks in r (checked\n by assertion)\n \\post rdbm is the zone that only containts the zero valuation\n \\return tchecker::STATE_OK if the resulting DBM is not empty. Otherwise,\n tchecker::STATE_CLOCKS_SRC_INVARIANT_VIOLATED if the zero valuation does not\n satisfy invariant.\n */\n virtual tchecker::state_status_t initial(tchecker::dbm::db_t * rdbm, tchecker::reference_clock_variables_t const & r,\n boost::dynamic_bitset<> const & delay_allowed,\n tchecker::clock_constraint_container_t const & invariant);\n\n /*!\n \\brief Compute next zone with reference clocks\n \\param rdbm : a DBM\n \\param r : reference clocks for dbm\n \\param src_delay_allowed : set of reference clocks allowed to delay in source\n state\n \\param src_invariant : invariant in source state\n \\param sync_ref_clocks : set of reference clocks to synchronize\n \\param guard : transition guard\n \\param clkreset : transition reset\n \\param tgt_delay_allowed : set of reference clocks allowed to delay in target\n state\n \\param tgt_invariant : invariant in target state\n \\pre rdbm is not nullptr (checked by assertion).\n rdbm is a r.size()*r.size() array of difference bounds.\n rdbm is not tight and consistent.\n the size of src_delay_allowed is the number of reference clocks in r\n (checked by assertion).\n The size of sync_ref_clocks is the number of reference clocks in r (checked by\n assertion).)\n The size of tgt_delay_allowed is the number of reference clocks in r (checked\n by assertion).\n \\post rdbm has been delayed (only reference clocks which are allowed in\n src_delay_allowed), then intersected with src_invariant, then all reference\n clocks in sync_ref_clocks have been synchronized in rdbm, then rdbm has been\n intersected with guard, then dbm has been reset w.r.t clkreset, then\n intersected with tgt_invariant\n \\return tchecker::STATE_OK if the resulting DBM is not empty. Otherwise,\n tchecker::STATE_CLOCKS_SRC_INVARIANT_VIOLATED if intersection with src_invariant\n result in an empty zone, tchecker::STATE_CLOCKS_SYNC_EMPTY if synchronization\n of reference clocks in sync_ref_clocks yield an empty zone,\n tchecker::STATE_CLOCKS_GUARD_VIOLATED if intersection with guard result in an\n empty zone, tchecker::STATE_EMPTY_SYNC if synchronization of reference clocks\n result in an empty zone, tchecker::STATE_CLOCKS_TGT_INVARIANT_VIOLATED if\n intersection with tgt_invariant result in an empty zone\n */\n virtual tchecker::state_status_t\n next(tchecker::dbm::db_t * rdbm, tchecker::reference_clock_variables_t const & r,\n boost::dynamic_bitset<> const & src_delay_allowed, tchecker::clock_constraint_container_t const & src_invariant,\n boost::dynamic_bitset<> const & sync_ref_clocks, tchecker::clock_constraint_container_t const & guard,\n tchecker::clock_reset_container_t const & clkreset, boost::dynamic_bitset<> const & tgt_delay_allowed,\n tchecker::clock_constraint_container_t const & tgt_invariant);\n};\n\n/*!\n\\class elapsed_semantics_t\n\\brief elapsed semantics: each transition in the zone graph consists of a\ntransition from the automaton, followed by a delay (if allowed)\n*/\nclass elapsed_semantics_t final : public tchecker::refzg::semantics_t {\npublic:\n /*!\n \\brief Destructor\n */\n virtual ~elapsed_semantics_t() = default;\n\n /*!\n \\brief Compute initial zone with reference clocks\n \\param rdbm : a DBM\n \\param r : reference clocks for rdbm\n \\param delay_allowed : set of reference clocks allowed to delay\n \\param invariant : invariant\n \\pre rdbm is not nullptr (checked by assertion).\n rdbm is a r.size()*r.size() array of difference bounds.\n rdbm is not tight and consistent.\n the size of delay_allowed is the number of reference clocks in r (checked\n by assertion))\n \\post rdbm is the zone that contains all the time successors of the zero\n valuation (for reference clocks that are allowed to delay in delay_allowed),\n and that satisfy invariant\n \\return tchecker::STATE_OK if the resulting DBM is not empty. Otherwise,\n tchecker::STATE_CLOCKS_SRC_INVARIANT_VIOLATED if the (time successors of the)\n zero valuation does not satisfy invariant.\n */\n virtual tchecker::state_status_t initial(tchecker::dbm::db_t * rdbm, tchecker::reference_clock_variables_t const & r,\n boost::dynamic_bitset<> const & delay_allowed,\n tchecker::clock_constraint_container_t const & invariant);\n\n /*!\n \\brief Compute next zone with reference clocks\n \\param rdbm : a DBM\n \\param r : reference clocks for rdbm\n \\param src_delay_allowed : set of reference clocks allowed to delay in source\n state\n \\param src_invariant : invariant in source state\n \\param sync_ref_clocks : set of reference clocks to synchronize\n \\param guard : transition guard\n \\param clkreset : transition reset\n \\param tgt_delay_allowed : set of reference clocks allowed to delay in target\n state\n \\param tgt_invariant : invariant in target state\n \\pre rdbm is not nullptr (checked by assertion).\n rdbm is a r.size()*r.size() array of difference bounds.\n rdbm is not tight and consistent.\n the size of src_delay_allowed is the number of reference clocks in r\n (checked by assertion).\n The size of sync_ref_clocks is the number of reference clocks in r (checked by\n assertion).)\n The size of tgt_delay_allowed is the number of reference clocks in r (checked\n by assertion).\n \\post rdbm has been intersected with src_invariant, then all reference clocks\n in sync_ref_clocks have been synchronized in rdbm, then rdbm has been\n intersected with guard, then rdbm has been reset w.r.t clkreset, then\n intersected with tgt_invariant, then rdbm has been delayed (only reference\n clocks that are allowed in tgt_delay_allowed) and intersected wth\n tgt_invariant again\n \\return tchecker::STATE_OK if the resulting DBM is not empty. Otherwise,\n tchecker::STATE_CLOCKS_SRC_INVARIANT_VIOLATED if intersection with src_invariant\n result in an empty zone, tchecker::STATE_CLOCKS_EMPTY_SYNC if synchronization\n of reference clocks in sync_ref_clocks yields an empty zone,\n tchecker::STATE_CLOCKS_GUARD_VIOLATED if intersection with guard result in an\n empty zone, tchecker::STATE_EMPTY_SYNC if synchronization of reference clocks\n result in an empty zone, tchecker::STATE_CLOCKS_TGT_INVARIANT_VIOLATED if\n intersection with tgt_invariant result in an empty zone\n */\n virtual tchecker::state_status_t\n next(tchecker::dbm::db_t * rdbm, tchecker::reference_clock_variables_t const & r,\n boost::dynamic_bitset<> const & src_delay_allowed, tchecker::clock_constraint_container_t const & src_invariant,\n boost::dynamic_bitset<> const & sync_ref_clocks, tchecker::clock_constraint_container_t const & guard,\n tchecker::clock_reset_container_t const & clkreset, boost::dynamic_bitset<> const & tgt_delay_allowed,\n tchecker::clock_constraint_container_t const & tgt_invariant);\n};\n\n/*!\n \\brief type of semantics\n*/\nenum semantics_type_t {\n STANDARD_SEMANTICS, /*!< see tchecker::refzg::standard_semantics_t */\n ELAPSED_SEMANTICS, /*!< see tchecker::refzg::elapsed_semantics_t */\n};\n\n/*!\n \\brief Zone semantics factory\n \\param semantics_type : type zone graph semantics\n \\return A zone semantics over DBMs with reference clocks of type semantics\n \\note the returned semantics must be deallocated by the caller\n \\throw std::invalid_argument : if semantics is unknown\n*/\ntchecker::refzg::semantics_t * semantics_factory(enum tchecker::refzg::semantics_type_t semantics_type);\n\n} // end of namespace refzg\n\n} // end of namespace tchecker\n\n#endif // TCHECKER_REFZG_SEMANTICS_HH\n", "meta": {"hexsha": "b14ea7df7dd71c7c29f51fc3d6c496750d96af8c", "size": 11836, "ext": "hh", "lang": "C++", "max_stars_repo_path": "include/tchecker/refzg/semantics.hh", "max_stars_repo_name": "mukherjee-sayan/tchecker", "max_stars_repo_head_hexsha": "c4f37a479a7273c15fc45ccb9741984e72036f2e", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "include/tchecker/refzg/semantics.hh", "max_issues_repo_name": "mukherjee-sayan/tchecker", "max_issues_repo_head_hexsha": "c4f37a479a7273c15fc45ccb9741984e72036f2e", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "include/tchecker/refzg/semantics.hh", "max_forks_repo_name": "mukherjee-sayan/tchecker", "max_forks_repo_head_hexsha": "c4f37a479a7273c15fc45ccb9741984e72036f2e", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 1.0, "max_forks_repo_forks_event_min_datetime": "2022-03-11T10:01:27.000Z", "max_forks_repo_forks_event_max_datetime": "2022-03-11T10:01:27.000Z", "avg_line_length": 44.6641509434, "max_line_length": 119, "alphanum_fraction": 0.7550692802, "num_tokens": 2876, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO\n\n", "lm_q1_score": 0.5544704649604273, "lm_q2_score": 0.26588047891687405, "lm_q1q2_score": 0.14742287276894023}} {"text": "// Boost.Geometry - gis-projections (based on PROJ4)\r\n\r\n// Copyright (c) 2008-2015 Barend Gehrels, Amsterdam, the Netherlands.\r\n\r\n// This file was modified by Oracle on 2017, 2018.\r\n// Modifications copyright (c) 2017-2018, Oracle and/or its affiliates.\r\n// Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle.\r\n\r\n// Use, modification and distribution is subject to the Boost Software License,\r\n// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at\r\n// http://www.boost.org/LICENSE_1_0.txt)\r\n\r\n// This file is converted from PROJ4, http://trac.osgeo.org/proj\r\n// PROJ4 is originally written by Gerald Evenden (then of the USGS)\r\n// PROJ4 is maintained by Frank Warmerdam\r\n// PROJ4 is converted to Boost.Geometry by Barend Gehrels\r\n\r\n// Last updated version of proj: 5.0.0\r\n\r\n// Original copyright notice:\r\n\r\n// Permission is hereby granted, free of charge, to any person obtaining a\r\n// copy of this software and associated documentation files (the \"Software\"),\r\n// to deal in the Software without restriction, including without limitation\r\n// the rights to use, copy, modify, merge, publish, distribute, sublicense,\r\n// and/or sell copies of the Software, and to permit persons to whom the\r\n// Software is furnished to do so, subject to the following conditions:\r\n\r\n// The above copyright notice and this permission notice shall be included\r\n// in all copies or substantial portions of the Software.\r\n\r\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\r\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\r\n// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\r\n// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\r\n// DEALINGS IN THE SOFTWARE.\r\n\r\n#ifndef BOOST_GEOMETRY_PROJECTIONS_IGH_HPP\r\n#define BOOST_GEOMETRY_PROJECTIONS_IGH_HPP\r\n\r\n#include \r\n#include \r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\nnamespace boost { namespace geometry\r\n{\r\n\r\nnamespace projections\r\n{\r\n #ifndef DOXYGEN_NO_DETAIL\r\n namespace detail { namespace igh\r\n {\r\n // TODO: consider replacing dynamically created projections\r\n // with member objects\r\n template \r\n struct par_igh\r\n {\r\n boost::shared_ptr > pj[12];\r\n T dy0;\r\n };\r\n\r\n /* 40d 44' 11.8\" [degrees] */\r\n template \r\n inline T d4044118() { return (T(40) + T(44)/T(60.) + T(11.8)/T(3600.)) * geometry::math::d2r(); }\r\n\r\n template \r\n inline T d10() { return T(10) * geometry::math::d2r(); }\r\n template \r\n inline T d20() { return T(20) * geometry::math::d2r(); }\r\n template \r\n inline T d30() { return T(30) * geometry::math::d2r(); }\r\n template \r\n inline T d40() { return T(40) * geometry::math::d2r(); }\r\n template \r\n inline T d50() { return T(50) * geometry::math::d2r(); }\r\n template \r\n inline T d60() { return T(60) * geometry::math::d2r(); }\r\n template \r\n inline T d80() { return T(80) * geometry::math::d2r(); }\r\n template \r\n inline T d90() { return T(90) * geometry::math::d2r(); }\r\n template \r\n inline T d100() { return T(100) * geometry::math::d2r(); }\r\n template \r\n inline T d140() { return T(140) * geometry::math::d2r(); }\r\n template \r\n inline T d160() { return T(160) * geometry::math::d2r(); }\r\n template \r\n inline T d180() { return T(180) * geometry::math::d2r(); }\r\n\r\n static const double epsilon = 1.e-10; // allow a little 'slack' on zone edge positions\r\n\r\n // Converted from #define SETUP(n, proj, x_0, y_0, lon_0)\r\n template