游戏王残局简化版

Check-in [6bd570d52a]
Login

Check-in [6bd570d52a]

Overview
Comment:精度难知呀
Downloads: Tarball | ZIP archive
Timelines: family | ancestors | descendants | both | trunk
Files: files | file ages | folders
SHA3-256: 6bd570d52a3a716a8bb680bf35671f36dc441f8e9efb78a108f7938749d31fcb
User & Date: 顽雨沉风 on 2024-02-05 10:01:34.113
Other Links: manifest | tags
Context
2024-02-05
11:37
又卡住了 check-in: 91958121fe user: 顽雨沉风 tags: trunk
10:01
精度难知呀 check-in: 6bd570d52a user: 顽雨沉风 tags: trunk
09:10
遇到瓶颈了 check-in: 7a7894a746 user: 顽雨沉风 tags: trunk
Changes
Side-by-Side Diff Ignore Whitespace Patch
Modified 残局文料/lua_lib/常用库.lua from [87f563d14c] to [6ff72213e4].
︙
185
186
187
188
189
190
191







192

185
186
187
188
189
190
191
192
193
194
195
196
197
198
199








+
+
+
+
+
+
+


  return o1 / o2
  end
--~ 左数
--~ 右数
function d.位和(o1, o2)
  return bit.band(o1, o2)
  end
do
  local double_pointer = ffi.new("double[1]")
  local uint64_pointer = ffi.cast("uint64_t*", double_pointer)
  function d.double_to_uint64(o1)
    
    end
  end
return d
Modified 残局文料/残局改名.lua from [c8147571cd] to [689535e77e].
︙
65
66
67
68
69
70
71
72
73
74
75
76






77
78
79
80
81
82
83

65
66
67
68
69
70
71





72
73
74
75
76
77
78
79
80
81
82
83
84








-
-
-
-
-
+
+
+
+
+
+








  for o1_4 in 数据库:nrows("select * from texts where id = " .. o1) do
    return o1_4
    end
  end
--~ 卡编
function d.取卡数据(o1)
  for o1_4 in 数据库:nrows("select * from datas where id = " .. o1) do
    if o1_4.setcode > 0xffffffff then
      ffi = require("ffi")
      print(bit.tohex(o1_4.setcode, 16), o1_4.setcode, o1_4.setcode == 36592129229979791, bit.tohex(bit.rshift(o1_4.setcode, 31)), bit.tohex(bit.band(o1_4.setcode, 0xf)), string.format("%x", 36592129229979791), bit.tohex(math.fmod(36592129229979791, 0xffff + 1)), math.fmod(36592129229979791, 0xffff + 1), ffi.new("uint64_t[1]", 36592129229979791)[0], tostring(36592129229979791) == tostring(o1_4.setcode), math.modf(36592129229979791 / (0xffff + 1)), bit.tohex(bit.band(o1_4.setcode - 4, ffi.new("uint64_t[1]", 0xffff)[0])))
    else
      end
    --~ if o1_4.setcode > 0xffffffff then
      --~ ffi = require("ffi")
      --~ print(bit.tohex(o1_4.setcode, 16), o1_4.setcode, o1_4.setcode == 36592129229979791, bit.tohex(bit.rshift(o1_4.setcode, 31)), bit.tohex(bit.band(o1_4.setcode, 0xf)), string.format("%x", 36592129229979791 - 36592129229979791), bit.tohex(math.fmod(36592129229979791, 0xffff + 1)), math.fmod(36592129229979791, 0xffff + 1), ffi.new("uint64_t[1]", 36592129229979791)[0], tostring(36592129229979791) == tostring(o1_4.setcode), tonumber(tostring(o1_4.setcode)) == 36592129229979791, math.modf(36592129229979791 / (0xffff + 1)), bit.tohex(bit.band(o1_4.setcode - 4, ffi.new("uint64_t[1]", 0xffff)[0])))
      --~ print(string.format("%x", 36592129229979791 - 5))
    --~ else
      --~ end
    return o1_4
    end
  end
--~ 文
function d.局筛卡编(o1)
  local k1_0
  --~ 卡编排
︙
105
106
107
108
109
110
111






112
113
114
115
116
117
118

106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125








+
+
+
+
+
+








--~ 卡对排
function d.荐字段名(o1_0)
  local k1, k2
  local k1_0
  --~ 字段对
  k1_0 = {}
  for o1 = 1, #o1_0 do
    --~ 字段数
    k1 = f.double_to_uint64(o1_0[o1].setcode)
    if k1 > 0xffff then
      k1 = k1 - 1
    else
      end
    --~ for o2 = 1, 11112222 do
    --~ 大字段号
      --~ k1 = f.位和(o1_0[o1].setcode, 0xffff)
      --~ k2 = 
      --~ end
    --~ 大字段号
    --~ k1 = bit.band(o1_0[o1].setcode, 0xffff)
︙