s*v
3 楼
面向服务器/cloud computing市场,这个是Intel dominated而且margin奇高的市场,
Intel在 计划用3D进攻Mobile,ARM也在反攻Intel, 好玩。
Intel在 计划用3D进攻Mobile,ARM也在反攻Intel, 好玩。
c*o
5 楼
谢支持~
【在 s********0 的大作中提到】
: http://www.mitbbs.com/article_t/board/31302295.html
【在 s********0 的大作中提到】
: http://www.mitbbs.com/article_t/board/31302295.html
d*a
9 楼
这应该和如何遍历没关系,总之就是遍历所有叶结点才能得到深度。
s*v
10 楼
But the 3D really upsets other ARM fabless.
Anyway, how do you feel about the ARMv8? Is that a make-sense tech to allow
ARM to open a field in Intel's backyard?
I remember Applied Micro uses power pc arch, right? Don't know it filters
with ARM for couple of years.
【在 a***e 的大作中提到】
: 3D has nothing to do with mobile
Anyway, how do you feel about the ARMv8? Is that a make-sense tech to allow
ARM to open a field in Intel's backyard?
I remember Applied Micro uses power pc arch, right? Don't know it filters
with ARM for couple of years.
【在 a***e 的大作中提到】
: 3D has nothing to do with mobile
a*e
12 楼
not much detail leak out.
no idea.
allow
【在 s******v 的大作中提到】
: But the 3D really upsets other ARM fabless.
: Anyway, how do you feel about the ARMv8? Is that a make-sense tech to allow
: ARM to open a field in Intel's backyard?
: I remember Applied Micro uses power pc arch, right? Don't know it filters
: with ARM for couple of years.
no idea.
allow
【在 s******v 的大作中提到】
: But the 3D really upsets other ARM fabless.
: Anyway, how do you feel about the ARMv8? Is that a make-sense tech to allow
: ARM to open a field in Intel's backyard?
: I remember Applied Micro uses power pc arch, right? Don't know it filters
: with ARM for couple of years.
m*g
13 楼
int treeDepthNonRec(treeNode *root)
{
int maxDepth = 0;
if(!root) return 0;
stack > treeNodeStack;
//using traversal
treeNodeStack.push(make_pair(root, root->numChildren));
int depth = 0;
while(!treeNodeStack.empty())
{
pair curNode = treeNodeStack.top();
treeNodeStack.pop();
if(curNode.second)
{
treeNode *curChild = curNode.first->children[curNode.second-1];
{
int maxDepth = 0;
if(!root) return 0;
stack
//using traversal
treeNodeStack.push(make_pair(root, root->numChildren));
int depth = 0;
while(!treeNodeStack.empty())
{
pair
treeNodeStack.pop();
if(curNode.second)
{
treeNode *curChild = curNode.first->children[curNode.second-1];
h*8
15 楼
请教一下 有个地方没看懂
if(curNode.second)
{
treeNode *curChild = curNode.first->children[curNode.second-1];
treeNodeStack.push(make_pair(curNode.first, curNode.second-1));
treeNodeStack.push(make_pair(curChild, curChild->numChildren));
}
else
{
if(!(curNode.first->numChildren)) //leaf node
{
depth = 0;
}
else
这里最后一个else是什么情况?哪些情况才会depth++?
【在 m*****g 的大作中提到】
: int treeDepthNonRec(treeNode *root)
: {
: int maxDepth = 0;
: if(!root) return 0;
: stack > treeNodeStack;
: //using traversal
: treeNodeStack.push(make_pair(root, root->numChildren));
:
: int depth = 0;
: while(!treeNodeStack.empty())
if(curNode.second)
{
treeNode *curChild = curNode.first->children[curNode.second-1];
treeNodeStack.push(make_pair(curNode.first, curNode.second-1));
treeNodeStack.push(make_pair(curChild, curChild->numChildren));
}
else
{
if(!(curNode.first->numChildren)) //leaf node
{
depth = 0;
}
else
这里最后一个else是什么情况?哪些情况才会depth++?
【在 m*****g 的大作中提到】
: int treeDepthNonRec(treeNode *root)
: {
: int maxDepth = 0;
: if(!root) return 0;
: stack
: //using traversal
: treeNodeStack.push(make_pair(root, root->numChildren));
:
: int depth = 0;
: while(!treeNodeStack.empty())
相关阅读
iMac更新请问哪里有thinkcentre desktop的恢复盘? (转载)服务器最厚有几U?有没有高手用电脑+webcam 看家的有没有用roboform的LCD screen antiglare贴膜有人 用过没有?笔记本充电充不进去了Is ips monitor much better than TN monitor?Win7 Tablet上"error initializing inking components"夏普出双屏电子书、手机、网板啦。。Thinkpad x61s 没有xp professional系统恢复盘,怎么恢复成出厂状态remote desktop 不能显示整个桌面。 (转载)求推荐一个3显示器的显卡scientific computing工作站 4核24G Memkindle免费看中文杂志如何网上查询Lenovo笔记本的维修状态?新蛋买的AMD Phenom II X2 555 Black Edition Callisto 3.2G 成功开4核你们说国内做个好点的 ARM CPU 难度大嘛?破解 windows 7 4g 限制想买新机器,请大家给点意见