Home
last modified time | relevance | path

Searched refs:LabelPosition (Results 1 – 25 of 181) sorted by relevance

12345678

/dports/graphics/qgis/qgis-3.22.3/src/core/pal/
H A Dproblem.h46 class LabelPosition; variable
98 …void addCandidatePosition( std::unique_ptr< LabelPosition > position ) { mLabelPositions.emplace_b… in addCandidatePosition()
134 …QList<LabelPosition *> getSolution( bool returnInactive, QList<LabelPosition *> *unlabeled = nullp…
147 std::vector< std::unique_ptr< LabelPosition > > *positionsWithNoCandidates() in positionsWithNoCandidates()
155 PalRtree< LabelPosition > &allCandidatesIndex() { return mAllCandidatesIndex; } in allCandidatesIndex()
162 bool candidatesAreConflicting( const LabelPosition *lp1, const LabelPosition *lp2 ) const;
199 std::vector< std::unique_ptr< LabelPosition > > mLabelPositions;
201 PalRtree<LabelPosition> mAllCandidatesIndex;
202 PalRtree<LabelPosition> mActiveCandidatesIndex;
204 std::vector< std::unique_ptr< LabelPosition > > mPositionsWithNoCandidates;
[all …]
H A Dlabelposition.cpp140 LabelPosition::LabelPosition( const LabelPosition &other ) in LabelPosition() function in LabelPosition
265 bool LabelPosition::isInConflict( const LabelPosition *lp ) const in isInConflict()
282 bool LabelPosition::isInConflictMultiPart( const LabelPosition *lp ) const in isInConflictMultiPart()
306 int LabelPosition::partCount() const in partCount()
328 int LabelPosition::getId() const in getId()
343 double LabelPosition::getAlpha() const in getAlpha()
348 void LabelPosition::validateCost() in validateCost()
401 void LabelPosition::removeFromIndex( PalRtree<LabelPosition> &index ) in removeFromIndex()
409 void LabelPosition::insertIntoIndex( PalRtree<LabelPosition> &index ) in insertIntoIndex()
423 const LabelPosition *tmp1 = this; in createMultiPartGeosGeom()
[all …]
H A Dfeature.h55 class LabelPosition; variable
124 std::vector<std::unique_ptr<LabelPosition> > createCandidates( Pal *pal );
134 …andidatesAroundPoint( double x, double y, std::vector<std::unique_ptr<LabelPosition> > &lPos, doub…
144 …eCandidatesOverPoint( double x, double y, std::vector<std::unique_ptr<LabelPosition> > &lPos, doub…
154 …ateCenteredOverPoint( double x, double y, std::vector<std::unique_ptr<LabelPosition> > &lPos, doub…
162 std::unique_ptr< LabelPosition > createCandidatePointOnSurface( PointSet *mapShape );
225 …std::unique_ptr< LabelPosition > curvedPlacementAtOffset( PointSet *mapShape, const std::vector<do…
245 …std::size_t createCandidatesForPolygon( std::vector<std::unique_ptr<LabelPosition> > &lPos, PointS…
253 …std::size_t createCandidatesOutsidePolygon( std::vector<std::unique_ptr<LabelPosition> > &lPos, Pa…
323 …void addSizePenalty( std::vector<std::unique_ptr<LabelPosition> > &lPos, double bbx[4], double bby…
[all …]
H A Dlabelposition.h55 class CORE_EXPORT LabelPosition : public PointSet
92 LabelPosition( int id, double x1, double y1,
98 LabelPosition( const LabelPosition &other );
137 bool isInConflict( const LabelPosition *ls ) const;
277 LabelPosition *nextPart() const { return mNextPart.get(); } in nextPart()
307 void removeFromIndex( PalRtree<LabelPosition> &index );
312 void insertIntoIndex( PalRtree<LabelPosition> &index );
368 LabelPosition::Quadrant quadrant;
373 std::unique_ptr< LabelPosition > mNextPart;
396 bool isInConflictMultiPart( const LabelPosition *lp ) const;
[all …]
H A Dcostcalculator.h31 class LabelPosition; variable
42 …static void addObstacleCostPenalty( pal::LabelPosition *lp, pal::FeaturePart *obstacle, Pal *pal );
48 …teCandidatePolygonRingDistanceCosts( std::vector<std::unique_ptr<pal::LabelPosition> > &lPos, doub…
55 …istanceCosts( pal::FeaturePart *feature, std::vector<std::unique_ptr<pal::LabelPosition> > &lPos );
58 …static double calculatePolygonRingDistance( LabelPosition *candidate, double bbx[4], double bby[4]…
66 …candidateSortGrow( const std::unique_ptr<pal::LabelPosition> &c1, const std::unique_ptr<pal::Label…
83 explicit CandidatePolygonRingDistanceCalculator( LabelPosition *candidate );
H A Dfeature.cpp248 return LabelPosition::QuadrantLeft; in quadrantFromOffset()
263 return LabelPosition::QuadrantRight; in quadrantFromOffset()
270 return LabelPosition::QuadrantAbove; in quadrantFromOffset()
274 return LabelPosition::QuadrantBelow; in quadrantFromOffset()
278 return LabelPosition::QuadrantOver; in quadrantFromOffset()
558 LabelPosition::Quadrant quadrant = LabelPosition::QuadrantAboveLeft; in createCandidatesAtOrderedPositionsOverPoint()
631 LabelPosition::Quadrant quadrant = LabelPosition::QuadrantOver; in createCandidatesAroundPoint()
1264 …LabelPosition > firstPosition = std::make_unique< LabelPosition >( 0, it->x, it->y, it->width, it-… in curvedPlacementAtOffset()
1271 …r< LabelPosition > position = std::make_unique< LabelPosition >( 0, it->x, it->y, it->width, it->h… in curvedPlacementAtOffset()
1460 std::unique_ptr< LabelPosition > p = std::make_unique< LabelPosition >( *labelPosition ); in createCurvedCandidatesAlongLine()
[all …]
H A Dcostcalculator.cpp28 …ator::candidateSortGrow( const std::unique_ptr< LabelPosition > &c1, const std::unique_ptr< LabelP… in candidateSortGrow()
33 void CostCalculator::addObstacleCostPenalty( LabelPosition *lp, FeaturePart *obstacle, Pal *pal ) in addObstacleCostPenalty()
114 QHash< LabelPosition *, double > polygonRingDistances; in calculateCandidatePolygonRingDistanceCosts()
117 for ( const std::unique_ptr< LabelPosition > &pos : lPos ) in calculateCandidatePolygonRingDistanceCosts()
136 for ( std::unique_ptr< LabelPosition > &pos : lPos ) in calculateCandidatePolygonRingDistanceCosts()
143 …troidDistanceCosts( pal::FeaturePart *feature, std::vector<std::unique_ptr<LabelPosition> > &lPos ) in calculateCandidatePolygonCentroidDistanceCosts()
150 QHash< LabelPosition *, double > polygonCentroidDistances; in calculateCandidatePolygonCentroidDistanceCosts()
153 for ( std::unique_ptr< LabelPosition > &pos : lPos ) in calculateCandidatePolygonCentroidDistanceCosts()
176 for ( std::unique_ptr< LabelPosition > &pos : lPos ) in calculateCandidatePolygonCentroidDistanceCosts()
183 double CostCalculator::calculatePolygonRingDistance( LabelPosition *candidate, double bbx[4], doubl… in calculatePolygonRingDistance()
[all …]
H A Dproblem.cpp85 LabelPosition *lp2 = nullptr; in reduce()
119 const_cast< LabelPosition * >( lp )->decrementNumOverlaps(); in reduce()
140 void Problem::ignoreLabel( const LabelPosition *lp, PriorityQueue &list, PalRtree< LabelPosition > … in ignoreLabel()
174 LabelPosition *lp = nullptr; in init_sol_falp()
217 std::vector< const LabelPosition * > conflictingPositions; in init_sol_falp()
227 for ( const LabelPosition *conflict : conflictingPositions ) in init_sol_falp()
239 LabelPosition *retainedLabel = nullptr; in init_sol_falp()
280 bool Problem::candidatesAreConflicting( const LabelPosition *lp1, const LabelPosition *lp2 ) const in candidatesAreConflicting()
307 LabelPosition *lp = nullptr; in chain()
653 QList<LabelPosition *> Problem::getSolution( bool returnInactive, QList<LabelPosition *> *unlabeled… in getSolution()
[all …]
H A Dpal.cpp101 PalRtree< LabelPosition > allCandidatesFirstRound( maxCoordinateExtentForSpatialIndices ); in extract()
178 …std::vector< std::unique_ptr< LabelPosition > > candidates = featurePart->createCandidates( this ); in extract()
197 for ( std::unique_ptr< LabelPosition > &candidate : candidates ) in extract()
304 …CostCalculator::addObstacleCostPenalty( const_cast< LabelPosition * >( candidatePosition ), obstac… in extract()
417 for ( std::unique_ptr< LabelPosition > &candidate : feat->candidates ) in extract()
437 for ( std::unique_ptr< LabelPosition > &candidate : feat->candidates ) in extract()
439 std::unique_ptr< LabelPosition > lp = std::move( candidate ); in extract()
488 QList<LabelPosition *> Pal::solveProblem( Problem *prob, bool displayAll, QList<LabelPosition *> *u… in solveProblem()
491 return QList<LabelPosition *>(); in solveProblem()
501 return QList<LabelPosition *>(); in solveProblem()
[all …]
/dports/graphics/qgis-ltr/qgis-3.16.16/src/core/pal/
H A Dlabelposition.cpp140 LabelPosition::LabelPosition( const LabelPosition &other ) in LabelPosition() function in LabelPosition
265 bool LabelPosition::isInConflict( const LabelPosition *lp ) const in isInConflict()
276 bool LabelPosition::isInConflictSinglePart( const LabelPosition *lp ) const in isInConflictSinglePart()
304 bool LabelPosition::isInConflictMultiPart( const LabelPosition *lp ) const in isInConflictMultiPart()
307 const LabelPosition *tmp1 = this; in isInConflictMultiPart()
311 const LabelPosition *tmp2 = lp; in isInConflictMultiPart()
324 int LabelPosition::partCount() const in partCount()
346 int LabelPosition::getId() const in getId()
366 void LabelPosition::validateCost() in validateCost()
419 void LabelPosition::removeFromIndex( PalRtree<LabelPosition> &index ) in removeFromIndex()
[all …]
H A Dlabelposition.h55 class CORE_EXPORT LabelPosition : public PointSet
92 LabelPosition( int id, double x1, double y1,
98 LabelPosition( const LabelPosition &other );
137 bool isInConflict( const LabelPosition *ls ) const;
277 LabelPosition *nextPart() const { return mNextPart.get(); } in nextPart()
299 void removeFromIndex( PalRtree<LabelPosition> &index );
304 void insertIntoIndex( PalRtree<LabelPosition> &index );
330 LabelPosition::Quadrant quadrant;
334 std::unique_ptr< LabelPosition > mNextPart;
353 bool isInConflictMultiPart( const LabelPosition *lp ) const;
[all …]
H A Dfeature.h87 class LabelPosition; variable
148 std::vector<std::unique_ptr<LabelPosition> > createCandidates( Pal *pal );
158 …andidatesAroundPoint( double x, double y, std::vector<std::unique_ptr<LabelPosition> > &lPos, doub…
168 …eCandidatesOverPoint( double x, double y, std::vector<std::unique_ptr<LabelPosition> > &lPos, doub…
186 std::unique_ptr< LabelPosition > createCandidatePointOnSurface( PointSet *mapShape );
215 …std::size_t createHorizontalCandidatesAlongLine( std::vector<std::unique_ptr<LabelPosition> > &lPo…
250 …std::unique_ptr< LabelPosition > curvedPlacementAtOffset( PointSet *path_positions, double *path_d…
270 …std::size_t createCandidatesForPolygon( std::vector<std::unique_ptr<LabelPosition> > &lPos, PointS…
278 …std::size_t createCandidatesOutsidePolygon( std::vector<std::unique_ptr<LabelPosition> > &lPos, Pa…
348 …void addSizePenalty( std::vector<std::unique_ptr<LabelPosition> > &lPos, double bbx[4], double bby…
[all …]
H A Dproblem.h46 class LabelPosition; variable
97 …void addCandidatePosition( std::unique_ptr< LabelPosition > position ) { mLabelPositions.emplace_b… in addCandidatePosition()
112 …LabelPosition *featureCandidate( int feature, int candidate ) const { return mLabelPositions[ mFea… in featureCandidate()
133 …QList<LabelPosition *> getSolution( bool returnInactive, QList<LabelPosition *> *unlabeled = nullp…
146 std::vector< std::unique_ptr< LabelPosition > > *positionsWithNoCandidates() in positionsWithNoCandidates()
154 PalRtree< LabelPosition > &allCandidatesIndex() { return mAllCandidatesIndex; } in allCandidatesIndex()
193 std::vector< std::unique_ptr< LabelPosition > > mLabelPositions;
195 PalRtree<LabelPosition> mAllCandidatesIndex;
196 PalRtree<LabelPosition> mActiveCandidatesIndex;
198 std::vector< std::unique_ptr< LabelPosition > > mPositionsWithNoCandidates;
H A Dcostcalculator.h31 class LabelPosition; variable
42 …static void addObstacleCostPenalty( pal::LabelPosition *lp, pal::FeaturePart *obstacle, Pal *pal );
48 …teCandidatePolygonRingDistanceCosts( std::vector<std::unique_ptr<pal::LabelPosition> > &lPos, doub…
55 …istanceCosts( pal::FeaturePart *feature, std::vector<std::unique_ptr<pal::LabelPosition> > &lPos );
58 …static double calculatePolygonRingDistance( LabelPosition *candidate, double bbx[4], double bby[4]…
66 …candidateSortGrow( const std::unique_ptr<pal::LabelPosition> &c1, const std::unique_ptr<pal::Label…
83 explicit CandidatePolygonRingDistanceCalculator( LabelPosition *candidate );
H A Dfeature.cpp244 return LabelPosition::QuadrantLeft; in quadrantFromOffset()
259 return LabelPosition::QuadrantRight; in quadrantFromOffset()
266 return LabelPosition::QuadrantAbove; in quadrantFromOffset()
274 return LabelPosition::QuadrantOver; in quadrantFromOffset()
547 LabelPosition::Quadrant quadrant = LabelPosition::QuadrantAboveLeft; in createCandidatesAtOrderedPositionsOverPoint()
620 LabelPosition::Quadrant quadrant = LabelPosition::QuadrantOver; in createCandidatesAroundPoint()
1299 LabelPosition *slp_tmp = nullptr; in curvedPlacementAtOffset()
1376 LabelPosition *next = tmp.get(); in curvedPlacementAtOffset()
1396 std::unique_ptr< LabelPosition > newLp = qgis::make_unique< LabelPosition >( *lp ); in _createCurvedCandidate()
1529 LabelPosition *tmp = slp.get(); in createCurvedCandidatesAlongLine()
[all …]
H A Dcostcalculator.cpp28 …ator::candidateSortGrow( const std::unique_ptr< LabelPosition > &c1, const std::unique_ptr< LabelP… in candidateSortGrow()
33 void CostCalculator::addObstacleCostPenalty( LabelPosition *lp, FeaturePart *obstacle, Pal *pal ) in addObstacleCostPenalty()
114 QHash< LabelPosition *, double > polygonRingDistances; in calculateCandidatePolygonRingDistanceCosts()
117 for ( std::unique_ptr< LabelPosition > &pos : lPos ) in calculateCandidatePolygonRingDistanceCosts()
136 for ( std::unique_ptr< LabelPosition > &pos : lPos ) in calculateCandidatePolygonRingDistanceCosts()
143 …troidDistanceCosts( pal::FeaturePart *feature, std::vector<std::unique_ptr<LabelPosition> > &lPos ) in calculateCandidatePolygonCentroidDistanceCosts()
150 QHash< LabelPosition *, double > polygonCentroidDistances; in calculateCandidatePolygonCentroidDistanceCosts()
153 for ( std::unique_ptr< LabelPosition > &pos : lPos ) in calculateCandidatePolygonCentroidDistanceCosts()
176 for ( std::unique_ptr< LabelPosition > &pos : lPos ) in calculateCandidatePolygonCentroidDistanceCosts()
183 double CostCalculator::calculatePolygonRingDistance( LabelPosition *candidate, double bbx[4], doubl… in calculatePolygonRingDistance()
[all …]
H A Dproblem.cpp85 LabelPosition *lp2 = nullptr; in reduce()
119 const_cast< LabelPosition * >( lp )->decrementNumOverlaps(); in reduce()
140 void ignoreLabel( const LabelPosition *lp, PriorityQueue &list, PalRtree< LabelPosition > &candidat… in ignoreLabel()
174 LabelPosition *lp = nullptr; in init_sol_falp()
217 std::vector< const LabelPosition * > conflictingPositions; in init_sol_falp()
227 for ( const LabelPosition *conflict : conflictingPositions ) in init_sol_falp()
239 LabelPosition *retainedLabel = nullptr; in init_sol_falp()
302 LabelPosition *lp = nullptr; in chain()
657 QList<LabelPosition *> Problem::getSolution( bool returnInactive, QList<LabelPosition *> *unlabeled… in getSolution()
659 QList<LabelPosition *> finalLabelPlacements; in getSolution()
[all …]
H A Dpal.cpp101 PalRtree< LabelPosition > allCandidatesFirstRound( maxCoordinateExtentForSpatialIndices ); in extract()
178 …std::vector< std::unique_ptr< LabelPosition > > candidates = featurePart->createCandidates( this ); in extract()
197 for ( std::unique_ptr< LabelPosition > &candidate : candidates ) in extract()
215 …std::unique_ptr< LabelPosition > unplacedPosition = featurePart->createCandidatePointOnSurface( fe… in extract()
302 …CostCalculator::addObstacleCostPenalty( const_cast< LabelPosition * >( candidatePosition ), obstac… in extract()
415 for ( std::unique_ptr< LabelPosition > &candidate : feat->candidates ) in extract()
435 for ( std::unique_ptr< LabelPosition > &candidate : feat->candidates ) in extract()
437 std::unique_ptr< LabelPosition > lp = std::move( candidate ); in extract()
486 QList<LabelPosition *> Pal::solveProblem( Problem *prob, bool displayAll, QList<LabelPosition *> *u… in solveProblem()
489 return QList<LabelPosition *>(); in solveProblem()
[all …]
/dports/databases/kexi/kexi-3.2.0/src/plugins/forms/widgets/
H A Dkexidbautofield.h56 Q_PROPERTY(LabelPosition labelPosition READ labelPosition WRITE setLabelPosition)
67 enum LabelPosition { Left = 300, Top, NoLabel }; enum
68 Q_ENUM(LabelPosition)
70 KexiDBAutoField(const QString &text, WidgetType type, LabelPosition pos,
72 explicit KexiDBAutoField(QWidget *parent = 0, LabelPosition pos = Left);
105 LabelPosition labelPosition() const;
106 virtual void setLabelPosition(LabelPosition position);
197 void init(const QString &text, WidgetType type, LabelPosition pos);
208 void setLabelPositionInternal(LabelPosition position, bool noLabel);
/dports/devel/intel-graphics-compiler/SPIRV-Tools/test/opt/
H A Ddataflow.cpp37 VisitOrder(IRContext& context, LabelPosition label_position) in VisitOrder()
65 context, ForwardDataFlowAnalysis::LabelPosition::kLabelsOnly) {} in BackwardReachability()
151 std::map<ForwardDataFlowAnalysis::LabelPosition, std::vector<uint32_t>> in TEST_F()
153 expected_order[ForwardDataFlowAnalysis::LabelPosition::kLabelsOnly] = { in TEST_F()
156 expected_order[ForwardDataFlowAnalysis::LabelPosition::kLabelsAtBeginning] = { in TEST_F()
159 expected_order[ForwardDataFlowAnalysis::LabelPosition::kLabelsAtEnd] = { in TEST_F()
162 expected_order[ForwardDataFlowAnalysis::LabelPosition::kNoLabels] = { in TEST_F()
/dports/graphics/spirv-tools/SPIRV-Tools-2021.4/test/opt/
H A Ddataflow.cpp37 VisitOrder(IRContext& context, LabelPosition label_position) in VisitOrder()
65 context, ForwardDataFlowAnalysis::LabelPosition::kLabelsOnly) {} in BackwardReachability()
151 std::map<ForwardDataFlowAnalysis::LabelPosition, std::vector<uint32_t>> in TEST_F()
153 expected_order[ForwardDataFlowAnalysis::LabelPosition::kLabelsOnly] = { in TEST_F()
156 expected_order[ForwardDataFlowAnalysis::LabelPosition::kLabelsAtBeginning] = { in TEST_F()
159 expected_order[ForwardDataFlowAnalysis::LabelPosition::kLabelsAtEnd] = { in TEST_F()
162 expected_order[ForwardDataFlowAnalysis::LabelPosition::kNoLabels] = { in TEST_F()
/dports/graphics/qgis/qgis-3.22.3/src/core/labeling/
H A Dqgsvectorlayerlabelprovider.h64 void drawLabelBackground( QgsRenderContext &context, pal::LabelPosition *label ) const override;
65 void drawLabel( QgsRenderContext &context, pal::LabelPosition *label ) const override;
66 void drawUnplacedLabel( QgsRenderContext &context, pal::LabelPosition *label ) const override;
125 …void drawLabelPrivate( pal::LabelPosition *label, QgsRenderContext &context, QgsPalLayerSettings &…
150 void drawCallout( QgsRenderContext &context, pal::LabelPosition *label ) const;
/dports/graphics/qgis-ltr/qgis-3.16.16/src/core/labeling/
H A Dqgsvectorlayerlabelprovider.h64 void drawLabelBackground( QgsRenderContext &context, pal::LabelPosition *label ) const override;
65 void drawLabel( QgsRenderContext &context, pal::LabelPosition *label ) const override;
66 void drawUnplacedLabel( QgsRenderContext &context, pal::LabelPosition *label ) const override;
123 …void drawLabelPrivate( pal::LabelPosition *label, QgsRenderContext &context, QgsPalLayerSettings &…
148 void drawCallout( QgsRenderContext &context, pal::LabelPosition *label ) const;
/dports/audio/bharvestr-lv2/BHarvestr-7e6a1e7c81d0af61d4fabcd823978d62c8970502/src/BWidgets/
H A DVSliderValue.hpp41 const std::string& valueFormat, LabelPosition valuePos = LABEL_TOP);
76 virtual void setValuePosition (const LabelPosition pos);
82 LabelPosition getValuePosition () const;
131 LabelPosition valPosition;
H A DHSliderValue.hpp41 const std::string& valueFormat, LabelPosition valuePos = LABEL_TOP);
76 virtual void setValuePosition (const LabelPosition pos);
82 LabelPosition getValuePosition () const;
131 LabelPosition valPosition;

12345678