[Angular 1.x] Display treeDnD & event DrapnDrop, field 'td' by tree.
###Support(just when I'm online)
Demo:
###Requirement:
angular: >=1.2.1
Source (>= 3.0.4)
http://thienhung1989.github.io/angular-tree-dnd/3.0.4/ng-tree-dnd.css
http://thienhung1989.github.io/angular-tree-dnd/3.0.4/ng-tree-dnd.js
http://thienhung1989.github.io/angular-tree-dnd/3.0.4/ng-tree-dnd.min.js
Install bower:
bower install angular-tree-dnd
npm install angular-tree-dnd
Problems
- Big data not good (development with scrollInfinite, will update soon late).
Feature
- Display Data-Tree with 2 type: Table-Grid & List (ul, ol).
- Drag & Drop.
- Filter Data-Tree.
- GroupBy (building, not ready)
- Extended function
Directive forData-Tree (next, prex, remove,...)
Manuals & Documents:
Changes Log:
Thank To:
This product is the combination and optimization of 2: JimLiu (Drag2Drop) và khan4019 (Display Tree2Table).
Contact
-
本篇文章是个简单的例子，如果需求需要更复杂的可参考jstree 官网，里面详细接受有事件、方法。 jstree：https://www.jstree.com/ angularjs调用一般是： <script src="../bootstrap/js/bootstrap.min.js"></script> <link rel="stylesheet" href="../bootstrap/css
-
en.json { "HOME": "Home", "MODULESMGR": "Modules Mgr", "NEWS": "News", "PRODUCTES": "Productes", "SERVICES": "Services", "ABOUT": "About Us", "CONTACT": "Contact Us", "SYSTEMMGR"
-
UI组件库 Element Material ngx-bootstrap 常用UI sweetalert angular2-notifications ngx-gallery ng2-image-upload ng2-file-upload ngx-chips ng2-smart-table ngx-datatable ng2-select angular-tree-component 图片查看-
-
angular tree component Getting started Install angular-tree-component: npm install @circlon/angular-tree-component Import TreeModule: import { TreeModule } from '@circlon/angular-tree-component';@NgMo
-
Angular UI Tree Angular UI Tree is an AngularJS UI component that can sort nested lists, provides drag & drop support and doesn't depend on jQuery. If you are a user who uses angular-nestedSortable, t
-
Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same values. 题目翻译: 给两棵树，写一个函
-
Given a binary tree, check whether it is a mirror of itself(ie, symmetric around its center) For example, this tree is symmetric: 1 / \ 2 2 / \ / \ 3 4 4 3 But the following tree is not.
-
Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1 / \ 2 3 \ 5 All root-to-leaf paths are: ["1->2->5", "1->3"] 题目翻译： 给定一棵二叉树，返回所有从根节点到叶节点的
-
Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ b