Home
last modified time | relevance | path

Searched refs:ScalarKeySortedTables (Results 1 – 5 of 5) sorted by relevance

/aosp_15_r20/external/flatbuffers/tests/MyGame/Example/
H A DMonster.go59 ScalarKeySortedTables []*StatT `json:"scalar_key_sorted_tables"` member
249 if t.ScalarKeySortedTables != nil {
250 scalarKeySortedTablesLength := len(t.ScalarKeySortedTables)
253 scalarKeySortedTablesOffsets[j] = t.ScalarKeySortedTables[j].Pack(builder)
455 t.ScalarKeySortedTables = make([]*StatT, scalarKeySortedTablesLength)
458 rcv.ScalarKeySortedTables(&x, j)
459 t.ScalarKeySortedTables[j] = x.UnPack()
1332 func (rcv *Monster) ScalarKeySortedTables(obj *Stat, j int) bool { func
H A DMonster.cs210 …public MyGame.Example.Stat? ScalarKeySortedTables(int j) { int o = __p.__offset(104); return o != … in ScalarKeySortedTables() method
618 _o.ScalarKeySortedTables = new List<MyGame.Example.StatT>(); in UnPackTo()
619 …ortedTablesLength; ++_j) {_o.ScalarKeySortedTables.Add(this.ScalarKeySortedTables(_j).HasValue ? t… in UnPackTo()
740 if (_o.ScalarKeySortedTables != null) { in Pack()
741 … var __scalar_key_sorted_tables = new Offset<MyGame.Example.Stat>[_o.ScalarKeySortedTables.Count]; in Pack()
742 …__scalar_key_sorted_tables[_j] = MyGame.Example.Stat.Pack(builder, _o.ScalarKeySortedTables[_j]); } in Pack()
945 public List<MyGame.Example.StatT> ScalarKeySortedTables { get; set; } property in MyGame.Example.MonsterT
1000 this.ScalarKeySortedTables = null; in MonsterT()
H A DMonster.py770 def ScalarKeySortedTables(self, j): member in Monster
1318 if monster.ScalarKeySortedTables(i) is None:
1321 stat_ = MyGame.Example.Stat.StatT.InitFromObj(monster.ScalarKeySortedTables(i))
H A DMonster.lua660 function mt:ScalarKeySortedTables(j) function
/aosp_15_r20/external/flatbuffers/tests/
H A Dmonster_test_generated.py1521 def ScalarKeySortedTables(self, j): member in Monster
1903 if monster.ScalarKeySortedTables(i) is None:
1906 stat_ = StatT.InitFromObj(monster.ScalarKeySortedTables(i))