diff options
author | Matti Tahvonen <matti.tahvonen@itmill.com> | 2010-03-18 11:33:38 +0000 |
---|---|---|
committer | Matti Tahvonen <matti.tahvonen@itmill.com> | 2010-03-18 11:33:38 +0000 |
commit | 2dac4e6c47fb68616ec4b0a958549c4738a52d04 (patch) | |
tree | 703b3c746c402f79d742f9bd8d52243b99b1f777 /src/com/vaadin/ui/Tree.java | |
parent | 7588a1708218dc9a419a2c43a5efbbf627663338 (diff) | |
download | vaadin-framework-2dac4e6c47fb68616ec4b0a958549c4738a52d04.tar.gz vaadin-framework-2dac4e6c47fb68616ec4b0a958549c4738a52d04.zip |
property id is now sent to server from table drag event + some javadocs and small improvements
svn changeset:11958/svn branch:6.3
Diffstat (limited to 'src/com/vaadin/ui/Tree.java')
-rw-r--r-- | src/com/vaadin/ui/Tree.java | 13 |
1 files changed, 8 insertions, 5 deletions
diff --git a/src/com/vaadin/ui/Tree.java b/src/com/vaadin/ui/Tree.java index 018cc61985..f8a51cb8e4 100644 --- a/src/com/vaadin/ui/Tree.java +++ b/src/com/vaadin/ui/Tree.java @@ -1286,12 +1286,15 @@ public class Tree extends AbstractSelect implements Container.Hierarchical, } /** - * An example of lazy initializing criterion. Initially pretty much no data - * is sent to client, on first accepts set (per drag request) the client - * side data structure is initialized and no subsequent requests requests - * are needed during that drag and drop operation. + * Lazy loading accept criterion for Tree. Accepted target nodes are loaded + * from server once per drag and drop operation. Developer must override one + * method that decides accepted tree nodes for the whole Tree. + * * <p> - * See client side counterpart + * Initially pretty much no data is sent to client. On first required + * criterion check (per drag request) the client side data structure is + * initialized from server and no subsequent requests requests are needed + * during that drag and drop operation. */ @ClientCriterion(VLazyInitItemIdentifiers.class) public static abstract class TreeDropCriterion extends ServerSideCriterion { |