qpid-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "ASF subversion and git services (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (PROTON-1984) [c] pn_data_inspect has order n^2 running time
Date Thu, 20 Dec 2018 17:17:00 GMT

    [ https://issues.apache.org/jira/browse/PROTON-1984?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16726052#comment-16726052

ASF subversion and git services commented on PROTON-1984:

Commit 6397116291fd569ce03025c1b3a135172de3f2a6 in qpid-proton's branch refs/heads/master
from Andrew Stitcher
[ https://gitbox.apache.org/repos/asf?p=qpid-proton.git;h=6397116 ]

PROTON-1984: Fix pn_data_inspect test to work on 32 bit machines!

> [c] pn_data_inspect has order n^2 running time
> ----------------------------------------------
>                 Key: PROTON-1984
>                 URL: https://issues.apache.org/jira/browse/PROTON-1984
>             Project: Qpid Proton
>          Issue Type: Bug
>          Components: proton-c
>            Reporter: Andrew Stitcher
>            Assignee: Andrew Stitcher
>            Priority: Major
>             Fix For: proton-c-0.27.0
> pni_node_index which is used in a couple of places to find out the index of a node inside
a pn_data_t has a run time that is linear in the size of the level of the pn_data_t it is
> pni_inspect_enter and pni_inspect_exit which are called for every node in the pn_data_t
when traversing it using pn_data_inspect use pni_node_index. This means that the overall time
complexity is n^2 in the size of any embedded compound data structure (array, list, map).
> So for large compound data structures this can take an extremely long time.

This message was sent by Atlassian JIRA

To unsubscribe, e-mail: dev-unsubscribe@qpid.apache.org
For additional commands, e-mail: dev-help@qpid.apache.org

View raw message