Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
O
opcua-asyncio
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
1
Merge Requests
1
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Nikola Balog
opcua-asyncio
Commits
2cf565e2
Commit
2cf565e2
authored
May 03, 2021
by
Igor Nehoroshev
Committed by
oroulet
May 04, 2021
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Make read_raw_history recursive by default
parent
a50c0ce1
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
1 addition
and
6 deletions
+1
-6
asyncua/common/node.py
asyncua/common/node.py
+1
-6
No files found.
asyncua/common/node.py
View file @
2cf565e2
...
...
@@ -514,7 +514,7 @@ class Node:
rpath
.
Elements
.
append
(
el
)
return
rpath
async
def
read_raw_history
(
self
,
starttime
=
None
,
endtime
=
None
,
numvalues
=
0
,
return_bounds
=
True
,
recursive
=
False
):
async
def
read_raw_history
(
self
,
starttime
=
None
,
endtime
=
None
,
numvalues
=
0
,
return_bounds
=
True
):
"""
Read raw history of a node
result code from server is checked and an exception is raised in case of error
...
...
@@ -533,11 +533,6 @@ class Node:
details
.
EndTime
=
ua
.
get_win_epoch
()
details
.
NumValuesPerNode
=
numvalues
details
.
ReturnBounds
=
return_bounds
if
not
recursive
:
result
=
await
self
.
history_read
(
details
)
result
.
StatusCode
.
check
()
return
result
.
HistoryData
.
DataValues
history
=
[]
continuation_point
=
None
while
True
:
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment