Onek8/LNXSDK
1
0
Fork 1
forked from LeenkxTeam/LNXSDK
Code Pull Requests Activity

Merge pull request 'main' (#151) from Onek8/LNXSDK:main into main

Browse Source 
Reviewed-on: LeenkxTeam/LNXSDK#151
This commit is contained in:
LeenkxTeam
2026-10-29 05:59:43 +00:00
parent 083e7dbe7d d4a70b7882
commit 4c1ec8078b
8 changed files with 40 additions and 1458 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
leenkx/Sources/iron/data/MeshBatch.hx
View File

@ -57,10 +57,8 @@ class MeshBatch {
} }
public function removeMesh(m: MeshObject) { public function removeMesh(m: MeshObject) {
var shader = m.materials[0].shader; var b = m.materials.length > 0 ? buckets.get(m.materials[0].shader) : null;
var b = buckets.get(shader); if (b == null || !b.removeMesh(m)) nonBatched.remove(m);
if (b != null) b.removeMesh(m);
else nonBatched.remove(m);
} }
@:access(iron.RenderPath) @:access(iron.RenderPath)
@ -176,8 +174,8 @@ class Bucket {
meshes.push(m); meshes.push(m);
} }
public function removeMesh(m: MeshObject) { public function removeMesh(m: MeshObject): Bool {
meshes.remove(m); return meshes.remove(m);
} }
#if lnx_deinterleaved #if lnx_deinterleaved

4
leenkx/Sources/leenkx/logicnode/CreateLeenkxNode.hx
View File

