forked from StrafesNET/strafe-client
Compare commits
105 Commits
Author | SHA1 | Date | |
---|---|---|---|
a67aa71fb0 | |||
7cc0fd59c8 | |||
bded9fccdf | |||
4cd0114567 | |||
991e01d530 | |||
e2bd9ba692 | |||
383df8637f | |||
1a6831cf8b | |||
ccae1a45e1 | |||
1e299b7b9c | |||
f3d4d8dbda | |||
b2a84e3be1 | |||
0468484788 | |||
b9dc97053f | |||
40ed173b60 | |||
fd5a813357 | |||
50726199b9 | |||
0676007430 | |||
97c49c9351 | |||
10689784be | |||
2eff5dda9e | |||
93b04f4f1f | |||
c616e82c47 | |||
d3f84c2dbd | |||
5e45753756 | |||
cfee6f119f | |||
b9e34f53c3 | |||
394f1f1dc2 | |||
05ec7ea5d8 | |||
7996df532e | |||
b4b85b7da4 | |||
3a98eaff7c | |||
4b5b7dc2fb | |||
8a13640c55 | |||
85ba12ff92 | |||
4f492d73b0 | |||
a8d54fdd7c | |||
34ac541260 | |||
099788b746 | |||
305017c6c8 | |||
e47d152af2 | |||
755adeaefd | |||
e04e754abb | |||
5c1f69628d | |||
44031c8b83 | |||
d6470ee81b | |||
a7c7088c1f | |||
dd6acbfc2f | |||
3fea6ec5a2 | |||
38df41e043 | |||
171cd8f2e4 | |||
914b5da897 | |||
52e92bfa5a | |||
938500e39b | |||
d82dfc2bc2 | |||
c59f40892a | |||
4863605af7 | |||
685e74575a | |||
d1aca4519b | |||
4a4ede36ed | |||
33cc2e1a45 | |||
9982a52af5 | |||
34939db8ef | |||
b61088195a | |||
19ab098be0 | |||
bf1fad9fc4 | |||
62b5ba2b33 | |||
f2a7b44884 | |||
c054b6aab3 | |||
7caec210ce | |||
5fdcf9047c | |||
3756af9638 | |||
8424fea634 | |||
46c73b80c6 | |||
0ac1c1aa6b | |||
0a75e78c90 | |||
ecc8d2395b | |||
e2bd8b4038 | |||
4a53040011 | |||
b1d860edf1 | |||
db6e1e43c1 | |||
03970edeb8 | |||
e2da41ec99 | |||
ae4d539ab1 | |||
9de60a8e19 | |||
df8189b874 | |||
b25bcc627d | |||
977069c4eb | |||
63655ef931 | |||
39924db94d | |||
3b3ccefebb | |||
ae6e4ee6aa | |||
746d3eb7ee | |||
7be93d2114 | |||
e7f01eff80 | |||
f58a17adba | |||
3be9730b52 | |||
93eeb3354f | |||
69bab269db | |||
3bad427f61 | |||
90cca51e6e | |||
480cd0e3be | |||
515ca20fb5 | |||
6dff6a2c33 | |||
ae9fc15320 |
2
.cargo/config.toml
Normal file
2
.cargo/config.toml
Normal file
@ -0,0 +1,2 @@
|
|||||||
|
[registries.strafesnet]
|
||||||
|
index = "sparse+https://git.itzana.me/api/packages/strafesnet/cargo/"
|
1
.gitignore
vendored
1
.gitignore
vendored
@ -1,2 +1 @@
|
|||||||
/target
|
/target
|
||||||
/textures
|
|
1625
Cargo.lock
generated
1625
Cargo.lock
generated
File diff suppressed because it is too large
Load Diff
39
Cargo.toml
39
Cargo.toml
@ -1,31 +1,36 @@
|
|||||||
[package]
|
[package]
|
||||||
name = "strafe-client"
|
name = "strafe-client"
|
||||||
version = "0.9.0"
|
version = "0.10.5"
|
||||||
edition = "2021"
|
edition = "2021"
|
||||||
|
repository = "https://git.itzana.me/StrafesNET/strafe-client"
|
||||||
|
license = "Custom"
|
||||||
|
description = "StrafesNET game client for bhop and surf."
|
||||||
|
authors = ["Rhys Lloyd <krakow20@gmail.com>"]
|
||||||
|
|
||||||
# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
|
# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
|
||||||
|
[features]
|
||||||
|
default = ["snf"]
|
||||||
|
snf = ["dep:strafesnet_snf"]
|
||||||
|
source = ["dep:strafesnet_deferred_loader", "dep:strafesnet_bsp_loader"]
|
||||||
|
roblox = ["dep:strafesnet_deferred_loader", "dep:strafesnet_rbx_loader"]
|
||||||
|
|
||||||
[dependencies]
|
[dependencies]
|
||||||
bytemuck = { version = "1.13.1", features = ["derive"] }
|
bytemuck = { version = "1.13.1", features = ["derive"] }
|
||||||
color-print = "0.3.5"
|
|
||||||
configparser = "3.0.2"
|
configparser = "3.0.2"
|
||||||
ddsfile = "0.5.1"
|
ddsfile = "0.5.1"
|
||||||
glam = "0.24.1"
|
glam = "0.29.0"
|
||||||
lazy-regex = "3.0.2"
|
id = { version = "0.1.0", registry = "strafesnet" }
|
||||||
mlua = { version = "0.9.4", features = ["luau-jit"] }
|
|
||||||
obj = "0.10.2"
|
|
||||||
parking_lot = "0.12.1"
|
parking_lot = "0.12.1"
|
||||||
pollster = "0.3.0"
|
pollster = "0.3.0"
|
||||||
rbx_binary = "0.7.1"
|
strafesnet_bsp_loader = { version = "0.2.1", registry = "strafesnet", optional = true }
|
||||||
rbx_dom_weak = "2.5.0"
|
strafesnet_common = { version = "0.5.2", registry = "strafesnet" }
|
||||||
rbx_reflection_database = "0.2.7"
|
strafesnet_deferred_loader = { version = "0.4.0", features = ["legacy"], registry = "strafesnet", optional = true }
|
||||||
rbx_xml = "0.13.1"
|
strafesnet_rbx_loader = { version = "0.5.1", registry = "strafesnet", optional = true }
|
||||||
vbsp = "0.5.0"
|
strafesnet_snf = { version = "0.2.0", registry = "strafesnet", optional = true }
|
||||||
vmdl = "0.1.1"
|
wgpu = "22.1.0"
|
||||||
wgpu = "0.19.0"
|
winit = "0.30.5"
|
||||||
winit = { version = "0.29.2" }
|
|
||||||
|
|
||||||
#[profile.release]
|
[profile.release]
|
||||||
#lto = true
|
#lto = true
|
||||||
#strip = true
|
strip = true
|
||||||
#codegen-units = 1
|
codegen-units = 1
|
||||||
|
2
LICENSE
2
LICENSE
@ -1,5 +1,5 @@
|
|||||||
/*******************************************************
|
/*******************************************************
|
||||||
* Copyright (C) 2023 Rhys Lloyd <krakow20@gmail.com>
|
* Copyright (C) 2023-2024 Rhys Lloyd <krakow20@gmail.com>
|
||||||
*
|
*
|
||||||
* This file is part of the StrafesNET bhop/surf client.
|
* This file is part of the StrafesNET bhop/surf client.
|
||||||
*
|
*
|
||||||
|
@ -1,52 +0,0 @@
|
|||||||
type workspace = {[string]: {number}}
|
|
||||||
type Service = {}
|
|
||||||
|
|
||||||
export type exports = {[string]: {workspace | number | {}}}
|
|
||||||
|
|
||||||
local workspace: workspace = {}
|
|
||||||
local RS = {
|
|
||||||
RenderStepped = {},
|
|
||||||
Stepped = {},
|
|
||||||
Heartbeat = {}
|
|
||||||
}
|
|
||||||
local game = setmetatable({
|
|
||||||
Workspace = workspace,
|
|
||||||
Players = {},
|
|
||||||
RunService = RS
|
|
||||||
}, {
|
|
||||||
__index = function(self,i)
|
|
||||||
return rawget(self,i)
|
|
||||||
end,
|
|
||||||
__newindex = function(self,i,_)
|
|
||||||
--Roblox actually does this
|
|
||||||
local t = type(i)
|
|
||||||
return t == "Object" and "Unable to assign property Game. Property is read only" or `Unable to assign property Game. Object expected, got {t}`
|
|
||||||
end,
|
|
||||||
__metatable = "This metatable is locked."
|
|
||||||
})
|
|
||||||
|
|
||||||
function game:GetService(service: string): Service
|
|
||||||
return self[service]
|
|
||||||
end
|
|
||||||
function game:service(service: string): Service
|
|
||||||
return self:GetService(service)
|
|
||||||
end
|
|
||||||
function game:FindService(service: string): boolean | Service
|
|
||||||
return self[service] and self[service]
|
|
||||||
end
|
|
||||||
|
|
||||||
local tick = os.clock() --just be better (Roblox wants you to use this instead of "tick" anyways because of Wine)
|
|
||||||
local task = {
|
|
||||||
wait = {},
|
|
||||||
delay = {},
|
|
||||||
defer = {}
|
|
||||||
}
|
|
||||||
|
|
||||||
local exports: exports = {
|
|
||||||
game = game, Game = game,
|
|
||||||
workspace = workspace, Workspace = workspace,
|
|
||||||
tick = tick,
|
|
||||||
task = task
|
|
||||||
}
|
|
||||||
|
|
||||||
return exports
|
|
@ -1,20 +0,0 @@
|
|||||||
local vec2 = Vector.new(1,2)
|
|
||||||
local vec3 = Vector.new(1,2,3)
|
|
||||||
local vec4 = Vector.new(1,2,3,4)
|
|
||||||
|
|
||||||
local function InspectVectorTable(Vector: {[string]: number})
|
|
||||||
local aye: {string} = {"{"}
|
|
||||||
for k,v in Vector do
|
|
||||||
table.insert(aye, `{tostring(k)}={tostring(v)}`)
|
|
||||||
end
|
|
||||||
table.insert(aye, "}")
|
|
||||||
return table.concat(aye, " ")
|
|
||||||
end
|
|
||||||
|
|
||||||
print("----StrafeLua----")
|
|
||||||
warn(_VERSION)
|
|
||||||
print(`Vector.new = {InspectVectorTable(Vector.new())}`)
|
|
||||||
print(`vec2 = {InspectVectorTable(vec2)}`)
|
|
||||||
print(`vec3 = {InspectVectorTable(vec3)}`)
|
|
||||||
print(`vec4 = {InspectVectorTable(vec4)}`)
|
|
||||||
print("-----------------")
|
|
@ -1,48 +0,0 @@
|
|||||||
--A type map for the luau analyzer
|
|
||||||
type f32 = number
|
|
||||||
|
|
||||||
type struct_Vector2 = {x: f32, y: f32}
|
|
||||||
type struct_Vector3 = struct_Vector2 & {z: f32}
|
|
||||||
type struct_Vector4 = struct_Vector3 & {w: f32}
|
|
||||||
|
|
||||||
export type warn = (message: string) -> ()
|
|
||||||
|
|
||||||
export type Vector2 = {
|
|
||||||
new: (x: f32?, y: f32?) -> struct_Vector2,
|
|
||||||
ONE: struct_Vector2,
|
|
||||||
ZERO: struct_Vector2,
|
|
||||||
NEG_ZERO: struct_Vector2,
|
|
||||||
NEG_ONE: struct_Vector2,
|
|
||||||
NEG_X: struct_Vector2,
|
|
||||||
NEG_Y: struct_Vector2,
|
|
||||||
}
|
|
||||||
export type Vector3 = {
|
|
||||||
new: (x: f32?, y: f32?, z: f32?) -> struct_Vector3,
|
|
||||||
ONE: struct_Vector3,
|
|
||||||
ZERO: struct_Vector3,
|
|
||||||
NEG_ZERO: struct_Vector3,
|
|
||||||
NEG_ONE: struct_Vector3,
|
|
||||||
NEG_X: struct_Vector3,
|
|
||||||
NEG_Y: struct_Vector3,
|
|
||||||
}
|
|
||||||
export type Vector4 = {
|
|
||||||
new: (x: f32?, y: f32?, z: f32?, w: f32?) -> struct_Vector4,
|
|
||||||
ONE: struct_Vector4,
|
|
||||||
ZERO: struct_Vector4,
|
|
||||||
NEG_ZERO: struct_Vector4,
|
|
||||||
NEG_ONE: struct_Vector4,
|
|
||||||
NEG_X: struct_Vector4,
|
|
||||||
NEG_Y: struct_Vector4,
|
|
||||||
}
|
|
||||||
|
|
||||||
local Vector2: Vector2 = Vector2
|
|
||||||
local Vector3: Vector3 = Vector3
|
|
||||||
local Vector4: Vector4 = Vector4
|
|
||||||
local warn: warn = warn
|
|
||||||
|
|
||||||
return {
|
|
||||||
Vector2 = Vector2,
|
|
||||||
Vector3 = Vector3,
|
|
||||||
Vector4 = Vector4,
|
|
||||||
warn = warn
|
|
||||||
}
|
|
46
src/aabb.rs
46
src/aabb.rs
@ -1,46 +0,0 @@
|
|||||||
use crate::integer::Planar64Vec3;
|
|
||||||
|
|
||||||
#[derive(Clone)]
|
|
||||||
pub struct Aabb{
|
|
||||||
min:Planar64Vec3,
|
|
||||||
max:Planar64Vec3,
|
|
||||||
}
|
|
||||||
|
|
||||||
impl Default for Aabb {
|
|
||||||
fn default()->Self {
|
|
||||||
Self{min:Planar64Vec3::MAX,max:Planar64Vec3::MIN}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
impl Aabb{
|
|
||||||
pub fn grow(&mut self,point:Planar64Vec3){
|
|
||||||
self.min=self.min.min(point);
|
|
||||||
self.max=self.max.max(point);
|
|
||||||
}
|
|
||||||
pub fn join(&mut self,aabb:&Aabb){
|
|
||||||
self.min=self.min.min(aabb.min);
|
|
||||||
self.max=self.max.max(aabb.max);
|
|
||||||
}
|
|
||||||
pub fn inflate(&mut self,hs:Planar64Vec3){
|
|
||||||
self.min-=hs;
|
|
||||||
self.max+=hs;
|
|
||||||
}
|
|
||||||
pub fn intersects(&self,aabb:&Aabb)->bool{
|
|
||||||
(self.min.cmplt(aabb.max)&aabb.min.cmplt(self.max)).all()
|
|
||||||
}
|
|
||||||
pub fn size(&self)->Planar64Vec3{
|
|
||||||
self.max-self.min
|
|
||||||
}
|
|
||||||
pub fn center(&self)->Planar64Vec3{
|
|
||||||
self.min.midpoint(self.max)
|
|
||||||
}
|
|
||||||
//probably use floats for area & volume because we don't care about precision
|
|
||||||
// pub fn area_weight(&self)->f32{
|
|
||||||
// let d=self.max-self.min;
|
|
||||||
// d.x*d.y+d.y*d.z+d.z*d.x
|
|
||||||
// }
|
|
||||||
// pub fn volume(&self)->f32{
|
|
||||||
// let d=self.max-self.min;
|
|
||||||
// d.x*d.y*d.z
|
|
||||||
// }
|
|
||||||
}
|
|
123
src/bvh.rs
123
src/bvh.rs
@ -1,123 +0,0 @@
|
|||||||
use crate::aabb::Aabb;
|
|
||||||
|
|
||||||
//da algaritum
|
|
||||||
//lista boxens
|
|
||||||
//sort by {minx,maxx,miny,maxy,minz,maxz} (6 lists)
|
|
||||||
//find the sets that minimizes the sum of surface areas
|
|
||||||
//splitting is done when the minimum split sum of surface areas is larger than the node's own surface area
|
|
||||||
|
|
||||||
//start with bisection into octrees because a bad bvh is still 1000x better than no bvh
|
|
||||||
//sort the centerpoints on each axis (3 lists)
|
|
||||||
//bv is put into octant based on whether it is upper or lower in each list
|
|
||||||
enum BvhNodeContent{
|
|
||||||
Branch(Vec<BvhNode>),
|
|
||||||
Leaf(usize),
|
|
||||||
}
|
|
||||||
impl Default for BvhNodeContent{
|
|
||||||
fn default()->Self{
|
|
||||||
Self::Branch(Vec::new())
|
|
||||||
}
|
|
||||||
}
|
|
||||||
#[derive(Default)]
|
|
||||||
pub struct BvhNode{
|
|
||||||
content:BvhNodeContent,
|
|
||||||
aabb:Aabb,
|
|
||||||
}
|
|
||||||
|
|
||||||
impl BvhNode{
|
|
||||||
pub fn the_tester<F:FnMut(usize)>(&self,aabb:&Aabb,f:&mut F){
|
|
||||||
match &self.content{
|
|
||||||
&BvhNodeContent::Leaf(model)=>f(model),
|
|
||||||
BvhNodeContent::Branch(children)=>for child in children{
|
|
||||||
//this test could be moved outside the match statement
|
|
||||||
//but that would test the root node aabb
|
|
||||||
//you're probably not going to spend a lot of time outside the map,
|
|
||||||
//so the test is extra work for nothing
|
|
||||||
if aabb.intersects(&child.aabb){
|
|
||||||
child.the_tester(aabb,f);
|
|
||||||
}
|
|
||||||
},
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn generate_bvh(boxen:Vec<Aabb>)->BvhNode{
|
|
||||||
generate_bvh_node(boxen.into_iter().enumerate().collect())
|
|
||||||
}
|
|
||||||
|
|
||||||
fn generate_bvh_node(boxen:Vec<(usize,Aabb)>)->BvhNode{
|
|
||||||
let n=boxen.len();
|
|
||||||
if n<20{
|
|
||||||
let mut aabb=Aabb::default();
|
|
||||||
let nodes=boxen.into_iter().map(|b|{
|
|
||||||
aabb.join(&b.1);
|
|
||||||
BvhNode{
|
|
||||||
content:BvhNodeContent::Leaf(b.0),
|
|
||||||
aabb:b.1,
|
|
||||||
}
|
|
||||||
}).collect();
|
|
||||||
BvhNode{
|
|
||||||
content:BvhNodeContent::Branch(nodes),
|
|
||||||
aabb,
|
|
||||||
}
|
|
||||||
}else{
|
|
||||||
let mut octant=std::collections::HashMap::with_capacity(n);//this ids which octant the boxen is put in
|
|
||||||
let mut sort_x=Vec::with_capacity(n);
|
|
||||||
let mut sort_y=Vec::with_capacity(n);
|
|
||||||
let mut sort_z=Vec::with_capacity(n);
|
|
||||||
for (i,aabb) in boxen.iter(){
|
|
||||||
let center=aabb.center();
|
|
||||||
octant.insert(*i,0);
|
|
||||||
sort_x.push((*i,center.x()));
|
|
||||||
sort_y.push((*i,center.y()));
|
|
||||||
sort_z.push((*i,center.z()));
|
|
||||||
}
|
|
||||||
sort_x.sort_by(|tup0,tup1|tup0.1.cmp(&tup1.1));
|
|
||||||
sort_y.sort_by(|tup0,tup1|tup0.1.cmp(&tup1.1));
|
|
||||||
sort_z.sort_by(|tup0,tup1|tup0.1.cmp(&tup1.1));
|
|
||||||
let h=n/2;
|
|
||||||
let median_x=sort_x[h].1;
|
|
||||||
let median_y=sort_y[h].1;
|
|
||||||
let median_z=sort_z[h].1;
|
|
||||||
for (i,c) in sort_x{
|
|
||||||
if median_x<c{
|
|
||||||
octant.insert(i,octant[&i]+1<<0);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
for (i,c) in sort_y{
|
|
||||||
if median_y<c{
|
|
||||||
octant.insert(i,octant[&i]+1<<1);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
for (i,c) in sort_z{
|
|
||||||
if median_z<c{
|
|
||||||
octant.insert(i,octant[&i]+1<<2);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
//generate lists for unique octant values
|
|
||||||
let mut list_list=Vec::with_capacity(8);
|
|
||||||
let mut octant_list=Vec::with_capacity(8);
|
|
||||||
for (i,aabb) in boxen.into_iter(){
|
|
||||||
let octant_id=octant[&i];
|
|
||||||
let list_id=if let Some(list_id)=octant_list.iter().position(|&id|id==octant_id){
|
|
||||||
list_id
|
|
||||||
}else{
|
|
||||||
let list_id=list_list.len();
|
|
||||||
octant_list.push(octant_id);
|
|
||||||
list_list.push(Vec::new());
|
|
||||||
list_id
|
|
||||||
};
|
|
||||||
list_list[list_id].push((i,aabb));
|
|
||||||
}
|
|
||||||
let mut aabb=Aabb::default();
|
|
||||||
let children=list_list.into_iter().map(|b|{
|
|
||||||
let node=generate_bvh_node(b);
|
|
||||||
aabb.join(&node.aabb);
|
|
||||||
node
|
|
||||||
}).collect();
|
|
||||||
BvhNode{
|
|
||||||
content:BvhNodeContent::Branch(children),
|
|
||||||
aabb,
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
@ -1,32 +1,33 @@
|
|||||||
use crate::physics::Body;
|
use crate::physics::Body;
|
||||||
use crate::model_physics::{FEV,MeshQuery,DirectedEdge};
|
use crate::model_physics::{GigaTime,FEV,MeshQuery,DirectedEdge,MinkowskiMesh,MinkowskiFace,MinkowskiDirectedEdge,MinkowskiVert};
|
||||||
use crate::integer::{Time,Planar64};
|
use strafesnet_common::integer::{Time,Fixed,Ratio};
|
||||||
use crate::zeroes::zeroes2;
|
|
||||||
|
|
||||||
|
#[derive(Debug)]
|
||||||
enum Transition<F,E:DirectedEdge,V>{
|
enum Transition<F,E:DirectedEdge,V>{
|
||||||
Miss,
|
Miss,
|
||||||
Next(FEV<F,E,V>,Time),
|
Next(FEV<F,E,V>,GigaTime),
|
||||||
Hit(F,Time),
|
Hit(F,GigaTime),
|
||||||
}
|
}
|
||||||
|
|
||||||
fn next_transition<F:Copy,E:Copy+DirectedEdge,V:Copy>(fev:&FEV<F,E,V>,time:Time,mesh:&impl MeshQuery<F,E,V>,body:&Body,time_limit:Time)->Transition<F,E,V>{
|
type MinkowskiFEV=FEV<MinkowskiFace,MinkowskiDirectedEdge,MinkowskiVert>;
|
||||||
|
type MinkowskiTransition=Transition<MinkowskiFace,MinkowskiDirectedEdge,MinkowskiVert>;
|
||||||
|
|
||||||
|
fn next_transition(fev:&MinkowskiFEV,body_time:GigaTime,mesh:&MinkowskiMesh,body:&Body,mut best_time:GigaTime)->MinkowskiTransition{
|
||||||
//conflicting derivative means it crosses in the wrong direction.
|
//conflicting derivative means it crosses in the wrong direction.
|
||||||
//if the transition time is equal to an already tested transition, do not replace the current best.
|
//if the transition time is equal to an already tested transition, do not replace the current best.
|
||||||
let mut best_time=time_limit;
|
let mut best_transition=MinkowskiTransition::Miss;
|
||||||
let mut best_transtition=Transition::Miss;
|
|
||||||
match fev{
|
match fev{
|
||||||
&FEV::<F,E,V>::Face(face_id)=>{
|
&MinkowskiFEV::Face(face_id)=>{
|
||||||
//test own face collision time, ignoring roots with zero or conflicting derivative
|
//test own face collision time, ignoring roots with zero or conflicting derivative
|
||||||
//n=face.normal d=face.dot
|
//n=face.normal d=face.dot
|
||||||
//n.a t^2+n.v t+n.p-d==0
|
//n.a t^2+n.v t+n.p-d==0
|
||||||
let (n,d)=mesh.face_nd(face_id);
|
let (n,d)=mesh.face_nd(face_id);
|
||||||
//TODO: use higher precision d value?
|
//TODO: use higher precision d value?
|
||||||
//use the mesh transform translation instead of baking it into the d value.
|
//use the mesh transform translation instead of baking it into the d value.
|
||||||
for t in zeroes2((n.dot(body.position)-d)*2,n.dot(body.velocity)*2,n.dot(body.acceleration)){
|
for dt in Fixed::<4,128>::zeroes2((n.dot(body.position)-d)*2,n.dot(body.velocity)*2,n.dot(body.acceleration)){
|
||||||
let t=body.time+Time::from(t);
|
if body_time.le_ratio(dt)&&dt.lt_ratio(best_time)&&n.dot(body.extrapolated_velocity_ratio_dt(dt)).is_negative(){
|
||||||
if time<=t&&t<best_time&&n.dot(body.extrapolated_velocity(t))<Planar64::ZERO{
|
best_time=dt;
|
||||||
best_time=t;
|
best_transition=MinkowskiTransition::Hit(face_id,dt);
|
||||||
best_transtition=Transition::Hit(face_id,t);
|
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@ -36,18 +37,18 @@ enum Transition<F,E:DirectedEdge,V>{
|
|||||||
let n=n.cross(edge_n);
|
let n=n.cross(edge_n);
|
||||||
let verts=mesh.edge_verts(directed_edge_id.as_undirected());
|
let verts=mesh.edge_verts(directed_edge_id.as_undirected());
|
||||||
//WARNING: d is moved out of the *2 block because of adding two vertices!
|
//WARNING: d is moved out of the *2 block because of adding two vertices!
|
||||||
for t in zeroes2(n.dot(body.position*2-(mesh.vert(verts[0])+mesh.vert(verts[1]))),n.dot(body.velocity)*2,n.dot(body.acceleration)){
|
//WARNING: precision is swept under the rug!
|
||||||
let t=body.time+Time::from(t);
|
for dt in Fixed::<4,128>::zeroes2(n.dot(body.position*2-(mesh.vert(verts[0])+mesh.vert(verts[1]))).fix_4(),n.dot(body.velocity).fix_4()*2,n.dot(body.acceleration).fix_4()){
|
||||||
if time<=t&&t<best_time&&n.dot(body.extrapolated_velocity(t))<Planar64::ZERO{
|
if body_time.le_ratio(dt)&&dt.lt_ratio(best_time)&&n.dot(body.extrapolated_velocity_ratio_dt(dt)).is_negative(){
|
||||||
best_time=t;
|
best_time=dt;
|
||||||
best_transtition=Transition::Next(FEV::<F,E,V>::Edge(directed_edge_id.as_undirected()),t);
|
best_transition=MinkowskiTransition::Next(MinkowskiFEV::Edge(directed_edge_id.as_undirected()),dt);
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
//if none:
|
//if none:
|
||||||
},
|
},
|
||||||
&FEV::<F,E,V>::Edge(edge_id)=>{
|
&MinkowskiFEV::Edge(edge_id)=>{
|
||||||
//test each face collision time, ignoring roots with zero or conflicting derivative
|
//test each face collision time, ignoring roots with zero or conflicting derivative
|
||||||
let edge_n=mesh.edge_n(edge_id);
|
let edge_n=mesh.edge_n(edge_id);
|
||||||
let edge_verts=mesh.edge_verts(edge_id);
|
let edge_verts=mesh.edge_verts(edge_id);
|
||||||
@ -57,11 +58,10 @@ enum Transition<F,E:DirectedEdge,V>{
|
|||||||
//edge_n gets parity from the order of edge_faces
|
//edge_n gets parity from the order of edge_faces
|
||||||
let n=face_n.cross(edge_n)*((i as i64)*2-1);
|
let n=face_n.cross(edge_n)*((i as i64)*2-1);
|
||||||
//WARNING yada yada d *2
|
//WARNING yada yada d *2
|
||||||
for t in zeroes2(n.dot(delta_pos),n.dot(body.velocity)*2,n.dot(body.acceleration)){
|
for dt in Fixed::<4,128>::zeroes2(n.dot(delta_pos).fix_4(),n.dot(body.velocity).fix_4()*2,n.dot(body.acceleration).fix_4()){
|
||||||
let t=body.time+Time::from(t);
|
if body_time.le_ratio(dt)&&dt.lt_ratio(best_time)&&n.dot(body.extrapolated_velocity_ratio_dt(dt)).is_negative(){
|
||||||
if time<=t&&t<best_time&&n.dot(body.extrapolated_velocity(t))<Planar64::ZERO{
|
best_time=dt;
|
||||||
best_time=t;
|
best_transition=MinkowskiTransition::Next(MinkowskiFEV::Face(edge_face_id),dt);
|
||||||
best_transtition=Transition::Next(FEV::<F,E,V>::Face(edge_face_id),t);
|
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@ -70,27 +70,27 @@ enum Transition<F,E:DirectedEdge,V>{
|
|||||||
for (i,&vert_id) in edge_verts.iter().enumerate(){
|
for (i,&vert_id) in edge_verts.iter().enumerate(){
|
||||||
//vertex normal gets parity from vert index
|
//vertex normal gets parity from vert index
|
||||||
let n=edge_n*(1-2*(i as i64));
|
let n=edge_n*(1-2*(i as i64));
|
||||||
for t in zeroes2((n.dot(body.position-mesh.vert(vert_id)))*2,n.dot(body.velocity)*2,n.dot(body.acceleration)){
|
for dt in Fixed::<2,64>::zeroes2((n.dot(body.position-mesh.vert(vert_id)))*2,n.dot(body.velocity)*2,n.dot(body.acceleration)){
|
||||||
let t=body.time+Time::from(t);
|
if body_time.le_ratio(dt)&&dt.lt_ratio(best_time)&&n.dot(body.extrapolated_velocity_ratio_dt(dt)).is_negative(){
|
||||||
if time<=t&&t<best_time&&n.dot(body.extrapolated_velocity(t))<Planar64::ZERO{
|
let dt=Ratio::new(dt.num.fix_4(),dt.den.fix_4());
|
||||||
best_time=t;
|
best_time=dt;
|
||||||
best_transtition=Transition::Next(FEV::<F,E,V>::Vert(vert_id),t);
|
best_transition=MinkowskiTransition::Next(MinkowskiFEV::Vert(vert_id),dt);
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
//if none:
|
//if none:
|
||||||
},
|
},
|
||||||
&FEV::<F,E,V>::Vert(vert_id)=>{
|
&MinkowskiFEV::Vert(vert_id)=>{
|
||||||
//test each edge collision time, ignoring roots with zero or conflicting derivative
|
//test each edge collision time, ignoring roots with zero or conflicting derivative
|
||||||
for &directed_edge_id in mesh.vert_edges(vert_id).iter(){
|
for &directed_edge_id in mesh.vert_edges(vert_id).iter(){
|
||||||
//edge is directed away from vertex, but we want the dot product to turn out negative
|
//edge is directed away from vertex, but we want the dot product to turn out negative
|
||||||
let n=-mesh.directed_edge_n(directed_edge_id);
|
let n=-mesh.directed_edge_n(directed_edge_id);
|
||||||
for t in zeroes2((n.dot(body.position-mesh.vert(vert_id)))*2,n.dot(body.velocity)*2,n.dot(body.acceleration)){
|
for dt in Fixed::<2,64>::zeroes2((n.dot(body.position-mesh.vert(vert_id)))*2,n.dot(body.velocity)*2,n.dot(body.acceleration)){
|
||||||
let t=body.time+Time::from(t);
|
if body_time.le_ratio(dt)&&dt.lt_ratio(best_time)&&n.dot(body.extrapolated_velocity_ratio_dt(dt)).is_negative(){
|
||||||
if time<=t&&t<best_time&&n.dot(body.extrapolated_velocity(t))<Planar64::ZERO{
|
let dt=Ratio::new(dt.num.fix_4(),dt.den.fix_4());
|
||||||
best_time=t;
|
best_time=dt;
|
||||||
best_transtition=Transition::Next(FEV::<F,E,V>::Edge(directed_edge_id.as_undirected()),t);
|
best_transition=MinkowskiTransition::Next(MinkowskiFEV::Edge(directed_edge_id.as_undirected()),dt);
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@ -98,22 +98,30 @@ enum Transition<F,E:DirectedEdge,V>{
|
|||||||
//if none:
|
//if none:
|
||||||
},
|
},
|
||||||
}
|
}
|
||||||
best_transtition
|
best_transition
|
||||||
}
|
}
|
||||||
pub enum CrawlResult<F,E:DirectedEdge,V>{
|
pub enum CrawlResult<F,E:DirectedEdge,V>{
|
||||||
Miss(FEV<F,E,V>),
|
Miss(FEV<F,E,V>),
|
||||||
Hit(F,Time),
|
Hit(F,GigaTime),
|
||||||
}
|
}
|
||||||
pub fn crawl_fev<F:Copy,E:Copy+DirectedEdge,V:Copy>(mut fev:FEV<F,E,V>,mesh:&impl MeshQuery<F,E,V>,relative_body:&Body,start_time:Time,time_limit:Time)->CrawlResult<F,E,V>{
|
type MinkowskiCrawlResult=CrawlResult<MinkowskiFace,MinkowskiDirectedEdge,MinkowskiVert>;
|
||||||
let mut time=start_time;
|
pub fn crawl_fev(mut fev:MinkowskiFEV,mesh:&MinkowskiMesh,relative_body:&Body,start_time:Time,time_limit:Time)->MinkowskiCrawlResult{
|
||||||
|
let mut body_time={
|
||||||
|
let r=(start_time-relative_body.time).to_ratio();
|
||||||
|
Ratio::new(r.num.fix_4(),r.den.fix_4())
|
||||||
|
};
|
||||||
|
let time_limit={
|
||||||
|
let r=(time_limit-relative_body.time).to_ratio();
|
||||||
|
Ratio::new(r.num.fix_4(),r.den.fix_4())
|
||||||
|
};
|
||||||
for _ in 0..20{
|
for _ in 0..20{
|
||||||
match next_transition(&fev,time,mesh,relative_body,time_limit){
|
match next_transition(&fev,body_time,mesh,relative_body,time_limit){
|
||||||
Transition::Miss=>return CrawlResult::Miss(fev),
|
Transition::Miss=>return CrawlResult::Miss(fev),
|
||||||
Transition::Next(next_fev,next_time)=>(fev,time)=(next_fev,next_time),
|
Transition::Next(next_fev,next_time)=>(fev,body_time)=(next_fev,next_time),
|
||||||
Transition::Hit(face,time)=>return CrawlResult::Hit(face,time),
|
Transition::Hit(face,time)=>return CrawlResult::Hit(face,time),
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
//TODO: fix all bugs
|
//TODO: fix all bugs
|
||||||
println!("Too many iterations! Using default behaviour instead of crashing...");
|
//println!("Too many iterations! Using default behaviour instead of crashing...");
|
||||||
CrawlResult::Miss(fev)
|
CrawlResult::Miss(fev)
|
||||||
}
|
}
|
||||||
|
144
src/file.rs
Normal file
144
src/file.rs
Normal file
@ -0,0 +1,144 @@
|
|||||||
|
use std::io::Read;
|
||||||
|
|
||||||
|
#[derive(Debug)]
|
||||||
|
pub enum ReadError{
|
||||||
|
#[cfg(feature="roblox")]
|
||||||
|
Roblox(strafesnet_rbx_loader::ReadError),
|
||||||
|
#[cfg(feature="source")]
|
||||||
|
Source(strafesnet_bsp_loader::ReadError),
|
||||||
|
#[cfg(feature="snf")]
|
||||||
|
StrafesNET(strafesnet_snf::Error),
|
||||||
|
#[cfg(feature="snf")]
|
||||||
|
StrafesNETMap(strafesnet_snf::map::Error),
|
||||||
|
Io(std::io::Error),
|
||||||
|
UnknownFileFormat,
|
||||||
|
}
|
||||||
|
impl std::fmt::Display for ReadError{
|
||||||
|
fn fmt(&self,f:&mut std::fmt::Formatter<'_>)->std::fmt::Result{
|
||||||
|
write!(f,"{self:?}")
|
||||||
|
}
|
||||||
|
}
|
||||||
|
impl std::error::Error for ReadError{}
|
||||||
|
|
||||||
|
pub enum DataStructure{
|
||||||
|
#[cfg(feature="roblox")]
|
||||||
|
Roblox(strafesnet_rbx_loader::Model),
|
||||||
|
#[cfg(feature="source")]
|
||||||
|
Source(strafesnet_bsp_loader::Bsp),
|
||||||
|
#[cfg(feature="snf")]
|
||||||
|
StrafesNET(strafesnet_common::map::CompleteMap),
|
||||||
|
}
|
||||||
|
|
||||||
|
pub fn read<R:Read+std::io::Seek>(input:R)->Result<DataStructure,ReadError>{
|
||||||
|
let mut buf=std::io::BufReader::new(input);
|
||||||
|
let peek=std::io::BufRead::fill_buf(&mut buf).map_err(ReadError::Io)?;
|
||||||
|
match &peek[0..4]{
|
||||||
|
#[cfg(feature="roblox")]
|
||||||
|
b"<rob"=>Ok(DataStructure::Roblox(strafesnet_rbx_loader::read(buf).map_err(ReadError::Roblox)?)),
|
||||||
|
#[cfg(feature="source")]
|
||||||
|
b"VBSP"=>Ok(DataStructure::Source(strafesnet_bsp_loader::read(buf).map_err(ReadError::Source)?)),
|
||||||
|
#[cfg(feature="snf")]
|
||||||
|
b"SNFM"=>Ok(DataStructure::StrafesNET(
|
||||||
|
strafesnet_snf::read_map(buf).map_err(ReadError::StrafesNET)?
|
||||||
|
.into_complete_map().map_err(ReadError::StrafesNETMap)?
|
||||||
|
)),
|
||||||
|
_=>Err(ReadError::UnknownFileFormat),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
#[derive(Debug)]
|
||||||
|
pub enum LoadError{
|
||||||
|
ReadError(ReadError),
|
||||||
|
File(std::io::Error),
|
||||||
|
Io(std::io::Error),
|
||||||
|
}
|
||||||
|
impl std::fmt::Display for LoadError{
|
||||||
|
fn fmt(&self,f:&mut std::fmt::Formatter<'_>)->std::fmt::Result{
|
||||||
|
write!(f,"{self:?}")
|
||||||
|
}
|
||||||
|
}
|
||||||
|
impl std::error::Error for LoadError{}
|
||||||
|
|
||||||
|
pub fn load<P:AsRef<std::path::Path>>(path:P)->Result<strafesnet_common::map::CompleteMap,LoadError>{
|
||||||
|
//blocking because it's simpler...
|
||||||
|
let file=std::fs::File::open(path).map_err(LoadError::File)?;
|
||||||
|
match read(file).map_err(LoadError::ReadError)?{
|
||||||
|
#[cfg(feature="snf")]
|
||||||
|
DataStructure::StrafesNET(map)=>Ok(map),
|
||||||
|
#[cfg(feature="roblox")]
|
||||||
|
DataStructure::Roblox(model)=>{
|
||||||
|
let mut place=model.into_place();
|
||||||
|
place.run_scripts();
|
||||||
|
|
||||||
|
let mut loader=strafesnet_deferred_loader::roblox_legacy();
|
||||||
|
|
||||||
|
let (texture_loader,mesh_loader)=loader.get_inner_mut();
|
||||||
|
|
||||||
|
let map_step1=strafesnet_rbx_loader::convert(
|
||||||
|
&place,
|
||||||
|
|name|texture_loader.acquire_render_config_id(name),
|
||||||
|
|name|mesh_loader.acquire_mesh_id(name),
|
||||||
|
);
|
||||||
|
|
||||||
|
let meshpart_meshes=mesh_loader.load_meshes().map_err(LoadError::Io)?;
|
||||||
|
|
||||||
|
let map_step2=map_step1.add_meshpart_meshes_and_calculate_attributes(
|
||||||
|
meshpart_meshes.into_iter().map(|(mesh_id,loader_model)|
|
||||||
|
(mesh_id,strafesnet_rbx_loader::data::RobloxMeshBytes::new(loader_model.get()))
|
||||||
|
)
|
||||||
|
);
|
||||||
|
|
||||||
|
let (textures,render_configs)=loader.into_render_configs().map_err(LoadError::Io)?.consume();
|
||||||
|
|
||||||
|
let map=map_step2.add_render_configs_and_textures(
|
||||||
|
render_configs.into_iter(),
|
||||||
|
textures.into_iter().map(|(texture_id,texture)|
|
||||||
|
(texture_id,match texture{
|
||||||
|
strafesnet_deferred_loader::texture::Texture::ImageDDS(data)=>data,
|
||||||
|
})
|
||||||
|
)
|
||||||
|
);
|
||||||
|
|
||||||
|
Ok(map)
|
||||||
|
},
|
||||||
|
#[cfg(feature="source")]
|
||||||
|
DataStructure::Source(bsp)=>{
|
||||||
|
let mut loader=strafesnet_deferred_loader::source_legacy();
|
||||||
|
|
||||||
|
let (texture_loader,mesh_loader)=loader.get_inner_mut();
|
||||||
|
|
||||||
|
let map_step1=strafesnet_bsp_loader::convert(
|
||||||
|
&bsp,
|
||||||
|
|name|texture_loader.acquire_render_config_id(name),
|
||||||
|
|name|mesh_loader.acquire_mesh_id(name),
|
||||||
|
);
|
||||||
|
|
||||||
|
let prop_meshes=mesh_loader.load_meshes(bsp.as_ref());
|
||||||
|
|
||||||
|
let map_step2=map_step1.add_prop_meshes(
|
||||||
|
//the type conflagulator 9000
|
||||||
|
prop_meshes.into_iter().map(|(mesh_id,loader_model)|
|
||||||
|
(mesh_id,strafesnet_bsp_loader::data::ModelData{
|
||||||
|
mdl:strafesnet_bsp_loader::data::MdlData::new(loader_model.mdl.get()),
|
||||||
|
vtx:strafesnet_bsp_loader::data::VtxData::new(loader_model.vtx.get()),
|
||||||
|
vvd:strafesnet_bsp_loader::data::VvdData::new(loader_model.vvd.get()),
|
||||||
|
})
|
||||||
|
),
|
||||||
|
|name|texture_loader.acquire_render_config_id(name),
|
||||||
|
);
|
||||||
|
|
||||||
|
let (textures,render_configs)=loader.into_render_configs().map_err(LoadError::Io)?.consume();
|
||||||
|
|
||||||
|
let map=map_step2.add_render_configs_and_textures(
|
||||||
|
render_configs.into_iter(),
|
||||||
|
textures.into_iter().map(|(texture_id,texture)|
|
||||||
|
(texture_id,match texture{
|
||||||
|
strafesnet_deferred_loader::texture::Texture::ImageDDS(data)=>data,
|
||||||
|
})
|
||||||
|
),
|
||||||
|
);
|
||||||
|
|
||||||
|
Ok(map)
|
||||||
|
},
|
||||||
|
}
|
||||||
|
}
|
1109
src/graphics.rs
1109
src/graphics.rs
File diff suppressed because it is too large
Load Diff
@ -1,9 +1,8 @@
|
|||||||
pub enum Instruction{
|
pub enum Instruction{
|
||||||
Render(crate::physics::PhysicsOutputState,crate::integer::Time,glam::IVec2),
|
Render(crate::graphics::FrameState),
|
||||||
//UpdateModel(crate::graphics::GraphicsModelUpdate),
|
//UpdateModel(crate::graphics::GraphicsModelUpdate),
|
||||||
Resize(winit::dpi::PhysicalSize<u32>,crate::settings::UserSettings),
|
Resize(winit::dpi::PhysicalSize<u32>,crate::settings::UserSettings),
|
||||||
GenerateModels(crate::model::IndexedModelInstances),
|
ChangeMap(strafesnet_common::map::CompleteMap),
|
||||||
ClearModels,
|
|
||||||
}
|
}
|
||||||
|
|
||||||
//Ideally the graphics thread worker description is:
|
//Ideally the graphics thread worker description is:
|
||||||
@ -21,31 +20,27 @@ pub fn new<'a>(
|
|||||||
surface:wgpu::Surface<'a>,
|
surface:wgpu::Surface<'a>,
|
||||||
device:wgpu::Device,
|
device:wgpu::Device,
|
||||||
queue:wgpu::Queue,
|
queue:wgpu::Queue,
|
||||||
)->crate::compat_worker::INWorker<'a,Instruction>{
|
)->crate::compat_worker::INWorker<'a,Instruction>{
|
||||||
let mut resize=None;
|
let mut resize=None;
|
||||||
crate::compat_worker::INWorker::new(move |ins:Instruction|{
|
crate::compat_worker::INWorker::new(move |ins:Instruction|{
|
||||||
match ins{
|
match ins{
|
||||||
Instruction::GenerateModels(indexed_model_instances)=>{
|
Instruction::ChangeMap(map)=>{
|
||||||
graphics.generate_models(&device,&queue,indexed_model_instances);
|
|
||||||
},
|
|
||||||
Instruction::ClearModels=>{
|
|
||||||
graphics.clear();
|
graphics.clear();
|
||||||
|
graphics.generate_models(&device,&queue,&map);
|
||||||
},
|
},
|
||||||
Instruction::Resize(size,user_settings)=>{
|
Instruction::Resize(size,user_settings)=>{
|
||||||
resize=Some((size,user_settings));
|
resize=Some((size,user_settings));
|
||||||
}
|
}
|
||||||
Instruction::Render(physics_output,predicted_time,mouse_pos)=>{
|
Instruction::Render(frame_state)=>{
|
||||||
if let Some((size,user_settings))=&resize{
|
if let Some((size,user_settings))=resize.take(){
|
||||||
println!("Resizing to {:?}",size);
|
println!("Resizing to {:?}",size);
|
||||||
let t0=std::time::Instant::now();
|
let t0=std::time::Instant::now();
|
||||||
config.width=size.width.max(1);
|
config.width=size.width.max(1);
|
||||||
config.height=size.height.max(1);
|
config.height=size.height.max(1);
|
||||||
surface.configure(&device,&config);
|
surface.configure(&device,&config);
|
||||||
graphics.resize(&device,&config,user_settings);
|
graphics.resize(&device,&config,&user_settings);
|
||||||
println!("Resize took {:?}",t0.elapsed());
|
println!("Resize took {:?}",t0.elapsed());
|
||||||
}
|
}
|
||||||
//clear every time w/e
|
|
||||||
resize=None;
|
|
||||||
//this has to go deeper somehow
|
//this has to go deeper somehow
|
||||||
let frame=match surface.get_current_texture(){
|
let frame=match surface.get_current_texture(){
|
||||||
Ok(frame)=>frame,
|
Ok(frame)=>frame,
|
||||||
@ -61,7 +56,7 @@ pub fn new<'a>(
|
|||||||
..wgpu::TextureViewDescriptor::default()
|
..wgpu::TextureViewDescriptor::default()
|
||||||
});
|
});
|
||||||
|
|
||||||
graphics.render(&view,&device,&queue,physics_output,predicted_time,mouse_pos);
|
graphics.render(&view,&device,&queue,frame_state);
|
||||||
|
|
||||||
frame.present();
|
frame.present();
|
||||||
}
|
}
|
||||||
|
@ -1,53 +0,0 @@
|
|||||||
use crate::integer::Time;
|
|
||||||
|
|
||||||
#[derive(Debug)]
|
|
||||||
pub struct TimedInstruction<I>{
|
|
||||||
pub time:Time,
|
|
||||||
pub instruction:I,
|
|
||||||
}
|
|
||||||
|
|
||||||
pub trait InstructionEmitter<I>{
|
|
||||||
fn next_instruction(&self,time_limit:Time)->Option<TimedInstruction<I>>;
|
|
||||||
}
|
|
||||||
pub trait InstructionConsumer<I>{
|
|
||||||
fn process_instruction(&mut self, instruction:TimedInstruction<I>);
|
|
||||||
}
|
|
||||||
|
|
||||||
//PROPER PRIVATE FIELDS!!!
|
|
||||||
pub struct InstructionCollector<I>{
|
|
||||||
time:Time,
|
|
||||||
instruction:Option<I>,
|
|
||||||
}
|
|
||||||
impl<I> InstructionCollector<I>{
|
|
||||||
pub fn new(time:Time)->Self{
|
|
||||||
Self{
|
|
||||||
time,
|
|
||||||
instruction:None
|
|
||||||
}
|
|
||||||
}
|
|
||||||
#[inline]
|
|
||||||
pub fn time(&self)->Time{
|
|
||||||
self.time
|
|
||||||
}
|
|
||||||
pub fn collect(&mut self,instruction:Option<TimedInstruction<I>>){
|
|
||||||
match instruction{
|
|
||||||
Some(unwrap_instruction)=>{
|
|
||||||
if unwrap_instruction.time<self.time {
|
|
||||||
self.time=unwrap_instruction.time;
|
|
||||||
self.instruction=Some(unwrap_instruction.instruction);
|
|
||||||
}
|
|
||||||
},
|
|
||||||
None=>(),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
pub fn instruction(self)->Option<TimedInstruction<I>>{
|
|
||||||
//STEAL INSTRUCTION AND DESTROY INSTRUCTIONCOLLECTOR
|
|
||||||
match self.instruction{
|
|
||||||
Some(instruction)=>Some(TimedInstruction{
|
|
||||||
time:self.time,
|
|
||||||
instruction
|
|
||||||
}),
|
|
||||||
None=>None,
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
1054
src/integer.rs
1054
src/integer.rs
File diff suppressed because it is too large
Load Diff
235
src/load_bsp.rs
235
src/load_bsp.rs
@ -1,235 +0,0 @@
|
|||||||
const VALVE_SCALE:f32=1.0/16.0;
|
|
||||||
fn valve_transform(v:[f32;3])->crate::integer::Planar64Vec3{
|
|
||||||
crate::integer::Planar64Vec3::try_from([v[0]*VALVE_SCALE,v[2]*VALVE_SCALE,-v[1]*VALVE_SCALE]).unwrap()
|
|
||||||
}
|
|
||||||
pub fn generate_indexed_models<R:std::io::Read+std::io::Seek>(input:&mut R)->Result<crate::model::IndexedModelInstances,vbsp::BspError>{
|
|
||||||
let mut s=Vec::new();
|
|
||||||
|
|
||||||
match input.read_to_end(&mut s){
|
|
||||||
Ok(_)=>(),
|
|
||||||
Err(e)=>println!("load_bsp::generate_indexed_models read_to_end failed: {:?}",e),
|
|
||||||
}
|
|
||||||
|
|
||||||
match vbsp::Bsp::read(s.as_slice()){
|
|
||||||
Ok(bsp)=>{
|
|
||||||
let mut spawn_point=crate::integer::Planar64Vec3::ZERO;
|
|
||||||
|
|
||||||
let vertices: Vec<_> = bsp
|
|
||||||
.vertices
|
|
||||||
.iter()
|
|
||||||
.map(|vertex|<[f32;3]>::from(vertex.position))
|
|
||||||
.collect();
|
|
||||||
|
|
||||||
let mut name_from_texture_id=Vec::new();
|
|
||||||
let mut texture_id_from_name=std::collections::HashMap::new();
|
|
||||||
|
|
||||||
let mut models=bsp.models().map(|world_model|{
|
|
||||||
//non-deduplicated
|
|
||||||
let mut spam_pos=Vec::new();
|
|
||||||
let mut spam_tex=Vec::new();
|
|
||||||
let mut spam_normal=Vec::new();
|
|
||||||
let mut spam_vertices=Vec::new();
|
|
||||||
let groups=world_model.faces()
|
|
||||||
.filter(|face| face.is_visible())//TODO: look at this
|
|
||||||
.map(|face|{
|
|
||||||
let face_texture=face.texture();
|
|
||||||
let face_texture_data=face_texture.texture_data();
|
|
||||||
let (texture_u,texture_v)=(glam::Vec3A::from_slice(&face_texture.texture_transforms_u[0..3]),glam::Vec3A::from_slice(&face_texture.texture_transforms_v[0..3]));
|
|
||||||
let texture_offset=glam::vec2(face_texture.texture_transforms_u[3],face_texture.texture_transforms_v[3]);
|
|
||||||
let texture_size=glam::vec2(face_texture_data.width as f32,face_texture_data.height as f32);
|
|
||||||
|
|
||||||
//texture
|
|
||||||
let texture_id=if let Some(&texture_id)=texture_id_from_name.get(face_texture_data.name()){
|
|
||||||
texture_id
|
|
||||||
}else{
|
|
||||||
let texture_id=name_from_texture_id.len() as u32;
|
|
||||||
texture_id_from_name.insert(face_texture_data.name().to_string(),texture_id);
|
|
||||||
name_from_texture_id.push(face_texture_data.name().to_string());
|
|
||||||
texture_id
|
|
||||||
};
|
|
||||||
|
|
||||||
//normal
|
|
||||||
let normal=face.normal();
|
|
||||||
let normal_idx=spam_normal.len() as u32;
|
|
||||||
spam_normal.push(valve_transform(<[f32;3]>::from(normal)));
|
|
||||||
let mut vertices:Vec<u32>=face.vertex_indexes().map(|vertex_index|{
|
|
||||||
let pos=glam::Vec3A::from_array(vertices[vertex_index as usize]);
|
|
||||||
let pos_idx=spam_pos.len();
|
|
||||||
spam_pos.push(valve_transform(vertices[vertex_index as usize]));
|
|
||||||
|
|
||||||
//calculate texture coordinates
|
|
||||||
let tex=(glam::vec2(pos.dot(texture_u),pos.dot(texture_v))+texture_offset)/texture_size;
|
|
||||||
let tex_idx=spam_tex.len() as u32;
|
|
||||||
spam_tex.push(tex);
|
|
||||||
|
|
||||||
let i=spam_vertices.len() as u32;
|
|
||||||
spam_vertices.push(crate::model::IndexedVertex{
|
|
||||||
pos: pos_idx as u32,
|
|
||||||
tex: tex_idx as u32,
|
|
||||||
normal: normal_idx,
|
|
||||||
color: 0,
|
|
||||||
});
|
|
||||||
i
|
|
||||||
}).collect();
|
|
||||||
vertices.reverse();
|
|
||||||
crate::model::IndexedGroup{
|
|
||||||
texture:Some(texture_id),
|
|
||||||
polys:vec![crate::model::IndexedPolygon{vertices}],
|
|
||||||
}
|
|
||||||
}).collect();
|
|
||||||
crate::model::IndexedModel{
|
|
||||||
unique_pos:spam_pos,
|
|
||||||
unique_tex:spam_tex,
|
|
||||||
unique_normal:spam_normal,
|
|
||||||
unique_color:vec![glam::Vec4::ONE],
|
|
||||||
unique_vertices:spam_vertices,
|
|
||||||
groups,
|
|
||||||
instances:vec![crate::model::ModelInstance{
|
|
||||||
attributes:crate::model::CollisionAttributes::Decoration,
|
|
||||||
transform:crate::integer::Planar64Affine3::new(
|
|
||||||
crate::integer::Planar64Mat3::default(),
|
|
||||||
valve_transform(<[f32;3]>::from(world_model.origin))
|
|
||||||
),
|
|
||||||
..Default::default()
|
|
||||||
}],
|
|
||||||
}
|
|
||||||
}).collect();
|
|
||||||
|
|
||||||
//dedupe prop models
|
|
||||||
let mut model_dedupe=std::collections::HashSet::new();
|
|
||||||
for prop in bsp.static_props(){
|
|
||||||
model_dedupe.insert(prop.model());
|
|
||||||
}
|
|
||||||
|
|
||||||
//generate unique meshes
|
|
||||||
let mut model_map=std::collections::HashMap::with_capacity(model_dedupe.len());
|
|
||||||
let mut prop_models=Vec::new();
|
|
||||||
for model_name in model_dedupe{
|
|
||||||
let model_name_lower=model_name.to_lowercase();
|
|
||||||
//.mdl, .vvd, .dx90.vtx
|
|
||||||
let mut path=std::path::PathBuf::from(model_name_lower.as_str());
|
|
||||||
let file_name=std::path::PathBuf::from(path.file_stem().unwrap());
|
|
||||||
path.pop();
|
|
||||||
path.push(file_name);
|
|
||||||
let mut vvd_path=path.clone();
|
|
||||||
let mut vtx_path=path.clone();
|
|
||||||
vvd_path.set_extension("vvd");
|
|
||||||
vtx_path.set_extension("dx90.vtx");
|
|
||||||
match (bsp.pack.get(model_name_lower.as_str()),bsp.pack.get(vvd_path.as_os_str().to_str().unwrap()),bsp.pack.get(vtx_path.as_os_str().to_str().unwrap())){
|
|
||||||
(Ok(Some(mdl_file)),Ok(Some(vvd_file)),Ok(Some(vtx_file)))=>{
|
|
||||||
match (vmdl::mdl::Mdl::read(mdl_file.as_ref()),vmdl::vvd::Vvd::read(vvd_file.as_ref()),vmdl::vtx::Vtx::read(vtx_file.as_ref())){
|
|
||||||
(Ok(mdl),Ok(vvd),Ok(vtx))=>{
|
|
||||||
let model=vmdl::Model::from_parts(mdl,vtx,vvd);
|
|
||||||
let texture_paths=model.texture_directories();
|
|
||||||
if texture_paths.len()!=1{
|
|
||||||
println!("WARNING: multiple texture paths");
|
|
||||||
}
|
|
||||||
let skin=model.skin_tables().nth(0).unwrap();
|
|
||||||
|
|
||||||
let mut spam_pos=Vec::with_capacity(model.vertices().len());
|
|
||||||
let mut spam_normal=Vec::with_capacity(model.vertices().len());
|
|
||||||
let mut spam_tex=Vec::with_capacity(model.vertices().len());
|
|
||||||
let mut spam_vertices=Vec::with_capacity(model.vertices().len());
|
|
||||||
for (i,vertex) in model.vertices().iter().enumerate(){
|
|
||||||
spam_pos.push(valve_transform(<[f32;3]>::from(vertex.position)));
|
|
||||||
spam_normal.push(valve_transform(<[f32;3]>::from(vertex.normal)));
|
|
||||||
spam_tex.push(glam::Vec2::from_array(vertex.texture_coordinates));
|
|
||||||
spam_vertices.push(crate::model::IndexedVertex{
|
|
||||||
pos:i as u32,
|
|
||||||
tex:i as u32,
|
|
||||||
normal:i as u32,
|
|
||||||
color:0,
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
let model_id=prop_models.len();
|
|
||||||
model_map.insert(model_name,model_id);
|
|
||||||
prop_models.push(crate::model::IndexedModel{
|
|
||||||
unique_pos:spam_pos,
|
|
||||||
unique_normal:spam_normal,
|
|
||||||
unique_tex:spam_tex,
|
|
||||||
unique_color:vec![glam::Vec4::ONE],
|
|
||||||
unique_vertices:spam_vertices,
|
|
||||||
groups:model.meshes().map(|mesh|{
|
|
||||||
let texture=if let (Some(texture_path),Some(texture_name))=(texture_paths.get(0),skin.texture(mesh.material_index())){
|
|
||||||
let mut path=std::path::PathBuf::from(texture_path.as_str());
|
|
||||||
path.push(texture_name);
|
|
||||||
let texture_location=path.as_os_str().to_str().unwrap();
|
|
||||||
let texture_id=if let Some(&texture_id)=texture_id_from_name.get(texture_location){
|
|
||||||
texture_id
|
|
||||||
}else{
|
|
||||||
println!("texture! {}",texture_location);
|
|
||||||
let texture_id=name_from_texture_id.len() as u32;
|
|
||||||
texture_id_from_name.insert(texture_location.to_string(),texture_id);
|
|
||||||
name_from_texture_id.push(texture_location.to_string());
|
|
||||||
texture_id
|
|
||||||
};
|
|
||||||
Some(texture_id)
|
|
||||||
}else{
|
|
||||||
None
|
|
||||||
};
|
|
||||||
|
|
||||||
crate::model::IndexedGroup{
|
|
||||||
texture,
|
|
||||||
polys:{
|
|
||||||
//looking at the code, it would seem that the strips are pre-deindexed into triangle lists when calling this function
|
|
||||||
mesh.vertex_strip_indices().map(|strip|{
|
|
||||||
strip.collect::<Vec<usize>>().chunks(3).map(|tri|{
|
|
||||||
crate::model::IndexedPolygon{vertices:vec![tri[0] as u32,tri[1] as u32,tri[2] as u32]}
|
|
||||||
}).collect::<Vec<crate::model::IndexedPolygon>>()
|
|
||||||
}).flatten().collect()
|
|
||||||
},
|
|
||||||
}
|
|
||||||
}).collect(),
|
|
||||||
instances:Vec::new(),
|
|
||||||
});
|
|
||||||
},
|
|
||||||
_=>println!("model_name={} error",model_name),
|
|
||||||
}
|
|
||||||
},
|
|
||||||
_=>println!("no model name={}",model_name),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
//generate model instances
|
|
||||||
for prop in bsp.static_props(){
|
|
||||||
let placement=prop.as_prop_placement();
|
|
||||||
if let Some(&model_index)=model_map.get(placement.model){
|
|
||||||
prop_models[model_index].instances.push(crate::model::ModelInstance{
|
|
||||||
transform:crate::integer::Planar64Affine3::new(
|
|
||||||
crate::integer::Planar64Mat3::try_from(
|
|
||||||
glam::Mat3A::from_diagonal(glam::Vec3::splat(placement.scale))
|
|
||||||
//TODO: figure this out
|
|
||||||
*glam::Mat3A::from_quat(glam::Quat::from_xyzw(
|
|
||||||
placement.rotation.v.x,//b
|
|
||||||
placement.rotation.v.y,//c
|
|
||||||
placement.rotation.v.z,//d
|
|
||||||
placement.rotation.s,//a
|
|
||||||
))
|
|
||||||
).unwrap(),
|
|
||||||
valve_transform(<[f32;3]>::from(placement.origin)),
|
|
||||||
),
|
|
||||||
attributes:crate::model::CollisionAttributes::Decoration,
|
|
||||||
..Default::default()
|
|
||||||
});
|
|
||||||
}else{
|
|
||||||
//println!("model not found {}",placement.model);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
//actually add the prop models
|
|
||||||
prop_models.append(&mut models);
|
|
||||||
|
|
||||||
Ok(crate::model::IndexedModelInstances{
|
|
||||||
textures:name_from_texture_id,
|
|
||||||
models:prop_models,
|
|
||||||
spawn_point,
|
|
||||||
modes:Vec::new(),
|
|
||||||
})
|
|
||||||
},
|
|
||||||
Err(e)=>{
|
|
||||||
println!("rotten {:?}",e);
|
|
||||||
Err(e)
|
|
||||||
},
|
|
||||||
}
|
|
||||||
}
|
|
@ -1,523 +0,0 @@
|
|||||||
use crate::primitives;
|
|
||||||
use crate::integer::{Planar64,Planar64Vec3,Planar64Mat3,Planar64Affine3};
|
|
||||||
|
|
||||||
fn class_is_a(class: &str, superclass: &str) -> bool {
|
|
||||||
if class==superclass {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
let class_descriptor=rbx_reflection_database::get().classes.get(class);
|
|
||||||
if let Some(descriptor) = &class_descriptor {
|
|
||||||
if let Some(class_super) = &descriptor.superclass {
|
|
||||||
return class_is_a(&class_super, superclass)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return false
|
|
||||||
}
|
|
||||||
fn recursive_collect_superclass(objects: &mut std::vec::Vec<rbx_dom_weak::types::Ref>,dom: &rbx_dom_weak::WeakDom, instance: &rbx_dom_weak::Instance, superclass: &str){
|
|
||||||
let mut stack=vec![instance];
|
|
||||||
while let Some(item)=stack.pop(){
|
|
||||||
for &referent in item.children(){
|
|
||||||
if let Some(c)=dom.get_by_ref(referent){
|
|
||||||
if class_is_a(c.class.as_str(),superclass){
|
|
||||||
objects.push(c.referent());//copy ref
|
|
||||||
}
|
|
||||||
stack.push(c);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
fn planar64_affine3_from_roblox(cf:&rbx_dom_weak::types::CFrame,size:&rbx_dom_weak::types::Vector3)->Planar64Affine3{
|
|
||||||
Planar64Affine3::new(
|
|
||||||
Planar64Mat3::from_cols(
|
|
||||||
Planar64Vec3::try_from([cf.orientation.x.x,cf.orientation.y.x,cf.orientation.z.x]).unwrap()
|
|
||||||
*Planar64::try_from(size.x/2.0).unwrap(),
|
|
||||||
Planar64Vec3::try_from([cf.orientation.x.y,cf.orientation.y.y,cf.orientation.z.y]).unwrap()
|
|
||||||
*Planar64::try_from(size.y/2.0).unwrap(),
|
|
||||||
Planar64Vec3::try_from([cf.orientation.x.z,cf.orientation.y.z,cf.orientation.z.z]).unwrap()
|
|
||||||
*Planar64::try_from(size.z/2.0).unwrap(),
|
|
||||||
),
|
|
||||||
Planar64Vec3::try_from([cf.position.x,cf.position.y,cf.position.z]).unwrap()
|
|
||||||
)
|
|
||||||
}
|
|
||||||
fn get_attributes(name:&str,can_collide:bool,velocity:Planar64Vec3,force_intersecting:bool)->crate::model::CollisionAttributes{
|
|
||||||
let mut general=crate::model::GameMechanicAttributes::default();
|
|
||||||
let mut intersecting=crate::model::IntersectingAttributes::default();
|
|
||||||
let mut contacting=crate::model::ContactingAttributes::default();
|
|
||||||
let mut force_can_collide=can_collide;
|
|
||||||
match name{
|
|
||||||
"Water"=>{
|
|
||||||
force_can_collide=false;
|
|
||||||
//TODO: read stupid CustomPhysicalProperties
|
|
||||||
intersecting.water=Some(crate::model::IntersectingWater{density:Planar64::ONE,viscosity:Planar64::ONE/10,velocity});
|
|
||||||
},
|
|
||||||
"Accelerator"=>{
|
|
||||||
//although the new game supports collidable accelerators, this is a roblox compatability map loader
|
|
||||||
force_can_collide=false;
|
|
||||||
general.accelerator=Some(crate::model::GameMechanicAccelerator{acceleration:velocity});
|
|
||||||
},
|
|
||||||
// "UnorderedCheckpoint"=>general.teleport_behaviour=Some(crate::model::TeleportBehaviour::StageElement(crate::model::GameMechanicStageElement{
|
|
||||||
// mode_id:0,
|
|
||||||
// stage_id:0,
|
|
||||||
// force:false,
|
|
||||||
// behaviour:crate::model::StageElementBehaviour::Unordered
|
|
||||||
// })),
|
|
||||||
"SetVelocity"=>general.trajectory=Some(crate::model::GameMechanicSetTrajectory::Velocity(velocity)),
|
|
||||||
"MapFinish"=>{force_can_collide=false;general.zone=Some(crate::model::GameMechanicZone{mode_id:0,behaviour:crate::model::ZoneBehaviour::Finish})},
|
|
||||||
"MapAnticheat"=>{force_can_collide=false;general.zone=Some(crate::model::GameMechanicZone{mode_id:0,behaviour:crate::model::ZoneBehaviour::Anitcheat})},
|
|
||||||
"Platform"=>general.teleport_behaviour=Some(crate::model::TeleportBehaviour::StageElement(crate::model::GameMechanicStageElement{
|
|
||||||
mode_id:0,
|
|
||||||
stage_id:0,
|
|
||||||
force:false,
|
|
||||||
behaviour:crate::model::StageElementBehaviour::Platform,
|
|
||||||
})),
|
|
||||||
other=>{
|
|
||||||
if let Some(captures)=lazy_regex::regex!(r"^(Force)?(Spawn|SpawnAt|Trigger|Teleport|Platform)(\d+)$")
|
|
||||||
.captures(other){
|
|
||||||
general.teleport_behaviour=Some(crate::model::TeleportBehaviour::StageElement(crate::model::GameMechanicStageElement{
|
|
||||||
mode_id:0,
|
|
||||||
stage_id:captures[3].parse::<u32>().unwrap(),
|
|
||||||
force:match captures.get(1){
|
|
||||||
Some(m)=>m.as_str()=="Force",
|
|
||||||
None=>false,
|
|
||||||
},
|
|
||||||
behaviour:match &captures[2]{
|
|
||||||
"Spawn"|"SpawnAt"=>crate::model::StageElementBehaviour::SpawnAt,
|
|
||||||
//cancollide false so you don't hit the side
|
|
||||||
//NOT a decoration
|
|
||||||
"Trigger"=>{force_can_collide=false;crate::model::StageElementBehaviour::Trigger},
|
|
||||||
"Teleport"=>{force_can_collide=false;crate::model::StageElementBehaviour::Teleport},
|
|
||||||
"Platform"=>crate::model::StageElementBehaviour::Platform,
|
|
||||||
_=>panic!("regex1[2] messed up bad"),
|
|
||||||
}
|
|
||||||
}));
|
|
||||||
}else if let Some(captures)=lazy_regex::regex!(r"^(Force)?(Jump)(\d+)$")
|
|
||||||
.captures(other){
|
|
||||||
general.teleport_behaviour=Some(crate::model::TeleportBehaviour::StageElement(crate::model::GameMechanicStageElement{
|
|
||||||
mode_id:0,
|
|
||||||
stage_id:0,
|
|
||||||
force:match captures.get(1){
|
|
||||||
Some(m)=>m.as_str()=="Force",
|
|
||||||
None=>false,
|
|
||||||
},
|
|
||||||
behaviour:match &captures[2]{
|
|
||||||
"Jump"=>crate::model::StageElementBehaviour::JumpLimit(captures[3].parse::<u32>().unwrap()),
|
|
||||||
_=>panic!("regex4[1] messed up bad"),
|
|
||||||
}
|
|
||||||
}));
|
|
||||||
}else if let Some(captures)=lazy_regex::regex!(r"^Bonus(Finish|Anticheat)(\d+)$")
|
|
||||||
.captures(other){
|
|
||||||
force_can_collide=false;
|
|
||||||
match &captures[1]{
|
|
||||||
"Finish"=>general.zone=Some(crate::model::GameMechanicZone{mode_id:captures[2].parse::<u32>().unwrap(),behaviour:crate::model::ZoneBehaviour::Finish}),
|
|
||||||
"Anticheat"=>general.zone=Some(crate::model::GameMechanicZone{mode_id:captures[2].parse::<u32>().unwrap(),behaviour:crate::model::ZoneBehaviour::Anitcheat}),
|
|
||||||
_=>panic!("regex2[1] messed up bad"),
|
|
||||||
}
|
|
||||||
}else if let Some(captures)=lazy_regex::regex!(r"^(WormholeIn)(\d+)$")
|
|
||||||
.captures(other){
|
|
||||||
force_can_collide=false;
|
|
||||||
match &captures[1]{
|
|
||||||
"WormholeIn"=>general.teleport_behaviour=Some(crate::model::TeleportBehaviour::Wormhole(crate::model::GameMechanicWormhole{destination_model_id:captures[2].parse::<u32>().unwrap()})),
|
|
||||||
_=>panic!("regex3[1] messed up bad"),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
// else if let Some(captures)=lazy_regex::regex!(r"^(OrderedCheckpoint)(\d+)$")
|
|
||||||
// .captures(other){
|
|
||||||
// match &captures[1]{
|
|
||||||
// "OrderedCheckpoint"=>general.checkpoint=Some(crate::model::GameMechanicCheckpoint::Ordered{mode_id:0,checkpoint_id:captures[2].parse::<u32>().unwrap()}),
|
|
||||||
// _=>panic!("regex3[1] messed up bad"),
|
|
||||||
// }
|
|
||||||
// }
|
|
||||||
}
|
|
||||||
}
|
|
||||||
//need some way to skip this
|
|
||||||
if velocity!=Planar64Vec3::ZERO{
|
|
||||||
general.booster=Some(crate::model::GameMechanicBooster::Velocity(velocity));
|
|
||||||
}
|
|
||||||
match force_can_collide{
|
|
||||||
true=>{
|
|
||||||
match name{
|
|
||||||
"Bounce"=>contacting.contact_behaviour=Some(crate::model::ContactingBehaviour::Elastic(u32::MAX)),
|
|
||||||
"Surf"=>contacting.contact_behaviour=Some(crate::model::ContactingBehaviour::Surf),
|
|
||||||
"Ladder"=>contacting.contact_behaviour=Some(crate::model::ContactingBehaviour::Ladder(crate::model::ContactingLadder{sticky:true})),
|
|
||||||
_=>(),
|
|
||||||
}
|
|
||||||
crate::model::CollisionAttributes::Contact{contacting,general}
|
|
||||||
},
|
|
||||||
false=>if force_intersecting
|
|
||||||
||general.any()
|
|
||||||
||intersecting.any()
|
|
||||||
{
|
|
||||||
crate::model::CollisionAttributes::Intersect{intersecting,general}
|
|
||||||
}else{
|
|
||||||
crate::model::CollisionAttributes::Decoration
|
|
||||||
},
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
struct RobloxAssetId(u64);
|
|
||||||
struct RobloxAssetIdParseErr;
|
|
||||||
impl std::str::FromStr for RobloxAssetId {
|
|
||||||
type Err=RobloxAssetIdParseErr;
|
|
||||||
fn from_str(s: &str) -> Result<Self, Self::Err>{
|
|
||||||
let regman=lazy_regex::regex!(r"(\d+)$");
|
|
||||||
if let Some(captures) = regman.captures(s) {
|
|
||||||
if captures.len()==2{//captures[0] is all captures concatenated, and then each individual capture
|
|
||||||
if let Ok(id) = captures[0].parse::<u64>() {
|
|
||||||
return Ok(Self(id));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
Err(RobloxAssetIdParseErr)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
#[derive(Clone,Copy,PartialEq)]
|
|
||||||
struct RobloxTextureTransform{
|
|
||||||
offset_u:f32,
|
|
||||||
offset_v:f32,
|
|
||||||
scale_u:f32,
|
|
||||||
scale_v:f32,
|
|
||||||
}
|
|
||||||
impl std::cmp::Eq for RobloxTextureTransform{}//????
|
|
||||||
impl std::default::Default for RobloxTextureTransform{
|
|
||||||
fn default() -> Self {
|
|
||||||
Self{offset_u:0.0,offset_v:0.0,scale_u:1.0,scale_v:1.0}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
impl std::hash::Hash for RobloxTextureTransform {
|
|
||||||
fn hash<H: std::hash::Hasher>(&self, state: &mut H) {
|
|
||||||
self.offset_u.to_ne_bytes().hash(state);
|
|
||||||
self.offset_v.to_ne_bytes().hash(state);
|
|
||||||
self.scale_u.to_ne_bytes().hash(state);
|
|
||||||
self.scale_v.to_ne_bytes().hash(state);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
#[derive(Clone,PartialEq)]
|
|
||||||
struct RobloxFaceTextureDescription{
|
|
||||||
texture:u32,
|
|
||||||
color:glam::Vec4,
|
|
||||||
transform:RobloxTextureTransform,
|
|
||||||
}
|
|
||||||
impl std::cmp::Eq for RobloxFaceTextureDescription{}//????
|
|
||||||
impl std::hash::Hash for RobloxFaceTextureDescription {
|
|
||||||
fn hash<H: std::hash::Hasher>(&self, state: &mut H) {
|
|
||||||
self.texture.hash(state);
|
|
||||||
self.transform.hash(state);
|
|
||||||
for &el in self.color.as_ref().iter() {
|
|
||||||
el.to_ne_bytes().hash(state);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
impl RobloxFaceTextureDescription{
|
|
||||||
fn to_face_description(&self)->primitives::FaceDescription{
|
|
||||||
primitives::FaceDescription{
|
|
||||||
texture:Some(self.texture),
|
|
||||||
transform:glam::Affine2::from_translation(
|
|
||||||
glam::vec2(self.transform.offset_u,self.transform.offset_v)
|
|
||||||
)
|
|
||||||
*glam::Affine2::from_scale(
|
|
||||||
glam::vec2(self.transform.scale_u,self.transform.scale_v)
|
|
||||||
),
|
|
||||||
color:self.color,
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
type RobloxPartDescription=[Option<RobloxFaceTextureDescription>;6];
|
|
||||||
type RobloxWedgeDescription=[Option<RobloxFaceTextureDescription>;5];
|
|
||||||
type RobloxCornerWedgeDescription=[Option<RobloxFaceTextureDescription>;5];
|
|
||||||
#[derive(Clone,Eq,Hash,PartialEq)]
|
|
||||||
enum RobloxBasePartDescription{
|
|
||||||
Sphere(RobloxPartDescription),
|
|
||||||
Part(RobloxPartDescription),
|
|
||||||
Cylinder(RobloxPartDescription),
|
|
||||||
Wedge(RobloxWedgeDescription),
|
|
||||||
CornerWedge(RobloxCornerWedgeDescription),
|
|
||||||
}
|
|
||||||
pub fn generate_indexed_models(dom:rbx_dom_weak::WeakDom) -> crate::model::IndexedModelInstances{
|
|
||||||
//IndexedModelInstances includes textures
|
|
||||||
let mut spawn_point=Planar64Vec3::ZERO;
|
|
||||||
|
|
||||||
let mut indexed_models=Vec::new();
|
|
||||||
let mut model_id_from_description=std::collections::HashMap::<RobloxBasePartDescription,usize>::new();
|
|
||||||
|
|
||||||
let mut texture_id_from_asset_id=std::collections::HashMap::<u64,u32>::new();
|
|
||||||
let mut asset_id_from_texture_id=Vec::new();
|
|
||||||
|
|
||||||
let mut object_refs=Vec::new();
|
|
||||||
let mut temp_objects=Vec::new();
|
|
||||||
recursive_collect_superclass(&mut object_refs, &dom, dom.root(),"BasePart");
|
|
||||||
for object_ref in object_refs {
|
|
||||||
if let Some(object)=dom.get_by_ref(object_ref){
|
|
||||||
if let (
|
|
||||||
Some(rbx_dom_weak::types::Variant::CFrame(cf)),
|
|
||||||
Some(rbx_dom_weak::types::Variant::Vector3(size)),
|
|
||||||
Some(rbx_dom_weak::types::Variant::Vector3(velocity)),
|
|
||||||
Some(rbx_dom_weak::types::Variant::Float32(transparency)),
|
|
||||||
Some(rbx_dom_weak::types::Variant::Color3uint8(color3)),
|
|
||||||
Some(rbx_dom_weak::types::Variant::Bool(can_collide)),
|
|
||||||
) = (
|
|
||||||
object.properties.get("CFrame"),
|
|
||||||
object.properties.get("Size"),
|
|
||||||
object.properties.get("Velocity"),
|
|
||||||
object.properties.get("Transparency"),
|
|
||||||
object.properties.get("Color"),
|
|
||||||
object.properties.get("CanCollide"),
|
|
||||||
)
|
|
||||||
{
|
|
||||||
let model_transform=planar64_affine3_from_roblox(cf,size);
|
|
||||||
|
|
||||||
if model_transform.matrix3.determinant()==Planar64::ZERO{
|
|
||||||
let mut parent_ref=object.parent();
|
|
||||||
let mut full_path=object.name.clone();
|
|
||||||
while let Some(parent)=dom.get_by_ref(parent_ref){
|
|
||||||
full_path=format!("{}.{}",parent.name,full_path);
|
|
||||||
parent_ref=parent.parent();
|
|
||||||
}
|
|
||||||
println!("Zero determinant CFrame at location {}",full_path);
|
|
||||||
println!("matrix3:{}",model_transform.matrix3);
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
//push TempIndexedAttributes
|
|
||||||
let mut force_intersecting=false;
|
|
||||||
let mut temp_indexing_attributes=Vec::new();
|
|
||||||
if let Some(attr)=match &object.name[..]{
|
|
||||||
"MapStart"=>{
|
|
||||||
spawn_point=model_transform.transform_point3(Planar64Vec3::ZERO)+Planar64Vec3::Y*5/2;
|
|
||||||
Some(crate::model::TempIndexedAttributes::Start(crate::model::TempAttrStart{mode_id:0}))
|
|
||||||
},
|
|
||||||
other=>{
|
|
||||||
let regman=lazy_regex::regex!(r"^(BonusStart|Spawn|ForceSpawn|WormholeOut)(\d+)$");
|
|
||||||
if let Some(captures) = regman.captures(other) {
|
|
||||||
match &captures[1]{
|
|
||||||
"BonusStart"=>Some(crate::model::TempIndexedAttributes::Start(crate::model::TempAttrStart{mode_id:captures[2].parse::<u32>().unwrap()})),
|
|
||||||
"Spawn"|"ForceSpawn"=>Some(crate::model::TempIndexedAttributes::Spawn(crate::model::TempAttrSpawn{mode_id:0,stage_id:captures[2].parse::<u32>().unwrap()})),
|
|
||||||
"WormholeOut"=>Some(crate::model::TempIndexedAttributes::Wormhole(crate::model::TempAttrWormhole{wormhole_id:captures[2].parse::<u32>().unwrap()})),
|
|
||||||
_=>None,
|
|
||||||
}
|
|
||||||
}else{
|
|
||||||
None
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}{
|
|
||||||
force_intersecting=true;
|
|
||||||
temp_indexing_attributes.push(attr);
|
|
||||||
}
|
|
||||||
|
|
||||||
//TODO: also detect "CylinderMesh" etc here
|
|
||||||
let shape=match &object.class[..]{
|
|
||||||
"Part"=>{
|
|
||||||
if let Some(rbx_dom_weak::types::Variant::Enum(shape))=object.properties.get("Shape"){
|
|
||||||
match shape.to_u32(){
|
|
||||||
0=>primitives::Primitives::Sphere,
|
|
||||||
1=>primitives::Primitives::Cube,
|
|
||||||
2=>primitives::Primitives::Cylinder,
|
|
||||||
3=>primitives::Primitives::Wedge,
|
|
||||||
4=>primitives::Primitives::CornerWedge,
|
|
||||||
_=>panic!("Funky roblox PartType={};",shape.to_u32()),
|
|
||||||
}
|
|
||||||
}else{
|
|
||||||
panic!("Part has no Shape!");
|
|
||||||
}
|
|
||||||
},
|
|
||||||
"TrussPart"=>primitives::Primitives::Cube,
|
|
||||||
"WedgePart"=>primitives::Primitives::Wedge,
|
|
||||||
"CornerWedgePart"=>primitives::Primitives::CornerWedge,
|
|
||||||
_=>{
|
|
||||||
println!("Unsupported BasePart ClassName={}; defaulting to cube",object.class);
|
|
||||||
primitives::Primitives::Cube
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
//use the biggest one and cut it down later...
|
|
||||||
let mut part_texture_description:RobloxPartDescription=[None,None,None,None,None,None];
|
|
||||||
temp_objects.clear();
|
|
||||||
recursive_collect_superclass(&mut temp_objects, &dom, object,"Decal");
|
|
||||||
for &decal_ref in &temp_objects{
|
|
||||||
if let Some(decal)=dom.get_by_ref(decal_ref){
|
|
||||||
if let (
|
|
||||||
Some(rbx_dom_weak::types::Variant::Content(content)),
|
|
||||||
Some(rbx_dom_weak::types::Variant::Enum(normalid)),
|
|
||||||
Some(rbx_dom_weak::types::Variant::Color3(decal_color3)),
|
|
||||||
Some(rbx_dom_weak::types::Variant::Float32(decal_transparency)),
|
|
||||||
) = (
|
|
||||||
decal.properties.get("Texture"),
|
|
||||||
decal.properties.get("Face"),
|
|
||||||
decal.properties.get("Color3"),
|
|
||||||
decal.properties.get("Transparency"),
|
|
||||||
) {
|
|
||||||
if let Ok(asset_id)=content.clone().into_string().parse::<RobloxAssetId>(){
|
|
||||||
let texture_id=if let Some(&texture_id)=texture_id_from_asset_id.get(&asset_id.0){
|
|
||||||
texture_id
|
|
||||||
}else{
|
|
||||||
let texture_id=asset_id_from_texture_id.len() as u32;
|
|
||||||
texture_id_from_asset_id.insert(asset_id.0,texture_id);
|
|
||||||
asset_id_from_texture_id.push(asset_id.0);
|
|
||||||
texture_id
|
|
||||||
};
|
|
||||||
let normal_id=normalid.to_u32();
|
|
||||||
if normal_id<6{
|
|
||||||
let (roblox_texture_color,roblox_texture_transform)=if decal.class=="Texture"{
|
|
||||||
//generate tranform
|
|
||||||
if let (
|
|
||||||
Some(rbx_dom_weak::types::Variant::Float32(ox)),
|
|
||||||
Some(rbx_dom_weak::types::Variant::Float32(oy)),
|
|
||||||
Some(rbx_dom_weak::types::Variant::Float32(sx)),
|
|
||||||
Some(rbx_dom_weak::types::Variant::Float32(sy)),
|
|
||||||
) = (
|
|
||||||
decal.properties.get("OffsetStudsU"),
|
|
||||||
decal.properties.get("OffsetStudsV"),
|
|
||||||
decal.properties.get("StudsPerTileU"),
|
|
||||||
decal.properties.get("StudsPerTileV"),
|
|
||||||
)
|
|
||||||
{
|
|
||||||
let (size_u,size_v)=match normal_id{
|
|
||||||
0=>(size.z,size.y),//right
|
|
||||||
1=>(size.x,size.z),//top
|
|
||||||
2=>(size.x,size.y),//back
|
|
||||||
3=>(size.z,size.y),//left
|
|
||||||
4=>(size.x,size.z),//bottom
|
|
||||||
5=>(size.x,size.y),//front
|
|
||||||
_=>panic!("unreachable"),
|
|
||||||
};
|
|
||||||
(
|
|
||||||
glam::vec4(decal_color3.r,decal_color3.g,decal_color3.b,1.0-*decal_transparency),
|
|
||||||
RobloxTextureTransform{
|
|
||||||
offset_u:*ox/(*sx),offset_v:*oy/(*sy),
|
|
||||||
scale_u:size_u/(*sx),scale_v:size_v/(*sy),
|
|
||||||
}
|
|
||||||
)
|
|
||||||
}else{
|
|
||||||
(glam::Vec4::ONE,RobloxTextureTransform::default())
|
|
||||||
}
|
|
||||||
}else{
|
|
||||||
(glam::Vec4::ONE,RobloxTextureTransform::default())
|
|
||||||
};
|
|
||||||
part_texture_description[normal_id as usize]=Some(RobloxFaceTextureDescription{
|
|
||||||
texture:texture_id,
|
|
||||||
color:roblox_texture_color,
|
|
||||||
transform:roblox_texture_transform,
|
|
||||||
});
|
|
||||||
}else{
|
|
||||||
println!("NormalId={} unsupported for shape={:?}",normal_id,shape);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
//obscure rust syntax "slice pattern"
|
|
||||||
let [
|
|
||||||
f0,//Cube::Right
|
|
||||||
f1,//Cube::Top
|
|
||||||
f2,//Cube::Back
|
|
||||||
f3,//Cube::Left
|
|
||||||
f4,//Cube::Bottom
|
|
||||||
f5,//Cube::Front
|
|
||||||
]=part_texture_description;
|
|
||||||
let basepart_texture_description=match shape{
|
|
||||||
primitives::Primitives::Sphere=>RobloxBasePartDescription::Sphere([f0,f1,f2,f3,f4,f5]),
|
|
||||||
primitives::Primitives::Cube=>RobloxBasePartDescription::Part([f0,f1,f2,f3,f4,f5]),
|
|
||||||
primitives::Primitives::Cylinder=>RobloxBasePartDescription::Cylinder([f0,f1,f2,f3,f4,f5]),
|
|
||||||
//use front face texture first and use top face texture as a fallback
|
|
||||||
primitives::Primitives::Wedge=>RobloxBasePartDescription::Wedge([
|
|
||||||
f0,//Cube::Right->Wedge::Right
|
|
||||||
if f5.is_some(){f5}else{f1},//Cube::Front|Cube::Top->Wedge::TopFront
|
|
||||||
f2,//Cube::Back->Wedge::Back
|
|
||||||
f3,//Cube::Left->Wedge::Left
|
|
||||||
f4,//Cube::Bottom->Wedge::Bottom
|
|
||||||
]),
|
|
||||||
//TODO: fix Left+Back texture coordinates to match roblox when not overwridden by Top
|
|
||||||
primitives::Primitives::CornerWedge=>RobloxBasePartDescription::CornerWedge([
|
|
||||||
f0,//Cube::Right->CornerWedge::Right
|
|
||||||
if f2.is_some(){f2}else{f1.clone()},//Cube::Back|Cube::Top->CornerWedge::TopBack
|
|
||||||
if f3.is_some(){f3}else{f1},//Cube::Left|Cube::Top->CornerWedge::TopLeft
|
|
||||||
f4,//Cube::Bottom->CornerWedge::Bottom
|
|
||||||
f5,//Cube::Front->CornerWedge::Front
|
|
||||||
]),
|
|
||||||
};
|
|
||||||
//make new model if unit cube has not been created before
|
|
||||||
let model_id=if let Some(&model_id)=model_id_from_description.get(&basepart_texture_description){
|
|
||||||
//push to existing texture model
|
|
||||||
model_id
|
|
||||||
}else{
|
|
||||||
let model_id=indexed_models.len();
|
|
||||||
model_id_from_description.insert(basepart_texture_description.clone(),model_id);//borrow checker going crazy
|
|
||||||
indexed_models.push(match basepart_texture_description{
|
|
||||||
RobloxBasePartDescription::Sphere(part_texture_description)
|
|
||||||
|RobloxBasePartDescription::Cylinder(part_texture_description)
|
|
||||||
|RobloxBasePartDescription::Part(part_texture_description)=>{
|
|
||||||
let mut cube_face_description=primitives::CubeFaceDescription::default();
|
|
||||||
for (face_id,roblox_face_description) in part_texture_description.iter().enumerate(){
|
|
||||||
cube_face_description.insert(
|
|
||||||
match face_id{
|
|
||||||
0=>primitives::CubeFace::Right,
|
|
||||||
1=>primitives::CubeFace::Top,
|
|
||||||
2=>primitives::CubeFace::Back,
|
|
||||||
3=>primitives::CubeFace::Left,
|
|
||||||
4=>primitives::CubeFace::Bottom,
|
|
||||||
5=>primitives::CubeFace::Front,
|
|
||||||
_=>panic!("unreachable"),
|
|
||||||
},
|
|
||||||
match roblox_face_description{
|
|
||||||
Some(roblox_texture_transform)=>roblox_texture_transform.to_face_description(),
|
|
||||||
None=>primitives::FaceDescription::default(),
|
|
||||||
});
|
|
||||||
}
|
|
||||||
primitives::generate_partial_unit_cube(cube_face_description)
|
|
||||||
},
|
|
||||||
RobloxBasePartDescription::Wedge(wedge_texture_description)=>{
|
|
||||||
let mut wedge_face_description=primitives::WedgeFaceDescription::default();
|
|
||||||
for (face_id,roblox_face_description) in wedge_texture_description.iter().enumerate(){
|
|
||||||
wedge_face_description.insert(
|
|
||||||
match face_id{
|
|
||||||
0=>primitives::WedgeFace::Right,
|
|
||||||
1=>primitives::WedgeFace::TopFront,
|
|
||||||
2=>primitives::WedgeFace::Back,
|
|
||||||
3=>primitives::WedgeFace::Left,
|
|
||||||
4=>primitives::WedgeFace::Bottom,
|
|
||||||
_=>panic!("unreachable"),
|
|
||||||
},
|
|
||||||
match roblox_face_description{
|
|
||||||
Some(roblox_texture_transform)=>roblox_texture_transform.to_face_description(),
|
|
||||||
None=>primitives::FaceDescription::default(),
|
|
||||||
});
|
|
||||||
}
|
|
||||||
primitives::generate_partial_unit_wedge(wedge_face_description)
|
|
||||||
},
|
|
||||||
RobloxBasePartDescription::CornerWedge(cornerwedge_texture_description)=>{
|
|
||||||
let mut cornerwedge_face_description=primitives::CornerWedgeFaceDescription::default();
|
|
||||||
for (face_id,roblox_face_description) in cornerwedge_texture_description.iter().enumerate(){
|
|
||||||
cornerwedge_face_description.insert(
|
|
||||||
match face_id{
|
|
||||||
0=>primitives::CornerWedgeFace::Right,
|
|
||||||
1=>primitives::CornerWedgeFace::TopBack,
|
|
||||||
2=>primitives::CornerWedgeFace::TopLeft,
|
|
||||||
3=>primitives::CornerWedgeFace::Bottom,
|
|
||||||
4=>primitives::CornerWedgeFace::Front,
|
|
||||||
_=>panic!("unreachable"),
|
|
||||||
},
|
|
||||||
match roblox_face_description{
|
|
||||||
Some(roblox_texture_transform)=>roblox_texture_transform.to_face_description(),
|
|
||||||
None=>primitives::FaceDescription::default(),
|
|
||||||
});
|
|
||||||
}
|
|
||||||
primitives::generate_partial_unit_cornerwedge(cornerwedge_face_description)
|
|
||||||
},
|
|
||||||
});
|
|
||||||
model_id
|
|
||||||
};
|
|
||||||
indexed_models[model_id].instances.push(crate::model::ModelInstance {
|
|
||||||
transform:model_transform,
|
|
||||||
color:glam::vec4(color3.r as f32/255f32, color3.g as f32/255f32, color3.b as f32/255f32, 1.0-*transparency),
|
|
||||||
attributes:get_attributes(&object.name,*can_collide,Planar64Vec3::try_from([velocity.x,velocity.y,velocity.z]).unwrap(),force_intersecting),
|
|
||||||
temp_indexing:temp_indexing_attributes,
|
|
||||||
});
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
crate::model::IndexedModelInstances{
|
|
||||||
textures:asset_id_from_texture_id.iter().map(|t|t.to_string()).collect(),
|
|
||||||
models:indexed_models,
|
|
||||||
spawn_point,
|
|
||||||
modes:Vec::new(),
|
|
||||||
}
|
|
||||||
}
|
|
95
src/luau.rs
95
src/luau.rs
@ -1,95 +0,0 @@
|
|||||||
use mlua::{Lua as Luau, Result};
|
|
||||||
use glam::{Vec2, Vec3, Vec4, Quat};
|
|
||||||
use color_print::cprintln;
|
|
||||||
|
|
||||||
const STRAFE_VERSION: &str = env!("CARGO_PKG_VERSION");
|
|
||||||
|
|
||||||
struct StrafeluaGlobals {
|
|
||||||
vm: Luau,
|
|
||||||
}
|
|
||||||
trait Luavm {
|
|
||||||
fn new_vm(isolated: bool) -> StrafeluaGlobals {
|
|
||||||
let vm = Luau::new();
|
|
||||||
vm.sandbox(isolated).unwrap();
|
|
||||||
if isolated {
|
|
||||||
//Prevent bad actors
|
|
||||||
vm.globals().set("getfenv", mlua::Nil).unwrap(); //Deprecated in Luau but not removed *yet*
|
|
||||||
vm.globals().set("setfenv", mlua::Nil).unwrap(); //same with this
|
|
||||||
vm.globals().set("loadstring", mlua::Nil).unwrap();
|
|
||||||
};
|
|
||||||
|
|
||||||
let luau_version: String = vm.globals().get("_VERSION").unwrap();
|
|
||||||
vm.globals().set("_VERSION", format!("StrafeLuau {}, {}", STRAFE_VERSION, luau_version)).unwrap();
|
|
||||||
|
|
||||||
StrafeluaGlobals {vm}
|
|
||||||
}
|
|
||||||
|
|
||||||
fn warn(&self) -> mlua::Function;
|
|
||||||
fn vector(&self) -> mlua::Table;
|
|
||||||
}
|
|
||||||
|
|
||||||
impl Luavm for StrafeluaGlobals {
|
|
||||||
//Debug stuff
|
|
||||||
fn warn(&self) -> mlua::Function {
|
|
||||||
return self.vm.create_function(|_, message: mlua::String| {
|
|
||||||
match Some(message) {
|
|
||||||
Some(lua_string) => cprintln!("<yellow>{}</yellow>", lua_string.to_str().unwrap()),
|
|
||||||
None => println!("Nothing provided to warn"),
|
|
||||||
};
|
|
||||||
Ok(())
|
|
||||||
}).unwrap();
|
|
||||||
}
|
|
||||||
|
|
||||||
fn vector(&self) -> mlua::Table {
|
|
||||||
let field_vector = self.vm.create_table().unwrap();
|
|
||||||
|
|
||||||
field_vector.set("new", self.vm.create_function(|this: &Luau, (x,y,z,w): (Option<mlua::Number>, Option<mlua::Number>, Option<mlua::Number>, Option<mlua::Number>)| {
|
|
||||||
let vector = this.create_table().unwrap();
|
|
||||||
vector.set("x", x.unwrap_or(0.0)).unwrap();
|
|
||||||
vector.set("y", y.unwrap_or(0.0)).unwrap();
|
|
||||||
vector.set("z", z.unwrap_or(0.0)).unwrap();
|
|
||||||
vector.set("w", w.unwrap_or(0.0)).unwrap();
|
|
||||||
Ok(vector)
|
|
||||||
}).unwrap()).unwrap();
|
|
||||||
|
|
||||||
let vector_one2 = self.vm.create_table().unwrap();
|
|
||||||
vector_one2.set("x", 1.0).unwrap();
|
|
||||||
vector_one2.set("y", 1.0).unwrap();
|
|
||||||
vector_one2.set("z", 0.0).unwrap();
|
|
||||||
vector_one2.set("w", 0.0).unwrap();
|
|
||||||
field_vector.set("one2", vector_one2).unwrap();
|
|
||||||
|
|
||||||
let vector_one3 = self.vm.create_table().unwrap();
|
|
||||||
vector_one3.set("x", 1.0).unwrap();
|
|
||||||
vector_one3.set("y", 1.0).unwrap();
|
|
||||||
vector_one3.set("z", 1.0).unwrap();
|
|
||||||
vector_one3.set("w", 0.0).unwrap();
|
|
||||||
field_vector.set("one3", vector_one3).unwrap();
|
|
||||||
|
|
||||||
let vector_one4 = self.vm.create_table().unwrap();
|
|
||||||
vector_one4.set("x", 1.0).unwrap();
|
|
||||||
vector_one4.set("y", 1.0).unwrap();
|
|
||||||
vector_one4.set("z", 1.0).unwrap();
|
|
||||||
vector_one4.set("w", 1.0).unwrap();
|
|
||||||
field_vector.set("one4", vector_one4).unwrap();
|
|
||||||
|
|
||||||
return field_vector
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Prevent strafe client from panicking when there is a Lua error related to syntax or anything else Lua related
|
|
||||||
pub fn error_wrapper(execute_result: Result<()>) {
|
|
||||||
match execute_result {
|
|
||||||
Ok(t) => t,
|
|
||||||
Err(e) => cprintln!("[StrafeLua ERROR]: <red>{}</red>", e),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn new_state(isolated: bool) -> Result<Luau> {
|
|
||||||
let strafelua = StrafeluaGlobals::new_vm(isolated);
|
|
||||||
|
|
||||||
strafelua.vm.globals().set("warn", strafelua.warn()).unwrap();
|
|
||||||
strafelua.vm.globals().set("Vector", strafelua.vector()).unwrap();
|
|
||||||
|
|
||||||
Ok(strafelua.vm)
|
|
||||||
}
|
|
133
src/main.rs
133
src/main.rs
@ -1,19 +1,10 @@
|
|||||||
mod bvh;
|
mod file;
|
||||||
mod aabb;
|
|
||||||
mod luau;
|
|
||||||
mod model;
|
|
||||||
mod setup;
|
mod setup;
|
||||||
mod window;
|
mod window;
|
||||||
mod worker;
|
mod worker;
|
||||||
mod zeroes;
|
|
||||||
mod integer;
|
|
||||||
mod physics;
|
mod physics;
|
||||||
mod graphics;
|
mod graphics;
|
||||||
mod settings;
|
mod settings;
|
||||||
mod primitives;
|
|
||||||
mod instruction;
|
|
||||||
mod load_bsp;
|
|
||||||
mod load_roblox;
|
|
||||||
mod face_crawler;
|
mod face_crawler;
|
||||||
mod compat_worker;
|
mod compat_worker;
|
||||||
mod model_physics;
|
mod model_physics;
|
||||||
@ -21,128 +12,6 @@ mod model_graphics;
|
|||||||
mod physics_worker;
|
mod physics_worker;
|
||||||
mod graphics_worker;
|
mod graphics_worker;
|
||||||
|
|
||||||
fn load_file(path: std::path::PathBuf)->Option<model::IndexedModelInstances>{
|
|
||||||
println!("Loading file: {:?}", &path);
|
|
||||||
//oh boy! let's load the map!
|
|
||||||
if let Ok(file)=std::fs::File::open(path){
|
|
||||||
let mut input = std::io::BufReader::new(file);
|
|
||||||
let mut first_8=[0u8;8];
|
|
||||||
//.rbxm roblox binary = "<roblox!"
|
|
||||||
//.rbxmx roblox xml = "<roblox "
|
|
||||||
//.bsp = "VBSP"
|
|
||||||
//.vmf =
|
|
||||||
//.snf = "SNMF"
|
|
||||||
//.snf = "SNBF"
|
|
||||||
if let (Ok(()),Ok(()))=(std::io::Read::read_exact(&mut input, &mut first_8),std::io::Seek::rewind(&mut input)){
|
|
||||||
match &first_8[0..4]{
|
|
||||||
b"<rob"=>{
|
|
||||||
match match &first_8[4..8]{
|
|
||||||
b"lox!"=>rbx_binary::from_reader(input).map_err(|e|format!("{:?}",e)),
|
|
||||||
b"lox "=>rbx_xml::from_reader(input,rbx_xml::DecodeOptions::default()).map_err(|e|format!("{:?}",e)),
|
|
||||||
other=>Err(format!("Unknown Roblox file type {:?}",other)),
|
|
||||||
}{
|
|
||||||
Ok(dom)=>Some(load_roblox::generate_indexed_models(dom)),
|
|
||||||
Err(e)=>{
|
|
||||||
println!("Error loading roblox file:{:?}",e);
|
|
||||||
None
|
|
||||||
},
|
|
||||||
}
|
|
||||||
},
|
|
||||||
b"VBSP"=>load_bsp::generate_indexed_models(&mut input).ok(),
|
|
||||||
//b"SNFM"=>Some(sniffer::generate_indexed_models(input)),
|
|
||||||
//b"SNFB"=>Some(sniffer::load_bot(input)),
|
|
||||||
other=>{
|
|
||||||
println!("loser file {:?}",other);
|
|
||||||
None
|
|
||||||
},
|
|
||||||
}
|
|
||||||
}else{
|
|
||||||
println!("Failed to read first 8 bytes and seek back to beginning of file.");
|
|
||||||
None
|
|
||||||
}
|
|
||||||
}else{
|
|
||||||
println!("Could not open file");
|
|
||||||
None
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn default_models()->model::IndexedModelInstances{
|
|
||||||
let mut indexed_models = Vec::new();
|
|
||||||
indexed_models.push(primitives::unit_sphere());
|
|
||||||
indexed_models.push(primitives::unit_cylinder());
|
|
||||||
indexed_models.push(primitives::unit_cube());
|
|
||||||
println!("models.len = {:?}", indexed_models.len());
|
|
||||||
//quad monkeys
|
|
||||||
indexed_models[0].instances.push(model::ModelInstance{
|
|
||||||
transform:integer::Planar64Affine3::try_from(glam::Affine3A::from_translation(glam::vec3(10.,5.,10.))).unwrap(),
|
|
||||||
..Default::default()
|
|
||||||
});
|
|
||||||
indexed_models[0].instances.push(model::ModelInstance{
|
|
||||||
transform:integer::Planar64Affine3::try_from(glam::Affine3A::from_translation(glam::vec3(20.,5.,10.))).unwrap(),
|
|
||||||
color:glam::vec4(1.0,0.0,0.0,1.0),
|
|
||||||
..Default::default()
|
|
||||||
});
|
|
||||||
indexed_models[0].instances.push(model::ModelInstance{
|
|
||||||
transform:integer::Planar64Affine3::try_from(glam::Affine3A::from_translation(glam::vec3(10.,5.,20.))).unwrap(),
|
|
||||||
color:glam::vec4(0.0,1.0,0.0,1.0),
|
|
||||||
..Default::default()
|
|
||||||
});
|
|
||||||
indexed_models[0].instances.push(model::ModelInstance{
|
|
||||||
transform:integer::Planar64Affine3::try_from(glam::Affine3A::from_translation(glam::vec3(20.,5.,20.))).unwrap(),
|
|
||||||
color:glam::vec4(0.0,0.0,1.0,1.0),
|
|
||||||
..Default::default()
|
|
||||||
});
|
|
||||||
//decorative monkey
|
|
||||||
indexed_models[0].instances.push(model::ModelInstance{
|
|
||||||
transform:integer::Planar64Affine3::try_from(glam::Affine3A::from_translation(glam::vec3(15.,10.,15.))).unwrap(),
|
|
||||||
color:glam::vec4(0.5,0.5,0.5,0.5),
|
|
||||||
attributes:model::CollisionAttributes::Decoration,
|
|
||||||
..Default::default()
|
|
||||||
});
|
|
||||||
//teapot
|
|
||||||
indexed_models[1].instances.push(model::ModelInstance{
|
|
||||||
transform:integer::Planar64Affine3::try_from(glam::Affine3A::from_scale_rotation_translation(glam::vec3(0.5, 1.0, 0.2),glam::quat(-0.22248298016985793,-0.839457167990537,-0.05603504040830783,-0.49261857546227916),glam::vec3(-10.,7.,10.))).unwrap(),
|
|
||||||
..Default::default()
|
|
||||||
});
|
|
||||||
//ground
|
|
||||||
indexed_models[2].instances.push(model::ModelInstance{
|
|
||||||
transform:integer::Planar64Affine3::try_from(glam::Affine3A::from_translation(glam::vec3(0.,0.,0.))*glam::Affine3A::from_scale(glam::vec3(160.0, 1.0, 160.0))).unwrap(),
|
|
||||||
..Default::default()
|
|
||||||
});
|
|
||||||
model::IndexedModelInstances{
|
|
||||||
textures:Vec::new(),
|
|
||||||
models:indexed_models,
|
|
||||||
spawn_point:integer::Planar64Vec3::Y*50,
|
|
||||||
modes:Vec::new(),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
fn main(){
|
fn main(){
|
||||||
let strafelua_vm = luau::new_state(true).expect("Failed to load strafe lua");
|
|
||||||
luau::error_wrapper(strafelua_vm.load(r#"
|
|
||||||
local vec2 = Vector.new(1,2)
|
|
||||||
local vec3 = Vector.new(1,2,3)
|
|
||||||
local vec4 = Vector.new(1,2,3,4)
|
|
||||||
|
|
||||||
local function InspectVectorTable(Vector: {[string]: number})
|
|
||||||
local aye: {string} = {"{"}
|
|
||||||
for k,v in Vector do
|
|
||||||
table.insert(aye, `{tostring(k)}={tostring(v)}`)
|
|
||||||
end
|
|
||||||
table.insert(aye, "}")
|
|
||||||
return table.concat(aye, " ")
|
|
||||||
end
|
|
||||||
|
|
||||||
print("----StrafeLua----")
|
|
||||||
warn(_VERSION)
|
|
||||||
print(`Vector.new = {InspectVectorTable(Vector.new())}`)
|
|
||||||
print(`vec2 = {InspectVectorTable(vec2)}`)
|
|
||||||
print(`vec3 = {InspectVectorTable(vec3)}`)
|
|
||||||
print(`vec4 = {InspectVectorTable(vec4)}`)
|
|
||||||
print("-----------------")
|
|
||||||
"#).exec());
|
|
||||||
//Lua syntax error!: SyntaxError { message: "[string \"src/main.rs:122:18\"]:7: Expected ')' (to close '(' at column 7), got ','", incomplete_input: false }
|
|
||||||
//we got our first lua syntax error, todo: make an error handler in luau.rs
|
|
||||||
|
|
||||||
setup::setup_and_start(format!("Strafe Client v{}",env!("CARGO_PKG_VERSION")));
|
setup::setup_and_start(format!("Strafe Client v{}",env!("CARGO_PKG_VERSION")));
|
||||||
}
|
}
|
||||||
|
321
src/model.rs
321
src/model.rs
@ -1,321 +0,0 @@
|
|||||||
use crate::integer::{Time,Planar64,Planar64Vec3,Planar64Affine3};
|
|
||||||
pub type TextureCoordinate=glam::Vec2;
|
|
||||||
pub type Color4=glam::Vec4;
|
|
||||||
#[derive(Clone,Hash,PartialEq,Eq)]
|
|
||||||
pub struct IndexedVertex{
|
|
||||||
pub pos:u32,
|
|
||||||
pub tex:u32,
|
|
||||||
pub normal:u32,
|
|
||||||
pub color:u32,
|
|
||||||
}
|
|
||||||
pub struct IndexedPolygon{
|
|
||||||
pub vertices:Vec<u32>,
|
|
||||||
}
|
|
||||||
pub struct IndexedGroup{
|
|
||||||
pub texture:Option<u32>,//RenderPattern? material/texture/shader/flat color
|
|
||||||
pub polys:Vec<IndexedPolygon>,
|
|
||||||
}
|
|
||||||
pub struct IndexedModel{
|
|
||||||
pub unique_pos:Vec<Planar64Vec3>,
|
|
||||||
pub unique_normal:Vec<Planar64Vec3>,
|
|
||||||
pub unique_tex:Vec<TextureCoordinate>,
|
|
||||||
pub unique_color:Vec<Color4>,
|
|
||||||
pub unique_vertices:Vec<IndexedVertex>,
|
|
||||||
pub groups: Vec<IndexedGroup>,
|
|
||||||
pub instances:Vec<ModelInstance>,
|
|
||||||
}
|
|
||||||
pub struct ModelInstance{
|
|
||||||
//pub id:u64,//this does not actually help with map fixes resimulating bots, they must always be resimulated
|
|
||||||
pub transform:Planar64Affine3,
|
|
||||||
pub color:Color4,//transparency is in here
|
|
||||||
pub attributes:CollisionAttributes,
|
|
||||||
pub temp_indexing:Vec<TempIndexedAttributes>,
|
|
||||||
}
|
|
||||||
impl std::default::Default for ModelInstance{
|
|
||||||
fn default() -> Self {
|
|
||||||
Self{
|
|
||||||
color:Color4::ONE,
|
|
||||||
transform:Default::default(),
|
|
||||||
attributes:Default::default(),
|
|
||||||
temp_indexing:Default::default(),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
pub struct IndexedModelInstances{
|
|
||||||
pub textures:Vec<String>,//RenderPattern
|
|
||||||
pub models:Vec<IndexedModel>,
|
|
||||||
//may make this into an object later.
|
|
||||||
pub modes:Vec<ModeDescription>,
|
|
||||||
pub spawn_point:Planar64Vec3,
|
|
||||||
}
|
|
||||||
//stage description referencing flattened ids is spooky, but the map loading is meant to be deterministic.
|
|
||||||
pub struct ModeDescription{
|
|
||||||
//TODO: put "default" style modifiers in mode
|
|
||||||
//pub style:StyleModifiers,
|
|
||||||
pub start:usize,//start=model_id
|
|
||||||
pub spawns:Vec<usize>,//spawns[spawn_id]=model_id
|
|
||||||
pub spawn_from_stage_id:std::collections::HashMap::<u32,usize>,
|
|
||||||
pub ordered_checkpoint_from_checkpoint_id:std::collections::HashMap::<u32,usize>,
|
|
||||||
}
|
|
||||||
impl ModeDescription{
|
|
||||||
pub fn get_spawn_model_id(&self,stage_id:u32)->Option<&usize>{
|
|
||||||
self.spawns.get(*self.spawn_from_stage_id.get(&stage_id)?)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
//I don't want this code to exist!
|
|
||||||
#[derive(Clone)]
|
|
||||||
pub struct TempAttrStart{
|
|
||||||
pub mode_id:u32,
|
|
||||||
}
|
|
||||||
#[derive(Clone)]
|
|
||||||
pub struct TempAttrSpawn{
|
|
||||||
pub mode_id:u32,
|
|
||||||
pub stage_id:u32,
|
|
||||||
}
|
|
||||||
#[derive(Clone)]
|
|
||||||
pub struct TempAttrWormhole{
|
|
||||||
pub wormhole_id:u32,
|
|
||||||
}
|
|
||||||
pub enum TempIndexedAttributes{
|
|
||||||
Start(TempAttrStart),
|
|
||||||
Spawn(TempAttrSpawn),
|
|
||||||
Wormhole(TempAttrWormhole),
|
|
||||||
}
|
|
||||||
|
|
||||||
//you have this effect while in contact
|
|
||||||
#[derive(Clone,Hash,Eq,PartialEq)]
|
|
||||||
pub struct ContactingLadder{
|
|
||||||
pub sticky:bool
|
|
||||||
}
|
|
||||||
#[derive(Clone,Hash,Eq,PartialEq)]
|
|
||||||
pub enum ContactingBehaviour{
|
|
||||||
Surf,
|
|
||||||
Cling,//usable as a zipline, or other weird and wonderful things
|
|
||||||
Ladder(ContactingLadder),
|
|
||||||
Elastic(u32),//[1/2^32,1] 0=None (elasticity+1)/2^32
|
|
||||||
}
|
|
||||||
//you have this effect while intersecting
|
|
||||||
#[derive(Clone,Hash,Eq,PartialEq)]
|
|
||||||
pub struct IntersectingWater{
|
|
||||||
pub viscosity:Planar64,
|
|
||||||
pub density:Planar64,
|
|
||||||
pub velocity:Planar64Vec3,
|
|
||||||
}
|
|
||||||
//All models can be given these attributes
|
|
||||||
#[derive(Clone,Hash,Eq,PartialEq)]
|
|
||||||
pub struct GameMechanicAccelerator{
|
|
||||||
pub acceleration:Planar64Vec3
|
|
||||||
}
|
|
||||||
#[derive(Clone,Hash,Eq,PartialEq)]
|
|
||||||
pub enum GameMechanicBooster{
|
|
||||||
Affine(Planar64Affine3),//capable of SetVelocity,DotVelocity,normal booster,bouncy part,redirect velocity, and much more
|
|
||||||
Velocity(Planar64Vec3),//straight up boost velocity adds to your current velocity
|
|
||||||
Energy{direction:Planar64Vec3,energy:Planar64},//increase energy in direction
|
|
||||||
}
|
|
||||||
#[derive(Clone,Hash,Eq,PartialEq)]
|
|
||||||
pub enum TrajectoryChoice{
|
|
||||||
HighArcLongDuration,//underhand lob at target: less horizontal speed and more air time
|
|
||||||
LowArcShortDuration,//overhand throw at target: more horizontal speed and less air time
|
|
||||||
}
|
|
||||||
#[derive(Clone,Hash,Eq,PartialEq)]
|
|
||||||
pub enum GameMechanicSetTrajectory{
|
|
||||||
//Speed-type SetTrajectory
|
|
||||||
AirTime(Time),//air time (relative to gravity direction) is invariant across mass and gravity changes
|
|
||||||
Height(Planar64),//boost height (relative to gravity direction) is invariant across mass and gravity changes
|
|
||||||
DotVelocity{direction:Planar64Vec3,dot:Planar64},//set your velocity in a specific direction without touching other directions
|
|
||||||
//Velocity-type SetTrajectory
|
|
||||||
TargetPointTime{//launch on a trajectory that will land at a target point in a set amount of time
|
|
||||||
target_point:Planar64Vec3,
|
|
||||||
time:Time,//short time = fast and direct, long time = launch high in the air, negative time = wrong way
|
|
||||||
},
|
|
||||||
TargetPointSpeed{//launch at a fixed speed and land at a target point
|
|
||||||
target_point:Planar64Vec3,
|
|
||||||
speed:Planar64,//if speed is too low this will fail to reach the target. The closest-passing trajectory will be chosen instead
|
|
||||||
trajectory_choice:TrajectoryChoice,
|
|
||||||
},
|
|
||||||
Velocity(Planar64Vec3),//SetVelocity
|
|
||||||
}
|
|
||||||
impl GameMechanicSetTrajectory{
|
|
||||||
fn is_velocity(&self)->bool{
|
|
||||||
match self{
|
|
||||||
GameMechanicSetTrajectory::AirTime(_)
|
|
||||||
|GameMechanicSetTrajectory::Height(_)
|
|
||||||
|GameMechanicSetTrajectory::DotVelocity{direction:_,dot:_}=>false,
|
|
||||||
GameMechanicSetTrajectory::TargetPointTime{target_point:_,time:_}
|
|
||||||
|GameMechanicSetTrajectory::TargetPointSpeed{target_point:_,speed:_,trajectory_choice:_}
|
|
||||||
|GameMechanicSetTrajectory::Velocity(_)=>true,
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
#[derive(Clone,Hash,Eq,PartialEq)]
|
|
||||||
pub enum ZoneBehaviour{
|
|
||||||
//Start is indexed
|
|
||||||
//Checkpoints are indexed
|
|
||||||
Finish,
|
|
||||||
Anitcheat,
|
|
||||||
}
|
|
||||||
#[derive(Clone,Hash,Eq,PartialEq)]
|
|
||||||
pub struct GameMechanicZone{
|
|
||||||
pub mode_id:u32,
|
|
||||||
pub behaviour:ZoneBehaviour,
|
|
||||||
}
|
|
||||||
// enum TrapCondition{
|
|
||||||
// FasterThan(Planar64),
|
|
||||||
// SlowerThan(Planar64),
|
|
||||||
// InRange(Planar64,Planar64),
|
|
||||||
// OutsideRange(Planar64,Planar64),
|
|
||||||
// }
|
|
||||||
#[derive(Clone,Hash,Eq,PartialEq)]
|
|
||||||
pub enum StageElementBehaviour{
|
|
||||||
//Spawn,//The behaviour of stepping on a spawn setting the spawnid
|
|
||||||
SpawnAt,//must be standing on top to get effect. except cancollide false
|
|
||||||
Trigger,
|
|
||||||
Teleport,
|
|
||||||
Platform,
|
|
||||||
//Checkpoint acts like a trigger if you haven't hit all the checkpoints yet.
|
|
||||||
//Note that all stage elements act like this for the next stage.
|
|
||||||
Checkpoint,
|
|
||||||
//OrderedCheckpoint. You must pass through all of these in ascending order.
|
|
||||||
//If you hit them out of order it acts like a trigger.
|
|
||||||
//Do not support backtracking at all for now.
|
|
||||||
Ordered{
|
|
||||||
checkpoint_id:u32,
|
|
||||||
},
|
|
||||||
//UnorderedCheckpoint. You must pass through all of these in any order.
|
|
||||||
Unordered,
|
|
||||||
//If you get reset by a jump limit
|
|
||||||
JumpLimit(u32),
|
|
||||||
//Speedtrap(TrapCondition),//Acts as a trigger with a speed condition
|
|
||||||
}
|
|
||||||
#[derive(Clone,Hash,Eq,PartialEq)]
|
|
||||||
pub struct GameMechanicStageElement{
|
|
||||||
pub mode_id:u32,
|
|
||||||
pub stage_id:u32,//which spawn to send to
|
|
||||||
pub force:bool,//allow setting to lower spawn id i.e. 7->3
|
|
||||||
pub behaviour:StageElementBehaviour
|
|
||||||
}
|
|
||||||
#[derive(Clone,Hash,Eq,PartialEq)]
|
|
||||||
pub struct GameMechanicWormhole{
|
|
||||||
//destination does not need to be another wormhole
|
|
||||||
//this defines a one way portal to a destination model transform
|
|
||||||
//two of these can create a two way wormhole
|
|
||||||
pub destination_model_id:u32,
|
|
||||||
//(position,angles)*=origin.transform.inverse()*destination.transform
|
|
||||||
}
|
|
||||||
#[derive(Clone,Hash,Eq,PartialEq)]
|
|
||||||
pub enum TeleportBehaviour{
|
|
||||||
StageElement(GameMechanicStageElement),
|
|
||||||
Wormhole(GameMechanicWormhole),
|
|
||||||
}
|
|
||||||
//attributes listed in order of handling
|
|
||||||
#[derive(Default,Clone,Hash,Eq,PartialEq)]
|
|
||||||
pub struct GameMechanicAttributes{
|
|
||||||
pub zone:Option<GameMechanicZone>,
|
|
||||||
pub booster:Option<GameMechanicBooster>,
|
|
||||||
pub trajectory:Option<GameMechanicSetTrajectory>,
|
|
||||||
pub teleport_behaviour:Option<TeleportBehaviour>,
|
|
||||||
pub accelerator:Option<GameMechanicAccelerator>,
|
|
||||||
}
|
|
||||||
impl GameMechanicAttributes{
|
|
||||||
pub fn any(&self)->bool{
|
|
||||||
self.zone.is_some()
|
|
||||||
||self.booster.is_some()
|
|
||||||
||self.trajectory.is_some()
|
|
||||||
||self.teleport_behaviour.is_some()
|
|
||||||
||self.accelerator.is_some()
|
|
||||||
}
|
|
||||||
pub fn is_wrcp(&self,current_mode_id:u32)->bool{
|
|
||||||
self.trajectory.as_ref().map_or(false,|t|t.is_velocity())
|
|
||||||
&&match &self.teleport_behaviour{
|
|
||||||
Some(TeleportBehaviour::StageElement(
|
|
||||||
GameMechanicStageElement{
|
|
||||||
mode_id,
|
|
||||||
stage_id:_,
|
|
||||||
force:true,
|
|
||||||
behaviour:StageElementBehaviour::Trigger|StageElementBehaviour::Teleport
|
|
||||||
}
|
|
||||||
))=>current_mode_id==*mode_id,
|
|
||||||
_=>false,
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
#[derive(Default,Clone,Hash,Eq,PartialEq)]
|
|
||||||
pub struct ContactingAttributes{
|
|
||||||
//friction?
|
|
||||||
pub contact_behaviour:Option<ContactingBehaviour>,
|
|
||||||
}
|
|
||||||
impl ContactingAttributes{
|
|
||||||
pub fn any(&self)->bool{
|
|
||||||
self.contact_behaviour.is_some()
|
|
||||||
}
|
|
||||||
}
|
|
||||||
#[derive(Default,Clone,Hash,Eq,PartialEq)]
|
|
||||||
pub struct IntersectingAttributes{
|
|
||||||
pub water:Option<IntersectingWater>,
|
|
||||||
}
|
|
||||||
impl IntersectingAttributes{
|
|
||||||
pub fn any(&self)->bool{
|
|
||||||
self.water.is_some()
|
|
||||||
}
|
|
||||||
}
|
|
||||||
//Spawn(u32) NO! spawns are indexed in the map header instead of marked with attibutes
|
|
||||||
pub enum CollisionAttributes{
|
|
||||||
Decoration,//visual only
|
|
||||||
Contact{//track whether you are contacting the object
|
|
||||||
contacting:ContactingAttributes,
|
|
||||||
general:GameMechanicAttributes,
|
|
||||||
},
|
|
||||||
Intersect{//track whether you are intersecting the object
|
|
||||||
intersecting:IntersectingAttributes,
|
|
||||||
general:GameMechanicAttributes,
|
|
||||||
},
|
|
||||||
}
|
|
||||||
impl std::default::Default for CollisionAttributes{
|
|
||||||
fn default() -> Self {
|
|
||||||
Self::Contact{
|
|
||||||
contacting:ContactingAttributes::default(),
|
|
||||||
general:GameMechanicAttributes::default()
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn generate_indexed_model_list_from_obj(data:obj::ObjData,color:Color4)->Vec<IndexedModel>{
|
|
||||||
let mut unique_vertex_index = std::collections::HashMap::<obj::IndexTuple,u32>::new();
|
|
||||||
return data.objects.iter().map(|object|{
|
|
||||||
unique_vertex_index.clear();
|
|
||||||
let mut unique_vertices = Vec::new();
|
|
||||||
let groups = object.groups.iter().map(|group|{
|
|
||||||
IndexedGroup{
|
|
||||||
texture:None,
|
|
||||||
polys:group.polys.iter().map(|poly|{
|
|
||||||
IndexedPolygon{
|
|
||||||
vertices:poly.0.iter().map(|&tup|{
|
|
||||||
if let Some(&i)=unique_vertex_index.get(&tup){
|
|
||||||
i
|
|
||||||
}else{
|
|
||||||
let i=unique_vertices.len() as u32;
|
|
||||||
unique_vertices.push(IndexedVertex{
|
|
||||||
pos: tup.0 as u32,
|
|
||||||
tex: tup.1.unwrap() as u32,
|
|
||||||
normal: tup.2.unwrap() as u32,
|
|
||||||
color: 0,
|
|
||||||
});
|
|
||||||
unique_vertex_index.insert(tup,i);
|
|
||||||
i
|
|
||||||
}
|
|
||||||
}).collect()
|
|
||||||
}
|
|
||||||
}).collect()
|
|
||||||
}
|
|
||||||
}).collect();
|
|
||||||
IndexedModel{
|
|
||||||
unique_pos: data.position.iter().map(|&v|Planar64Vec3::try_from(v).unwrap()).collect(),
|
|
||||||
unique_tex: data.texture.iter().map(|&v|TextureCoordinate::from_array(v)).collect(),
|
|
||||||
unique_normal: data.normal.iter().map(|&v|Planar64Vec3::try_from(v).unwrap()).collect(),
|
|
||||||
unique_color: vec![color],
|
|
||||||
unique_vertices,
|
|
||||||
groups,
|
|
||||||
instances:Vec::new(),
|
|
||||||
}
|
|
||||||
}).collect()
|
|
||||||
}
|
|
@ -1,50 +1,39 @@
|
|||||||
use bytemuck::{Pod, Zeroable};
|
use bytemuck::{Pod,Zeroable};
|
||||||
use crate::model::{IndexedVertex,IndexedPolygon};
|
use strafesnet_common::model::{IndexedVertex,PolygonGroup,RenderConfigId};
|
||||||
#[derive(Clone, Copy, Pod, Zeroable)]
|
#[derive(Clone,Copy,Pod,Zeroable)]
|
||||||
#[repr(C)]
|
#[repr(C)]
|
||||||
pub struct GraphicsVertex {
|
pub struct GraphicsVertex{
|
||||||
pub pos: [f32; 3],
|
pub pos:[f32;3],
|
||||||
pub tex: [f32; 2],
|
pub tex:[f32;2],
|
||||||
pub normal: [f32; 3],
|
pub normal:[f32;3],
|
||||||
pub color: [f32; 4],
|
pub color:[f32;4],
|
||||||
}
|
}
|
||||||
pub struct IndexedGroupFixedTexture{
|
#[derive(Clone,Copy,id::Id)]
|
||||||
pub polys:Vec<IndexedPolygon>,
|
pub struct IndexedGraphicsMeshOwnedRenderConfigId(u32);
|
||||||
}
|
pub struct IndexedGraphicsMeshOwnedRenderConfig{
|
||||||
pub struct IndexedGraphicsModelSingleTexture{
|
pub unique_pos:Vec<[f32;3]>,
|
||||||
pub unique_pos:Vec<[f32; 3]>,
|
pub unique_tex:Vec<[f32;2]>,
|
||||||
pub unique_tex:Vec<[f32; 2]>,
|
pub unique_normal:Vec<[f32;3]>,
|
||||||
pub unique_normal:Vec<[f32; 3]>,
|
pub unique_color:Vec<[f32;4]>,
|
||||||
pub unique_color:Vec<[f32; 4]>,
|
|
||||||
pub unique_vertices:Vec<IndexedVertex>,
|
pub unique_vertices:Vec<IndexedVertex>,
|
||||||
pub texture:Option<u32>,//RenderPattern? material/texture/shader/flat color
|
pub render_config:RenderConfigId,
|
||||||
pub groups: Vec<IndexedGroupFixedTexture>,
|
pub polys:PolygonGroup,
|
||||||
pub instances:Vec<GraphicsModelInstance>,
|
pub instances:Vec<GraphicsModelOwned>,
|
||||||
}
|
}
|
||||||
pub enum Entities{
|
pub enum Indices{
|
||||||
U32(Vec<Vec<u32>>),
|
U32(Vec<u32>),
|
||||||
U16(Vec<Vec<u16>>),
|
U16(Vec<u16>),
|
||||||
}
|
}
|
||||||
pub struct GraphicsModelSingleTexture{
|
pub struct GraphicsMeshOwnedRenderConfig{
|
||||||
pub instances:Vec<GraphicsModelInstance>,
|
|
||||||
pub vertices:Vec<GraphicsVertex>,
|
pub vertices:Vec<GraphicsVertex>,
|
||||||
pub entities:Entities,
|
pub indices:Indices,
|
||||||
pub texture:Option<u32>,
|
pub render_config:RenderConfigId,
|
||||||
|
pub instances:Vec<GraphicsModelOwned>,
|
||||||
}
|
}
|
||||||
#[derive(Clone,PartialEq)]
|
#[derive(Clone,Copy,PartialEq,id::Id)]
|
||||||
pub struct GraphicsModelColor4(glam::Vec4);
|
pub struct GraphicsModelColor4(glam::Vec4);
|
||||||
impl GraphicsModelColor4{
|
|
||||||
pub const fn get(&self)->glam::Vec4{
|
|
||||||
self.0
|
|
||||||
}
|
|
||||||
}
|
|
||||||
impl From<glam::Vec4> for GraphicsModelColor4{
|
|
||||||
fn from(value:glam::Vec4)->Self{
|
|
||||||
Self(value)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
impl std::hash::Hash for GraphicsModelColor4{
|
impl std::hash::Hash for GraphicsModelColor4{
|
||||||
fn hash<H: std::hash::Hasher>(&self,state:&mut H) {
|
fn hash<H:std::hash::Hasher>(&self,state:&mut H) {
|
||||||
for &f in self.0.as_ref(){
|
for &f in self.0.as_ref(){
|
||||||
bytemuck::cast::<f32,u32>(f).hash(state);
|
bytemuck::cast::<f32,u32>(f).hash(state);
|
||||||
}
|
}
|
||||||
@ -52,7 +41,7 @@ impl std::hash::Hash for GraphicsModelColor4{
|
|||||||
}
|
}
|
||||||
impl Eq for GraphicsModelColor4{}
|
impl Eq for GraphicsModelColor4{}
|
||||||
#[derive(Clone)]
|
#[derive(Clone)]
|
||||||
pub struct GraphicsModelInstance{
|
pub struct GraphicsModelOwned{
|
||||||
pub transform:glam::Mat4,
|
pub transform:glam::Mat4,
|
||||||
pub normal_transform:glam::Mat3,
|
pub normal_transform:glam::Mat3,
|
||||||
pub color:GraphicsModelColor4,
|
pub color:GraphicsModelColor4,
|
||||||
|
@ -1,22 +1,15 @@
|
|||||||
use crate::integer::{Planar64,Planar64Vec3};
|
|
||||||
use std::borrow::{Borrow,Cow};
|
use std::borrow::{Borrow,Cow};
|
||||||
|
use std::collections::{HashSet,HashMap};
|
||||||
|
use strafesnet_common::integer::vec3::Vector3;
|
||||||
|
use strafesnet_common::model::{self,MeshId,PolygonIter};
|
||||||
|
use strafesnet_common::integer::{self,vec3,Fixed,Planar64,Planar64Vec3,Ratio};
|
||||||
|
|
||||||
#[derive(Debug,Clone,Copy,Hash,Eq,PartialEq)]
|
|
||||||
pub struct VertId(usize);
|
|
||||||
#[derive(Debug,Clone,Copy,Hash,Eq,PartialEq)]
|
|
||||||
pub struct EdgeId(usize);
|
|
||||||
pub trait UndirectedEdge{
|
pub trait UndirectedEdge{
|
||||||
type DirectedEdge:Copy+DirectedEdge;
|
type DirectedEdge:Copy+DirectedEdge;
|
||||||
fn as_directed(&self,parity:bool)->Self::DirectedEdge;
|
fn as_directed(&self,parity:bool)->Self::DirectedEdge;
|
||||||
}
|
}
|
||||||
impl UndirectedEdge for EdgeId{
|
|
||||||
type DirectedEdge=DirectedEdgeId;
|
|
||||||
fn as_directed(&self,parity:bool)->DirectedEdgeId{
|
|
||||||
DirectedEdgeId(self.0|((parity as usize)<<(usize::BITS-1)))
|
|
||||||
}
|
|
||||||
}
|
|
||||||
pub trait DirectedEdge{
|
pub trait DirectedEdge{
|
||||||
type UndirectedEdge:Copy+UndirectedEdge;
|
type UndirectedEdge:Copy+std::fmt::Debug+UndirectedEdge;
|
||||||
fn as_undirected(&self)->Self::UndirectedEdge;
|
fn as_undirected(&self)->Self::UndirectedEdge;
|
||||||
fn parity(&self)->bool;
|
fn parity(&self)->bool;
|
||||||
//this is stupid but may work fine
|
//this is stupid but may work fine
|
||||||
@ -24,22 +17,40 @@ pub trait DirectedEdge{
|
|||||||
self.as_undirected().as_directed(!self.parity())
|
self.as_undirected().as_directed(!self.parity())
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#[derive(Debug,Clone,Copy,Hash,id::Id,Eq,PartialEq)]
|
||||||
|
pub struct MeshVertId(u32);
|
||||||
|
#[derive(Debug,Clone,Copy,Hash,id::Id,Eq,PartialEq)]
|
||||||
|
pub struct MeshFaceId(u32);
|
||||||
|
|
||||||
|
#[derive(Debug,Clone,Copy,Hash,id::Id,Eq,PartialEq)]
|
||||||
|
pub struct SubmeshVertId(u32);
|
||||||
|
#[derive(Debug,Clone,Copy,Hash,id::Id,Eq,PartialEq)]
|
||||||
|
pub struct SubmeshEdgeId(u32);
|
||||||
/// DirectedEdgeId refers to an EdgeId when undirected.
|
/// DirectedEdgeId refers to an EdgeId when undirected.
|
||||||
#[derive(Debug,Clone,Copy,Hash,Eq,PartialEq)]
|
#[derive(Debug,Clone,Copy,Hash,id::Id,Eq,PartialEq)]
|
||||||
pub struct DirectedEdgeId(usize);
|
pub struct SubmeshDirectedEdgeId(u32);
|
||||||
impl DirectedEdge for DirectedEdgeId{
|
#[derive(Debug,Clone,Copy,Hash,id::Id,Eq,PartialEq)]
|
||||||
type UndirectedEdge=EdgeId;
|
pub struct SubmeshFaceId(u32);
|
||||||
fn as_undirected(&self)->EdgeId{
|
|
||||||
EdgeId(self.0&!(1<<(usize::BITS-1)))
|
impl UndirectedEdge for SubmeshEdgeId{
|
||||||
}
|
type DirectedEdge=SubmeshDirectedEdgeId;
|
||||||
fn parity(&self)->bool{
|
fn as_directed(&self,parity:bool)->SubmeshDirectedEdgeId{
|
||||||
self.0&(1<<(usize::BITS-1))!=0
|
SubmeshDirectedEdgeId(self.0|((parity as u32)<<(u32::BITS-1)))
|
||||||
|
}
|
||||||
|
}
|
||||||
|
impl DirectedEdge for SubmeshDirectedEdgeId{
|
||||||
|
type UndirectedEdge=SubmeshEdgeId;
|
||||||
|
fn as_undirected(&self)->SubmeshEdgeId{
|
||||||
|
SubmeshEdgeId(self.0&!(1<<(u32::BITS-1)))
|
||||||
|
}
|
||||||
|
fn parity(&self)->bool{
|
||||||
|
self.0&(1<<(u32::BITS-1))!=0
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
#[derive(Debug,Clone,Copy,Hash,Eq,PartialEq)]
|
|
||||||
pub struct FaceId(usize);
|
|
||||||
|
|
||||||
//Vertex <-> Edge <-> Face -> Collide
|
//Vertex <-> Edge <-> Face -> Collide
|
||||||
|
#[derive(Debug)]
|
||||||
pub enum FEV<F,E:DirectedEdge,V>{
|
pub enum FEV<F,E:DirectedEdge,V>{
|
||||||
Face(F),
|
Face(F),
|
||||||
Edge(E::UndirectedEdge),
|
Edge(E::UndirectedEdge),
|
||||||
@ -47,12 +58,16 @@ pub enum FEV<F,E:DirectedEdge,V>{
|
|||||||
}
|
}
|
||||||
|
|
||||||
//use Unit32 #[repr(C)] for map files
|
//use Unit32 #[repr(C)] for map files
|
||||||
|
#[derive(Clone,Hash,Eq,PartialEq)]
|
||||||
struct Face{
|
struct Face{
|
||||||
normal:Planar64Vec3,
|
normal:Planar64Vec3,
|
||||||
dot:Planar64,
|
dot:Planar64,
|
||||||
}
|
}
|
||||||
struct Vert(Planar64Vec3);
|
struct Vert(Planar64Vec3);
|
||||||
pub trait MeshQuery<FACE:Clone,EDGE:Clone+DirectedEdge,VERT:Clone>{
|
pub trait MeshQuery<FACE:Clone,EDGE:Clone+DirectedEdge,VERT:Clone>{
|
||||||
|
// Vertex must be Planar64Vec3 because it represents an actual position
|
||||||
|
type Normal;
|
||||||
|
type Offset;
|
||||||
fn edge_n(&self,edge_id:EDGE::UndirectedEdge)->Planar64Vec3{
|
fn edge_n(&self,edge_id:EDGE::UndirectedEdge)->Planar64Vec3{
|
||||||
let verts=self.edge_verts(edge_id);
|
let verts=self.edge_verts(edge_id);
|
||||||
self.vert(verts[1].clone())-self.vert(verts[0].clone())
|
self.vert(verts[1].clone())-self.vert(verts[0].clone())
|
||||||
@ -62,7 +77,7 @@ pub trait MeshQuery<FACE:Clone,EDGE:Clone+DirectedEdge,VERT:Clone>{
|
|||||||
(self.vert(verts[1].clone())-self.vert(verts[0].clone()))*((directed_edge_id.parity() as i64)*2-1)
|
(self.vert(verts[1].clone())-self.vert(verts[0].clone()))*((directed_edge_id.parity() as i64)*2-1)
|
||||||
}
|
}
|
||||||
fn vert(&self,vert_id:VERT)->Planar64Vec3;
|
fn vert(&self,vert_id:VERT)->Planar64Vec3;
|
||||||
fn face_nd(&self,face_id:FACE)->(Planar64Vec3,Planar64);
|
fn face_nd(&self,face_id:FACE)->(Self::Normal,Self::Offset);
|
||||||
fn face_edges(&self,face_id:FACE)->Cow<Vec<EDGE>>;
|
fn face_edges(&self,face_id:FACE)->Cow<Vec<EDGE>>;
|
||||||
fn edge_faces(&self,edge_id:EDGE::UndirectedEdge)->Cow<[FACE;2]>;
|
fn edge_faces(&self,edge_id:EDGE::UndirectedEdge)->Cow<[FACE;2]>;
|
||||||
fn edge_verts(&self,edge_id:EDGE::UndirectedEdge)->Cow<[VERT;2]>;
|
fn edge_verts(&self,edge_id:EDGE::UndirectedEdge)->Cow<[VERT;2]>;
|
||||||
@ -70,34 +85,170 @@ pub trait MeshQuery<FACE:Clone,EDGE:Clone+DirectedEdge,VERT:Clone>{
|
|||||||
fn vert_faces(&self,vert_id:VERT)->Cow<Vec<FACE>>;
|
fn vert_faces(&self,vert_id:VERT)->Cow<Vec<FACE>>;
|
||||||
}
|
}
|
||||||
struct FaceRefs{
|
struct FaceRefs{
|
||||||
edges:Vec<DirectedEdgeId>,
|
edges:Vec<SubmeshDirectedEdgeId>,
|
||||||
//verts:Vec<VertId>,
|
//verts:Vec<VertId>,
|
||||||
}
|
}
|
||||||
struct EdgeRefs{
|
struct EdgeRefs{
|
||||||
faces:[FaceId;2],//left, right
|
faces:[SubmeshFaceId;2],//left, right
|
||||||
verts:[VertId;2],//bottom, top
|
verts:[SubmeshVertId;2],//bottom, top
|
||||||
}
|
}
|
||||||
struct VertRefs{
|
struct VertRefs{
|
||||||
faces:Vec<FaceId>,
|
faces:Vec<SubmeshFaceId>,
|
||||||
edges:Vec<DirectedEdgeId>,
|
edges:Vec<SubmeshDirectedEdgeId>,
|
||||||
}
|
}
|
||||||
pub struct PhysicsMesh{
|
pub struct PhysicsMeshData{
|
||||||
faces:Vec<Face>,
|
//this contains all real and virtual faces used in both the complete mesh and convex submeshes
|
||||||
verts:Vec<Vert>,
|
//faces are sorted such that all faces that belong to the complete mesh appear first, and then
|
||||||
|
//all remaining faces are virtual to operate internal logic of the face crawler
|
||||||
|
//and cannot be part of a physics collision
|
||||||
|
//virtual faces are only used in convex submeshes.
|
||||||
|
faces:Vec<Face>,//MeshFaceId indexes this list
|
||||||
|
verts:Vec<Vert>,//MeshVertId indexes this list
|
||||||
|
}
|
||||||
|
pub struct PhysicsMeshTopology{
|
||||||
|
//mapping of local ids to PhysicsMeshData ids
|
||||||
|
faces:Vec<MeshFaceId>,//SubmeshFaceId indexes this list
|
||||||
|
verts:Vec<MeshVertId>,//SubmeshVertId indexes this list
|
||||||
|
//all ids here are local to this object
|
||||||
face_topology:Vec<FaceRefs>,
|
face_topology:Vec<FaceRefs>,
|
||||||
edge_topology:Vec<EdgeRefs>,
|
edge_topology:Vec<EdgeRefs>,
|
||||||
vert_topology:Vec<VertRefs>,
|
vert_topology:Vec<VertRefs>,
|
||||||
}
|
}
|
||||||
|
#[derive(Clone,Copy,Hash,id::Id,Eq,PartialEq)]
|
||||||
|
pub struct PhysicsMeshId(u32);
|
||||||
|
impl Into<MeshId> for PhysicsMeshId{
|
||||||
|
fn into(self)->MeshId{
|
||||||
|
MeshId::new(self.0)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
impl From<MeshId> for PhysicsMeshId{
|
||||||
|
fn from(value:MeshId)->Self{
|
||||||
|
Self::new(value.get())
|
||||||
|
}
|
||||||
|
}
|
||||||
|
#[derive(Debug,Default,Clone,Copy,Hash,id::Id,Eq,PartialEq)]
|
||||||
|
pub struct PhysicsSubmeshId(u32);
|
||||||
|
pub struct PhysicsMesh{
|
||||||
|
data:PhysicsMeshData,
|
||||||
|
complete_mesh:PhysicsMeshTopology,
|
||||||
|
//Most objects in roblox maps are already convex, so the list length is 0
|
||||||
|
//as soon as the mesh is divided into 2 submeshes, the list length jumps to 2.
|
||||||
|
//length 1 is unnecessary since the complete mesh would be a duplicate of the only submesh, but would still function properly
|
||||||
|
submeshes:Vec<PhysicsMeshTopology>,
|
||||||
|
}
|
||||||
|
impl PhysicsMesh{
|
||||||
|
pub fn unit_cube()->Self{
|
||||||
|
//go go gadget debug print mesh
|
||||||
|
let data=PhysicsMeshData{
|
||||||
|
faces:vec![
|
||||||
|
Face{normal:vec3::raw_xyz( 4294967296, 0, 0),dot:Planar64::raw(4294967296)},
|
||||||
|
Face{normal:vec3::raw_xyz( 0, 4294967296, 0),dot:Planar64::raw(4294967296)},
|
||||||
|
Face{normal:vec3::raw_xyz( 0, 0, 4294967296),dot:Planar64::raw(4294967296)},
|
||||||
|
Face{normal:vec3::raw_xyz(-4294967296, 0, 0),dot:Planar64::raw(4294967296)},
|
||||||
|
Face{normal:vec3::raw_xyz( 0,-4294967296, 0),dot:Planar64::raw(4294967296)},
|
||||||
|
Face{normal:vec3::raw_xyz( 0, 0,-4294967296),dot:Planar64::raw(4294967296)}
|
||||||
|
],
|
||||||
|
verts:vec![
|
||||||
|
Vert(vec3::raw_xyz( 4294967296,-4294967296,-4294967296)),
|
||||||
|
Vert(vec3::raw_xyz( 4294967296, 4294967296,-4294967296)),
|
||||||
|
Vert(vec3::raw_xyz( 4294967296, 4294967296, 4294967296)),
|
||||||
|
Vert(vec3::raw_xyz( 4294967296,-4294967296, 4294967296)),
|
||||||
|
Vert(vec3::raw_xyz(-4294967296, 4294967296,-4294967296)),
|
||||||
|
Vert(vec3::raw_xyz(-4294967296, 4294967296, 4294967296)),
|
||||||
|
Vert(vec3::raw_xyz(-4294967296,-4294967296, 4294967296)),
|
||||||
|
Vert(vec3::raw_xyz(-4294967296,-4294967296,-4294967296))
|
||||||
|
]
|
||||||
|
};
|
||||||
|
let mesh_topology=PhysicsMeshTopology{
|
||||||
|
faces:(0..data.faces.len() as u32).map(MeshFaceId::new).collect(),
|
||||||
|
verts:(0..data.verts.len() as u32).map(MeshVertId::new).collect(),
|
||||||
|
face_topology:vec![
|
||||||
|
FaceRefs{edges:vec![SubmeshDirectedEdgeId((9223372036854775808u64-(1<<63)+(1<<31)) as u32),SubmeshDirectedEdgeId((9223372036854775809u64-(1<<63)+(1<<31)) as u32),SubmeshDirectedEdgeId((9223372036854775810u64-(1<<63)+(1<<31)) as u32),SubmeshDirectedEdgeId(3)]},
|
||||||
|
FaceRefs{edges:vec![SubmeshDirectedEdgeId((9223372036854775812u64-(1<<63)+(1<<31)) as u32),SubmeshDirectedEdgeId((9223372036854775813u64-(1<<63)+(1<<31)) as u32),SubmeshDirectedEdgeId(6),SubmeshDirectedEdgeId(1)]},
|
||||||
|
FaceRefs{edges:vec![SubmeshDirectedEdgeId(7),SubmeshDirectedEdgeId(2),SubmeshDirectedEdgeId((9223372036854775814u64-(1<<63)+(1<<31)) as u32),SubmeshDirectedEdgeId((9223372036854775816u64-(1<<63)+(1<<31)) as u32)]},
|
||||||
|
FaceRefs{edges:vec![SubmeshDirectedEdgeId(8),SubmeshDirectedEdgeId(5),SubmeshDirectedEdgeId((9223372036854775817u64-(1<<63)+(1<<31)) as u32),SubmeshDirectedEdgeId(10)]},
|
||||||
|
FaceRefs{edges:vec![SubmeshDirectedEdgeId((9223372036854775815u64-(1<<63)+(1<<31)) as u32),SubmeshDirectedEdgeId((9223372036854775818u64-(1<<63)+(1<<31)) as u32),SubmeshDirectedEdgeId(11),SubmeshDirectedEdgeId((9223372036854775811u64-(1<<63)+(1<<31)) as u32)]},
|
||||||
|
FaceRefs{edges:vec![SubmeshDirectedEdgeId(4),SubmeshDirectedEdgeId(0),SubmeshDirectedEdgeId((9223372036854775819u64-(1<<63)+(1<<31)) as u32),SubmeshDirectedEdgeId(9)]}
|
||||||
|
],
|
||||||
|
edge_topology:vec![
|
||||||
|
EdgeRefs{faces:[SubmeshFaceId(0),SubmeshFaceId(5)],verts:[SubmeshVertId(0),SubmeshVertId(1)]},
|
||||||
|
EdgeRefs{faces:[SubmeshFaceId(0),SubmeshFaceId(1)],verts:[SubmeshVertId(1),SubmeshVertId(2)]},
|
||||||
|
EdgeRefs{faces:[SubmeshFaceId(0),SubmeshFaceId(2)],verts:[SubmeshVertId(2),SubmeshVertId(3)]},
|
||||||
|
EdgeRefs{faces:[SubmeshFaceId(4),SubmeshFaceId(0)],verts:[SubmeshVertId(0),SubmeshVertId(3)]},
|
||||||
|
EdgeRefs{faces:[SubmeshFaceId(1),SubmeshFaceId(5)],verts:[SubmeshVertId(1),SubmeshVertId(4)]},
|
||||||
|
EdgeRefs{faces:[SubmeshFaceId(1),SubmeshFaceId(3)],verts:[SubmeshVertId(4),SubmeshVertId(5)]},
|
||||||
|
EdgeRefs{faces:[SubmeshFaceId(2),SubmeshFaceId(1)],verts:[SubmeshVertId(2),SubmeshVertId(5)]},
|
||||||
|
EdgeRefs{faces:[SubmeshFaceId(4),SubmeshFaceId(2)],verts:[SubmeshVertId(3),SubmeshVertId(6)]},
|
||||||
|
EdgeRefs{faces:[SubmeshFaceId(2),SubmeshFaceId(3)],verts:[SubmeshVertId(5),SubmeshVertId(6)]},
|
||||||
|
EdgeRefs{faces:[SubmeshFaceId(3),SubmeshFaceId(5)],verts:[SubmeshVertId(4),SubmeshVertId(7)]},
|
||||||
|
EdgeRefs{faces:[SubmeshFaceId(4),SubmeshFaceId(3)],verts:[SubmeshVertId(6),SubmeshVertId(7)]},
|
||||||
|
EdgeRefs{faces:[SubmeshFaceId(5),SubmeshFaceId(4)],verts:[SubmeshVertId(0),SubmeshVertId(7)]}
|
||||||
|
],
|
||||||
|
vert_topology:vec![
|
||||||
|
VertRefs{faces:vec![SubmeshFaceId(0),SubmeshFaceId(4),SubmeshFaceId(5)],edges:vec![SubmeshDirectedEdgeId((9223372036854775811u64-(1<<63)+(1<<31)) as u32),SubmeshDirectedEdgeId((9223372036854775819u64-(1<<63)+(1<<31)) as u32),SubmeshDirectedEdgeId((9223372036854775808u64-(1<<63)+(1<<31)) as u32)]},
|
||||||
|
VertRefs{faces:vec![SubmeshFaceId(0),SubmeshFaceId(5),SubmeshFaceId(1)],edges:vec![SubmeshDirectedEdgeId((9223372036854775812u64-(1<<63)+(1<<31)) as u32),SubmeshDirectedEdgeId(0),SubmeshDirectedEdgeId((9223372036854775809u64-(1<<63)+(1<<31)) as u32)]},
|
||||||
|
VertRefs{faces:vec![SubmeshFaceId(0),SubmeshFaceId(2),SubmeshFaceId(1)],edges:vec![SubmeshDirectedEdgeId(1),SubmeshDirectedEdgeId((9223372036854775810u64-(1<<63)+(1<<31)) as u32),SubmeshDirectedEdgeId((9223372036854775814u64-(1<<63)+(1<<31)) as u32)]},
|
||||||
|
VertRefs{faces:vec![SubmeshFaceId(0),SubmeshFaceId(2),SubmeshFaceId(4)],edges:vec![SubmeshDirectedEdgeId(2),SubmeshDirectedEdgeId(3),SubmeshDirectedEdgeId((9223372036854775815u64-(1<<63)+(1<<31)) as u32)]},
|
||||||
|
VertRefs{faces:vec![SubmeshFaceId(3),SubmeshFaceId(5),SubmeshFaceId(1)],edges:vec![SubmeshDirectedEdgeId(4),SubmeshDirectedEdgeId((9223372036854775817u64-(1<<63)+(1<<31)) as u32),SubmeshDirectedEdgeId((9223372036854775813u64-(1<<63)+(1<<31)) as u32)]},
|
||||||
|
VertRefs{faces:vec![SubmeshFaceId(2),SubmeshFaceId(3),SubmeshFaceId(1)],edges:vec![SubmeshDirectedEdgeId(5),SubmeshDirectedEdgeId(6),SubmeshDirectedEdgeId((9223372036854775816u64-(1<<63)+(1<<31)) as u32)]},
|
||||||
|
VertRefs{faces:vec![SubmeshFaceId(2),SubmeshFaceId(3),SubmeshFaceId(4)],edges:vec![SubmeshDirectedEdgeId(7),SubmeshDirectedEdgeId(8),SubmeshDirectedEdgeId((9223372036854775818u64-(1<<63)+(1<<31)) as u32)]},
|
||||||
|
VertRefs{faces:vec![SubmeshFaceId(4),SubmeshFaceId(3),SubmeshFaceId(5)],edges:vec![SubmeshDirectedEdgeId(10),SubmeshDirectedEdgeId(11),SubmeshDirectedEdgeId(9)]}
|
||||||
|
]
|
||||||
|
};
|
||||||
|
Self{
|
||||||
|
data,
|
||||||
|
complete_mesh:mesh_topology,
|
||||||
|
submeshes:Vec::new(),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
pub fn unit_cylinder()->Self{
|
||||||
|
Self::unit_cube()
|
||||||
|
}
|
||||||
|
#[inline]
|
||||||
|
pub const fn complete_mesh(&self)->&PhysicsMeshTopology{
|
||||||
|
&self.complete_mesh
|
||||||
|
}
|
||||||
|
#[inline]
|
||||||
|
pub const fn complete_mesh_view(&self)->PhysicsMeshView{
|
||||||
|
PhysicsMeshView{
|
||||||
|
data:&self.data,
|
||||||
|
topology:self.complete_mesh(),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
#[inline]
|
||||||
|
pub fn submeshes(&self)->&[PhysicsMeshTopology]{
|
||||||
|
//the complete mesh is already a convex mesh when len()==0, len()==1 is invalid but will still work
|
||||||
|
if self.submeshes.len()==0{
|
||||||
|
std::slice::from_ref(&self.complete_mesh)
|
||||||
|
}else{
|
||||||
|
&self.submeshes.as_slice()
|
||||||
|
}
|
||||||
|
}
|
||||||
|
#[inline]
|
||||||
|
pub fn submesh_view(&self,submesh_id:PhysicsSubmeshId)->PhysicsMeshView{
|
||||||
|
PhysicsMeshView{
|
||||||
|
data:&self.data,
|
||||||
|
topology:&self.submeshes()[submesh_id.get() as usize],
|
||||||
|
}
|
||||||
|
}
|
||||||
|
pub fn submesh_views(&self)->impl Iterator<Item=PhysicsMeshView>{
|
||||||
|
self.submeshes().iter().map(|topology|PhysicsMeshView{
|
||||||
|
data:&self.data,
|
||||||
|
topology,
|
||||||
|
})
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
//mesh builder code
|
||||||
#[derive(Default,Clone)]
|
#[derive(Default,Clone)]
|
||||||
struct VertRefGuy{
|
struct VertRefGuy{
|
||||||
edges:std::collections::HashSet<DirectedEdgeId>,
|
edges:HashSet<SubmeshDirectedEdgeId>,
|
||||||
faces:std::collections::HashSet<FaceId>,
|
faces:HashSet<SubmeshFaceId>,
|
||||||
}
|
}
|
||||||
#[derive(Clone,Hash,Eq,PartialEq)]
|
#[derive(Clone,Hash,Eq,PartialEq)]
|
||||||
struct EdgeRefVerts([VertId;2]);
|
struct EdgeRefVerts([SubmeshVertId;2]);
|
||||||
impl EdgeRefVerts{
|
impl EdgeRefVerts{
|
||||||
fn new(v0:VertId,v1:VertId)->(Self,bool){
|
const fn new(v0:SubmeshVertId,v1:SubmeshVertId)->(Self,bool){
|
||||||
(if v0.0<v1.0{
|
(if v0.0<v1.0{
|
||||||
Self([v0,v1])
|
Self([v0,v1])
|
||||||
}else{
|
}else{
|
||||||
@ -105,89 +256,142 @@ impl EdgeRefVerts{
|
|||||||
},v0.0<v1.0)
|
},v0.0<v1.0)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
struct EdgeRefFaces([FaceId;2]);
|
struct EdgeRefFaces([SubmeshFaceId;2]);
|
||||||
impl EdgeRefFaces{
|
impl EdgeRefFaces{
|
||||||
fn new()->Self{
|
const fn new()->Self{
|
||||||
Self([FaceId(0);2])
|
Self([SubmeshFaceId(0);2])
|
||||||
}
|
}
|
||||||
fn push(&mut self,i:usize,face_id:FaceId){
|
fn push(&mut self,i:usize,face_id:SubmeshFaceId){
|
||||||
self.0[i]=face_id;
|
self.0[i]=face_id;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
struct FaceRefEdges(Vec<DirectedEdgeId>);
|
struct FaceRefEdges(Vec<SubmeshDirectedEdgeId>);
|
||||||
#[derive(Default)]
|
#[derive(Default)]
|
||||||
struct EdgePool{
|
struct EdgePool{
|
||||||
edge_guys:Vec<(EdgeRefVerts,EdgeRefFaces)>,
|
edge_guys:Vec<(EdgeRefVerts,EdgeRefFaces)>,
|
||||||
edge_id_from_guy:std::collections::HashMap<EdgeRefVerts,usize>,
|
edge_id_from_guy:HashMap<EdgeRefVerts,SubmeshEdgeId>,
|
||||||
}
|
}
|
||||||
impl EdgePool{
|
impl EdgePool{
|
||||||
fn push(&mut self,edge_ref_verts:EdgeRefVerts)->(&mut EdgeRefFaces,EdgeId){
|
fn push(&mut self,edge_ref_verts:EdgeRefVerts)->(&mut EdgeRefFaces,SubmeshEdgeId){
|
||||||
let edge_id=if let Some(&edge_id)=self.edge_id_from_guy.get(&edge_ref_verts){
|
let edge_id=if let Some(&edge_id)=self.edge_id_from_guy.get(&edge_ref_verts){
|
||||||
edge_id
|
edge_id
|
||||||
}else{
|
}else{
|
||||||
let edge_id=self.edge_guys.len();
|
let edge_id=SubmeshEdgeId::new(self.edge_guys.len() as u32);
|
||||||
self.edge_guys.push((edge_ref_verts.clone(),EdgeRefFaces::new()));
|
self.edge_guys.push((edge_ref_verts.clone(),EdgeRefFaces::new()));
|
||||||
self.edge_id_from_guy.insert(edge_ref_verts,edge_id);
|
self.edge_id_from_guy.insert(edge_ref_verts,edge_id);
|
||||||
edge_id
|
edge_id
|
||||||
};
|
};
|
||||||
(&mut unsafe{self.edge_guys.get_unchecked_mut(edge_id)}.1,EdgeId(edge_id))
|
(&mut unsafe{self.edge_guys.get_unchecked_mut(edge_id.get() as usize)}.1,edge_id)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
impl From<&crate::model::IndexedModel> for PhysicsMesh{
|
|
||||||
fn from(indexed_model:&crate::model::IndexedModel)->Self{
|
#[derive(Debug)]
|
||||||
assert!(indexed_model.unique_pos.len()!=0,"Mesh cannot have 0 vertices");
|
pub enum PhysicsMeshError{
|
||||||
let verts=indexed_model.unique_pos.iter().map(|v|Vert(v.clone())).collect();
|
ZeroVertices,
|
||||||
let mut vert_ref_guys=vec![VertRefGuy::default();indexed_model.unique_pos.len()];
|
NoPhysicsGroups,
|
||||||
let mut edge_pool=EdgePool::default();
|
}
|
||||||
let mut face_i=0;
|
impl std::fmt::Display for PhysicsMeshError{
|
||||||
|
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
|
||||||
|
write!(f,"{self:?}")
|
||||||
|
}
|
||||||
|
}
|
||||||
|
impl std::error::Error for PhysicsMeshError{}
|
||||||
|
|
||||||
|
impl TryFrom<&model::Mesh> for PhysicsMesh{
|
||||||
|
type Error=PhysicsMeshError;
|
||||||
|
fn try_from(mesh:&model::Mesh)->Result<Self,PhysicsMeshError>{
|
||||||
|
if mesh.unique_pos.len()==0{
|
||||||
|
return Err(PhysicsMeshError::ZeroVertices);
|
||||||
|
}
|
||||||
|
let verts=mesh.unique_pos.iter().copied().map(Vert).collect();
|
||||||
|
//TODO: fix submeshes
|
||||||
|
//flat map mesh.physics_groups[$1].groups.polys()[$2] as face_id
|
||||||
|
//lower face_id points to upper face_id
|
||||||
|
//the same face is not allowed to be in multiple polygon groups
|
||||||
let mut faces=Vec::new();
|
let mut faces=Vec::new();
|
||||||
|
let mut face_id_from_face=HashMap::new();
|
||||||
|
let mut mesh_topologies:Vec<PhysicsMeshTopology>=mesh.physics_groups.iter().map(|physics_group|{
|
||||||
|
//construct submesh
|
||||||
|
let mut submesh_faces=Vec::new();//these contain a map from submeshId->meshId
|
||||||
|
let mut submesh_verts=Vec::new();
|
||||||
|
let mut submesh_vert_id_from_mesh_vert_id=HashMap::<MeshVertId,SubmeshVertId>::new();
|
||||||
|
//lazy closure
|
||||||
|
let mut get_submesh_vert_id=|vert_id:MeshVertId|{
|
||||||
|
if let Some(&submesh_vert_id)=submesh_vert_id_from_mesh_vert_id.get(&vert_id){
|
||||||
|
submesh_vert_id
|
||||||
|
}else{
|
||||||
|
let submesh_vert_id=SubmeshVertId::new(submesh_verts.len() as u32);
|
||||||
|
submesh_verts.push(vert_id);
|
||||||
|
submesh_vert_id_from_mesh_vert_id.insert(vert_id,submesh_vert_id);
|
||||||
|
submesh_vert_id
|
||||||
|
}
|
||||||
|
};
|
||||||
|
let mut edge_pool=EdgePool::default();
|
||||||
|
let mut vert_ref_guys=vec![VertRefGuy::default();mesh.unique_pos.len()];
|
||||||
let mut face_ref_guys=Vec::new();
|
let mut face_ref_guys=Vec::new();
|
||||||
for group in indexed_model.groups.iter(){for poly in group.polys.iter(){
|
for polygon_group_id in &physics_group.groups{
|
||||||
let face_id=FaceId(face_i);
|
let polygon_group=&mesh.polygon_groups[polygon_group_id.get() as usize];
|
||||||
|
for poly_vertices in polygon_group.polys(){
|
||||||
|
let submesh_face_id=SubmeshFaceId::new(submesh_faces.len() as u32);
|
||||||
//one face per poly
|
//one face per poly
|
||||||
let mut normal=Planar64Vec3::ZERO;
|
let mut normal=Vector3::new([Fixed::ZERO,Fixed::ZERO,Fixed::ZERO]);
|
||||||
let len=poly.vertices.len();
|
let len=poly_vertices.len();
|
||||||
let face_edges=poly.vertices.iter().enumerate().map(|(i,&vert_id)|{
|
let face_edges=poly_vertices.into_iter().enumerate().map(|(i,vert_id)|{
|
||||||
let vert0_id=indexed_model.unique_vertices[vert_id as usize].pos as usize;
|
let vert0_id=MeshVertId::new(mesh.unique_vertices[vert_id.get() as usize].pos.get() as u32);
|
||||||
let vert1_id=indexed_model.unique_vertices[poly.vertices[(i+1)%len] as usize].pos as usize;
|
let vert1_id=MeshVertId::new(mesh.unique_vertices[poly_vertices[(i+1)%len].get() as usize].pos.get() as u32);
|
||||||
|
//index submesh verts
|
||||||
|
let submesh_vert0_id=get_submesh_vert_id(vert0_id);
|
||||||
|
let submesh_vert1_id=get_submesh_vert_id(vert1_id);
|
||||||
//https://www.khronos.org/opengl/wiki/Calculating_a_Surface_Normal (Newell's Method)
|
//https://www.khronos.org/opengl/wiki/Calculating_a_Surface_Normal (Newell's Method)
|
||||||
let v0=indexed_model.unique_pos[vert0_id];
|
let v0=mesh.unique_pos[vert0_id.get() as usize];
|
||||||
let v1=indexed_model.unique_pos[vert1_id];
|
let v1=mesh.unique_pos[vert1_id.get() as usize];
|
||||||
normal+=Planar64Vec3::new(
|
normal+=Vector3::new([
|
||||||
(v0.y()-v1.y())*(v0.z()+v1.z()),
|
(v0.y-v1.y)*(v0.z+v1.z),
|
||||||
(v0.z()-v1.z())*(v0.x()+v1.x()),
|
(v0.z-v1.z)*(v0.x+v1.x),
|
||||||
(v0.x()-v1.x())*(v0.y()+v1.y()),
|
(v0.x-v1.x)*(v0.y+v1.y),
|
||||||
);
|
]);
|
||||||
//get/create edge and push face into it
|
//get/create edge and push face into it
|
||||||
let (edge_ref_verts,is_sorted)=EdgeRefVerts::new(VertId(vert0_id),VertId(vert1_id));
|
let (edge_ref_verts,is_sorted)=EdgeRefVerts::new(submesh_vert0_id,submesh_vert1_id);
|
||||||
let (edge_ref_faces,edge_id)=edge_pool.push(edge_ref_verts);
|
let (edge_ref_faces,edge_id)=edge_pool.push(edge_ref_verts);
|
||||||
//polygon vertices as assumed to be listed clockwise
|
//polygon vertices as assumed to be listed clockwise
|
||||||
//populate the edge face on the left or right depending on how the edge vertices got sorted
|
//populate the edge face on the left or right depending on how the edge vertices got sorted
|
||||||
edge_ref_faces.push(!is_sorted as usize,face_id);
|
edge_ref_faces.push(!is_sorted as usize,submesh_face_id);
|
||||||
//index edges & face into vertices
|
//index edges & face into vertices
|
||||||
{
|
{
|
||||||
let vert_ref_guy=unsafe{vert_ref_guys.get_unchecked_mut(vert0_id)};
|
let vert_ref_guy=unsafe{vert_ref_guys.get_unchecked_mut(submesh_vert0_id.get() as usize)};
|
||||||
vert_ref_guy.edges.insert(edge_id.as_directed(is_sorted));
|
vert_ref_guy.edges.insert(edge_id.as_directed(is_sorted));
|
||||||
vert_ref_guy.faces.insert(face_id);
|
vert_ref_guy.faces.insert(submesh_face_id);
|
||||||
unsafe{vert_ref_guys.get_unchecked_mut(vert1_id)}.edges.insert(edge_id.as_directed(!is_sorted));
|
unsafe{vert_ref_guys.get_unchecked_mut(submesh_vert1_id.get() as usize)}.edges.insert(edge_id.as_directed(!is_sorted));
|
||||||
}
|
}
|
||||||
//return directed_edge_id
|
//return directed_edge_id
|
||||||
edge_id.as_directed(is_sorted)
|
edge_id.as_directed(is_sorted)
|
||||||
}).collect();
|
}).collect();
|
||||||
//choose precision loss randomly idk
|
let mut dot=Fixed::ZERO;
|
||||||
normal=normal/len as i64;
|
// find the average dot
|
||||||
let mut dot=Planar64::ZERO;
|
for &v in poly_vertices{
|
||||||
for &v in poly.vertices.iter(){
|
dot+=normal.dot(mesh.unique_pos[mesh.unique_vertices[v.get() as usize].pos.get() as usize]);
|
||||||
dot+=normal.dot(indexed_model.unique_pos[indexed_model.unique_vertices[v as usize].pos as usize]);
|
|
||||||
}
|
}
|
||||||
faces.push(Face{normal,dot:dot/len as i64});
|
//assume face hash is stable, and there are no flush faces...
|
||||||
|
let face=Face{
|
||||||
|
normal:(normal/len as i64).divide().fix_1(),
|
||||||
|
dot:(dot/(len*len) as i64).fix_1(),
|
||||||
|
};
|
||||||
|
let face_id=match face_id_from_face.get(&face){
|
||||||
|
Some(&face_id)=>face_id,
|
||||||
|
None=>{
|
||||||
|
let face_id=MeshFaceId::new(faces.len() as u32);
|
||||||
|
face_id_from_face.insert(face.clone(),face_id);
|
||||||
|
faces.push(face);
|
||||||
|
face_id
|
||||||
|
}
|
||||||
|
};
|
||||||
|
submesh_faces.push(face_id);
|
||||||
face_ref_guys.push(FaceRefEdges(face_edges));
|
face_ref_guys.push(FaceRefEdges(face_edges));
|
||||||
face_i+=1;
|
}
|
||||||
}}
|
}
|
||||||
//conceivably faces, edges, and vertices exist now
|
PhysicsMeshTopology{
|
||||||
Self{
|
faces:submesh_faces,
|
||||||
faces,
|
verts:submesh_verts,
|
||||||
verts,
|
|
||||||
face_topology:face_ref_guys.into_iter().map(|face_ref_guy|{
|
face_topology:face_ref_guys.into_iter().map(|face_ref_guy|{
|
||||||
FaceRefs{edges:face_ref_guy.0}
|
FaceRefs{edges:face_ref_guy.0}
|
||||||
}).collect(),
|
}).collect(),
|
||||||
@ -201,102 +405,127 @@ impl From<&crate::model::IndexedModel> for PhysicsMesh{
|
|||||||
}
|
}
|
||||||
).collect(),
|
).collect(),
|
||||||
}
|
}
|
||||||
|
}).collect();
|
||||||
|
Ok(Self{
|
||||||
|
data:PhysicsMeshData{
|
||||||
|
faces,
|
||||||
|
verts,
|
||||||
|
},
|
||||||
|
complete_mesh:mesh_topologies.pop().ok_or(PhysicsMeshError::NoPhysicsGroups)?,
|
||||||
|
submeshes:mesh_topologies,
|
||||||
|
})
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
impl PhysicsMesh{
|
pub struct PhysicsMeshView<'a>{
|
||||||
pub fn verts<'a>(&'a self)->impl Iterator<Item=Planar64Vec3>+'a{
|
data:&'a PhysicsMeshData,
|
||||||
self.verts.iter().map(|Vert(pos)|*pos)
|
topology:&'a PhysicsMeshTopology,
|
||||||
}
|
|
||||||
}
|
}
|
||||||
impl MeshQuery<FaceId,DirectedEdgeId,VertId> for PhysicsMesh{
|
impl MeshQuery<SubmeshFaceId,SubmeshDirectedEdgeId,SubmeshVertId> for PhysicsMeshView<'_>{
|
||||||
fn face_nd(&self,face_id:FaceId)->(Planar64Vec3,Planar64){
|
type Normal=Planar64Vec3;
|
||||||
(self.faces[face_id.0].normal,self.faces[face_id.0].dot)
|
type Offset=Planar64;
|
||||||
|
fn face_nd(&self,face_id:SubmeshFaceId)->(Planar64Vec3,Planar64){
|
||||||
|
let face_idx=self.topology.faces[face_id.get() as usize].get() as usize;
|
||||||
|
(self.data.faces[face_idx].normal,self.data.faces[face_idx].dot)
|
||||||
}
|
}
|
||||||
//ideally I never calculate the vertex position, but I have to for the graphical meshes...
|
//ideally I never calculate the vertex position, but I have to for the graphical meshes...
|
||||||
fn vert(&self,vert_id:VertId)->Planar64Vec3{
|
fn vert(&self,vert_id:SubmeshVertId)->Planar64Vec3{
|
||||||
self.verts[vert_id.0].0
|
let vert_idx=self.topology.verts[vert_id.get() as usize].get() as usize;
|
||||||
|
self.data.verts[vert_idx].0
|
||||||
}
|
}
|
||||||
fn face_edges(&self,face_id:FaceId)->Cow<Vec<DirectedEdgeId>>{
|
fn face_edges(&self,face_id:SubmeshFaceId)->Cow<Vec<SubmeshDirectedEdgeId>>{
|
||||||
Cow::Borrowed(&self.face_topology[face_id.0].edges)
|
Cow::Borrowed(&self.topology.face_topology[face_id.get() as usize].edges)
|
||||||
}
|
}
|
||||||
fn edge_faces(&self,edge_id:EdgeId)->Cow<[FaceId;2]>{
|
fn edge_faces(&self,edge_id:SubmeshEdgeId)->Cow<[SubmeshFaceId;2]>{
|
||||||
Cow::Borrowed(&self.edge_topology[edge_id.0].faces)
|
Cow::Borrowed(&self.topology.edge_topology[edge_id.get() as usize].faces)
|
||||||
}
|
}
|
||||||
fn edge_verts(&self,edge_id:EdgeId)->Cow<[VertId;2]>{
|
fn edge_verts(&self,edge_id:SubmeshEdgeId)->Cow<[SubmeshVertId;2]>{
|
||||||
Cow::Borrowed(&self.edge_topology[edge_id.0].verts)
|
Cow::Borrowed(&self.topology.edge_topology[edge_id.get() as usize].verts)
|
||||||
}
|
}
|
||||||
fn vert_edges(&self,vert_id:VertId)->Cow<Vec<DirectedEdgeId>>{
|
fn vert_edges(&self,vert_id:SubmeshVertId)->Cow<Vec<SubmeshDirectedEdgeId>>{
|
||||||
Cow::Borrowed(&self.vert_topology[vert_id.0].edges)
|
Cow::Borrowed(&self.topology.vert_topology[vert_id.get() as usize].edges)
|
||||||
|
}
|
||||||
|
fn vert_faces(&self,vert_id:SubmeshVertId)->Cow<Vec<SubmeshFaceId>>{
|
||||||
|
Cow::Borrowed(&self.topology.vert_topology[vert_id.get() as usize].faces)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
pub struct PhysicsMeshTransform{
|
||||||
|
pub vertex:integer::Planar64Affine3,
|
||||||
|
pub normal:integer::mat3::Matrix3<Fixed<2,64>>,
|
||||||
|
pub det:Fixed<3,96>,
|
||||||
|
}
|
||||||
|
impl PhysicsMeshTransform{
|
||||||
|
pub fn new(transform:integer::Planar64Affine3)->Self{
|
||||||
|
Self{
|
||||||
|
normal:transform.matrix3.adjugate().transpose(),
|
||||||
|
det:transform.matrix3.det(),
|
||||||
|
vertex:transform,
|
||||||
}
|
}
|
||||||
fn vert_faces(&self,vert_id:VertId)->Cow<Vec<FaceId>>{
|
|
||||||
Cow::Borrowed(&self.vert_topology[vert_id.0].faces)
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
pub struct TransformedMesh<'a>{
|
pub struct TransformedMesh<'a>{
|
||||||
mesh:&'a PhysicsMesh,
|
view:PhysicsMeshView<'a>,
|
||||||
transform:&'a crate::integer::Planar64Affine3,
|
transform:&'a PhysicsMeshTransform,
|
||||||
normal_transform:&'a crate::integer::Planar64Mat3,
|
|
||||||
transform_det:Planar64,
|
|
||||||
}
|
}
|
||||||
impl TransformedMesh<'_>{
|
impl TransformedMesh<'_>{
|
||||||
pub fn new<'a>(
|
pub const fn new<'a>(
|
||||||
mesh:&'a PhysicsMesh,
|
view:PhysicsMeshView<'a>,
|
||||||
transform:&'a crate::integer::Planar64Affine3,
|
transform:&'a PhysicsMeshTransform,
|
||||||
normal_transform:&'a crate::integer::Planar64Mat3,
|
|
||||||
transform_det:Planar64,
|
|
||||||
)->TransformedMesh<'a>{
|
)->TransformedMesh<'a>{
|
||||||
TransformedMesh{
|
TransformedMesh{
|
||||||
mesh,
|
view,
|
||||||
transform,
|
transform,
|
||||||
normal_transform,
|
|
||||||
transform_det,
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
fn farthest_vert(&self,dir:Planar64Vec3)->VertId{
|
pub fn verts<'a>(&'a self)->impl Iterator<Item=vec3::Vector3<Fixed<2,64>>>+'a{
|
||||||
let mut best_dot=Planar64::MIN;
|
self.view.data.verts.iter().map(|&Vert(pos)|self.transform.vertex.transform_point3(pos))
|
||||||
let mut best_vert=VertId(0);
|
|
||||||
for (i,vert) in self.mesh.verts.iter().enumerate(){
|
|
||||||
let p=self.transform.transform_point3(vert.0);
|
|
||||||
let d=dir.dot(p);
|
|
||||||
if best_dot<d{
|
|
||||||
best_dot=d;
|
|
||||||
best_vert=VertId(i);
|
|
||||||
}
|
}
|
||||||
}
|
fn farthest_vert(&self,dir:Planar64Vec3)->SubmeshVertId{
|
||||||
best_vert
|
//this happens to be well-defined. there are no virtual virtices
|
||||||
|
SubmeshVertId::new(
|
||||||
|
self.view.topology.verts.iter()
|
||||||
|
.enumerate()
|
||||||
|
.max_by_key(|(_,&vert_id)|
|
||||||
|
dir.dot(self.transform.vertex.transform_point3(self.view.data.verts[vert_id.get() as usize].0))
|
||||||
|
)
|
||||||
|
//assume there is more than zero vertices.
|
||||||
|
.unwrap().0 as u32
|
||||||
|
)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
impl MeshQuery<FaceId,DirectedEdgeId,VertId> for TransformedMesh<'_>{
|
impl MeshQuery<SubmeshFaceId,SubmeshDirectedEdgeId,SubmeshVertId> for TransformedMesh<'_>{
|
||||||
fn face_nd(&self,face_id:FaceId)->(Planar64Vec3,Planar64){
|
type Normal=Vector3<Fixed<3,96>>;
|
||||||
let (n,d)=self.mesh.face_nd(face_id);
|
type Offset=Fixed<4,128>;
|
||||||
let transformed_n=*self.normal_transform*n;
|
fn face_nd(&self,face_id:SubmeshFaceId)->(Self::Normal,Self::Offset){
|
||||||
let transformed_d=d+transformed_n.dot(self.transform.translation)/self.transform_det;
|
let (n,d)=self.view.face_nd(face_id);
|
||||||
(transformed_n/self.transform_det,transformed_d)
|
let transformed_n=self.transform.normal*n;
|
||||||
|
let transformed_d=d*self.transform.det+transformed_n.dot(self.transform.vertex.translation);
|
||||||
|
(transformed_n,transformed_d)
|
||||||
}
|
}
|
||||||
fn vert(&self,vert_id:VertId)->Planar64Vec3{
|
fn vert(&self,vert_id:SubmeshVertId)->Planar64Vec3{
|
||||||
self.transform.transform_point3(self.mesh.vert(vert_id))
|
self.transform.vertex.transform_point3(self.view.vert(vert_id)).fix_1()
|
||||||
}
|
}
|
||||||
#[inline]
|
#[inline]
|
||||||
fn face_edges(&self,face_id:FaceId)->Cow<Vec<DirectedEdgeId>>{
|
fn face_edges(&self,face_id:SubmeshFaceId)->Cow<Vec<SubmeshDirectedEdgeId>>{
|
||||||
self.mesh.face_edges(face_id)
|
self.view.face_edges(face_id)
|
||||||
}
|
}
|
||||||
#[inline]
|
#[inline]
|
||||||
fn edge_faces(&self,edge_id:EdgeId)->Cow<[FaceId;2]>{
|
fn edge_faces(&self,edge_id:SubmeshEdgeId)->Cow<[SubmeshFaceId;2]>{
|
||||||
self.mesh.edge_faces(edge_id)
|
self.view.edge_faces(edge_id)
|
||||||
}
|
}
|
||||||
#[inline]
|
#[inline]
|
||||||
fn edge_verts(&self,edge_id:EdgeId)->Cow<[VertId;2]>{
|
fn edge_verts(&self,edge_id:SubmeshEdgeId)->Cow<[SubmeshVertId;2]>{
|
||||||
self.mesh.edge_verts(edge_id)
|
self.view.edge_verts(edge_id)
|
||||||
}
|
}
|
||||||
#[inline]
|
#[inline]
|
||||||
fn vert_edges(&self,vert_id:VertId)->Cow<Vec<DirectedEdgeId>>{
|
fn vert_edges(&self,vert_id:SubmeshVertId)->Cow<Vec<SubmeshDirectedEdgeId>>{
|
||||||
self.mesh.vert_edges(vert_id)
|
self.view.vert_edges(vert_id)
|
||||||
}
|
}
|
||||||
#[inline]
|
#[inline]
|
||||||
fn vert_faces(&self,vert_id:VertId)->Cow<Vec<FaceId>>{
|
fn vert_faces(&self,vert_id:SubmeshVertId)->Cow<Vec<SubmeshFaceId>>{
|
||||||
self.mesh.vert_faces(vert_id)
|
self.view.vert_faces(vert_id)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -304,14 +533,14 @@ impl MeshQuery<FaceId,DirectedEdgeId,VertId> for TransformedMesh<'_>{
|
|||||||
//(face,vertex)
|
//(face,vertex)
|
||||||
//(edge,edge)
|
//(edge,edge)
|
||||||
//(vertex,face)
|
//(vertex,face)
|
||||||
#[derive(Clone,Copy)]
|
#[derive(Clone,Copy,Debug)]
|
||||||
pub enum MinkowskiVert{
|
pub enum MinkowskiVert{
|
||||||
VertVert(VertId,VertId),
|
VertVert(SubmeshVertId,SubmeshVertId),
|
||||||
}
|
}
|
||||||
#[derive(Clone,Copy)]
|
#[derive(Clone,Copy,Debug)]
|
||||||
pub enum MinkowskiEdge{
|
pub enum MinkowskiEdge{
|
||||||
VertEdge(VertId,EdgeId),
|
VertEdge(SubmeshVertId,SubmeshEdgeId),
|
||||||
EdgeVert(EdgeId,VertId),
|
EdgeVert(SubmeshEdgeId,SubmeshVertId),
|
||||||
//EdgeEdge when edges are parallel
|
//EdgeEdge when edges are parallel
|
||||||
}
|
}
|
||||||
impl UndirectedEdge for MinkowskiEdge{
|
impl UndirectedEdge for MinkowskiEdge{
|
||||||
@ -323,10 +552,10 @@ impl UndirectedEdge for MinkowskiEdge{
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
#[derive(Clone,Copy)]
|
#[derive(Clone,Copy,Debug)]
|
||||||
pub enum MinkowskiDirectedEdge{
|
pub enum MinkowskiDirectedEdge{
|
||||||
VertEdge(VertId,DirectedEdgeId),
|
VertEdge(SubmeshVertId,SubmeshDirectedEdgeId),
|
||||||
EdgeVert(DirectedEdgeId,VertId),
|
EdgeVert(SubmeshDirectedEdgeId,SubmeshVertId),
|
||||||
//EdgeEdge when edges are parallel
|
//EdgeEdge when edges are parallel
|
||||||
}
|
}
|
||||||
impl DirectedEdge for MinkowskiDirectedEdge{
|
impl DirectedEdge for MinkowskiDirectedEdge{
|
||||||
@ -344,22 +573,23 @@ impl DirectedEdge for MinkowskiDirectedEdge{
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
#[derive(Debug,Clone,Copy,Hash,Eq,PartialEq)]
|
#[derive(Clone,Copy,Debug,Hash,Eq,PartialEq)]
|
||||||
pub enum MinkowskiFace{
|
pub enum MinkowskiFace{
|
||||||
VertFace(VertId,FaceId),
|
VertFace(SubmeshVertId,SubmeshFaceId),
|
||||||
EdgeEdge(EdgeId,EdgeId,bool),
|
EdgeEdge(SubmeshEdgeId,SubmeshEdgeId,bool),
|
||||||
FaceVert(FaceId,VertId),
|
FaceVert(SubmeshFaceId,SubmeshVertId),
|
||||||
//EdgeFace
|
//EdgeFace
|
||||||
//FaceEdge
|
//FaceEdge
|
||||||
//FaceFace
|
//FaceFace
|
||||||
}
|
}
|
||||||
|
|
||||||
pub struct MinkowskiMesh<'a>{
|
pub struct MinkowskiMesh<'a>{
|
||||||
mesh0:&'a TransformedMesh<'a>,
|
mesh0:TransformedMesh<'a>,
|
||||||
mesh1:&'a TransformedMesh<'a>,
|
mesh1:TransformedMesh<'a>,
|
||||||
}
|
}
|
||||||
|
|
||||||
//infinity fev algorithm state transition
|
//infinity fev algorithm state transition
|
||||||
|
#[derive(Debug)]
|
||||||
enum Transition{
|
enum Transition{
|
||||||
Done,//found closest vert, no edges are better
|
Done,//found closest vert, no edges are better
|
||||||
Vert(MinkowskiVert),//transition to vert
|
Vert(MinkowskiVert),//transition to vert
|
||||||
@ -369,8 +599,10 @@ enum EV{
|
|||||||
Edge(MinkowskiEdge),
|
Edge(MinkowskiEdge),
|
||||||
}
|
}
|
||||||
|
|
||||||
|
pub type GigaTime=Ratio<Fixed<4,128>,Fixed<4,128>>;
|
||||||
|
|
||||||
impl MinkowskiMesh<'_>{
|
impl MinkowskiMesh<'_>{
|
||||||
pub fn minkowski_sum<'a>(mesh0:&'a TransformedMesh,mesh1:&'a TransformedMesh)->MinkowskiMesh<'a>{
|
pub fn minkowski_sum<'a>(mesh0:TransformedMesh<'a>,mesh1:TransformedMesh<'a>)->MinkowskiMesh<'a>{
|
||||||
MinkowskiMesh{
|
MinkowskiMesh{
|
||||||
mesh0,
|
mesh0,
|
||||||
mesh1,
|
mesh1,
|
||||||
@ -379,7 +611,7 @@ impl MinkowskiMesh<'_>{
|
|||||||
fn farthest_vert(&self,dir:Planar64Vec3)->MinkowskiVert{
|
fn farthest_vert(&self,dir:Planar64Vec3)->MinkowskiVert{
|
||||||
MinkowskiVert::VertVert(self.mesh0.farthest_vert(dir),self.mesh1.farthest_vert(-dir))
|
MinkowskiVert::VertVert(self.mesh0.farthest_vert(dir),self.mesh1.farthest_vert(-dir))
|
||||||
}
|
}
|
||||||
fn next_transition_vert(&self,vert_id:MinkowskiVert,best_distance_squared:&mut Planar64,infinity_dir:Planar64Vec3,point:Planar64Vec3)->Transition{
|
fn next_transition_vert(&self,vert_id:MinkowskiVert,best_distance_squared:&mut Fixed<2,64>,infinity_dir:Planar64Vec3,point:Planar64Vec3)->Transition{
|
||||||
let mut best_transition=Transition::Done;
|
let mut best_transition=Transition::Done;
|
||||||
for &directed_edge_id in self.vert_edges(vert_id).iter(){
|
for &directed_edge_id in self.vert_edges(vert_id).iter(){
|
||||||
let edge_n=self.directed_edge_n(directed_edge_id);
|
let edge_n=self.directed_edge_n(directed_edge_id);
|
||||||
@ -389,7 +621,7 @@ impl MinkowskiMesh<'_>{
|
|||||||
let test_vert_id=edge_verts[directed_edge_id.parity() as usize];
|
let test_vert_id=edge_verts[directed_edge_id.parity() as usize];
|
||||||
//test if it's closer
|
//test if it's closer
|
||||||
let diff=point-self.vert(test_vert_id);
|
let diff=point-self.vert(test_vert_id);
|
||||||
if crate::zeroes::zeroes1(edge_n.dot(diff),edge_n.dot(infinity_dir)).len()==0{
|
if edge_n.dot(infinity_dir).is_zero(){
|
||||||
let distance_squared=diff.dot(diff);
|
let distance_squared=diff.dot(diff);
|
||||||
if distance_squared<*best_distance_squared{
|
if distance_squared<*best_distance_squared{
|
||||||
best_transition=Transition::Vert(test_vert_id);
|
best_transition=Transition::Vert(test_vert_id);
|
||||||
@ -399,21 +631,21 @@ impl MinkowskiMesh<'_>{
|
|||||||
}
|
}
|
||||||
best_transition
|
best_transition
|
||||||
}
|
}
|
||||||
fn final_ev(&self,vert_id:MinkowskiVert,best_distance_squared:&mut Planar64,infinity_dir:Planar64Vec3,point:Planar64Vec3)->EV{
|
fn final_ev(&self,vert_id:MinkowskiVert,best_distance_squared:&mut Fixed<2,64>,infinity_dir:Planar64Vec3,point:Planar64Vec3)->EV{
|
||||||
let mut best_transition=EV::Vert(vert_id);
|
let mut best_transition=EV::Vert(vert_id);
|
||||||
let diff=point-self.vert(vert_id);
|
let diff=point-self.vert(vert_id);
|
||||||
for &directed_edge_id in self.vert_edges(vert_id).iter(){
|
for &directed_edge_id in self.vert_edges(vert_id).iter(){
|
||||||
let edge_n=self.directed_edge_n(directed_edge_id);
|
let edge_n=self.directed_edge_n(directed_edge_id);
|
||||||
//is boundary uncrossable by a crawl from infinity
|
//is boundary uncrossable by a crawl from infinity
|
||||||
//check if time of collision is outside Time::MIN..Time::MAX
|
//check if time of collision is outside Time::MIN..Time::MAX
|
||||||
|
if edge_n.dot(infinity_dir).is_zero(){
|
||||||
let d=edge_n.dot(diff);
|
let d=edge_n.dot(diff);
|
||||||
if crate::zeroes::zeroes1(d,edge_n.dot(infinity_dir)).len()==0{
|
|
||||||
//test the edge
|
//test the edge
|
||||||
let edge_nn=edge_n.dot(edge_n);
|
let edge_nn=edge_n.dot(edge_n);
|
||||||
if Planar64::ZERO<=d&&d<=edge_nn{
|
if !d.is_negative()&&d<=edge_nn{
|
||||||
let distance_squared={
|
let distance_squared={
|
||||||
let c=diff.cross(edge_n);
|
let c=diff.cross(edge_n);
|
||||||
c.dot(c)/edge_nn
|
(c.dot(c)/edge_nn).divide().fix_2()
|
||||||
};
|
};
|
||||||
if distance_squared<=*best_distance_squared{
|
if distance_squared<=*best_distance_squared{
|
||||||
best_transition=EV::Edge(directed_edge_id.as_undirected());
|
best_transition=EV::Edge(directed_edge_id.as_undirected());
|
||||||
@ -459,7 +691,7 @@ impl MinkowskiMesh<'_>{
|
|||||||
let boundary_d=boundary_n.dot(delta_pos);
|
let boundary_d=boundary_n.dot(delta_pos);
|
||||||
//check if time of collision is outside Time::MIN..Time::MAX
|
//check if time of collision is outside Time::MIN..Time::MAX
|
||||||
//infinity_dir can always be treated as a velocity
|
//infinity_dir can always be treated as a velocity
|
||||||
if (boundary_d)<=Planar64::ZERO&&crate::zeroes::zeroes1(boundary_d,boundary_n.dot(infinity_dir)*2).len()==0{
|
if !boundary_d.is_positive()&&boundary_n.dot(infinity_dir).is_zero(){
|
||||||
//both faces cannot pass this condition, return early if one does.
|
//both faces cannot pass this condition, return early if one does.
|
||||||
return FEV::<MinkowskiFace,MinkowskiDirectedEdge,MinkowskiVert>::Face(face_id);
|
return FEV::<MinkowskiFace,MinkowskiDirectedEdge,MinkowskiVert>::Face(face_id);
|
||||||
}
|
}
|
||||||
@ -473,15 +705,16 @@ impl MinkowskiMesh<'_>{
|
|||||||
let infinity_fev=self.infinity_fev(-dir,infinity_body.position);
|
let infinity_fev=self.infinity_fev(-dir,infinity_body.position);
|
||||||
//a line is simpler to solve than a parabola
|
//a line is simpler to solve than a parabola
|
||||||
infinity_body.velocity=dir;
|
infinity_body.velocity=dir;
|
||||||
infinity_body.acceleration=Planar64Vec3::ZERO;
|
infinity_body.acceleration=vec3::ZERO;
|
||||||
//crawl in from negative infinity along a tangent line to get the closest fev
|
//crawl in from negative infinity along a tangent line to get the closest fev
|
||||||
match crate::face_crawler::crawl_fev(infinity_fev,self,&infinity_body,crate::integer::Time::MIN,infinity_body.time){
|
// TODO: change crawl_fev args to delta time? Optional values?
|
||||||
|
match crate::face_crawler::crawl_fev(infinity_fev,self,&infinity_body,integer::Time::MIN/4,infinity_body.time){
|
||||||
crate::face_crawler::CrawlResult::Miss(fev)=>Some(fev),
|
crate::face_crawler::CrawlResult::Miss(fev)=>Some(fev),
|
||||||
crate::face_crawler::CrawlResult::Hit(_,_)=>None,
|
crate::face_crawler::CrawlResult::Hit(_,_)=>None,
|
||||||
}
|
}
|
||||||
})
|
})
|
||||||
}
|
}
|
||||||
pub fn predict_collision_in(&self,relative_body:&crate::physics::Body,time_limit:crate::integer::Time)->Option<(MinkowskiFace,crate::integer::Time)>{
|
pub fn predict_collision_in(&self,relative_body:&crate::physics::Body,time_limit:integer::Time)->Option<(MinkowskiFace,GigaTime)>{
|
||||||
self.closest_fev_not_inside(relative_body.clone()).map_or(None,|fev|{
|
self.closest_fev_not_inside(relative_body.clone()).map_or(None,|fev|{
|
||||||
//continue forwards along the body parabola
|
//continue forwards along the body parabola
|
||||||
match crate::face_crawler::crawl_fev(fev,self,relative_body,relative_body.time,time_limit){
|
match crate::face_crawler::crawl_fev(fev,self,relative_body,relative_body.time,time_limit){
|
||||||
@ -490,7 +723,7 @@ impl MinkowskiMesh<'_>{
|
|||||||
}
|
}
|
||||||
})
|
})
|
||||||
}
|
}
|
||||||
pub fn predict_collision_out(&self,relative_body:&crate::physics::Body,time_limit:crate::integer::Time)->Option<(MinkowskiFace,crate::integer::Time)>{
|
pub fn predict_collision_out(&self,relative_body:&crate::physics::Body,time_limit:integer::Time)->Option<(MinkowskiFace,GigaTime)>{
|
||||||
//create an extrapolated body at time_limit
|
//create an extrapolated body at time_limit
|
||||||
let infinity_body=crate::physics::Body::new(
|
let infinity_body=crate::physics::Body::new(
|
||||||
relative_body.extrapolated_position(time_limit),
|
relative_body.extrapolated_position(time_limit),
|
||||||
@ -506,10 +739,13 @@ impl MinkowskiMesh<'_>{
|
|||||||
}
|
}
|
||||||
})
|
})
|
||||||
}
|
}
|
||||||
pub fn predict_collision_face_out(&self,relative_body:&crate::physics::Body,time_limit:crate::integer::Time,contact_face_id:MinkowskiFace)->Option<(MinkowskiEdge,crate::integer::Time)>{
|
pub fn predict_collision_face_out(&self,relative_body:&crate::physics::Body,time_limit:integer::Time,contact_face_id:MinkowskiFace)->Option<(MinkowskiEdge,GigaTime)>{
|
||||||
//no algorithm needed, there is only one state and two cases (Edge,None)
|
//no algorithm needed, there is only one state and two cases (Edge,None)
|
||||||
//determine when it passes an edge ("sliding off" case)
|
//determine when it passes an edge ("sliding off" case)
|
||||||
let mut best_time=time_limit;
|
let mut best_time={
|
||||||
|
let r=(time_limit-relative_body.time).to_ratio();
|
||||||
|
Ratio::new(r.num.fix_4(),r.den.fix_4())
|
||||||
|
};
|
||||||
let mut best_edge=None;
|
let mut best_edge=None;
|
||||||
let face_n=self.face_nd(contact_face_id).0;
|
let face_n=self.face_nd(contact_face_id).0;
|
||||||
for &directed_edge_id in self.face_edges(contact_face_id).iter(){
|
for &directed_edge_id in self.face_edges(contact_face_id).iter(){
|
||||||
@ -519,10 +755,10 @@ impl MinkowskiMesh<'_>{
|
|||||||
let verts=self.edge_verts(directed_edge_id.as_undirected());
|
let verts=self.edge_verts(directed_edge_id.as_undirected());
|
||||||
let d=n.dot(self.vert(verts[0])+self.vert(verts[1]));
|
let d=n.dot(self.vert(verts[0])+self.vert(verts[1]));
|
||||||
//WARNING! d outside of *2
|
//WARNING! d outside of *2
|
||||||
for t in crate::zeroes::zeroes2((n.dot(relative_body.position))*2-d,n.dot(relative_body.velocity)*2,n.dot(relative_body.acceleration)){
|
//WARNING: truncated precision
|
||||||
let t=relative_body.time+crate::integer::Time::from(t);
|
for dt in Fixed::<4,128>::zeroes2(((n.dot(relative_body.position))*2-d).fix_4(),n.dot(relative_body.velocity).fix_4()*2,n.dot(relative_body.acceleration).fix_4()){
|
||||||
if relative_body.time<t&&t<best_time&&n.dot(relative_body.extrapolated_velocity(t))<Planar64::ZERO{
|
if Ratio::new(Planar64::ZERO,Planar64::EPSILON).le_ratio(dt)&&dt.lt_ratio(best_time)&&n.dot(relative_body.extrapolated_velocity_ratio_dt(dt)).is_negative(){
|
||||||
best_time=t;
|
best_time=dt;
|
||||||
best_edge=Some(directed_edge_id);
|
best_edge=Some(directed_edge_id);
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
@ -530,9 +766,28 @@ impl MinkowskiMesh<'_>{
|
|||||||
}
|
}
|
||||||
best_edge.map(|e|(e.as_undirected(),best_time))
|
best_edge.map(|e|(e.as_undirected(),best_time))
|
||||||
}
|
}
|
||||||
|
fn infinity_in(&self,infinity_body:crate::physics::Body)->Option<(MinkowskiFace,GigaTime)>{
|
||||||
|
let infinity_fev=self.infinity_fev(-infinity_body.velocity,infinity_body.position);
|
||||||
|
match crate::face_crawler::crawl_fev(infinity_fev,self,&infinity_body,integer::Time::MIN/4,infinity_body.time){
|
||||||
|
crate::face_crawler::CrawlResult::Miss(_)=>None,
|
||||||
|
crate::face_crawler::CrawlResult::Hit(face,time)=>Some((face,time)),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
pub fn is_point_in_mesh(&self,point:Planar64Vec3)->bool{
|
||||||
|
let infinity_body=crate::physics::Body::new(point,vec3::Y,vec3::ZERO,integer::Time::ZERO);
|
||||||
|
//movement must escape the mesh forwards and backwards in time,
|
||||||
|
//otherwise the point is not inside the mesh
|
||||||
|
self.infinity_in(infinity_body)
|
||||||
|
.is_some_and(|_|
|
||||||
|
self.infinity_in(-infinity_body)
|
||||||
|
.is_some()
|
||||||
|
)
|
||||||
|
}
|
||||||
}
|
}
|
||||||
impl MeshQuery<MinkowskiFace,MinkowskiDirectedEdge,MinkowskiVert> for MinkowskiMesh<'_>{
|
impl MeshQuery<MinkowskiFace,MinkowskiDirectedEdge,MinkowskiVert> for MinkowskiMesh<'_>{
|
||||||
fn face_nd(&self,face_id:MinkowskiFace)->(Planar64Vec3,Planar64){
|
type Normal=Vector3<Fixed<3,96>>;
|
||||||
|
type Offset=Fixed<4,128>;
|
||||||
|
fn face_nd(&self,face_id:MinkowskiFace)->(Self::Normal,Self::Offset){
|
||||||
match face_id{
|
match face_id{
|
||||||
MinkowskiFace::VertFace(v0,f1)=>{
|
MinkowskiFace::VertFace(v0,f1)=>{
|
||||||
let (n,d)=self.mesh1.face_nd(f1);
|
let (n,d)=self.mesh1.face_nd(f1);
|
||||||
@ -546,7 +801,7 @@ impl MeshQuery<MinkowskiFace,MinkowskiDirectedEdge,MinkowskiVert> for MinkowskiM
|
|||||||
let n=edge0_n.cross(edge1_n);
|
let n=edge0_n.cross(edge1_n);
|
||||||
let e0d=n.dot(self.mesh0.vert(e0v0)+self.mesh0.vert(e0v1));
|
let e0d=n.dot(self.mesh0.vert(e0v0)+self.mesh0.vert(e0v1));
|
||||||
let e1d=n.dot(self.mesh1.vert(e1v0)+self.mesh1.vert(e1v1));
|
let e1d=n.dot(self.mesh1.vert(e1v0)+self.mesh1.vert(e1v1));
|
||||||
(n*(parity as i64*4-2),(e0d-e1d)*(parity as i64*2-1))
|
((n*(parity as i64*4-2)).fix_3(),((e0d-e1d)*(parity as i64*2-1)).fix_4())
|
||||||
},
|
},
|
||||||
MinkowskiFace::FaceVert(f0,v1)=>{
|
MinkowskiFace::FaceVert(f0,v1)=>{
|
||||||
let (n,d)=self.mesh0.face_nd(f0);
|
let (n,d)=self.mesh0.face_nd(f0);
|
||||||
@ -595,17 +850,18 @@ impl MeshQuery<MinkowskiFace,MinkowskiDirectedEdge,MinkowskiVert> for MinkowskiM
|
|||||||
let &[e1f0,e1f1]=self.mesh1.edge_faces(e1).borrow();
|
let &[e1f0,e1f1]=self.mesh1.edge_faces(e1).borrow();
|
||||||
Cow::Owned([(e1f1,false),(e1f0,true)].map(|(edge_face_id1,face_parity)|{
|
Cow::Owned([(e1f1,false),(e1f0,true)].map(|(edge_face_id1,face_parity)|{
|
||||||
let mut best_edge=None;
|
let mut best_edge=None;
|
||||||
let mut best_d=Planar64::ZERO;
|
let mut best_d:Ratio<Fixed<8,256>,Fixed<8,256>>=Ratio::new(Fixed::ZERO,Fixed::ONE);
|
||||||
let edge_face1_n=self.mesh1.face_nd(edge_face_id1).0;
|
let edge_face1_n=self.mesh1.face_nd(edge_face_id1).0;
|
||||||
let edge_face1_nn=edge_face1_n.dot(edge_face1_n);
|
let edge_face1_nn=edge_face1_n.dot(edge_face1_n);
|
||||||
for &directed_edge_id0 in v0e.iter(){
|
for &directed_edge_id0 in v0e.iter(){
|
||||||
let edge0_n=self.mesh0.directed_edge_n(directed_edge_id0);
|
let edge0_n=self.mesh0.directed_edge_n(directed_edge_id0);
|
||||||
//must be behind other face.
|
//must be behind other face.
|
||||||
let d=edge_face1_n.dot(edge0_n);
|
let d=edge_face1_n.dot(edge0_n);
|
||||||
if d<Planar64::ZERO{
|
if d.is_negative(){
|
||||||
let edge0_nn=edge0_n.dot(edge0_n);
|
let edge0_nn=edge0_n.dot(edge0_n);
|
||||||
//divide by zero???
|
// Assume not every number is huge
|
||||||
let dd=d*d/(edge_face1_nn*edge0_nn);
|
// TODO: revisit this
|
||||||
|
let dd=(d*d)/(edge_face1_nn*edge0_nn);
|
||||||
if best_d<dd{
|
if best_d<dd{
|
||||||
best_d=dd;
|
best_d=dd;
|
||||||
best_edge=Some(directed_edge_id0);
|
best_edge=Some(directed_edge_id0);
|
||||||
@ -624,15 +880,15 @@ impl MeshQuery<MinkowskiFace,MinkowskiDirectedEdge,MinkowskiVert> for MinkowskiM
|
|||||||
let &[e0f0,e0f1]=self.mesh0.edge_faces(e0).borrow();
|
let &[e0f0,e0f1]=self.mesh0.edge_faces(e0).borrow();
|
||||||
Cow::Owned([(e0f0,true),(e0f1,false)].map(|(edge_face_id0,face_parity)|{
|
Cow::Owned([(e0f0,true),(e0f1,false)].map(|(edge_face_id0,face_parity)|{
|
||||||
let mut best_edge=None;
|
let mut best_edge=None;
|
||||||
let mut best_d=Planar64::ZERO;
|
let mut best_d:Ratio<Fixed<8,256>,Fixed<8,256>>=Ratio::new(Fixed::ZERO,Fixed::ONE);
|
||||||
let edge_face0_n=self.mesh0.face_nd(edge_face_id0).0;
|
let edge_face0_n=self.mesh0.face_nd(edge_face_id0).0;
|
||||||
let edge_face0_nn=edge_face0_n.dot(edge_face0_n);
|
let edge_face0_nn=edge_face0_n.dot(edge_face0_n);
|
||||||
for &directed_edge_id1 in v1e.iter(){
|
for &directed_edge_id1 in v1e.iter(){
|
||||||
let edge1_n=self.mesh1.directed_edge_n(directed_edge_id1);
|
let edge1_n=self.mesh1.directed_edge_n(directed_edge_id1);
|
||||||
let d=edge_face0_n.dot(edge1_n);
|
let d=edge_face0_n.dot(edge1_n);
|
||||||
if d<Planar64::ZERO{
|
if d.is_negative(){
|
||||||
let edge1_nn=edge1_n.dot(edge1_n);
|
let edge1_nn=edge1_n.dot(edge1_n);
|
||||||
let dd=d*d/(edge_face0_nn*edge1_nn);
|
let dd=(d*d)/(edge_face0_nn*edge1_nn);
|
||||||
if best_d<dd{
|
if best_d<dd{
|
||||||
best_d=dd;
|
best_d=dd;
|
||||||
best_edge=Some(directed_edge_id1);
|
best_edge=Some(directed_edge_id1);
|
||||||
@ -668,19 +924,20 @@ impl MeshQuery<MinkowskiFace,MinkowskiDirectedEdge,MinkowskiVert> for MinkowskiM
|
|||||||
//detect shared volume when the other mesh is mirrored along a test edge dir
|
//detect shared volume when the other mesh is mirrored along a test edge dir
|
||||||
let v0f=self.mesh0.vert_faces(v0);
|
let v0f=self.mesh0.vert_faces(v0);
|
||||||
let v1f=self.mesh1.vert_faces(v1);
|
let v1f=self.mesh1.vert_faces(v1);
|
||||||
let v0f_n:Vec<Planar64Vec3>=v0f.iter().map(|&face_id|self.mesh0.face_nd(face_id).0).collect();
|
let v0f_n:Vec<_>=v0f.iter().map(|&face_id|self.mesh0.face_nd(face_id).0).collect();
|
||||||
let v1f_n:Vec<Planar64Vec3>=v1f.iter().map(|&face_id|self.mesh1.face_nd(face_id).0).collect();
|
let v1f_n:Vec<_>=v1f.iter().map(|&face_id|self.mesh1.face_nd(face_id).0).collect();
|
||||||
let the_len=v0f.len()+v1f.len();
|
let the_len=v0f.len()+v1f.len();
|
||||||
for &directed_edge_id in self.mesh0.vert_edges(v0).iter(){
|
for &directed_edge_id in self.mesh0.vert_edges(v0).iter(){
|
||||||
let n=self.mesh0.directed_edge_n(directed_edge_id);
|
let n=self.mesh0.directed_edge_n(directed_edge_id);
|
||||||
let nn=n.dot(n);
|
let nn=n.dot(n);
|
||||||
|
// TODO: there's gotta be a better way to do this
|
||||||
//make a set of faces
|
//make a set of faces
|
||||||
let mut face_normals=Vec::with_capacity(the_len);
|
let mut face_normals=Vec::with_capacity(the_len);
|
||||||
//add mesh0 faces as-is
|
//add mesh0 faces as-is
|
||||||
face_normals.clone_from(&v0f_n);
|
face_normals.clone_from(&v0f_n);
|
||||||
for face_n in &v1f_n{
|
for face_n in &v1f_n{
|
||||||
//add reflected mesh1 faces
|
//add reflected mesh1 faces
|
||||||
face_normals.push(*face_n-n*(face_n.dot(n)*2/nn));
|
face_normals.push(*face_n-(n*face_n.dot(n)*2/nn).divide().fix_3());
|
||||||
}
|
}
|
||||||
if is_empty_volume(face_normals){
|
if is_empty_volume(face_normals){
|
||||||
edges.push(MinkowskiDirectedEdge::EdgeVert(directed_edge_id,v1));
|
edges.push(MinkowskiDirectedEdge::EdgeVert(directed_edge_id,v1));
|
||||||
@ -692,7 +949,7 @@ impl MeshQuery<MinkowskiFace,MinkowskiDirectedEdge,MinkowskiVert> for MinkowskiM
|
|||||||
let mut face_normals=Vec::with_capacity(the_len);
|
let mut face_normals=Vec::with_capacity(the_len);
|
||||||
face_normals.clone_from(&v1f_n);
|
face_normals.clone_from(&v1f_n);
|
||||||
for face_n in &v0f_n{
|
for face_n in &v0f_n{
|
||||||
face_normals.push(*face_n-n*(face_n.dot(n)*2/nn));
|
face_normals.push(*face_n-(n*face_n.dot(n)*2/nn).divide().fix_3());
|
||||||
}
|
}
|
||||||
if is_empty_volume(face_normals){
|
if is_empty_volume(face_normals){
|
||||||
edges.push(MinkowskiDirectedEdge::VertEdge(v0,directed_edge_id));
|
edges.push(MinkowskiDirectedEdge::VertEdge(v0,directed_edge_id));
|
||||||
@ -707,7 +964,7 @@ impl MeshQuery<MinkowskiFace,MinkowskiDirectedEdge,MinkowskiVert> for MinkowskiM
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
fn is_empty_volume(normals:Vec<Planar64Vec3>)->bool{
|
fn is_empty_volume(normals:Vec<Vector3<Fixed<3,96>>>)->bool{
|
||||||
let len=normals.len();
|
let len=normals.len();
|
||||||
for i in 0..len-1{
|
for i in 0..len-1{
|
||||||
for j in i+1..len{
|
for j in i+1..len{
|
||||||
@ -715,9 +972,10 @@ fn is_empty_volume(normals:Vec<Planar64Vec3>)->bool{
|
|||||||
let mut d_comp=None;
|
let mut d_comp=None;
|
||||||
for k in 0..len{
|
for k in 0..len{
|
||||||
if k!=i&&k!=j{
|
if k!=i&&k!=j{
|
||||||
let d=n.dot(normals[k]);
|
let d=n.dot(normals[k]).is_negative();
|
||||||
if let Some(comp)=&d_comp{
|
if let Some(comp)=&d_comp{
|
||||||
if *comp*d<Planar64::ZERO{
|
// This is testing if d_comp*d < 0
|
||||||
|
if comp^d{
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
}else{
|
}else{
|
||||||
@ -732,13 +990,12 @@ fn is_empty_volume(normals:Vec<Planar64Vec3>)->bool{
|
|||||||
|
|
||||||
#[test]
|
#[test]
|
||||||
fn test_is_empty_volume(){
|
fn test_is_empty_volume(){
|
||||||
assert!(!is_empty_volume([Planar64Vec3::X,Planar64Vec3::Y,Planar64Vec3::Z].to_vec()));
|
assert!(!is_empty_volume([vec3::X.fix_3(),vec3::Y.fix_3(),vec3::Z.fix_3()].to_vec()));
|
||||||
assert!(is_empty_volume([Planar64Vec3::X,Planar64Vec3::Y,Planar64Vec3::Z,Planar64Vec3::NEG_X].to_vec()));
|
assert!(is_empty_volume([vec3::X.fix_3(),vec3::Y.fix_3(),vec3::Z.fix_3(),vec3::NEG_X.fix_3()].to_vec()));
|
||||||
}
|
}
|
||||||
|
|
||||||
#[test]
|
#[test]
|
||||||
fn build_me_a_cube(){
|
fn build_me_a_cube(){
|
||||||
let unit_cube=crate::primitives::unit_cube();
|
let mesh=PhysicsMesh::unit_cube();
|
||||||
let mesh=PhysicsMesh::from(&unit_cube);
|
|
||||||
//println!("mesh={:?}",mesh);
|
//println!("mesh={:?}",mesh);
|
||||||
}
|
}
|
3066
src/physics.rs
3066
src/physics.rs
File diff suppressed because it is too large
Load Diff
@ -1,8 +1,12 @@
|
|||||||
use crate::integer::Time;
|
use strafesnet_common::mouse::MouseState;
|
||||||
use crate::physics::{MouseState,PhysicsInputInstruction};
|
use strafesnet_common::physics::Instruction as PhysicsInputInstruction;
|
||||||
use crate::instruction::{TimedInstruction,InstructionConsumer};
|
use strafesnet_common::integer::Time;
|
||||||
|
use strafesnet_common::instruction::TimedInstruction;
|
||||||
|
use strafesnet_common::timer::{Scaled,Timer,TimerState};
|
||||||
|
use mouse_interpolator::MouseInterpolator;
|
||||||
|
|
||||||
#[derive(Debug)]
|
#[derive(Debug)]
|
||||||
pub enum InputInstruction {
|
pub enum InputInstruction{
|
||||||
MoveMouse(glam::IVec2),
|
MoveMouse(glam::IVec2),
|
||||||
MoveRight(bool),
|
MoveRight(bool),
|
||||||
MoveUp(bool),
|
MoveUp(bool),
|
||||||
@ -12,82 +16,148 @@ pub enum InputInstruction {
|
|||||||
MoveForward(bool),
|
MoveForward(bool),
|
||||||
Jump(bool),
|
Jump(bool),
|
||||||
Zoom(bool),
|
Zoom(bool),
|
||||||
Reset,
|
ResetAndRestart,
|
||||||
|
ResetAndSpawn(strafesnet_common::gameplay_modes::ModeId,strafesnet_common::gameplay_modes::StageId),
|
||||||
|
PracticeFly,
|
||||||
}
|
}
|
||||||
pub enum Instruction{
|
pub enum Instruction{
|
||||||
Input(InputInstruction),
|
Input(InputInstruction),
|
||||||
Render,
|
Render,
|
||||||
Resize(winit::dpi::PhysicalSize<u32>,crate::settings::UserSettings),
|
Resize(winit::dpi::PhysicalSize<u32>),
|
||||||
GenerateModels(crate::model::IndexedModelInstances),
|
ChangeMap(strafesnet_common::map::CompleteMap),
|
||||||
ClearModels,
|
//SetPaused is not an InputInstruction: the physics doesn't know that it's paused.
|
||||||
|
SetPaused(bool),
|
||||||
//Graphics(crate::graphics_worker::Instruction),
|
//Graphics(crate::graphics_worker::Instruction),
|
||||||
}
|
}
|
||||||
|
mod mouse_interpolator{
|
||||||
|
use super::*;
|
||||||
|
//TODO: move this or tab
|
||||||
|
pub struct MouseInterpolator{
|
||||||
|
//"PlayerController"
|
||||||
|
user_settings:crate::settings::UserSettings,
|
||||||
|
//"MouseInterpolator"
|
||||||
|
timeline:std::collections::VecDeque<TimedInstruction<PhysicsInputInstruction>>,
|
||||||
|
last_mouse_time:Time,//this value is pre-transformed to simulation time
|
||||||
|
mouse_blocking:bool,
|
||||||
|
//"Simulation"
|
||||||
|
timer:Timer<Scaled>,
|
||||||
|
physics:crate::physics::PhysicsContext,
|
||||||
|
|
||||||
pub fn new(mut physics:crate::physics::PhysicsState,mut graphics_worker:crate::compat_worker::INWorker<crate::graphics_worker::Instruction>)->crate::compat_worker::QNWorker<TimedInstruction<Instruction>>{
|
}
|
||||||
let mut mouse_blocking=true;
|
impl MouseInterpolator{
|
||||||
let mut last_mouse_time=physics.next_mouse.time;
|
pub fn new(
|
||||||
let mut timeline=std::collections::VecDeque::new();
|
physics:crate::physics::PhysicsContext,
|
||||||
crate::compat_worker::QNWorker::new(move |ins:TimedInstruction<Instruction>|{
|
user_settings:crate::settings::UserSettings,
|
||||||
if if let Some(phys_input)=match &ins.instruction{
|
)->MouseInterpolator{
|
||||||
Instruction::Input(input_instruction)=>match input_instruction{
|
MouseInterpolator{
|
||||||
&InputInstruction::MoveMouse(m)=>{
|
mouse_blocking:true,
|
||||||
if mouse_blocking{
|
last_mouse_time:physics.get_next_mouse().time,
|
||||||
|
timeline:std::collections::VecDeque::new(),
|
||||||
|
timer:Timer::from_state(Scaled::identity(),false),
|
||||||
|
physics,
|
||||||
|
user_settings,
|
||||||
|
}
|
||||||
|
}
|
||||||
|
fn push_mouse_instruction(&mut self,ins:&TimedInstruction<Instruction>,m:glam::IVec2){
|
||||||
|
if self.mouse_blocking{
|
||||||
//tell the game state which is living in the past about its future
|
//tell the game state which is living in the past about its future
|
||||||
timeline.push_front(TimedInstruction{
|
self.timeline.push_front(TimedInstruction{
|
||||||
time:last_mouse_time,
|
time:self.last_mouse_time,
|
||||||
instruction:PhysicsInputInstruction::SetNextMouse(MouseState{time:ins.time,pos:m}),
|
instruction:PhysicsInputInstruction::SetNextMouse(MouseState{time:self.timer.time(ins.time),pos:m}),
|
||||||
});
|
});
|
||||||
}else{
|
}else{
|
||||||
//mouse has just started moving again after being still for longer than 10ms.
|
//mouse has just started moving again after being still for longer than 10ms.
|
||||||
//replace the entire mouse interpolation state to avoid an intermediate state with identical m0.t m1.t timestamps which will divide by zero
|
//replace the entire mouse interpolation state to avoid an intermediate state with identical m0.t m1.t timestamps which will divide by zero
|
||||||
timeline.push_front(TimedInstruction{
|
self.timeline.push_front(TimedInstruction{
|
||||||
time:last_mouse_time,
|
time:self.last_mouse_time,
|
||||||
instruction:PhysicsInputInstruction::ReplaceMouse(
|
instruction:PhysicsInputInstruction::ReplaceMouse(
|
||||||
MouseState{time:last_mouse_time,pos:physics.next_mouse.pos},
|
MouseState{time:self.last_mouse_time,pos:self.physics.get_next_mouse().pos},
|
||||||
MouseState{time:ins.time,pos:m}
|
MouseState{time:self.timer.time(ins.time),pos:m}
|
||||||
),
|
),
|
||||||
});
|
});
|
||||||
//delay physics execution until we have an interpolation target
|
//delay physics execution until we have an interpolation target
|
||||||
mouse_blocking=true;
|
self.mouse_blocking=true;
|
||||||
}
|
}
|
||||||
last_mouse_time=ins.time;
|
self.last_mouse_time=self.timer.time(ins.time);
|
||||||
None
|
}
|
||||||
},
|
fn push(&mut self,time:Time,phys_input:PhysicsInputInstruction){
|
||||||
&InputInstruction::MoveForward(s)=>Some(PhysicsInputInstruction::SetMoveForward(s)),
|
//This is always a non-mouse event
|
||||||
&InputInstruction::MoveLeft(s)=>Some(PhysicsInputInstruction::SetMoveLeft(s)),
|
self.timeline.push_back(TimedInstruction{
|
||||||
&InputInstruction::MoveBack(s)=>Some(PhysicsInputInstruction::SetMoveBack(s)),
|
time:self.timer.time(time),
|
||||||
&InputInstruction::MoveRight(s)=>Some(PhysicsInputInstruction::SetMoveRight(s)),
|
|
||||||
&InputInstruction::MoveUp(s)=>Some(PhysicsInputInstruction::SetMoveUp(s)),
|
|
||||||
&InputInstruction::MoveDown(s)=>Some(PhysicsInputInstruction::SetMoveDown(s)),
|
|
||||||
&InputInstruction::Jump(s)=>Some(PhysicsInputInstruction::SetJump(s)),
|
|
||||||
&InputInstruction::Zoom(s)=>Some(PhysicsInputInstruction::SetZoom(s)),
|
|
||||||
InputInstruction::Reset=>Some(PhysicsInputInstruction::Reset),
|
|
||||||
},
|
|
||||||
Instruction::GenerateModels(_)=>Some(PhysicsInputInstruction::Idle),
|
|
||||||
Instruction::ClearModels=>Some(PhysicsInputInstruction::Idle),
|
|
||||||
Instruction::Resize(_,_)=>Some(PhysicsInputInstruction::Idle),
|
|
||||||
Instruction::Render=>Some(PhysicsInputInstruction::Idle),
|
|
||||||
}{
|
|
||||||
//non-mouse event
|
|
||||||
timeline.push_back(TimedInstruction{
|
|
||||||
time:ins.time,
|
|
||||||
instruction:phys_input,
|
instruction:phys_input,
|
||||||
});
|
});
|
||||||
|
}
|
||||||
if mouse_blocking{
|
/// returns should_empty_queue
|
||||||
|
/// may or may not mutate internal state XD!
|
||||||
|
fn map_instruction(&mut self,ins:&TimedInstruction<Instruction>)->bool{
|
||||||
|
let mut update_mouse_blocking=true;
|
||||||
|
match &ins.instruction{
|
||||||
|
Instruction::Input(input_instruction)=>match input_instruction{
|
||||||
|
&InputInstruction::MoveMouse(m)=>{
|
||||||
|
if !self.timer.is_paused(){
|
||||||
|
self.push_mouse_instruction(ins,m);
|
||||||
|
}
|
||||||
|
update_mouse_blocking=false;
|
||||||
|
},
|
||||||
|
&InputInstruction::MoveForward(s)=>self.push(ins.time,PhysicsInputInstruction::SetMoveForward(s)),
|
||||||
|
&InputInstruction::MoveLeft(s)=>self.push(ins.time,PhysicsInputInstruction::SetMoveLeft(s)),
|
||||||
|
&InputInstruction::MoveBack(s)=>self.push(ins.time,PhysicsInputInstruction::SetMoveBack(s)),
|
||||||
|
&InputInstruction::MoveRight(s)=>self.push(ins.time,PhysicsInputInstruction::SetMoveRight(s)),
|
||||||
|
&InputInstruction::MoveUp(s)=>self.push(ins.time,PhysicsInputInstruction::SetMoveUp(s)),
|
||||||
|
&InputInstruction::MoveDown(s)=>self.push(ins.time,PhysicsInputInstruction::SetMoveDown(s)),
|
||||||
|
&InputInstruction::Jump(s)=>self.push(ins.time,PhysicsInputInstruction::SetJump(s)),
|
||||||
|
&InputInstruction::Zoom(s)=>self.push(ins.time,PhysicsInputInstruction::SetZoom(s)),
|
||||||
|
&InputInstruction::ResetAndSpawn(mode_id,stage_id)=>{
|
||||||
|
self.push(ins.time,PhysicsInputInstruction::Reset);
|
||||||
|
self.push(ins.time,PhysicsInputInstruction::SetSensitivity(self.user_settings.calculate_sensitivity()));
|
||||||
|
self.push(ins.time,PhysicsInputInstruction::Spawn(mode_id,stage_id));
|
||||||
|
},
|
||||||
|
InputInstruction::ResetAndRestart=>{
|
||||||
|
self.push(ins.time,PhysicsInputInstruction::Reset);
|
||||||
|
self.push(ins.time,PhysicsInputInstruction::SetSensitivity(self.user_settings.calculate_sensitivity()));
|
||||||
|
self.push(ins.time,PhysicsInputInstruction::Restart);
|
||||||
|
},
|
||||||
|
InputInstruction::PracticeFly=>self.push(ins.time,PhysicsInputInstruction::PracticeFly),
|
||||||
|
},
|
||||||
|
//do these really need to idle the physics?
|
||||||
|
//sending None dumps the instruction queue
|
||||||
|
Instruction::ChangeMap(_)=>self.push(ins.time,PhysicsInputInstruction::Idle),
|
||||||
|
Instruction::Resize(_)=>self.push(ins.time,PhysicsInputInstruction::Idle),
|
||||||
|
Instruction::Render=>self.push(ins.time,PhysicsInputInstruction::Idle),
|
||||||
|
&Instruction::SetPaused(paused)=>{
|
||||||
|
if let Err(e)=self.timer.set_paused(ins.time,paused){
|
||||||
|
println!("Cannot pause: {e}");
|
||||||
|
}
|
||||||
|
self.push(ins.time,PhysicsInputInstruction::Idle);
|
||||||
|
},
|
||||||
|
}
|
||||||
|
if update_mouse_blocking{
|
||||||
|
//this returns the bool for us
|
||||||
|
self.update_mouse_blocking(ins.time)
|
||||||
|
}else{
|
||||||
|
//do flush that queue
|
||||||
|
true
|
||||||
|
}
|
||||||
|
}
|
||||||
|
/// must check if self.mouse_blocking==true before calling!
|
||||||
|
fn unblock_mouse(&mut self,time:Time){
|
||||||
|
//push an event to extrapolate no movement from
|
||||||
|
self.timeline.push_front(TimedInstruction{
|
||||||
|
time:self.last_mouse_time,
|
||||||
|
instruction:PhysicsInputInstruction::SetNextMouse(MouseState{time:self.timer.time(time),pos:self.physics.get_next_mouse().pos}),
|
||||||
|
});
|
||||||
|
self.last_mouse_time=self.timer.time(time);
|
||||||
|
//stop blocking. the mouse is not moving so the physics does not need to live in the past and wait for interpolation targets.
|
||||||
|
self.mouse_blocking=false;
|
||||||
|
}
|
||||||
|
fn update_mouse_blocking(&mut self,time:Time)->bool{
|
||||||
|
if self.mouse_blocking{
|
||||||
//assume the mouse has stopped moving after 10ms.
|
//assume the mouse has stopped moving after 10ms.
|
||||||
//shitty mice are 125Hz which is 8ms so this should cover that.
|
//shitty mice are 125Hz which is 8ms so this should cover that.
|
||||||
//setting this to 100us still doesn't print even though it's 10x lower than the polling rate,
|
//setting this to 100us still doesn't print even though it's 10x lower than the polling rate,
|
||||||
//so mouse events are probably not handled separately from drawing and fire right before it :(
|
//so mouse events are probably not handled separately from drawing and fire right before it :(
|
||||||
if Time::from_millis(10)<ins.time-physics.next_mouse.time{
|
if Time::from_millis(10)<self.timer.time(time)-self.physics.get_next_mouse().time{
|
||||||
//push an event to extrapolate no movement from
|
self.unblock_mouse(time);
|
||||||
timeline.push_front(TimedInstruction{
|
|
||||||
time:last_mouse_time,
|
|
||||||
instruction:PhysicsInputInstruction::SetNextMouse(MouseState{time:ins.time,pos:physics.next_mouse.pos}),
|
|
||||||
});
|
|
||||||
last_mouse_time=ins.time;
|
|
||||||
//stop blocking. the mouse is not moving so the physics does not need to live in the past and wait for interpolation targets.
|
|
||||||
mouse_blocking=false;
|
|
||||||
true
|
true
|
||||||
}else{
|
}else{
|
||||||
false
|
false
|
||||||
@ -95,39 +165,78 @@ pub enum Instruction{
|
|||||||
}else{
|
}else{
|
||||||
//keep this up to date so that it can be used as a known-timestamp
|
//keep this up to date so that it can be used as a known-timestamp
|
||||||
//that the mouse was not moving when the mouse starts moving again
|
//that the mouse was not moving when the mouse starts moving again
|
||||||
last_mouse_time=ins.time;
|
self.last_mouse_time=self.timer.time(time);
|
||||||
true
|
true
|
||||||
}
|
}
|
||||||
}else{
|
}
|
||||||
//mouse event
|
fn empty_queue(&mut self){
|
||||||
true
|
while let Some(instruction)=self.timeline.pop_front(){
|
||||||
}{
|
self.physics.run_input_instruction(instruction);
|
||||||
//empty queue
|
}
|
||||||
while let Some(instruction)=timeline.pop_front(){
|
}
|
||||||
physics.run(instruction.time);
|
pub fn handle_instruction(&mut self,ins:&TimedInstruction<Instruction>){
|
||||||
physics.process_instruction(TimedInstruction{
|
let should_empty_queue=self.map_instruction(ins);
|
||||||
time:instruction.time,
|
if should_empty_queue{
|
||||||
instruction:crate::physics::PhysicsInstruction::Input(instruction.instruction),
|
self.empty_queue();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
pub fn get_frame_state(&self,time:Time)->crate::graphics::FrameState{
|
||||||
|
crate::graphics::FrameState{
|
||||||
|
body:self.physics.camera_body(),
|
||||||
|
camera:self.physics.camera(),
|
||||||
|
time:self.timer.time(time),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
pub fn change_map(&mut self,time:Time,map:&strafesnet_common::map::CompleteMap){
|
||||||
|
//dump any pending interpolation state
|
||||||
|
if self.mouse_blocking{
|
||||||
|
self.unblock_mouse(time);
|
||||||
|
}
|
||||||
|
self.empty_queue();
|
||||||
|
|
||||||
|
//doing it like this to avoid doing PhysicsInstruction::ChangeMap(Rc<CompleteMap>)
|
||||||
|
self.physics.generate_models(&map);
|
||||||
|
|
||||||
|
//use the standard input interface so the instructions are written out to bots
|
||||||
|
self.handle_instruction(&TimedInstruction{
|
||||||
|
time:self.timer.time(time),
|
||||||
|
instruction:Instruction::Input(InputInstruction::ResetAndSpawn(
|
||||||
|
strafesnet_common::gameplay_modes::ModeId::MAIN,
|
||||||
|
strafesnet_common::gameplay_modes::StageId::FIRST,
|
||||||
|
)),
|
||||||
});
|
});
|
||||||
}
|
}
|
||||||
|
pub const fn user_settings(&self)->&crate::settings::UserSettings{
|
||||||
|
&self.user_settings
|
||||||
}
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
pub fn new<'a>(
|
||||||
|
mut graphics_worker:crate::compat_worker::INWorker<'a,crate::graphics_worker::Instruction>,
|
||||||
|
user_settings:crate::settings::UserSettings,
|
||||||
|
)->crate::compat_worker::QNWorker<'a,TimedInstruction<Instruction>>{
|
||||||
|
let physics=crate::physics::PhysicsContext::default();
|
||||||
|
let mut interpolator=MouseInterpolator::new(
|
||||||
|
physics,
|
||||||
|
user_settings
|
||||||
|
);
|
||||||
|
crate::compat_worker::QNWorker::new(move |ins:TimedInstruction<Instruction>|{
|
||||||
|
interpolator.handle_instruction(&ins);
|
||||||
match ins.instruction{
|
match ins.instruction{
|
||||||
Instruction::Render=>{
|
Instruction::Render=>{
|
||||||
graphics_worker.send(crate::graphics_worker::Instruction::Render(physics.output(),ins.time,physics.next_mouse.pos)).unwrap();
|
let frame_state=interpolator.get_frame_state(ins.time);
|
||||||
|
graphics_worker.send(crate::graphics_worker::Instruction::Render(frame_state)).unwrap();
|
||||||
},
|
},
|
||||||
Instruction::Resize(size,user_settings)=>{
|
Instruction::Resize(size)=>{
|
||||||
graphics_worker.send(crate::graphics_worker::Instruction::Resize(size,user_settings)).unwrap();
|
graphics_worker.send(crate::graphics_worker::Instruction::Resize(size,interpolator.user_settings().clone())).unwrap();
|
||||||
},
|
},
|
||||||
Instruction::GenerateModels(indexed_model_instances)=>{
|
Instruction::ChangeMap(map)=>{
|
||||||
physics.generate_models(&indexed_model_instances);
|
interpolator.change_map(ins.time,&map);
|
||||||
physics.spawn(indexed_model_instances.spawn_point);
|
graphics_worker.send(crate::graphics_worker::Instruction::ChangeMap(map)).unwrap();
|
||||||
graphics_worker.send(crate::graphics_worker::Instruction::GenerateModels(indexed_model_instances)).unwrap();
|
|
||||||
},
|
},
|
||||||
Instruction::ClearModels=>{
|
Instruction::Input(_)=>(),
|
||||||
physics.clear();
|
Instruction::SetPaused(_)=>(),
|
||||||
graphics_worker.send(crate::graphics_worker::Instruction::ClearModels).unwrap();
|
|
||||||
},
|
|
||||||
_=>(),
|
|
||||||
}
|
}
|
||||||
})
|
})
|
||||||
}
|
}
|
||||||
|
@ -1,493 +0,0 @@
|
|||||||
use crate::model::{Color4,TextureCoordinate,IndexedModel,IndexedPolygon,IndexedGroup,IndexedVertex};
|
|
||||||
use crate::integer::Planar64Vec3;
|
|
||||||
|
|
||||||
#[derive(Debug)]
|
|
||||||
pub enum Primitives{
|
|
||||||
Sphere,
|
|
||||||
Cube,
|
|
||||||
Cylinder,
|
|
||||||
Wedge,
|
|
||||||
CornerWedge,
|
|
||||||
}
|
|
||||||
#[derive(Hash,PartialEq,Eq)]
|
|
||||||
pub enum CubeFace{
|
|
||||||
Right,
|
|
||||||
Top,
|
|
||||||
Back,
|
|
||||||
Left,
|
|
||||||
Bottom,
|
|
||||||
Front,
|
|
||||||
}
|
|
||||||
const CUBE_DEFAULT_TEXTURE_COORDS:[TextureCoordinate;4]=[
|
|
||||||
TextureCoordinate::new(0.0,0.0),
|
|
||||||
TextureCoordinate::new(1.0,0.0),
|
|
||||||
TextureCoordinate::new(1.0,1.0),
|
|
||||||
TextureCoordinate::new(0.0,1.0),
|
|
||||||
];
|
|
||||||
const CUBE_DEFAULT_VERTICES:[Planar64Vec3;8]=[
|
|
||||||
Planar64Vec3::int(-1,-1, 1),//0 left bottom back
|
|
||||||
Planar64Vec3::int( 1,-1, 1),//1 right bottom back
|
|
||||||
Planar64Vec3::int( 1, 1, 1),//2 right top back
|
|
||||||
Planar64Vec3::int(-1, 1, 1),//3 left top back
|
|
||||||
Planar64Vec3::int(-1, 1,-1),//4 left top front
|
|
||||||
Planar64Vec3::int( 1, 1,-1),//5 right top front
|
|
||||||
Planar64Vec3::int( 1,-1,-1),//6 right bottom front
|
|
||||||
Planar64Vec3::int(-1,-1,-1),//7 left bottom front
|
|
||||||
];
|
|
||||||
const CUBE_DEFAULT_NORMALS:[Planar64Vec3;6]=[
|
|
||||||
Planar64Vec3::int( 1, 0, 0),//CubeFace::Right
|
|
||||||
Planar64Vec3::int( 0, 1, 0),//CubeFace::Top
|
|
||||||
Planar64Vec3::int( 0, 0, 1),//CubeFace::Back
|
|
||||||
Planar64Vec3::int(-1, 0, 0),//CubeFace::Left
|
|
||||||
Planar64Vec3::int( 0,-1, 0),//CubeFace::Bottom
|
|
||||||
Planar64Vec3::int( 0, 0,-1),//CubeFace::Front
|
|
||||||
];
|
|
||||||
const CUBE_DEFAULT_POLYS:[[[u32;3];4];6]=[
|
|
||||||
// right (1, 0, 0)
|
|
||||||
[
|
|
||||||
[6,2,0],//[vertex,tex,norm]
|
|
||||||
[5,1,0],
|
|
||||||
[2,0,0],
|
|
||||||
[1,3,0],
|
|
||||||
],
|
|
||||||
// top (0, 1, 0)
|
|
||||||
[
|
|
||||||
[5,3,1],
|
|
||||||
[4,2,1],
|
|
||||||
[3,1,1],
|
|
||||||
[2,0,1],
|
|
||||||
],
|
|
||||||
// back (0, 0, 1)
|
|
||||||
[
|
|
||||||
[0,3,2],
|
|
||||||
[1,2,2],
|
|
||||||
[2,1,2],
|
|
||||||
[3,0,2],
|
|
||||||
],
|
|
||||||
// left (-1, 0, 0)
|
|
||||||
[
|
|
||||||
[0,2,3],
|
|
||||||
[3,1,3],
|
|
||||||
[4,0,3],
|
|
||||||
[7,3,3],
|
|
||||||
],
|
|
||||||
// bottom (0,-1, 0)
|
|
||||||
[
|
|
||||||
[1,1,4],
|
|
||||||
[0,0,4],
|
|
||||||
[7,3,4],
|
|
||||||
[6,2,4],
|
|
||||||
],
|
|
||||||
// front (0, 0,-1)
|
|
||||||
[
|
|
||||||
[4,1,5],
|
|
||||||
[5,0,5],
|
|
||||||
[6,3,5],
|
|
||||||
[7,2,5],
|
|
||||||
],
|
|
||||||
];
|
|
||||||
|
|
||||||
#[derive(Hash,PartialEq,Eq)]
|
|
||||||
pub enum WedgeFace{
|
|
||||||
Right,
|
|
||||||
TopFront,
|
|
||||||
Back,
|
|
||||||
Left,
|
|
||||||
Bottom,
|
|
||||||
}
|
|
||||||
const WEDGE_DEFAULT_NORMALS:[Planar64Vec3;5]=[
|
|
||||||
Planar64Vec3::int( 1, 0, 0),//Wedge::Right
|
|
||||||
Planar64Vec3::int( 0, 1,-1),//Wedge::TopFront
|
|
||||||
Planar64Vec3::int( 0, 0, 1),//Wedge::Back
|
|
||||||
Planar64Vec3::int(-1, 0, 0),//Wedge::Left
|
|
||||||
Planar64Vec3::int( 0,-1, 0),//Wedge::Bottom
|
|
||||||
];
|
|
||||||
/*
|
|
||||||
local cornerWedgeVerticies = {
|
|
||||||
Vector3.new(-1/2,-1/2,-1/2),7
|
|
||||||
Vector3.new(-1/2,-1/2, 1/2),0
|
|
||||||
Vector3.new( 1/2,-1/2,-1/2),6
|
|
||||||
Vector3.new( 1/2,-1/2, 1/2),1
|
|
||||||
Vector3.new( 1/2, 1/2,-1/2),5
|
|
||||||
}
|
|
||||||
*/
|
|
||||||
#[derive(Hash,PartialEq,Eq)]
|
|
||||||
pub enum CornerWedgeFace{
|
|
||||||
Right,
|
|
||||||
TopBack,
|
|
||||||
TopLeft,
|
|
||||||
Bottom,
|
|
||||||
Front,
|
|
||||||
}
|
|
||||||
const CORNERWEDGE_DEFAULT_NORMALS:[Planar64Vec3;5]=[
|
|
||||||
Planar64Vec3::int( 1, 0, 0),//CornerWedge::Right
|
|
||||||
Planar64Vec3::int( 0, 1, 1),//CornerWedge::BackTop
|
|
||||||
Planar64Vec3::int(-1, 1, 0),//CornerWedge::LeftTop
|
|
||||||
Planar64Vec3::int( 0,-1, 0),//CornerWedge::Bottom
|
|
||||||
Planar64Vec3::int( 0, 0,-1),//CornerWedge::Front
|
|
||||||
];
|
|
||||||
pub fn unit_sphere()->crate::model::IndexedModel{
|
|
||||||
unit_cube()
|
|
||||||
}
|
|
||||||
#[derive(Default)]
|
|
||||||
pub struct CubeFaceDescription([Option<FaceDescription>;6]);
|
|
||||||
impl CubeFaceDescription{
|
|
||||||
pub fn insert(&mut self,index:CubeFace,value:FaceDescription){
|
|
||||||
self.0[index as usize]=Some(value);
|
|
||||||
}
|
|
||||||
pub fn pairs(self)->std::iter::FilterMap<std::iter::Enumerate<std::array::IntoIter<Option<FaceDescription>,6>>,impl FnMut((usize,Option<FaceDescription>))->Option<(usize,FaceDescription)>>{
|
|
||||||
self.0.into_iter().enumerate().filter_map(|v|v.1.map(|u|(v.0,u)))
|
|
||||||
}
|
|
||||||
}
|
|
||||||
pub fn unit_cube()->crate::model::IndexedModel{
|
|
||||||
let mut t=CubeFaceDescription::default();
|
|
||||||
t.insert(CubeFace::Right,FaceDescription::default());
|
|
||||||
t.insert(CubeFace::Top,FaceDescription::default());
|
|
||||||
t.insert(CubeFace::Back,FaceDescription::default());
|
|
||||||
t.insert(CubeFace::Left,FaceDescription::default());
|
|
||||||
t.insert(CubeFace::Bottom,FaceDescription::default());
|
|
||||||
t.insert(CubeFace::Front,FaceDescription::default());
|
|
||||||
generate_partial_unit_cube(t)
|
|
||||||
}
|
|
||||||
pub fn unit_cylinder()->crate::model::IndexedModel{
|
|
||||||
unit_cube()
|
|
||||||
}
|
|
||||||
#[derive(Default)]
|
|
||||||
pub struct WedgeFaceDescription([Option<FaceDescription>;5]);
|
|
||||||
impl WedgeFaceDescription{
|
|
||||||
pub fn insert(&mut self,index:WedgeFace,value:FaceDescription){
|
|
||||||
self.0[index as usize]=Some(value);
|
|
||||||
}
|
|
||||||
pub fn pairs(self)->std::iter::FilterMap<std::iter::Enumerate<std::array::IntoIter<Option<FaceDescription>,5>>,impl FnMut((usize,Option<FaceDescription>))->Option<(usize,FaceDescription)>>{
|
|
||||||
self.0.into_iter().enumerate().filter_map(|v|v.1.map(|u|(v.0,u)))
|
|
||||||
}
|
|
||||||
}
|
|
||||||
pub fn unit_wedge()->crate::model::IndexedModel{
|
|
||||||
let mut t=WedgeFaceDescription::default();
|
|
||||||
t.insert(WedgeFace::Right,FaceDescription::default());
|
|
||||||
t.insert(WedgeFace::TopFront,FaceDescription::default());
|
|
||||||
t.insert(WedgeFace::Back,FaceDescription::default());
|
|
||||||
t.insert(WedgeFace::Left,FaceDescription::default());
|
|
||||||
t.insert(WedgeFace::Bottom,FaceDescription::default());
|
|
||||||
generate_partial_unit_wedge(t)
|
|
||||||
}
|
|
||||||
#[derive(Default)]
|
|
||||||
pub struct CornerWedgeFaceDescription([Option<FaceDescription>;5]);
|
|
||||||
impl CornerWedgeFaceDescription{
|
|
||||||
pub fn insert(&mut self,index:CornerWedgeFace,value:FaceDescription){
|
|
||||||
self.0[index as usize]=Some(value);
|
|
||||||
}
|
|
||||||
pub fn pairs(self)->std::iter::FilterMap<std::iter::Enumerate<std::array::IntoIter<Option<FaceDescription>,5>>,impl FnMut((usize,Option<FaceDescription>))->Option<(usize,FaceDescription)>>{
|
|
||||||
self.0.into_iter().enumerate().filter_map(|v|v.1.map(|u|(v.0,u)))
|
|
||||||
}
|
|
||||||
}
|
|
||||||
pub fn unit_cornerwedge()->crate::model::IndexedModel{
|
|
||||||
let mut t=CornerWedgeFaceDescription::default();
|
|
||||||
t.insert(CornerWedgeFace::Right,FaceDescription::default());
|
|
||||||
t.insert(CornerWedgeFace::TopBack,FaceDescription::default());
|
|
||||||
t.insert(CornerWedgeFace::TopLeft,FaceDescription::default());
|
|
||||||
t.insert(CornerWedgeFace::Bottom,FaceDescription::default());
|
|
||||||
t.insert(CornerWedgeFace::Front,FaceDescription::default());
|
|
||||||
generate_partial_unit_cornerwedge(t)
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Clone)]
|
|
||||||
pub struct FaceDescription{
|
|
||||||
pub texture:Option<u32>,
|
|
||||||
pub transform:glam::Affine2,
|
|
||||||
pub color:Color4,
|
|
||||||
}
|
|
||||||
impl std::default::Default for FaceDescription{
|
|
||||||
fn default()->Self {
|
|
||||||
Self{
|
|
||||||
texture:None,
|
|
||||||
transform:glam::Affine2::IDENTITY,
|
|
||||||
color:Color4::new(1.0,1.0,1.0,0.0),//zero alpha to hide the default texture
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
//TODO: it's probably better to use a shared vertex buffer between all primitives and use indexed rendering instead of generating a unique vertex buffer for each primitive.
|
|
||||||
//implementation: put all roblox primitives into one model.groups <- this won't work but I forget why
|
|
||||||
pub fn generate_partial_unit_cube(face_descriptions:CubeFaceDescription)->crate::model::IndexedModel{
|
|
||||||
let mut generated_pos=Vec::new();
|
|
||||||
let mut generated_tex=Vec::new();
|
|
||||||
let mut generated_normal=Vec::new();
|
|
||||||
let mut generated_color=Vec::new();
|
|
||||||
let mut generated_vertices=Vec::new();
|
|
||||||
let mut groups=Vec::new();
|
|
||||||
let mut transforms=Vec::new();
|
|
||||||
//note that on a cube every vertex is guaranteed to be unique, so there's no need to hash them against existing vertices.
|
|
||||||
for (face_id,face_description) in face_descriptions.pairs(){
|
|
||||||
//assume that scanning short lists is faster than hashing.
|
|
||||||
let transform_index=if let Some(transform_index)=transforms.iter().position(|&transform|transform==face_description.transform){
|
|
||||||
transform_index
|
|
||||||
}else{
|
|
||||||
//create new transform_index
|
|
||||||
let transform_index=transforms.len();
|
|
||||||
transforms.push(face_description.transform);
|
|
||||||
for tex in CUBE_DEFAULT_TEXTURE_COORDS{
|
|
||||||
generated_tex.push(face_description.transform.transform_point2(tex));
|
|
||||||
}
|
|
||||||
transform_index
|
|
||||||
} as u32;
|
|
||||||
let color_index=if let Some(color_index)=generated_color.iter().position(|&color|color==face_description.color){
|
|
||||||
color_index
|
|
||||||
}else{
|
|
||||||
//create new color_index
|
|
||||||
let color_index=generated_color.len();
|
|
||||||
generated_color.push(face_description.color);
|
|
||||||
color_index
|
|
||||||
} as u32;
|
|
||||||
//always push normal
|
|
||||||
let normal_index=generated_normal.len() as u32;
|
|
||||||
generated_normal.push(CUBE_DEFAULT_NORMALS[face_id]);
|
|
||||||
//push vertices as they are needed
|
|
||||||
groups.push(IndexedGroup{
|
|
||||||
texture:face_description.texture,
|
|
||||||
polys:vec![IndexedPolygon{
|
|
||||||
vertices:CUBE_DEFAULT_POLYS[face_id].map(|tup|{
|
|
||||||
let pos=CUBE_DEFAULT_VERTICES[tup[0] as usize];
|
|
||||||
let pos_index=if let Some(pos_index)=generated_pos.iter().position(|&p|p==pos){
|
|
||||||
pos_index
|
|
||||||
}else{
|
|
||||||
//create new pos_index
|
|
||||||
let pos_index=generated_pos.len();
|
|
||||||
generated_pos.push(pos);
|
|
||||||
pos_index
|
|
||||||
} as u32;
|
|
||||||
//always push vertex
|
|
||||||
let vertex=IndexedVertex{
|
|
||||||
pos:pos_index,
|
|
||||||
tex:tup[1]+4*transform_index,
|
|
||||||
normal:normal_index,
|
|
||||||
color:color_index,
|
|
||||||
};
|
|
||||||
let vert_index=generated_vertices.len();
|
|
||||||
generated_vertices.push(vertex);
|
|
||||||
vert_index as u32
|
|
||||||
}).to_vec(),
|
|
||||||
}],
|
|
||||||
});
|
|
||||||
}
|
|
||||||
IndexedModel{
|
|
||||||
unique_pos:generated_pos,
|
|
||||||
unique_tex:generated_tex,
|
|
||||||
unique_normal:generated_normal,
|
|
||||||
unique_color:generated_color,
|
|
||||||
unique_vertices:generated_vertices,
|
|
||||||
groups,
|
|
||||||
instances:Vec::new(),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
//don't think too hard about the copy paste because this is all going into the map tool eventually...
|
|
||||||
pub fn generate_partial_unit_wedge(face_descriptions:WedgeFaceDescription)->crate::model::IndexedModel{
|
|
||||||
let wedge_default_polys=vec![
|
|
||||||
// right (1, 0, 0)
|
|
||||||
vec![
|
|
||||||
[6,2,0],//[vertex,tex,norm]
|
|
||||||
[2,0,0],
|
|
||||||
[1,3,0],
|
|
||||||
],
|
|
||||||
// FrontTop (0, 1, -1)
|
|
||||||
vec![
|
|
||||||
[3,1,1],
|
|
||||||
[2,0,1],
|
|
||||||
[6,3,1],
|
|
||||||
[7,2,1],
|
|
||||||
],
|
|
||||||
// back (0, 0, 1)
|
|
||||||
vec![
|
|
||||||
[0,3,2],
|
|
||||||
[1,2,2],
|
|
||||||
[2,1,2],
|
|
||||||
[3,0,2],
|
|
||||||
],
|
|
||||||
// left (-1, 0, 0)
|
|
||||||
vec![
|
|
||||||
[0,2,3],
|
|
||||||
[3,1,3],
|
|
||||||
[7,3,3],
|
|
||||||
],
|
|
||||||
// bottom (0,-1, 0)
|
|
||||||
vec![
|
|
||||||
[1,1,4],
|
|
||||||
[0,0,4],
|
|
||||||
[7,3,4],
|
|
||||||
[6,2,4],
|
|
||||||
],
|
|
||||||
];
|
|
||||||
let mut generated_pos=Vec::new();
|
|
||||||
let mut generated_tex=Vec::new();
|
|
||||||
let mut generated_normal=Vec::new();
|
|
||||||
let mut generated_color=Vec::new();
|
|
||||||
let mut generated_vertices=Vec::new();
|
|
||||||
let mut groups=Vec::new();
|
|
||||||
let mut transforms=Vec::new();
|
|
||||||
//note that on a cube every vertex is guaranteed to be unique, so there's no need to hash them against existing vertices.
|
|
||||||
for (face_id,face_description) in face_descriptions.pairs(){
|
|
||||||
//assume that scanning short lists is faster than hashing.
|
|
||||||
let transform_index=if let Some(transform_index)=transforms.iter().position(|&transform|transform==face_description.transform){
|
|
||||||
transform_index
|
|
||||||
}else{
|
|
||||||
//create new transform_index
|
|
||||||
let transform_index=transforms.len();
|
|
||||||
transforms.push(face_description.transform);
|
|
||||||
for tex in CUBE_DEFAULT_TEXTURE_COORDS{
|
|
||||||
generated_tex.push(face_description.transform.transform_point2(tex));
|
|
||||||
}
|
|
||||||
transform_index
|
|
||||||
} as u32;
|
|
||||||
let color_index=if let Some(color_index)=generated_color.iter().position(|&color|color==face_description.color){
|
|
||||||
color_index
|
|
||||||
}else{
|
|
||||||
//create new color_index
|
|
||||||
let color_index=generated_color.len();
|
|
||||||
generated_color.push(face_description.color);
|
|
||||||
color_index
|
|
||||||
} as u32;
|
|
||||||
//always push normal
|
|
||||||
let normal_index=generated_normal.len() as u32;
|
|
||||||
generated_normal.push(WEDGE_DEFAULT_NORMALS[face_id]);
|
|
||||||
//push vertices as they are needed
|
|
||||||
groups.push(IndexedGroup{
|
|
||||||
texture:face_description.texture,
|
|
||||||
polys:vec![IndexedPolygon{
|
|
||||||
vertices:wedge_default_polys[face_id].iter().map(|tup|{
|
|
||||||
let pos=CUBE_DEFAULT_VERTICES[tup[0] as usize];
|
|
||||||
let pos_index=if let Some(pos_index)=generated_pos.iter().position(|&p|p==pos){
|
|
||||||
pos_index
|
|
||||||
}else{
|
|
||||||
//create new pos_index
|
|
||||||
let pos_index=generated_pos.len();
|
|
||||||
generated_pos.push(pos);
|
|
||||||
pos_index
|
|
||||||
} as u32;
|
|
||||||
//always push vertex
|
|
||||||
let vertex=IndexedVertex{
|
|
||||||
pos:pos_index,
|
|
||||||
tex:tup[1]+4*transform_index,
|
|
||||||
normal:normal_index,
|
|
||||||
color:color_index,
|
|
||||||
};
|
|
||||||
let vert_index=generated_vertices.len();
|
|
||||||
generated_vertices.push(vertex);
|
|
||||||
vert_index as u32
|
|
||||||
}).collect(),
|
|
||||||
}],
|
|
||||||
});
|
|
||||||
}
|
|
||||||
IndexedModel{
|
|
||||||
unique_pos:generated_pos,
|
|
||||||
unique_tex:generated_tex,
|
|
||||||
unique_normal:generated_normal,
|
|
||||||
unique_color:generated_color,
|
|
||||||
unique_vertices:generated_vertices,
|
|
||||||
groups,
|
|
||||||
instances:Vec::new(),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn generate_partial_unit_cornerwedge(face_descriptions:CornerWedgeFaceDescription)->crate::model::IndexedModel{
|
|
||||||
let cornerwedge_default_polys=vec![
|
|
||||||
// right (1, 0, 0)
|
|
||||||
vec![
|
|
||||||
[6,2,0],//[vertex,tex,norm]
|
|
||||||
[5,1,0],
|
|
||||||
[1,3,0],
|
|
||||||
],
|
|
||||||
// BackTop (0, 1, 1)
|
|
||||||
vec![
|
|
||||||
[5,3,1],
|
|
||||||
[0,1,1],
|
|
||||||
[1,0,1],
|
|
||||||
],
|
|
||||||
// LeftTop (-1, 1, 0)
|
|
||||||
vec![
|
|
||||||
[5,3,2],
|
|
||||||
[7,2,2],
|
|
||||||
[0,1,2],
|
|
||||||
],
|
|
||||||
// bottom (0,-1, 0)
|
|
||||||
vec![
|
|
||||||
[1,1,3],
|
|
||||||
[0,0,3],
|
|
||||||
[7,3,3],
|
|
||||||
[6,2,3],
|
|
||||||
],
|
|
||||||
// front (0, 0,-1)
|
|
||||||
vec![
|
|
||||||
[5,0,4],
|
|
||||||
[6,3,4],
|
|
||||||
[7,2,4],
|
|
||||||
],
|
|
||||||
];
|
|
||||||
let mut generated_pos=Vec::new();
|
|
||||||
let mut generated_tex=Vec::new();
|
|
||||||
let mut generated_normal=Vec::new();
|
|
||||||
let mut generated_color=Vec::new();
|
|
||||||
let mut generated_vertices=Vec::new();
|
|
||||||
let mut groups=Vec::new();
|
|
||||||
let mut transforms=Vec::new();
|
|
||||||
//note that on a cube every vertex is guaranteed to be unique, so there's no need to hash them against existing vertices.
|
|
||||||
for (face_id,face_description) in face_descriptions.pairs(){
|
|
||||||
//assume that scanning short lists is faster than hashing.
|
|
||||||
let transform_index=if let Some(transform_index)=transforms.iter().position(|&transform|transform==face_description.transform){
|
|
||||||
transform_index
|
|
||||||
}else{
|
|
||||||
//create new transform_index
|
|
||||||
let transform_index=transforms.len();
|
|
||||||
transforms.push(face_description.transform);
|
|
||||||
for tex in CUBE_DEFAULT_TEXTURE_COORDS{
|
|
||||||
generated_tex.push(face_description.transform.transform_point2(tex));
|
|
||||||
}
|
|
||||||
transform_index
|
|
||||||
} as u32;
|
|
||||||
let color_index=if let Some(color_index)=generated_color.iter().position(|&color|color==face_description.color){
|
|
||||||
color_index
|
|
||||||
}else{
|
|
||||||
//create new color_index
|
|
||||||
let color_index=generated_color.len();
|
|
||||||
generated_color.push(face_description.color);
|
|
||||||
color_index
|
|
||||||
} as u32;
|
|
||||||
//always push normal
|
|
||||||
let normal_index=generated_normal.len() as u32;
|
|
||||||
generated_normal.push(CORNERWEDGE_DEFAULT_NORMALS[face_id]);
|
|
||||||
//push vertices as they are needed
|
|
||||||
groups.push(IndexedGroup{
|
|
||||||
texture:face_description.texture,
|
|
||||||
polys:vec![IndexedPolygon{
|
|
||||||
vertices:cornerwedge_default_polys[face_id].iter().map(|tup|{
|
|
||||||
let pos=CUBE_DEFAULT_VERTICES[tup[0] as usize];
|
|
||||||
let pos_index=if let Some(pos_index)=generated_pos.iter().position(|&p|p==pos){
|
|
||||||
pos_index
|
|
||||||
}else{
|
|
||||||
//create new pos_index
|
|
||||||
let pos_index=generated_pos.len();
|
|
||||||
generated_pos.push(pos);
|
|
||||||
pos_index
|
|
||||||
} as u32;
|
|
||||||
//always push vertex
|
|
||||||
let vertex=IndexedVertex{
|
|
||||||
pos:pos_index,
|
|
||||||
tex:tup[1]+4*transform_index,
|
|
||||||
normal:normal_index,
|
|
||||||
color:color_index,
|
|
||||||
};
|
|
||||||
let vert_index=generated_vertices.len();
|
|
||||||
generated_vertices.push(vertex);
|
|
||||||
vert_index as u32
|
|
||||||
}).collect(),
|
|
||||||
}],
|
|
||||||
});
|
|
||||||
}
|
|
||||||
IndexedModel{
|
|
||||||
unique_pos:generated_pos,
|
|
||||||
unique_tex:generated_tex,
|
|
||||||
unique_normal:generated_normal,
|
|
||||||
unique_color:generated_color,
|
|
||||||
unique_vertices:generated_vertices,
|
|
||||||
groups,
|
|
||||||
instances:Vec::new(),
|
|
||||||
}
|
|
||||||
}
|
|
@ -1,4 +1,4 @@
|
|||||||
use crate::integer::{Ratio64,Ratio64Vec2};
|
use strafesnet_common::integer::{Ratio64,Ratio64Vec2};
|
||||||
#[derive(Clone)]
|
#[derive(Clone)]
|
||||||
struct Ratio{
|
struct Ratio{
|
||||||
ratio:f64,
|
ratio:f64,
|
||||||
|
28
src/setup.rs
28
src/setup.rs
@ -1,5 +1,6 @@
|
|||||||
use crate::instruction::TimedInstruction;
|
|
||||||
use crate::window::WindowInstruction;
|
use crate::window::WindowInstruction;
|
||||||
|
use strafesnet_common::instruction::TimedInstruction;
|
||||||
|
use strafesnet_common::integer;
|
||||||
|
|
||||||
fn optional_features()->wgpu::Features{
|
fn optional_features()->wgpu::Features{
|
||||||
wgpu::Features::TEXTURE_COMPRESSION_ASTC
|
wgpu::Features::TEXTURE_COMPRESSION_ASTC
|
||||||
@ -24,14 +25,14 @@ struct SetupContextPartial1{
|
|||||||
instance:wgpu::Instance,
|
instance:wgpu::Instance,
|
||||||
}
|
}
|
||||||
fn create_window(title:&str,event_loop:&winit::event_loop::EventLoop<()>)->Result<winit::window::Window,winit::error::OsError>{
|
fn create_window(title:&str,event_loop:&winit::event_loop::EventLoop<()>)->Result<winit::window::Window,winit::error::OsError>{
|
||||||
let mut builder = winit::window::WindowBuilder::new();
|
let mut attr=winit::window::WindowAttributes::default();
|
||||||
builder = builder.with_title(title);
|
attr=attr.with_title(title);
|
||||||
#[cfg(windows_OFF)] // TODO
|
#[cfg(windows_OFF)] // TODO
|
||||||
{
|
{
|
||||||
use winit::platform::windows::WindowBuilderExtWindows;
|
use winit::platform::windows::WindowBuilderExtWindows;
|
||||||
builder = builder.with_no_redirection_bitmap(true);
|
builder=builder.with_no_redirection_bitmap(true);
|
||||||
}
|
}
|
||||||
builder.build(event_loop)
|
event_loop.create_window(attr)
|
||||||
}
|
}
|
||||||
fn create_instance()->SetupContextPartial1{
|
fn create_instance()->SetupContextPartial1{
|
||||||
let backends=wgpu::util::backend_bits_from_env().unwrap_or_else(wgpu::Backends::all);
|
let backends=wgpu::util::backend_bits_from_env().unwrap_or_else(wgpu::Backends::all);
|
||||||
@ -142,6 +143,7 @@ impl<'a> SetupContextPartial3<'a>{
|
|||||||
label: None,
|
label: None,
|
||||||
required_features: (optional_features & self.adapter.features()) | required_features,
|
required_features: (optional_features & self.adapter.features()) | required_features,
|
||||||
required_limits: needed_limits,
|
required_limits: needed_limits,
|
||||||
|
memory_hints:wgpu::MemoryHints::Performance,
|
||||||
},
|
},
|
||||||
trace_dir.ok().as_ref().map(std::path::Path::new),
|
trace_dir.ok().as_ref().map(std::path::Path::new),
|
||||||
))
|
))
|
||||||
@ -211,9 +213,19 @@ pub fn setup_and_start(title:String){
|
|||||||
|
|
||||||
//dedicated thread to ping request redraw back and resize the window doesn't seem logical
|
//dedicated thread to ping request redraw back and resize the window doesn't seem logical
|
||||||
|
|
||||||
let window=crate::window::WindowContextSetup::new(&setup_context,&window);
|
|
||||||
//the thread that spawns the physics thread
|
//the thread that spawns the physics thread
|
||||||
let window_thread=window.into_worker(setup_context);
|
let mut window_thread=crate::window::worker(
|
||||||
|
&window,
|
||||||
|
setup_context,
|
||||||
|
);
|
||||||
|
|
||||||
|
if let Some(arg)=std::env::args().nth(1){
|
||||||
|
let path=std::path::PathBuf::from(arg);
|
||||||
|
window_thread.send(TimedInstruction{
|
||||||
|
time:integer::Time::ZERO,
|
||||||
|
instruction:WindowInstruction::WindowEvent(winit::event::WindowEvent::DroppedFile(path)),
|
||||||
|
}).unwrap();
|
||||||
|
};
|
||||||
|
|
||||||
println!("Entering event loop...");
|
println!("Entering event loop...");
|
||||||
let root_time=std::time::Instant::now();
|
let root_time=std::time::Instant::now();
|
||||||
@ -226,7 +238,7 @@ fn run_event_loop(
|
|||||||
root_time:std::time::Instant
|
root_time:std::time::Instant
|
||||||
)->Result<(),winit::error::EventLoopError>{
|
)->Result<(),winit::error::EventLoopError>{
|
||||||
event_loop.run(move |event,elwt|{
|
event_loop.run(move |event,elwt|{
|
||||||
let time=crate::integer::Time::from_nanos(root_time.elapsed().as_nanos() as i64);
|
let time=integer::Time::from_nanos(root_time.elapsed().as_nanos() as i64);
|
||||||
// *control_flow=if cfg!(feature="metal-auto-capture"){
|
// *control_flow=if cfg!(feature="metal-auto-capture"){
|
||||||
// winit::event_loop::ControlFlow::Exit
|
// winit::event_loop::ControlFlow::Exit
|
||||||
// }else{
|
// }else{
|
||||||
|
@ -48,7 +48,7 @@ struct ModelInstance{
|
|||||||
//my fancy idea is to create a megatexture for each model that includes all the textures each intance will need
|
//my fancy idea is to create a megatexture for each model that includes all the textures each intance will need
|
||||||
//the texture transform then maps the texture coordinates to the location of the specific texture
|
//the texture transform then maps the texture coordinates to the location of the specific texture
|
||||||
//group 1 is the model
|
//group 1 is the model
|
||||||
const MAX_MODEL_INSTANCES=4096;
|
const MAX_MODEL_INSTANCES=512;
|
||||||
@group(2)
|
@group(2)
|
||||||
@binding(0)
|
@binding(0)
|
||||||
var<uniform> model_instances: array<ModelInstance, MAX_MODEL_INSTANCES>;
|
var<uniform> model_instances: array<ModelInstance, MAX_MODEL_INSTANCES>;
|
||||||
|
@ -1,5 +1,6 @@
|
|||||||
use crate::instruction::TimedInstruction;
|
|
||||||
use crate::physics_worker::InputInstruction;
|
use crate::physics_worker::InputInstruction;
|
||||||
|
use strafesnet_common::integer;
|
||||||
|
use strafesnet_common::instruction::TimedInstruction;
|
||||||
|
|
||||||
pub enum WindowInstruction{
|
pub enum WindowInstruction{
|
||||||
Resize(winit::dpi::PhysicalSize<u32>),
|
Resize(winit::dpi::PhysicalSize<u32>),
|
||||||
@ -12,9 +13,8 @@ pub enum WindowInstruction{
|
|||||||
//holds thread handles to dispatch to
|
//holds thread handles to dispatch to
|
||||||
struct WindowContext<'a>{
|
struct WindowContext<'a>{
|
||||||
manual_mouse_lock:bool,
|
manual_mouse_lock:bool,
|
||||||
mouse:crate::physics::MouseState,//std::sync::Arc<std::sync::Mutex<>>
|
mouse:strafesnet_common::mouse::MouseState,//std::sync::Arc<std::sync::Mutex<>>
|
||||||
screen_size:glam::UVec2,
|
screen_size:glam::UVec2,
|
||||||
user_settings:crate::settings::UserSettings,
|
|
||||||
window:&'a winit::window::Window,
|
window:&'a winit::window::Window,
|
||||||
physics_thread:crate::compat_worker::QNWorker<'a, TimedInstruction<crate::physics_worker::Instruction>>,
|
physics_thread:crate::compat_worker::QNWorker<'a, TimedInstruction<crate::physics_worker::Instruction>>,
|
||||||
}
|
}
|
||||||
@ -23,17 +23,20 @@ impl WindowContext<'_>{
|
|||||||
fn get_middle_of_screen(&self)->winit::dpi::PhysicalPosition<f32>{
|
fn get_middle_of_screen(&self)->winit::dpi::PhysicalPosition<f32>{
|
||||||
winit::dpi::PhysicalPosition::new(self.screen_size.x as f32/2.0,self.screen_size.y as f32/2.0)
|
winit::dpi::PhysicalPosition::new(self.screen_size.x as f32/2.0,self.screen_size.y as f32/2.0)
|
||||||
}
|
}
|
||||||
fn window_event(&mut self,time:crate::integer::Time,event: winit::event::WindowEvent) {
|
fn window_event(&mut self,time:integer::Time,event: winit::event::WindowEvent) {
|
||||||
match event {
|
match event {
|
||||||
winit::event::WindowEvent::DroppedFile(path)=>{
|
winit::event::WindowEvent::DroppedFile(path)=>{
|
||||||
//blocking because it's simpler...
|
match crate::file::load(path.as_path()){
|
||||||
if let Some(indexed_model_instances)=crate::load_file(path){
|
Ok(map)=>self.physics_thread.send(TimedInstruction{time,instruction:crate::physics_worker::Instruction::ChangeMap(map)}).unwrap(),
|
||||||
self.physics_thread.send(TimedInstruction{time,instruction:crate::physics_worker::Instruction::ClearModels}).unwrap();
|
Err(e)=>println!("Failed to load map: {e}"),
|
||||||
self.physics_thread.send(TimedInstruction{time,instruction:crate::physics_worker::Instruction::GenerateModels(indexed_model_instances)}).unwrap();
|
|
||||||
}
|
}
|
||||||
},
|
},
|
||||||
winit::event::WindowEvent::Focused(_state)=>{
|
winit::event::WindowEvent::Focused(state)=>{
|
||||||
//pause unpause
|
//pause unpause
|
||||||
|
self.physics_thread.send(TimedInstruction{
|
||||||
|
time,
|
||||||
|
instruction:crate::physics_worker::Instruction::SetPaused(!state),
|
||||||
|
}).unwrap();
|
||||||
//recalculate pressed keys on focus
|
//recalculate pressed keys on focus
|
||||||
},
|
},
|
||||||
winit::event::WindowEvent::KeyboardInput{
|
winit::event::WindowEvent::KeyboardInput{
|
||||||
@ -104,7 +107,12 @@ impl WindowContext<'_>{
|
|||||||
"e"=>Some(InputInstruction::MoveUp(s)),
|
"e"=>Some(InputInstruction::MoveUp(s)),
|
||||||
"q"=>Some(InputInstruction::MoveDown(s)),
|
"q"=>Some(InputInstruction::MoveDown(s)),
|
||||||
"z"=>Some(InputInstruction::Zoom(s)),
|
"z"=>Some(InputInstruction::Zoom(s)),
|
||||||
"r"=>if s{Some(InputInstruction::Reset)}else{None},
|
"r"=>if s{
|
||||||
|
//mouse needs to be reset since the position is absolute
|
||||||
|
self.mouse=strafesnet_common::mouse::MouseState::default();
|
||||||
|
Some(InputInstruction::ResetAndRestart)
|
||||||
|
}else{None},
|
||||||
|
"f"=>if s{Some(InputInstruction::PracticeFly)}else{None},
|
||||||
_=>None,
|
_=>None,
|
||||||
},
|
},
|
||||||
_=>None,
|
_=>None,
|
||||||
@ -121,7 +129,7 @@ impl WindowContext<'_>{
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
fn device_event(&mut self,time:crate::integer::Time,event: winit::event::DeviceEvent) {
|
fn device_event(&mut self,time:integer::Time,event: winit::event::DeviceEvent) {
|
||||||
match event {
|
match event {
|
||||||
winit::event::DeviceEvent::MouseMotion {
|
winit::event::DeviceEvent::MouseMotion {
|
||||||
delta,//these (f64,f64) are integers on my machine
|
delta,//these (f64,f64) are integers on my machine
|
||||||
@ -157,59 +165,32 @@ impl WindowContext<'_>{
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
pub fn worker<'a>(
|
||||||
pub struct WindowContextSetup<'a>{
|
|
||||||
user_settings:crate::settings::UserSettings,
|
|
||||||
window:&'a winit::window::Window,
|
window:&'a winit::window::Window,
|
||||||
physics:crate::physics::PhysicsState,
|
setup_context:crate::setup::SetupContext<'a>,
|
||||||
graphics:crate::graphics::GraphicsState,
|
)->crate::compat_worker::QNWorker<'a,TimedInstruction<WindowInstruction>>{
|
||||||
}
|
// WindowContextSetup::new
|
||||||
|
|
||||||
impl<'a> WindowContextSetup<'a>{
|
|
||||||
pub fn new(context:&crate::setup::SetupContext,window:&'a winit::window::Window)->Self{
|
|
||||||
//wee
|
|
||||||
let user_settings=crate::settings::read_user_settings();
|
let user_settings=crate::settings::read_user_settings();
|
||||||
|
|
||||||
let args:Vec<String>=std::env::args().collect();
|
let mut graphics=crate::graphics::GraphicsState::new(&setup_context.device,&setup_context.queue,&setup_context.config);
|
||||||
let indexed_model_instances=if args.len()==2{
|
|
||||||
crate::load_file(std::path::PathBuf::from(&args[1]))
|
|
||||||
}else{
|
|
||||||
None
|
|
||||||
}.unwrap_or(crate::default_models());
|
|
||||||
|
|
||||||
let mut physics=crate::physics::PhysicsState::default();
|
|
||||||
physics.load_user_settings(&user_settings);
|
|
||||||
physics.generate_models(&indexed_model_instances);
|
|
||||||
physics.spawn(indexed_model_instances.spawn_point);
|
|
||||||
|
|
||||||
let mut graphics=crate::graphics::GraphicsState::new(&context.device,&context.queue,&context.config);
|
|
||||||
graphics.load_user_settings(&user_settings);
|
graphics.load_user_settings(&user_settings);
|
||||||
graphics.generate_models(&context.device,&context.queue,indexed_model_instances);
|
|
||||||
|
|
||||||
Self{
|
//WindowContextSetup::into_context
|
||||||
user_settings,
|
|
||||||
window,
|
|
||||||
graphics,
|
|
||||||
physics,
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
fn into_context(self,setup_context:crate::setup::SetupContext<'a>)->WindowContext<'a>{
|
|
||||||
let screen_size=glam::uvec2(setup_context.config.width,setup_context.config.height);
|
let screen_size=glam::uvec2(setup_context.config.width,setup_context.config.height);
|
||||||
let graphics_thread=crate::graphics_worker::new(self.graphics,setup_context.config,setup_context.surface,setup_context.device,setup_context.queue);
|
let graphics_thread=crate::graphics_worker::new(graphics,setup_context.config,setup_context.surface,setup_context.device,setup_context.queue);
|
||||||
WindowContext{
|
let mut window_context=WindowContext{
|
||||||
manual_mouse_lock:false,
|
manual_mouse_lock:false,
|
||||||
mouse:crate::physics::MouseState::default(),
|
mouse:strafesnet_common::mouse::MouseState::default(),
|
||||||
//make sure to update this!!!!!
|
//make sure to update this!!!!!
|
||||||
screen_size,
|
screen_size,
|
||||||
user_settings:self.user_settings,
|
window,
|
||||||
window:self.window,
|
physics_thread:crate::physics_worker::new(
|
||||||
physics_thread:crate::physics_worker::new(self.physics,graphics_thread),
|
graphics_thread,
|
||||||
}
|
user_settings,
|
||||||
}
|
),
|
||||||
|
};
|
||||||
|
|
||||||
pub fn into_worker(self,setup_context:crate::setup::SetupContext<'a>)->crate::compat_worker::QNWorker<'a,TimedInstruction<WindowInstruction>>{
|
//WindowContextSetup::into_worker
|
||||||
let mut window_context=self.into_context(setup_context);
|
|
||||||
crate::compat_worker::QNWorker::new(move |ins:TimedInstruction<WindowInstruction>|{
|
crate::compat_worker::QNWorker::new(move |ins:TimedInstruction<WindowInstruction>|{
|
||||||
match ins.instruction{
|
match ins.instruction{
|
||||||
WindowInstruction::RequestRedraw=>{
|
WindowInstruction::RequestRedraw=>{
|
||||||
@ -225,7 +206,7 @@ impl<'a> WindowContextSetup<'a>{
|
|||||||
window_context.physics_thread.send(
|
window_context.physics_thread.send(
|
||||||
TimedInstruction{
|
TimedInstruction{
|
||||||
time:ins.time,
|
time:ins.time,
|
||||||
instruction:crate::physics_worker::Instruction::Resize(size,window_context.user_settings.clone())
|
instruction:crate::physics_worker::Instruction::Resize(size)
|
||||||
}
|
}
|
||||||
).unwrap();
|
).unwrap();
|
||||||
}
|
}
|
||||||
@ -239,5 +220,4 @@ impl<'a> WindowContextSetup<'a>{
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
})
|
})
|
||||||
}
|
|
||||||
}
|
}
|
@ -173,19 +173,24 @@ impl<'a,Task:Send+'a> INWorker<'a,Task>{
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
#[test]//How to run this test with printing: cargo test --release -- --nocapture
|
#[cfg(test)]
|
||||||
fn test_worker() {
|
mod test{
|
||||||
|
use super::{thread,QRWorker};
|
||||||
|
use crate::physics;
|
||||||
|
use strafesnet_common::{integer,instruction};
|
||||||
|
#[test]//How to run this test with printing: cargo test --release -- --nocapture
|
||||||
|
fn test_worker() {
|
||||||
// Create the worker thread
|
// Create the worker thread
|
||||||
let test_body=crate::physics::Body::new(crate::integer::Planar64Vec3::ONE,crate::integer::Planar64Vec3::ONE,crate::integer::Planar64Vec3::ONE,crate::integer::Time::ZERO);
|
let test_body=physics::Body::new(integer::vec3::ONE,integer::vec3::ONE,integer::vec3::ONE,integer::Time::ZERO);
|
||||||
let worker=QRWorker::new(crate::physics::Body::default(),
|
let worker=QRWorker::new(physics::Body::ZERO,
|
||||||
|_|crate::physics::Body::new(crate::integer::Planar64Vec3::ONE,crate::integer::Planar64Vec3::ONE,crate::integer::Planar64Vec3::ONE,crate::integer::Time::ZERO)
|
|_|physics::Body::new(integer::vec3::ONE,integer::vec3::ONE,integer::vec3::ONE,integer::Time::ZERO)
|
||||||
);
|
);
|
||||||
|
|
||||||
// Send tasks to the worker
|
// Send tasks to the worker
|
||||||
for _ in 0..5 {
|
for _ in 0..5 {
|
||||||
let task = crate::instruction::TimedInstruction{
|
let task = instruction::TimedInstruction{
|
||||||
time:crate::integer::Time::ZERO,
|
time:integer::Time::ZERO,
|
||||||
instruction:crate::physics::PhysicsInstruction::StrafeTick,
|
instruction:strafesnet_common::physics::Instruction::Idle,
|
||||||
};
|
};
|
||||||
worker.send(task).unwrap();
|
worker.send(task).unwrap();
|
||||||
}
|
}
|
||||||
@ -197,9 +202,9 @@ fn test_worker() {
|
|||||||
thread::sleep(std::time::Duration::from_millis(10));
|
thread::sleep(std::time::Duration::from_millis(10));
|
||||||
|
|
||||||
// Send a new task
|
// Send a new task
|
||||||
let task = crate::instruction::TimedInstruction{
|
let task = instruction::TimedInstruction{
|
||||||
time:crate::integer::Time::ZERO,
|
time:integer::Time::ZERO,
|
||||||
instruction:crate::physics::PhysicsInstruction::StrafeTick,
|
instruction:strafesnet_common::physics::Instruction::Idle,
|
||||||
};
|
};
|
||||||
worker.send(task).unwrap();
|
worker.send(task).unwrap();
|
||||||
|
|
||||||
@ -207,4 +212,5 @@ fn test_worker() {
|
|||||||
|
|
||||||
// wait long enough to see print from final task
|
// wait long enough to see print from final task
|
||||||
thread::sleep(std::time::Duration::from_millis(10));
|
thread::sleep(std::time::Duration::from_millis(10));
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
@ -1,40 +0,0 @@
|
|||||||
//find roots of polynomials
|
|
||||||
use crate::integer::Planar64;
|
|
||||||
|
|
||||||
#[inline]
|
|
||||||
pub fn zeroes2(a0:Planar64,a1:Planar64,a2:Planar64) -> Vec<Planar64>{
|
|
||||||
if a2==Planar64::ZERO{
|
|
||||||
return zeroes1(a0, a1);
|
|
||||||
}
|
|
||||||
let radicand=a1.get() as i128*a1.get() as i128-a2.get() as i128*a0.get() as i128*4;
|
|
||||||
if 0<radicand {
|
|
||||||
//start with f64 sqrt
|
|
||||||
//failure case: 2^63 < sqrt(2^127)
|
|
||||||
let planar_radicand=Planar64::raw(unsafe{(radicand as f64).sqrt().to_int_unchecked()});
|
|
||||||
//TODO: one or two newtons
|
|
||||||
//sort roots ascending and avoid taking the difference of large numbers
|
|
||||||
match (Planar64::ZERO<a2,Planar64::ZERO<a1){
|
|
||||||
(true, true )=>vec![(-a1-planar_radicand)/(a2*2),(a0*2)/(-a1-planar_radicand)],
|
|
||||||
(true, false)=>vec![(a0*2)/(-a1+planar_radicand),(-a1+planar_radicand)/(a2*2)],
|
|
||||||
(false,true )=>vec![(a0*2)/(-a1-planar_radicand),(-a1-planar_radicand)/(a2*2)],
|
|
||||||
(false,false)=>vec![(-a1+planar_radicand)/(a2*2),(a0*2)/(-a1+planar_radicand)],
|
|
||||||
}
|
|
||||||
} else if radicand==0 {
|
|
||||||
return vec![a1/(a2*-2)];
|
|
||||||
} else {
|
|
||||||
return vec![];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
#[inline]
|
|
||||||
pub fn zeroes1(a0:Planar64,a1:Planar64) -> Vec<Planar64> {
|
|
||||||
if a1==Planar64::ZERO{
|
|
||||||
return vec![];
|
|
||||||
}else{
|
|
||||||
let q=((-a0.get() as i128)<<32)/(a1.get() as i128);
|
|
||||||
if i64::MIN as i128<=q&&q<=i64::MAX as i128{
|
|
||||||
return vec![Planar64::raw(q as i64)];
|
|
||||||
}else{
|
|
||||||
return vec![];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
@ -1 +1 @@
|
|||||||
mangohud ../target/release/strafe-client bhop_maps/5692113331.rbxm
|
mangohud ../target/release/strafe-client bhop_maps/5692113331.snfm
|
||||||
|
@ -1 +1 @@
|
|||||||
/run/media/quat/Files/Documents/map-files/verify-scripts/maps/bhop_all/
|
/run/media/quat/Files/Documents/map-files/verify-scripts/maps/bhop_snfm
|
@ -1 +1 @@
|
|||||||
cargo build --release --target x86_64-pc-windows-gnu
|
cargo build --release --target x86_64-pc-windows-gnu --all-features
|
||||||
|
1
tools/iso
Executable file
1
tools/iso
Executable file
@ -0,0 +1 @@
|
|||||||
|
mangohud ../target/release/strafe-client bhop_maps/5692124338.snfm
|
@ -1 +1 @@
|
|||||||
/run/media/quat/Files/Documents/map-files/verify-scripts/maps/surf_all/
|
/run/media/quat/Files/Documents/map-files/verify-scripts/maps/surf_snfm
|
@ -1 +0,0 @@
|
|||||||
/run/media/quat/Files/Documents/map-files/verify-scripts/textures/dds/
|
|
@ -1 +1 @@
|
|||||||
mangohud ../target/release/strafe-client bhop_maps/5692152916.rbxm
|
mangohud ../target/release/strafe-client bhop_maps/5692152916.snfm
|
||||||
|
@ -1 +1 @@
|
|||||||
mangohud ../target/release/strafe-client surf_maps/5692145408.rbxm
|
mangohud ../target/release/strafe-client surf_maps/5692145408.snfm
|
||||||
|
Loading…
Reference in New Issue
Block a user