FilesExpand file tree

 transformchunk

/

test_graphnode.js

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

363 lines (275 loc) · 8.81 KB

 transformchunk

/

test_graphnode.js

Top

File metadata and controls

• Code
• Blame

363 lines (275 loc) · 8.81 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

317

318

319

320

321

322

323

324

325

326

327

328

329

330

331

332

333

334

335

336

337

338

339

340

341

342

343

344

345

346

347

348

349

350

351

352

353

354

355

356

357

358

359

360

361

362

363

module('pc.GraphNode');

function buildGraph() {

var g1 = new pc.GraphNode();

g1.name = 'g1';

var g2 = new pc.GraphNode();

g2.name = 'g2';

var g3 = new pc.GraphNode();

g3.name = 'g3';

g1.addChild(g2);

g2.addChild(g3);

return g1;

}

test('GraphNode: addLabel', function () {

var node = buildGraph();

node.addLabel("new label");

ok(node.hasLabel("new label"));

equal(node.getLabels().length, 1);

equal(node.getLabels()[0], "new label");

});

test('GraphNode: removeLabel', function () {

var node = buildGraph();

node.addLabel("new label");

node.removeLabel("new label");

equal(node.hasLabel("new label"), false);

equal(node.getLabels().length, 0);

});

test('GraphNode: findByLabel', function () {

var node = buildGraph();

var child = node.getChildren()[0];

child.addLabel("new label");

var found = node.findByLabel("new label");

equal(found.length, 1);

equal(found[0].getName(), child.getName());

});

test('GraphNode: findByName same entity', function () {

var node = buildGraph();

var found = node.findByName('g1');

equal(found, node);

});

test('GraphNode: findByName grandchild', function () {

var node = buildGraph();

var child = node.getChildren()[0];

var grandchild = child.getChildren()[0];

var found = node.findByName('g3');

equal(found, grandchild);

});

test('GraphNode: findByName when entity does not exist', function () {

var node = buildGraph();

var found = node.findByName('g4');

equal(found, null);

});

test('GraphNode: findByPath without slashes', function () {

var node = buildGraph();

var child = node.getChildren()[0];

var found = node.findByPath('g2');

equal(found, child);

});

test('GraphNode: findByPath with slashes', function () {

var node = buildGraph();

var child = node.getChildren()[0];

var grandchild = child.getChildren()[0];

var found = node.findByPath('g2/g3');

equal(found, grandchild);

});

test('GraphNode: findByPath does not include same entity', function () {

var node = buildGraph();

var found = node.findByPath('g1/g2/g3');

equal(found, null);

});

test('GraphNode: findByPath when entity does not exist', function () {

var node = buildGraph();

var found = node.findByPath('g4');

equal(found, null);

});

test('GraphNode: getPath', function () {

var node = buildGraph();

var child = node.getChildren()[0];

var grandchild = child.getChildren()[0];

equal(grandchild.getPath(), 'g2/g3');

});

test('GraphNode: getPath of root entity', function () {

var node = buildGraph();

equal(node.getPath(), '');

});

test('GraphNode: addChild', function () {

var g1 = new pc.GraphNode('g1');

var g2 = new pc.GraphNode('g2');

g1.addChild(g2);

equal(g1.getChildren()[0], g2);

});

test('GraphNode: insertChild', function () {

var g1 = new pc.GraphNode('g1');

var g2 = new pc.GraphNode('g2');

var g3 = new pc.GraphNode('g3');

g1.addChild(g2);

g1.insertChild(g3, 0);

equal(g1.getChildren()[0], g3);

equal(g1.getChildren()[1], g2);

});

test('GraphNode: removeChild', function () {

var g1 = new pc.GraphNode('g1');

var g2 = new pc.GraphNode('g2');

g1.addChild(g2);

g1.removeChild(g2);

equal(g1.getChildren().length, 0);

});

test('GraphNode: reparent', function () {

var g1 = new pc.GraphNode('g1');

var g2 = new pc.GraphNode('g2');

var g3 = new pc.GraphNode('g3');

g1.addChild(g2);

g2.reparent(g3);

equal(g3.getChildren().length, 1);

equal(g3.getChildren()[0], g2);

equal(g1.getChildren().length, 0);

});

test('GraphNode: reparent at specific index', function () {

var g1 = new pc.GraphNode('g1');

var g2 = new pc.GraphNode('g2');

var g3 = new pc.GraphNode('g3');

var g4 = new pc.GraphNode('g4');

g1.addChild(g2);

g3.addChild(g4);

g2.reparent(g3, 0);

equal(g3.getChildren().length, 2);

equal(g3.getChildren()[0], g2);

equal(g1.getChildren().length, 0);

g2.reparent(g3, 1);

equal(g3.getChildren().length, 2);

equal(g3.getChildren()[0], g4);

equal(g3.getChildren()[1], g2);

});

test('GraphNode: getChildren', function () {

var g1 = new pc.GraphNode('g1');

var g2 = new pc.GraphNode('g2');

var g3 = new pc.GraphNode('g3');

g1.addChild(g2);

g1.addChild(g3);

equal(g1.getChildren()[0], g2);

equal(g1.getChildren()[1], g3);

});

