Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

LUCENE-7691 - add explicit size to arraylist creation if known #157

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

LUCENE-7691 - add explicit size to arraylist creation if known #157

wants to merge 1 commit into from

Conversation

michaelbraun
Copy link
Contributor

No description provided.

markrmiller added a commit that referenced this pull request Jul 14, 2020
@markrmiller
#157 - Spray spackle towards this TransactionLog leak.
9670164
glawson0 pushed a commit to glawson0/lucene-solr that referenced this pull request Aug 10, 2021
LUCENE-9963 Improve FlattenGraphFilter's robustness when handling inc…
4bc73df 
…oming token graphs with holes (apache#157)

6 main improvements:
    1) Iterate through all output.InputNodes since dest gaps can exist.
    2) freeBefore the minimum input node instead of the first input node(which was usually, but not always, the minimum).
    3) Don't freeBefore from a hole source node. Book keeping may not be correct and could result in an early free.
    4) When adding an output node after hole recovery, calculate its new position increment instead of adding it to the end of the output graph.
    5) Nodes after holes that have edges to their source will do the output re-mapping that the deleted node would have done.
    6) If a disconnected input node swaps order with another node in the output, then map them to the same output node.
glawson0 pushed a commit to glawson0/lucene-solr that referenced this pull request Aug 10, 2021
LUCENE-9963 Improve FlattenGraphFilter's robustness when handling inc…
e00a037 
…oming token graphs with holes (apache#157)

6 main improvements:
    1) Iterate through all output.InputNodes since dest gaps can exist.
    2) freeBefore the minimum input node instead of the first input node(which was usually, but not always, the minimum).
    3) Don't freeBefore from a hole source node. Book keeping may not be correct and could result in an early free.
    4) When adding an output node after hole recovery, calculate its new position increment instead of adding it to the end of the output graph.
    5) Nodes after holes that have edges to their source will do the output re-mapping that the deleted node would have done.
    6) If a disconnected input node swaps order with another node in the output, then map them to the same output node.
glawson0 pushed a commit to glawson0/lucene-solr that referenced this pull request Aug 10, 2021
LUCENE-9963 Improve FlattenGraphFilter's robustness when handling inc…
f193df7 
…oming token graphs with holes (apache#157)

6 main improvements:
    1) Iterate through all output.InputNodes since dest gaps can exist.
    2) freeBefore the minimum input node instead of the first input node(which was usually, but not always, the minimum).
    3) Don't freeBefore from a hole source node. Book keeping may not be correct and could result in an early free.
    4) When adding an output node after hole recovery, calculate its new position increment instead of adding it to the end of the output graph.
    5) Nodes after holes that have edges to their source will do the output re-mapping that the deleted node would have done.
    6) If a disconnected input node swaps order with another node in the output, then map them to the same output node.
glawson0 pushed a commit to glawson0/lucene-solr that referenced this pull request Aug 11, 2021
LUCENE-9963 Improve FlattenGraphFilter's robustness when handling inc…
433b58e 
…oming token graphs with holes (apache#157)

6 main improvements:
    1) Iterate through all output.InputNodes since dest gaps can exist.
    2) freeBefore the minimum input node instead of the first input node(which was usually, but not always, the minimum).
    3) Don't freeBefore from a hole source node. Book keeping may not be correct and could result in an early free.
    4) When adding an output node after hole recovery, calculate its new position increment instead of adding it to the end of the output graph.
    5) Nodes after holes that have edges to their source will do the output re-mapping that the deleted node would have done.
    6) If a disconnected input node swaps order with another node in the output, then map them to the same output node.
glawson0 pushed a commit to glawson0/lucene-solr that referenced this pull request Aug 11, 2021
LUCENE-9963 Improve FlattenGraphFilter's robustness when handling inc…
4d08bd8 
…oming token graphs with holes (apache#157)

6 main improvements:
    1) Iterate through all output.InputNodes since dest gaps can exist.
    2) freeBefore the minimum input node instead of the first input node(which was usually, but not always, the minimum).
    3) Don't freeBefore from a hole source node. Book keeping may not be correct and could result in an early free.
    4) When adding an output node after hole recovery, calculate its new position increment instead of adding it to the end of the output graph.
    5) Nodes after holes that have edges to their source will do the output re-mapping that the deleted node would have done.
    6) If a disconnected input node swaps order with another node in the output, then map them to the same output node.
glawson0 pushed a commit to glawson0/lucene-solr that referenced this pull request Aug 16, 2021
LUCENE-9963 Improve FlattenGraphFilter's robustness when handling inc…
c14582d 
…oming token graphs with holes (apache#157)

 6 main improvements:
     1) Iterate through all output.InputNodes since dest gaps can exist.
     2) freeBefore the minimum input node instead of the first input node(which was usually, but not always, the minimum).
     3) Don't freeBefore from a hole source node. Book keeping may not be correct and could result in an early free.
     4) When adding an output node after hole recovery, calculate its new position increment instead of adding it to the end of the output graph.
     5) Nodes after holes that have edges to their source will do the output re-mapping that the deleted node would have done.
     6) If a disconnected input node swaps order with another node in the output, then map them to the same output node.
glawson0 pushed a commit to glawson0/lucene-solr that referenced this pull request Aug 16, 2021
LUCENE-9963 Improve FlattenGraphFilter's robustness when handling inc…
b105e5a 
…oming token graphs with holes (apache#157)

 6 main improvements:
     1) Iterate through all output.InputNodes since dest gaps can exist.
     2) freeBefore the minimum input node instead of the first input node(which was usually, but not always, the minimum).
     3) Don't freeBefore from a hole source node. Book keeping may not be correct and could result in an early free.
     4) When adding an output node after hole recovery, calculate its new position increment instead of adding it to the end of the output graph.
     5) Nodes after holes that have edges to their source will do the output re-mapping that the deleted node would have done.
     6) If a disconnected input node swaps order with another node in the output, then map them to the same output node.
epugh pushed a commit to epugh/lucene-solr-1 that referenced this pull request Sep 3, 2021
@janhoy
SOLR-15316 Update Jetty to 9.4.41.v20210516 (apache#157)
3f8456f
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
1 participant
@michaelbraun