Search/Filter on tree data

[manjuyadav95.m]

Please help me or give an idea to do search/filter from tree data in perspective

[pturmel]

Please expand your question to include:

• A sample of the data you currently have (with private stuff cut out),

• A sample of the filtered data you wish to achieve,

• The code you've already tried, and the results it produced.

[manjuyadav95.m]

Thanks for your reply. I have shared the link below thats what i want but in this it's searched by tag path but i wanna achieve it by typing any keys into the search field

Perspective Progressive Tag Tree

Progress Update: Creating a filtered list = Easy Creating the list of all the filtered tag indices within the tree = Easy Expanding the list automatically = Easy to do, but very slow… I have it currently working in a format that expands all of the tags that match your search and highlights them. It works ok with my example (about 1000 tags) but still isnt as fast as I would like. Top items to correct: It needs to also remove/hide the tags and paths that don’t match the filter. In my exampl…

[pturmel]

@manjuyadav95.m

but i wanna achieve it by typing any keys into the search field

With tags? Or other arbitrary data?

{ Samples, please. }

[manjuyadav95.m]

Please see below image for the data example ...nodes should get filtered by entered text ...for example if I enter abc-1 then its parent node(under which abc-1 node is present) n the exact node(abc) and its child node should be displayed and when I remove the text then previous data should get populated on tree data...

[Transistor]

Tip: Please use full words, sentences, capitals and proper punctuation etc., so we can understand your writing and to help anyone using machine translation into another language. Make it easy for your readers you are asking to give of their time to help you.

[pturmel]

A recursive script would likely be needed. If you have the source data in a flat format, then the technique in this post might help, by filtering (with where()) then generating the tree:

Automation Professionals' Integration Toolkit Module

No longer true. For Ignition v8.1+: v2.0.3.231942018 With @Matthew.gaitan 's input dataset in a custom property named source, this expression: forEach( asMap( groupBy( {this.custom.source}, it()['RouteName'], it()['StopName'] ) ), asMap( 'label', it()[0], 'expanded', false, 'data', asMap('nodeType', 'Route'), 'items', forEach( it()[1], asMap( 'label', it()[0], 'expanded', false, 'data', asMap('nodeType', 'Stop'), 'items', forEach( it(…

[manjuyadav95.m]

sorry, I gone through this thread but I am not getting ...please help me with below code , I am checking that filter text n any of the label from tree data is matching or not. if matched then that particular complete node/item(including child) should be copied or else other items should be removed
refer from above shared example data: if i enter abc then abc complete node should be copied or else other items that is def node should be removed/deleted and if i unfilter then back to all data (abc n def both nodes should be displayed)

vTreeData=self.parent.getChild("cntrfilter").getChild("treeFilter").props.items
vFilterText=self.parent.getChild("cntrfilter").getChild("txtSearch").props.text
	
for i in range(len(vTreeData)):
	vId=self.parent.getChild("cntrfilter").getChild("treeFilter").props.items[i].label
	if vFilterText==vId:
		vFilteredData=self.parent.getChild("cntrfilter").getChild("treeFilter").props.items[i]
		import json
		vFilteredData = json.loads(vFilteredData)
		self.parent.getChild("cntrfilter").getChild("treeFilter").props.items=vFilteredData

i want the same way as how Ignition designer project browser search works....

sry to tag you here but need help ..plz check if you can help me on this @victordcq

[victordcq]

a basic resursive filter should be a kinda basic skill for a python programmer...
even with lowercase or regex support
i suggest you look up how it works, instead of just copying my workxd

	import re
	
	if not len(value.filter):
		return value.items
		
	def recursiveSearch(items, key):
		returnList = []		
		for item in items:
			if bool(re.search(key,item.label.lower())):				
				returnList.append(item)
			elif len(item.items):
				returnList += (recursiveSearch(item.items, key))
		if (returnList):
			return returnList
		return []
	
	return recursiveSearch(value.items, value.filter.lower())

filtertree.zip (7.6 KB)

[manjuyadav95.m]

Ok sure, Thank u so much