@ -74,7 +74,7 @@ class CreateLeenkxNode extends LogicNode {
lnxCn.isRelay = property1 == true; lnxCn.isRelay = property1 == true;
lnxCn.onOpen = function() { lnxCn.onOpen = function() {
Leenkx.data.set(net_Url, lnxCn.lastPeerCount); Leenkx.data.set(net_Url, lnxCn.lastPeerIndex);
Leenkx.id.set(net_Url, lnxCn.lastPeerId); Leenkx.id.set(net_Url, lnxCn.lastPeerId);
sock.onopen(); sock.onopen();
}; };
@ -94,6 +94,7 @@ class CreateLeenkxNode extends LogicNode {
lnxCn.onLeft = function(address) { lnxCn.onLeft = function(address) {
Leenkx.id.set(net_Url, address); Leenkx.id.set(net_Url, address);
sock.onleft(); sock.onleft();
sock.onclose();
}; };
lnxCn.onServer = function(address) { lnxCn.onServer = function(address) {
Leenkx.id.set(net_Url, address); Leenkx.id.set(net_Url, address);
@ -106,6 +107,7 @@ class CreateLeenkxNode extends LogicNode {
lnxCn.onTimeout = function(address) { lnxCn.onTimeout = function(address) {
Leenkx.id.set(net_Url, address); Leenkx.id.set(net_Url, address);
sock.ontimeout(); sock.ontimeout();
sock.onclose();
}; };
lnxCn.onWireLeft = function(wirecount, wire) { lnxCn.onWireLeft = function(wirecount, wire) {
Leenkx.data.set(net_Url, wirecount); Leenkx.data.set(net_Url, wirecount);

1
leenkx/Sources/leenkx/logicnode/LeenkxCloseConnectionNode.hx
View File

@ -23,7 +23,6 @@ class LeenkxCloseConnectionNode extends LogicNode {
var id:String = inputs.length > 2 ? inputs[2].get() : null; var id:String = inputs.length > 2 ? inputs[2].get() : null;
if (id != null && lnxCn != null) { if (id != null && lnxCn != null) {
lnxCn.peers.remove(id); lnxCn.peers.remove(id);
lnxCn.seenFired.remove(id);
} }
runOutput(0); runOutput(0);
return; return;

54
leenkx/Sources/leenkx/network/torrent/LeenkxClient.hx
View File

@ -26,11 +26,11 @@ class LeenkxClient {
public var peers:Map<String, PeerInfo> = []; public var peers:Map<String, PeerInfo> = [];
public var seen:Map<String, Float> = []; public var seen:Map<String, Float> = [];
public var seenFired:Map<String, Bool> = [];
public var pkToAddress:Map<String, String> = []; public var pkToAddress:Map<String, String> = [];
public var isRelay:Bool = false; public var isRelay:Bool = false;
public var lastPeerCount:Null<Int> = null; public var lastPeerCount:Null<Int> = null;
public var lastPeerId:String = null; public var lastPeerId:String = null;
public var lastPeerIndex:Int = 0;
public var serverAddress:String = null; public var serverAddress:String = null;
public var heartbeatTimer:Null<haxe.Timer> = null; public var heartbeatTimer:Null<haxe.Timer> = null;
@ -408,9 +408,10 @@ class LeenkxClient {
} }
function onMessageData(identifier:String, message:Bytes, ?senderPk:String):Void { function onMessageData(identifier:String, message:Bytes, ?senderPk:String):Void {
var hash = Crypto.hash(message).sub(0, 16).toHex(); var hash = (message.length > 0 && message.get(0) == 0x00)
? null : Crypto.hash(message).sub(0, 16).toHex();
var t = now(); var t = now();
if (!seen.exists(hash)) { if (hash == null || !seen.exists(hash)) {
if (message.length > 0 && (message.get(0) == 0x00 || message.get(0) == 0x01)) { if (message.length > 0 && (message.get(0) == 0x00 || message.get(0) == 0x01)) {
var isRelayed = message.get(0) == 0x01; var isRelayed = message.get(0) == 0x01;
var offset = 1; var offset = 1;
@ -434,7 +435,7 @@ class LeenkxClient {
var rawPayload = message.sub(offset, message.length - offset); var rawPayload = message.sub(offset, message.length - offset);
var payload = new leenkx.network.Buffer(); var payload = new leenkx.network.Buffer();
payload.writeBytes(rawPayload); payload.writeBytes(rawPayload);
seen.set(hash, t); if (isRelayed) seen.set(hash, t);
var senderAddr = msgSenderPk != null ? pkToAddress.get(msgSenderPk) : null; var senderAddr = msgSenderPk != null ? pkToAddress.get(msgSenderPk) : null;
if (senderAddr == null && msgSenderPk != null && msgSenderPk != "") { if (senderAddr == null && msgSenderPk != null && msgSenderPk != "") {
senderAddr = addressFromPk(msgSenderPk); senderAddr = addressFromPk(msgSenderPk);
@ -544,29 +545,32 @@ class LeenkxClient {
function sawPeer(pk:String, ek:String, identifier:String):Void { function sawPeer(pk:String, ek:String, identifier:String):Void {
var t = now(); var t = now();
var addr = addressFromPk(pk); var addr = addressFromPk(pk);
var myAddr = address(); if (addr == address()) return;
var isSelf = (addr == myAddr); if (!peers.exists(addr) || peers[addr].last + timeout < t) {
var alreadySeen = seenFired.exists(addr); var index = 0;
if (!isSelf) { var taken = true;
if (!peers.exists(addr) || peers[addr].last + timeout < t) { while (taken) {
peers.set(addr, {pk: pk, ek: ek, last: t}); taken = false;
var packet = makePacket({y: PacketType.Ping}); index++;
sendRaw(packet); for (k in peers.keys()) {
} else { if (peers[k].index == index) { taken = true; break; }
var p = peers.get(addr);
p.ek = ek;
p.last = t;
}
if (!alreadySeen) {
seenFired.set(addr, true);
lastPeerId = addr;
if (onOpen != null) onOpen();
if (onSeen != null) onSeen(addr);
if (addr == identifier) {
serverAddress = addr;
if (onServer != null) onServer(addr);
} }
} }
peers.set(addr, {pk: pk, ek: ek, last: t, index: index});
lastPeerIndex = index;
lastPeerId = addr;
if (onOpen != null) onOpen();
if (onSeen != null) onSeen(addr);
if (addr == identifier) {
serverAddress = addr;
if (onServer != null) onServer(addr);
}
var packet = makePacket({y: PacketType.Ping});
sendRaw(packet);
} else {
var p = peers.get(addr);
p.ek = ek;
p.last = t;
} }
} }

1
leenkx/Sources/leenkx/network/torrent/Types.hx
View File

@ -22,6 +22,7 @@ typedef PeerInfo = {
var pk:String; var pk:String;
var ek:String; var ek:String;
var last:Float; var last:Float;
var index:Int;
} }
typedef Packet = { typedef Packet = {

6
leenkx/Sources/leenkx/network/torrent/transport/WireTransport.hx
View File

@ -116,9 +116,6 @@ class WireTransport implements ITransport {
if (onPeerHandshake != null && remotePk != "") { if (onPeerHandshake != null && remotePk != "") {
onPeerHandshake(remotePk, remoteEk); onPeerHandshake(remotePk, remoteEk);
} }
if (onPeerConnected != null) {
onPeerConnected(peerId, getPeerCount());
}
}; };
wire.onExtended = function(name:String, data:Bytes) { wire.onExtended = function(name:String, data:Bytes) {
if (name != EXT) return; if (name != EXT) return;
@ -132,6 +129,9 @@ class WireTransport implements ITransport {
if (onError != null) onError(msg); if (onError != null) onError(msg);
}; };
wire.start([EXT]); wire.start([EXT]);
if (onPeerConnected != null) {
onPeerConnected(peerId, getPeerCount());
}
} }
function onPeerLeft(peerId:String):Void { function onPeerLeft(peerId:String):Void {

990
lib/leenkx_tools/threejs/three.min.js vendored
View File

File diff suppressed because one or more lines are too long

432
lib/leenkx_tools/threejs/three.tools.js
View File

@ -1,432 +0,0 @@
var THREE = require("./three.min");
// BufferGeometryUtils.js
/**
* @author spite / http://www.clicktorelease.com/
* @author mrdoob / http://mrdoob.com/
*/
THREE.BufferGeometryUtils = {
fromGeometry: function geometryToBufferGeometry( geometry, settings ) {
if ( geometry instanceof THREE.BufferGeometry ) {
return geometry;
}
settings = settings || { 'vertexColors': THREE.NoColors };
var vertices = geometry.vertices;
var faces = geometry.faces;
var faceVertexUvs = geometry.faceVertexUvs;
var vertexColors = settings.vertexColors;
var hasFaceVertexUv = faceVertexUvs[ 0 ].length > 0;
var hasFaceVertexNormals = faces[ 0 ].vertexNormals.length == 3;
var bufferGeometry = new THREE.BufferGeometry();
bufferGeometry.attributes = {
position: {
itemSize: 3,
array: new Float32Array( faces.length * 3 * 3 )
},
normal: {
itemSize: 3,
array: new Float32Array( faces.length * 3 * 3 )
}
}
var positions = bufferGeometry.attributes.position.array;
var normals = bufferGeometry.attributes.normal.array;
if ( vertexColors !== THREE.NoColors ) {
bufferGeometry.attributes.color = {
itemSize: 3,
array: new Float32Array( faces.length * 3 * 3 )
};
var colors = bufferGeometry.attributes.color.array;
}
if ( hasFaceVertexUv === true ) {
bufferGeometry.attributes.uv = {
itemSize: 2,
array: new Float32Array( faces.length * 3 * 2 )
};
var uvs = bufferGeometry.attributes.uv.array;
}
for ( var i = 0, i2 = 0, i3 = 0; i < faces.length; i ++, i2 += 6, i3 += 9 ) {
var face = faces[ i ];
var a = vertices[ face.a ];
var b = vertices[ face.b ];
var c = vertices[ face.c ];
positions[ i3 ] = a.x;
positions[ i3 + 1 ] = a.y;
positions[ i3 + 2 ] = a.z;
positions[ i3 + 3 ] = b.x;
positions[ i3 + 4 ] = b.y;
positions[ i3 + 5 ] = b.z;
positions[ i3 + 6 ] = c.x;
positions[ i3 + 7 ] = c.y;
positions[ i3 + 8 ] = c.z;
if ( hasFaceVertexNormals === true ) {
var na = face.vertexNormals[ 0 ];
var nb = face.vertexNormals[ 1 ];
var nc = face.vertexNormals[ 2 ];
normals[ i3 ] = na.x;
normals[ i3 + 1 ] = na.y;
normals[ i3 + 2 ] = na.z;
normals[ i3 + 3 ] = nb.x;
normals[ i3 + 4 ] = nb.y;
normals[ i3 + 5 ] = nb.z;
normals[ i3 + 6 ] = nc.x;
normals[ i3 + 7 ] = nc.y;
normals[ i3 + 8 ] = nc.z;
} else {
var n = face.normal;
normals[ i3 ] = n.x;
normals[ i3 + 1 ] = n.y;
normals[ i3 + 2 ] = n.z;
normals[ i3 + 3 ] = n.x;
normals[ i3 + 4 ] = n.y;
normals[ i3 + 5 ] = n.z;
normals[ i3 + 6 ] = n.x;
normals[ i3 + 7 ] = n.y;
normals[ i3 + 8 ] = n.z;
}
if ( vertexColors === THREE.FaceColors ) {
var fc = face.color;
colors[ i3 ] = fc.r;
colors[ i3 + 1 ] = fc.g;
colors[ i3 + 2 ] = fc.b;
colors[ i3 + 3 ] = fc.r;
colors[ i3 + 4 ] = fc.g;
colors[ i3 + 5 ] = fc.b;
colors[ i3 + 6 ] = fc.r;
colors[ i3 + 7 ] = fc.g;
colors[ i3 + 8 ] = fc.b;
} else if ( vertexColors === THREE.VertexColors ) {
var vca = face.vertexColors[ 0 ];
var vcb = face.vertexColors[ 1 ];
var vcc = face.vertexColors[ 2 ];
colors[ i3 ] = vca.r;
colors[ i3 + 1 ] = vca.g;
colors[ i3 + 2 ] = vca.b;
colors[ i3 + 3 ] = vcb.r;
colors[ i3 + 4 ] = vcb.g;
colors[ i3 + 5 ] = vcb.b;
colors[ i3 + 6 ] = vcc.r;
colors[ i3 + 7 ] = vcc.g;
colors[ i3 + 8 ] = vcc.b;
}
if ( hasFaceVertexUv === true ) {
var uva = faceVertexUvs[ 0 ][ i ][ 0 ];
var uvb = faceVertexUvs[ 0 ][ i ][ 1 ];
var uvc = faceVertexUvs[ 0 ][ i ][ 2 ];
uvs[ i2 ] = uva.x;
uvs[ i2 + 1 ] = uva.y;
uvs[ i2 + 2 ] = uvb.x;
uvs[ i2 + 3 ] = uvb.y;
uvs[ i2 + 4 ] = uvc.x;
uvs[ i2 + 5 ] = uvc.y;
}
}
bufferGeometry.computeBoundingSphere();
return bufferGeometry;
}
}
// ConvexGeometry.js
// @author qiao / https://github.com/qiao
THREE.ConvexGeometry = function( vertices ) {
THREE.Geometry.call( this );
var faces = [ [ 0, 1, 2 ], [ 0, 2, 1 ] ];
for ( var i = 3; i < vertices.length; i++ ) {
addPoint( i );
}
function addPoint( vertexId ) {
var vertex = vertices[ vertexId ].clone();
var mag = vertex.length();
vertex.x += mag * randomOffset();
vertex.y += mag * randomOffset();
vertex.z += mag * randomOffset();
var hole = [];
for ( var f = 0; f < faces.length; ) {
var face = faces[ f ];
// for each face, if the vertex can see it,
// then we try to add the face's edges into the hole.
if ( visible( face, vertex ) ) {
for ( var e = 0; e < 3; e++ ) {
var edge = [ face[ e ], face[ ( e + 1 ) % 3 ] ];
var boundary = true;
// remove duplicated edges.
for ( var h = 0; h < hole.length; h++ ) {
if ( equalEdge( hole[ h ], edge ) ) {
hole[ h ] = hole[ hole.length - 1 ];
hole.pop();
boundary = false;
break;
}
}
if ( boundary ) {
hole.push( edge );
}
}
// remove faces[ f ]
faces[ f ] = faces[ faces.length - 1 ];
faces.pop();
} else { // not visible
f++;
}
}
// construct the new faces formed by the edges of the hole and the vertex
for ( var h = 0; h < hole.length; h++ ) {
faces.push( [
hole[ h ][ 0 ],
hole[ h ][ 1 ],
vertexId
] );
}
}
/**
* Whether the face is visible from the vertex
*/
function visible( face, vertex ) {
var va = vertices[ face[ 0 ] ];
var vb = vertices[ face[ 1 ] ];
var vc = vertices[ face[ 2 ] ];
var n = normal( va, vb, vc );
// distance from face to origin
var dist = n.dot( va );
return n.dot( vertex ) >= dist;
}
/**
* Face normal
*/
function normal( va, vb, vc ) {
var cb = new THREE.Vector3();
var ab = new THREE.Vector3();
cb.subVectors( vc, vb );
ab.subVectors( va, vb );
cb.cross( ab );
cb.normalize();
return cb;
}
/**
* Detect whether two edges are equal.
* Note that when constructing the convex hull, two same edges can only
* be of the negative direction.
*/
function equalEdge( ea, eb ) {
return ea[ 0 ] === eb[ 1 ] && ea[ 1 ] === eb[ 0 ];
}
/**
* Create a random offset between -1e-6 and 1e-6.
*/
function randomOffset() {
return ( Math.random() - 0.5 ) * 2 * 1e-6;
}
/**
* XXX: Not sure if this is the correct approach. Need someone to review.
*/
function vertexUv( vertex ) {
var mag = vertex.length();
return new THREE.Vector2( vertex.x / mag, vertex.y / mag );
}
// Push vertices into `this.vertices`, skipping those inside the hull
var id = 0;
var newId = new Array( vertices.length ); // map from old vertex id to new id
for ( var i = 0; i < faces.length; i++ ) {
var face = faces[ i ];
for ( var j = 0; j < 3; j++ ) {
if ( newId[ face[ j ] ] === undefined ) {
newId[ face[ j ] ] = id++;
this.vertices.push( vertices[ face[ j ] ] );
}
face[ j ] = newId[ face[ j ] ];
}
}
// Convert faces into instances of THREE.Face3
for ( var i = 0; i < faces.length; i++ ) {
this.faces.push( new THREE.Face3(
faces[ i ][ 0 ],
faces[ i ][ 1 ],
faces[ i ][ 2 ]
) );
}
// Compute UVs
for ( var i = 0; i < this.faces.length; i++ ) {
var face = this.faces[ i ];
this.faceVertexUvs[ 0 ].push( [
vertexUv( this.vertices[ face.a ] ),
vertexUv( this.vertices[ face.b ] ),
vertexUv( this.vertices[ face.c ])
] );
}
this.computeFaceNormals();
this.computeVertexNormals();
};
THREE.ConvexGeometry.prototype = Object.create( THREE.Geometry.prototype );
// SceneUtils.js
/**
* @author alteredq / http://alteredqualia.com/
*/
THREE.SceneUtils = {
createMultiMaterialObject: function ( geometry, materials ) {
var group = new THREE.Group();
for ( var i = 0, l = materials.length; i < l; i ++ ) {
group.add( new THREE.Mesh( geometry, materials[ i ] ) );
}
return group;
},
detach: function ( child, parent, scene ) {
console.warn( 'THREE.SceneUtils: detach() has been deprecated. Use scene.attach( child ) instead.' );
scene.attach( child );
},
attach: function ( child, scene, parent ) {
console.warn( 'THREE.SceneUtils: attach() has been deprecated. Use parent.attach( child ) instead.' );
parent.attach( child );
}
};
module.exports = THREE