Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
M
Molstar
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Container Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Michal Malý
Molstar
Commits
0f22f538
Commit
0f22f538
authored
6 years ago
by
Alexander Rose
Browse files
Options
Downloads
Patches
Plain Diff
segment iterator cleanup/revert
parent
430e5a2f
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
src/mol-data/int/impl/segmentation.ts
+8
-15
8 additions, 15 deletions
src/mol-data/int/impl/segmentation.ts
with
8 additions
and
15 deletions
src/mol-data/int/impl/segmentation.ts
+
8
−
15
View file @
0f22f538
...
...
@@ -52,22 +52,18 @@ export function projectValue({ segments }: Segmentation, set: OrderedSet, value:
}
export
class
SegmentIterator
<
T
extends
number
=
number
>
implements
Iterator
<
Segs
.
Segment
<
T
>>
{
private
_segmentMin
=
0
;
private
_segmentMax
=
0
;
private
segmentCur
=
0
;
private
segmentMax
=
0
;
private
segmentMin
=
0
;
private
setRange
=
Interval
.
Empty
;
private
value
:
Segs
.
Segment
<
T
>
=
{
index
:
0
,
start
:
0
as
T
,
end
:
0
as
T
};
hasNext
:
boolean
=
false
;
get
segmentMin
()
{
return
this
.
_segmentMin
}
get
segmentMax
()
{
return
this
.
_segmentMax
}
move
()
{
while
(
this
.
hasNext
)
{
if
(
this
.
updateValue
())
{
this
.
value
.
index
=
this
.
segment
Cur
++
;
this
.
hasNext
=
this
.
_
segmentMax
>=
this
.
segment
Cur
&&
Interval
.
size
(
this
.
setRange
)
>
0
;
this
.
value
.
index
=
this
.
segment
Min
++
;
this
.
hasNext
=
this
.
segmentMax
>=
this
.
segment
Min
&&
Interval
.
size
(
this
.
setRange
)
>
0
;
break
;
}
else
{
this
.
updateSegmentRange
();
...
...
@@ -77,7 +73,7 @@ export class SegmentIterator<T extends number = number> implements Iterator<Segs
}
private
updateValue
()
{
const
segmentEnd
=
this
.
segments
[
this
.
segment
Cur
+
1
];
const
segmentEnd
=
this
.
segments
[
this
.
segment
Min
+
1
];
// TODO: add optimized version for interval and array?
const
setEnd
=
OrderedSet
.
findPredecessorIndexInInterval
(
this
.
set
,
segmentEnd
,
this
.
setRange
);
this
.
value
.
start
=
Interval
.
start
(
this
.
setRange
)
as
T
;
...
...
@@ -92,12 +88,9 @@ export class SegmentIterator<T extends number = number> implements Iterator<Segs
this
.
hasNext
=
false
;
return
;
}
this
.
segmentCur
=
this
.
segmentMap
[
OrderedSet
.
getAt
(
this
.
set
,
sMin
)];
this
.
_segmentMax
=
this
.
segmentMap
[
OrderedSet
.
getAt
(
this
.
set
,
sMax
)];
this
.
_segmentMin
=
this
.
segmentCur
this
.
hasNext
=
this
.
_segmentMax
>=
this
.
segmentCur
;
this
.
segmentMin
=
this
.
segmentMap
[
OrderedSet
.
getAt
(
this
.
set
,
sMin
)];
this
.
segmentMax
=
this
.
segmentMap
[
OrderedSet
.
getAt
(
this
.
set
,
sMax
)];
this
.
hasNext
=
this
.
segmentMax
>=
this
.
segmentMin
;
}
setSegment
(
segment
:
Segs
.
Segment
<
T
>
)
{
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment