PureBasic Forums - English

why don't you transfer your Map Keys into a List, then you can sort it.

If you want to search Kcc with additional character like Kccc, you can use phonetic functions like soundex.

If you put your individual debug functions in a seperate module, it do not blow up your functional code that much.

As freak said, It's by design not a bug. It's the PB arithmtic shift. That's often a problem!
You have to mask out the the upper Bits after the shift.

But here is a full solution for the BSWAP



Procedure.q BSWAP64(value.q)

CompilerIf #PB_Compiler_Backend = #PB_Backend_Asm

CompilerIf #PB ...

Amazing! If you did not manuiplate the ElapsedMilliseconds()!!!

I can't belive that the speed plus is only the change of String library.

I use prototyped String functions to prevent PB from creating string copies.

I'm working on a X-Reference Tool with a lot of Character and String functions ...

At 1st congratulation to this desiccion!

I do a lot of crazy String manipulations what will probably fail with the new String System.

So I have some questions about it works under the hood:

1. Where the length information is saved?
2. How to read out directly?
3. And finally how to manipulate ...

But what you are telling : "... would require a live compilation of the code to determine..." gives me an idea that only Fred can do, is to create a sort of line compiler.

C$ = LineCompile(line$) and would return a sort of compiled code with tokens for each element of the line. With that, it would ...

Just to understand it right what this software is able to do!
Please correct me when I'm wrong!

It is a runtime compiler, what compiles a very simple C-Like Syntax in an intermediate Byte-Code.
This Bytecode is interpreted by the Virtual Machine.

- Can we say it's a simple Script language?

- We ...

I tried to learn a bit from it! Wow! At the moment it's to hard for me! But for sure, if I have more time I will study it in detail - I guess I will learn a lot from that code!
Many tanks for sharing!!!

First I analysed the scanner: I'm wondering you use String operations for all. I'm very sure ...

nice work!

here are 2 Links if you need more geometric functions.

John Burkardt, Florida State University - Department of scientific computing

https://people.sc.fsu.edu/~jburkardt/f_src/triangle/
https://people.sc.fsu.edu/~jburkardt/f_src/geometry/

Is it always 4 numbers? Or do you want to have a code working for N numbers?
For 4 numbers the easiest solution is that:
Procedure min4(a, b, c, d)
Protected min = a
If b < min: min = b: EndIf
If c < min: min = c: EndIf
If d < min: ProcedureReturn d: EndIf
ProcedureReturn min
EndProcedure ...

Tanks! Puuh! A lot to sudy!

Just to see if it works! The 'crazy' Assembler versions!


EnableExplicit

; works at x32 and x64
; min of 4 Long

; SSE PackedMin support only up to 32 Bit
Procedure Min4l(a.l, b.l, c.l=2147483647, d.l=2147483647)

CompilerIf #PB_Compiler_Backend = #PB_Backend_Asm

CompilerIf #PB_Compiler ...

I try to use the PB SDK Functions from Map.h
But I can't get the Pointer of the Map correctly.

Here is the code what shows what I try to do! (It's just a proof of concept to learn what is possible!)



EnableExplicit

Prototype Map_Hash(*Str)
Global Map_Hash.Map_Hash

Prototype Map ...

Macro Min(_v1, _v2)
(_v1*Bool(_v1 <= _v2) + _v2*Bool(_v1 > _v2))
EndMacro

; Get the highest value from 2 values
; use it : result = Max(3,2)
Macro Max(_v1, _v2)
(_v1*Bool(_v1 >= _v2) + _v2*Bool(_v1 < _v2))
EndMacro

Macro MinOf3(_VarResult, _v1, _v2, _v3)
If _v3 < _v2
If _v3 < _v1 ...

All of them are integers, the function wants floats as input but It shouldn't be an issue, the promotion to float should only happen at the end of the evaluation when it passes the parameter to the function.

Now I understand. To make it clear for all!

In PB6.30 the variable type for Sprite ...

@idle
which of your variable is float?

The documentation says x,y of DisplayTransparentSprite(#Sprite, x, y) is an Integer.
There is no reason for the Compiler to switch to Float if your variables are not float.

maybe