1 /*
2  * This file is part of gtkD.
3  *
4  * gtkD is free software; you can redistribute it and/or modify
5  * it under the terms of the GNU Lesser General Public License
6  * as published by the Free Software Foundation; either version 3
7  * of the License, or (at your option) any later version, with
8  * some exceptions, please read the COPYING file.
9  *
10  * gtkD is distributed in the hope that it will be useful,
11  * but WITHOUT ANY WARRANTY; without even the implied warranty of
12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
13  * GNU Lesser General Public License for more details.
14  *
15  * You should have received a copy of the GNU Lesser General Public License
16  * along with gtkD; if not, write to the Free Software
17  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110, USA
18  */
19 
20 // generated automatically - do not change
21 // find conversion definition on APILookup.txt
22 // implement new conversion functionalities on the wrap.utils pakage
23 
24 
25 module gtk.TreeDragDestIF;
26 
27 private import gobject.Value;
28 private import gtk.TreePath;
29 private import gtk.c.functions;
30 public  import gtk.c.types;
31 
32 
33 /**
34  * Interface for Drag-and-Drop destinations in `GtkTreeView`.
35  */
36 public interface TreeDragDestIF{
37 	/** Get the main Gtk struct */
38 	public GtkTreeDragDest* getTreeDragDestStruct(bool transferOwnership = false);
39 
40 	/** the main Gtk struct as a void* */
41 	protected void* getStruct();
42 
43 
44 	/** */
45 	public static GType getType()
46 	{
47 		return gtk_tree_drag_dest_get_type();
48 	}
49 
50 	/**
51 	 * Asks the #GtkTreeDragDest to insert a row before the path @dest,
52 	 * deriving the contents of the row from @value. If @dest is
53 	 * outside the tree so that inserting before it is impossible, %FALSE
54 	 * will be returned. Also, %FALSE may be returned if the new row is
55 	 * not created for some model-specific reason.  Should robustly handle
56 	 * a @dest no longer found in the model!
57 	 *
58 	 * Params:
59 	 *     dest = row to drop in front of
60 	 *     value = data to drop
61 	 *
62 	 * Returns: whether a new row was created before position @dest
63 	 */
64 	public bool dragDataReceived(TreePath dest, Value value);
65 
66 	/**
67 	 * Determines whether a drop is possible before the given @dest_path,
68 	 * at the same depth as @dest_path. i.e., can we drop the data in
69 	 * @value at that location. @dest_path does not have to
70 	 * exist; the return value will almost certainly be %FALSE if the
71 	 * parent of @dest_path doesn’t exist, though.
72 	 *
73 	 * Params:
74 	 *     destPath = destination row
75 	 *     value = the data being dropped
76 	 *
77 	 * Returns: %TRUE if a drop is possible before @dest_path
78 	 */
79 	public bool rowDropPossible(TreePath destPath, Value value);
80 }