Just to give an idea of where this is going.
I've taken DataItemRendererFactorForArrayList and turned it into three
beads:
RefreshItemRenderersBead. This bead listens for dataProviderChanged and
replaced all of the itemRenderers in the IItemRendererParent with fresh
copies. It does this using
I'm working on three approached trying to decide which is a best fit.
Using the DynamicItemsRendererFactoryForArrayListData and adding handling
for items removed and changed is the easiest thing to do. We have one
bead, DataItemRendererFactoryForArrayList that's used for static lists and
then
Alex,
I do understand that, but in the results of that event which are coming
from ArrayList I need to do action on object (IItemRendererParent) and
remove those item renderers. - This part along with listeners to that event
should be done by bead. As I understand Peter is digging in that area.
In Flex, you can call ArrayList.removeItemAt and generate an ITEM_REMOVED
for each call, or set the source of the ArrayList which triggers a
different event as well.
So as Peter is saying, for Royale, there will similarly be two different
events and two different ways to remove items
If you remove everything from the ArrayList, the ArrayList dispatches
ITEM_REMOVED for each item (if you have 1000 items you will get 1000
events). ArrayList should probably not do that and instead, dispatch a
single COLLECTION_CHANGED event once completed.
But the RemoveItemBead will in fact,
Hi Peter,
I see that and there is question whether I can put that code as a separate
bead to our repo and whether you are not going to do this?
You have started other thread about Tree Grid and beads mentioned by you
seems to be the answer. Let me know before I create something.
Thanks, Piotr
Hi Guys,
I have faced an issue where solution seems to be not so easy. I have MDL
Table (issue affects also List) with some rows.
If I simply assign to dataProvider = null it doesn't remove all content. It
is because in our DataItemRendererFactoryForArrayData and other type of
that class we have
