tbedp / datavjs Goto Github PK
View Code? Open in Web Editor NEWDataV
Home Page: http://datavlab.org/datavjs/
License: Other
datavjs's People
Contributors
Stargazers
Watchers
Forkers
huang77 xibei sunfang1cn zqshen anewczs wufunxiang jonas8 gotomypc fangtoby lt1946 vincentfxz ryankung tornadory robertwang creamidea ryaninhust xvm03 majorye moocss jacksontian lulu523 johnyy jdk137 gijs gozo1234 immissile jixiangac kapokfly ghoshadow zhangxinxin khua hanaarena lynzz lnsoso magicshui ppv1 zhengxiaodong yangdanhz cheungzeecn weiguang3100 sbilly theseue jivinhuang chunterg break123 sunguo jokaye mozii johnnyhg moreorless bxeldor booles jy4618272 lipengming programmer-zhangdi dragonui tangfu tianmo acelan86 cloud-school yangdaidi hushicai jifeng streambo black516 houfeng mfine2 buttonwood scsidisk heracross sunjl128 zgithub reilost watano xmbsn liutian1937 weifengyao mlnotes xiejinlin mingzhouyang mavlarn gejigeji chongzhi kener zhangciwu sungis cdredfox tomliu neowangs kirk-ye sukonzer c93614 32138666 gkrists contalk gothack329 schumilin ppxu chandler-sun jonnyquandatavjs's Issues
deps.js与jquery.form插件冲突
deps.js与jquery.form插件冲突，执行jquery.form中的ajaxform或ajaxsubmit时在deps中总是会报no method [ajaxform]或[ajaxsubmit]。
Chord图的文字偏移问题
看看chord的文字偏移问题
chinamap信息需要更新
上海地图的原南汇合并到浦东新区，卢湾区合并到黄浦区，因此
datavjs/lib/charts/data/chinaMap/31.json文件需要更新
chord.js line 114 应该改为 i < this.groupNum
chord.js line 114：
for (i = 0; i <= this.groupNum; i++) {
应该改为
for (i = 0; i < this.groupNum; i++) {
否则图例里会有undefined出现，example里面没有出现是因为图例框超出了当前可见区域。
force：节点数据应该按id索引，而不是数组index
源码地址：https://github.com/TBEDP/datavjs/blob/master/lib/charts/force.js
Force.prototype.setSource = function (table, map) {
map = this.map(map);
//this.net = json;
if (table[0][0] === "node") {
table = table.slice(1);
}
var nData = [];
var lData = [];
var isNode = true;
var nodeNum;
var that = this;
table.forEach(function (d, i) {
var value;
if (isNode) {
if (d[map.nodeId] === "link") {
isNode = false;
nodeNum = i + 1;
} else {
if (d[map.nodeId] === "") {
throw new Error("ID can not be empty(line:" + (i + 1) + ").");
}
value = that._toNum(d[map.nodeValue]);
nData[i] = {
name: d[map.nodeName],
nodeValue: value
};
if (i === 0) {
that.nodeValueMin = value;
that.nodeValueMax = value;
}
that.nodeValueMin = (value < that.nodeValueMin) ? value : that.nodeValueMin;
that.nodeValueMax = (value > that.nodeValueMax) ? value : that.nodeValueMax;
}
} else {
if (d[map.linkSource - 3] === "") {
throw new Error("Source can not be empty(line:" + (i + 1) + ").");
}
if (d[map.linkTarget - 3] === "") {
throw new Error("Target can not be empty(line:" + (i + 1) + ").");
}
value = that._toNum(d[map.linkValue - 3]);
lData[i - nodeNum] = {
source: that._toNum(d[map.linkSource - 3]),
target: that._toNum(d[map.linkTarget - 3]),
value: that._toNum(d[map.linkValue - 3])
};
if (i === nodeNum) {
that.linkValueMin = value;
that.linkValueMax = value;
}
that.linkValueMin = (value < that.linkValueMin) ? value : that.linkValueMin;
that.linkValueMax = (value > that.linkValueMax) ? value : that.linkValueMax;
}
});
this.net.nodes = nData;
this.net.links = lData;
this.nodeValueMax++;
this.linkValueMax++;
};
这段代码中设置link的source和target的时候，应该根据数据的id来索引
lData[i - nodeNum] = {
source: that._toNum(d[map.linkSource - 3]),
target: that._toNum(d[map.linkTarget - 3]),
value: that._toNum(d[map.linkValue - 3])
};
fixed后的代码如下：
Force.prototype.setSource = function (table, map) {
map = this.map(map);
//this.net = json;
if (table[0][0] === "node") {
table = table.slice(1);
}
var nData = [],
lData = [],
isNode = true,
nodeNum,
that = this,
NUM = 3,
// FIXED: 用数据的id索引nodes
index = {},
source = map.linkSource - NUM,
target = map.linkTarget - NUM,
lValue = map.linkValue - NUM;
table.forEach(function (d, i) {
var value;
if (isNode) {
if (d[map.nodeId] === "link") {
isNode = false;
nodeNum = i + 1;
} else {
if (d[map.nodeId] === "") {
throw new Error("ID can not be empty(line:" + (i + 1) + ").");
}
value = +(d[map.nodeValue]);
nData[i] = {
name: d[map.nodeName],
nodeValue: value
};
if (i === 0) {
that.nodeValueMin = value;
that.nodeValueMax = value;
}
that.nodeValueMin = (value < that.nodeValueMin) ? value : that.nodeValueMin;
that.nodeValueMax = (value > that.nodeValueMax) ? value : that.nodeValueMax;
}
} else {
if (d[map.linkSource - 3] === "") {
throw new Error("Source can not be empty(line:" + (i + 1) + ").");
}
if (d[map.linkTarget - 3] === "") {
throw new Error("Target can not be empty(line:" + (i + 1) + ").");
}
value = +(d[map.linkValue - 3]);
// FIXED: 用数据的id索引nodes
index[d[map.id]] = i;
lData[i - nodeNum] = {
source: +(index[d[source]]),
target: +(index[d[target]]),
value: +(index[d[lValue]])
};
if (i === nodeNum) {
that.linkValueMin = value;
that.linkValueMax = value;
}
that.linkValueMin = (value < that.linkValueMin) ? value : that.linkValueMin;
that.linkValueMax = (value > that.linkValueMax) ? value : that.linkValueMax;
}
});
this.net.nodes = nData;
this.net.links = lData;
this.nodeValueMax++;
this.linkValueMax++;
};
Pie chart没有像其他组件一样继承Chart
force：节点数据应该按数据的id索引，而不是数组index
源码地址：https://github.com/TBEDP/datavjs/blob/master/lib/charts/force.js
Force.prototype.setSource = function (table, map) {
map = this.map(map);
//this.net = json;
if (table[0][0] === "node") {
table = table.slice(1);
}
var nData = [];
var lData = [];
var isNode = true;
var nodeNum;
var that = this;
table.forEach(function (d, i) {
var value;
if (isNode) {
if (d[map.nodeId] === "link") {
isNode = false;
nodeNum = i + 1;
} else {
if (d[map.nodeId] === "") {
throw new Error("ID can not be empty(line:" + (i + 1) + ").");
}
value = that._toNum(d[map.nodeValue]);
nData[i] = {
name: d[map.nodeName],
nodeValue: value
};
if (i === 0) {
that.nodeValueMin = value;
that.nodeValueMax = value;
}
that.nodeValueMin = (value < that.nodeValueMin) ? value : that.nodeValueMin;
that.nodeValueMax = (value > that.nodeValueMax) ? value : that.nodeValueMax;
}
} else {
if (d[map.linkSource - 3] === "") {
throw new Error("Source can not be empty(line:" + (i + 1) + ").");
}
if (d[map.linkTarget - 3] === "") {
throw new Error("Target can not be empty(line:" + (i + 1) + ").");
}
value = that._toNum(d[map.linkValue - 3]);
lData[i - nodeNum] = {
source: that._toNum(d[map.linkSource - 3]),
target: that._toNum(d[map.linkTarget - 3]),
value: that._toNum(d[map.linkValue - 3])
};
if (i === nodeNum) {
that.linkValueMin = value;
that.linkValueMax = value;
}
that.linkValueMin = (value < that.linkValueMin) ? value : that.linkValueMin;
that.linkValueMax = (value > that.linkValueMax) ? value : that.linkValueMax;
}
});
this.net.nodes = nData;
this.net.links = lData;
this.nodeValueMax++;
this.linkValueMax++;
};
这段代码中设置link的source和target的时候，应该根据数据的id来索引
lData[i - nodeNum] = {
source: that._toNum(d[map.linkSource - 3]),
target: that._toNum(d[map.linkTarget - 3]),
value: that._toNum(d[map.linkValue - 3])
};
fixed后的代码如下：
Force.prototype.setSource = function (table, map) {
map = this.map(map);
//this.net = json;
if (table[0][0] === "node") {
table = table.slice(1);
}
var nData = [],
lData = [],
isNode = true,
nodeNum,
that = this,
NUM = 3,
// FIXED: 用数据的id索引nodes
index = {},
source = map.linkSource - NUM,
target = map.linkTarget - NUM,
lValue = map.linkValue - NUM;
table.forEach(function (d, i) {
var value;
if (isNode) {
if (d[map.nodeId] === "link") {
isNode = false;
nodeNum = i + 1;
} else {
if (d[map.nodeId] === "") {
throw new Error("ID can not be empty(line:" + (i + 1) + ").");
}
value = +(d[map.nodeValue]);
nData[i] = {
name: d[map.nodeName],
nodeValue: value
};
if (i === 0) {
that.nodeValueMin = value;
that.nodeValueMax = value;
}
that.nodeValueMin = (value < that.nodeValueMin) ? value : that.nodeValueMin;
that.nodeValueMax = (value > that.nodeValueMax) ? value : that.nodeValueMax;
}
} else {
if (d[map.linkSource - 3] === "") {
throw new Error("Source can not be empty(line:" + (i + 1) + ").");
}
if (d[map.linkTarget - 3] === "") {
throw new Error("Target can not be empty(line:" + (i + 1) + ").");
}
value = +(d[map.linkValue - 3]);
// FIXED: 用数据的id索引nodes
index[d[map.id]] = i;
lData[i - nodeNum] = {
source: +(index[d[source]]),
target: +(index[d[target]]),
value: +(index[d[lValue]])
};
if (i === nodeNum) {
that.linkValueMin = value;
that.linkValueMax = value;
}
that.linkValueMin = (value < that.linkValueMin) ? value : that.linkValueMin;
that.linkValueMax = (value > that.linkValueMax) ? value : that.linkValueMax;
}
});
this.net.nodes = nData;
this.net.links = lData;
this.nodeValueMax++;
this.linkValueMax++;
};
很久没更新消息了
很久没看到更新了，是否几位老大在酝酿大版本？还是。。。
line 的图形是没有图例吗？
发现在像pie 和 bar 等经典图形中是有图例，而在line.js 中是没有的，pei 和 bar 都有 drawLegend 的方法，而在line.js 没有。是故意设计的吗？
Bubble 增加显示信息及多种数据格式支持
Bubble 需要显示更多的信息 以及 json xml数据源的支持
DataV.Force(): throw the exception "undefined is not a function "
Hi! This is the first time for me to construct a relation graph using Datavjs. I get a exception like "undefined is not a function " when I try to run my webpage with using {
var net = new DataV.Force("chart-relation",{"width": 700, "height": 500});
} to create my object. I have readed the "getting start.md" doc, but I just can't find the "compatible.js" in the master folder. Except that, I have included the all files needed. Now I get the exception related above. If you have any solution for this, please let me konw. Thanks advanced!
柱状图柱宽自动计算
在图的宽度固定的情况下，可以根据数据的个数自动计算柱宽，如图。
Bullet图的demo没有
- demo
- 数据定义
- 注释
- 文档
- 测试代码
@theseue 宁朗看看这个图是谁开发的。补一下以上这些点。
你们：force的新的一点建议
您好：
关于force组件，能否提供点一个node，跟这个node有关的所有关系都显示出来，包括它二级、三级、四级。。。的关联关系？
期待您的回复
package.json文件没有指定模块uglify-js的版本号
package.json 文件中没有指定模块uglify-js的版本号，这个模块的新版本2.x跟1.x的API不一样，运行 node bin/build.js 时如果加了压缩代码的选项会出错。
uglify-js 新版本压缩代码的例子：
var result = UglifyJS.minify("/path/to/file.js");
console.log(result.code); // minified output
// if you need to pass code instead of file name
var result = UglifyJS.minify("var b = function () {};", {fromString: true});河北省的数据看起来有些异常
可视化地图demo
您好，代码中没有找到可视化地图的代码文件。就是类似于map.ipviking的黑客攻击的可视化地图。
地图会重复下载JSON数据
最好存放在一个静态的变量上。不要存在实例上。因为实例可能会重复创建
dataV最新版本以后会开源吗？
RT，开放时间预计是多少呢?还是说会作为一个产品出售
平行坐标轴API文档
帮你写了部分。需要补上剩余的
操作的时候cpu飙升。。。
需要线图
为什么不支持线图
请问为什么数据要用数组形式？为什么不用json？
请问为什么数据要用数组形式？为什么不用json？
很费解为什么选用数组的数据格式，请问可以支持json吗
Martix文档
- 数据定义
- 注释
- 文档
- 测试代码
@theseue 宁朗看看，补一下以上这些点。
**地图澳门没有显示
datavjs/example/chinamap/chinamap_gradient_without_seajs.html
澳门没有显示
添加到 staticfile cdn
Tree图在几次节点的收起和展开后，线条就丢了
data v 中的进度池在打印的时候中间有一条黑线
data-v 链接http://datav.jiaminghi.com/guide/
柳岩离幸福好远
force 图距离计算有bug。
force图示例中的乱码
https://github.com/TBEDP/datavjs/blob/butterfly/example/force/DataExample.csv
查看了下，是csv的乱码导致的。
麻烦@theseue 宁朗fix一下。上传一份utf-8的数据
Flow图问题
- demo
- 数据定义
- 注释
- 文档
- 测试代码
@theseue 宁朗看看这个图是谁开发的。补一下以上这些点。
折线图bug
- 坐标轴的粗细与折线的粗细分开
- hover的竖线位置有错误
Cloud coder
A cload coder working at alibaba.
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.