test('GraphNode: g/setEulerAngles', function () {

var g1 = new pc.GraphNode('g1');

g1.setEulerAngles(1,2,3);

var angles = g1.getEulerAngles();

QUnit.close(angles.x, 1, 0.0001);

QUnit.close(angles.y, 2, 0.0001);

QUnit.close(angles.z, 3, 0.0001);

});

test('GraphNode: rotate', function () {

var g;

var angles;

g = new pc.GraphNode('g1');

g.rotate(10, 0, 0);

angles = g.getEulerAngles();

QUnit.close(angles.x, 10, 0.0001);

QUnit.close(angles.y, 0, 0.0001);

QUnit.close(angles.z, 0, 0.0001);

g = new pc.GraphNode('g1');

g.rotate(0, 10, 0);

angles = g.getEulerAngles();

QUnit.close(angles.x, 0, 0.0001);

QUnit.close(angles.y, 10, 0.0001);

QUnit.close(angles.z, 0, 0.0001);

g = new pc.GraphNode('g1');

g.rotate(0, 0, 10);

angles = g.getEulerAngles();

QUnit.close(angles.x, 0, 0.0001);

QUnit.close(angles.y, 0, 0.0001);

QUnit.close(angles.z, 10, 0.0001);

g = new pc.GraphNode('g1');

g.rotate(10, 20, 30);

angles = g.getEulerAngles();

QUnit.close(angles.x, 10, 0.0001);

QUnit.close(angles.y, 20, 0.0001);

QUnit.close(angles.z, 30, 0.0001);

});

test('GraphNode: rotate in hierarchy', function () {

var p = new pc.GraphNode('g0');

p.setEulerAngles(10,10,10);

var angles;

g = new pc.GraphNode('g1');

p.setEulerAngles(10,0,0);

p.addChild(g);

g.rotate(10, 0, 0);

angles = g.getEulerAngles();

QUnit.close(angles.x, 20, 0.0001);

QUnit.close(angles.y, 0, 0.0001);

QUnit.close(angles.z, 0, 0.0001);

p.removeChild(g);

g = new pc.GraphNode('g1');

p.setEulerAngles(0,10,0);

p.addChild(g);

g.rotate(0, 10, 0);

angles = g.getEulerAngles();

QUnit.close(angles.x, 0, 0.0001);

QUnit.close(angles.y, 20, 0.0001);

QUnit.close(angles.z, 0, 0.0001);

p.removeChild(g);

g = new pc.GraphNode('g1');

p.setEulerAngles(0,0,10);

p.addChild(g);

g.rotate(0, 0, 10);

angles = g.getEulerAngles();

QUnit.close(angles.x, 0, 0.0001);

QUnit.close(angles.y, 0, 0.0001);

QUnit.close(angles.z, 20, 0.0001);

p.removeChild(g);

});

test('GraphNode: rotateLocal', function () {

var g;

var angles;

g = new pc.GraphNode('g1');

g.rotateLocal(10, 0, 0);

angles = g.getLocalEulerAngles();

QUnit.close(angles.x, 10, 0.001);

QUnit.close(angles.y, 0, 0.001);

QUnit.close(angles.z, 0, 0.001);

angles = g.getEulerAngles();

QUnit.close(angles.x, 10, 0.001);

QUnit.close(angles.y, 0, 0.001);

QUnit.close(angles.z, 0, 0.001);

});

test('GraphNode: rotateLocal in hierarchy', function () {

var p = new pc.GraphNode('parent')

var g;

var angles;

p.setEulerAngles(1,2,3);

g = new pc.GraphNode('g1');

p.addChild(g);

g.rotateLocal(10, 0, 0);

angles = g.getLocalEulerAngles();

QUnit.close(angles.x, 10, 0.001);

QUnit.close(angles.y, 0, 0.001);

QUnit.close(angles.z, 0, 0.001);

angles = g.getEulerAngles();

QUnit.close(angles.x, 11, 0.001);

QUnit.close(angles.y, 2, 0.001);

QUnit.close(angles.z, 3, 0.001);

});

test('GraphNode: translate in hierarchy', function () {

var p = new pc.GraphNode('parent')

var g;

var pos;

p.setPosition(10,20,30);

g = new pc.GraphNode('g1');

p.addChild(g);

g.translate(10, 20, 30);

pos = g.getPosition();

QUnit.close(pos.x, 20, 0.001);

QUnit.close(pos.y, 40, 0.001);

QUnit.close(pos.z, 60, 0.001);

pos = g.getLocalPosition();

QUnit.close(pos.x, 10, 0.001);

QUnit.close(pos.y, 20, 0.001);

QUnit.close(pos.z, 30, 0.001);

});

test('GraphNode: translateLocal in hierarchy', function () {

var p = new pc.GraphNode('parent')

var g;

var pos;

p.setPosition(10,20,30);

g = new pc.GraphNode('g1');

p.addChild(g);

g.rotateLocal(0,180,0);

g.translateLocal(10, 20, 30);

pos = g.getPosition();

QUnit.close(pos.x, 0, 0.001);

QUnit.close(pos.y, 40, 0.001);

QUnit.close(pos.z, 0, 0.001);

pos = g.getLocalPosition();

QUnit.close(pos.x, -10, 0.001);

QUnit.close(pos.y, 20, 0.001);

QUnit.close(pos.z, -30, 0.001);

});