Search:
Type: Posts; User: pkedpker
Search:
Search took 0.03 seconds.
-
Hey passel I resolved this question by using scoring, But it still came short in my project can you look into my project with the Solve button? I'm glad I finally got in contact with you, you are...
-
182904
https://www.vbforums.com/attachment.php?attachmentid=182904
Click the Red Fire to update your code. That's why that button is there, Yeah it's a new feature before this it auto updated...
-
The list is unsorted with the values that come first second and third (100,200,300)
The list indicates the order of the values which is first,second or third.
The Row's are what I call the Keys of...
-
I have 1 small problem I need help with is lexicographical numbers picking the next number which comes soonest from a 2d array. I can throw in 25$ dollars for the help. Can someone contact me on a...
-
Can someone work on it, I posted it also on freelancer if anyone wants to take a look at it, i'm offering 20$ usd for working product.
...
-
This is very hard to explain so I put a picture to explain it, it's basically like a fill flood algorithm but for 2d multi-dimensional arrays. Start from top left and end at bottom right. Lowest...
-
I can pay money if it works right for any numbers.
I attached my whole project here with 2 attempts I tried both failed, attempt #1 almost successful but too much things to look for in the while...
-
alright, solved it guys thanks for the helping effort! :p
Private Sub Button11_Click(sender As Object, e As EventArgs) Handles Button11.Click
Dim bitmaskCounter As Integer = 0
...
-
I'm bad at explaining so I made a picture that's worth a million words
182793
https://www.vbforums.com/attachment.php?attachmentid=182793
Here is my newest code it's getting pretty close to...
-
I can pay 5 dollars for this task if anyone is up for the challenge.
the top values must match up with the bottom values for a 1 bit to be set.
if the values are the same on values before and...
-
I'm trying to shift the bits from old: to new:, If 2 same values are encountered a second time, then it should skip them I guess, that's why first example is broken.
Here is my code:
...
-
seems like a straight-forward simple question but I cannot program it no matter what I try because it's hard to compact the logic in both cases forward and backwards and ignoring starting position...
-
I have finally Solved It!, needed to use `Find` instead of `Where` and problem disappeared!.
The answer now requires 2 linq queries instead of one cannot do chaining on `Find`
...
-
Hello I'm trying to develop a Linq query to find the Lowest Unique Value or Lowest Value also sorted by Row and Column Value.
First it does the Lowest Unique Value Exact match (unique value)
If...
-
-
I store 3 Socket's in a Class (clsUser) and everytime a new user is added to Users Collection it would create.
Set SocketA = New SimpleSock
Set SocketB = New SimpleSock
Set SocketC = New...
-
I thought the SimpleServer was outdated because the size of the SimpleSock was smaller and the dates were older. This one also has Listen/Bind so I figured I could also use it as server code.
I...
-
I figured out why SimpleSock didn't work same as NewSocket2.5
In the function
Public Function Accept(requestID As Long) As Boolean
Commented out
'If m_State <> sckListening Then
...
-
Found 2 bugs in the NewSocket 2.5
Call Socket.Accept(requestId)
You had the m_bInEncr flag incorrect thats why a DataArrival event never triggered for me.
If...
-
thanks for the non-recursion function it'll do :P
by the way you said the way of sorting the data and getting the last column is not possible to get back the original data.. it is.. it's called...
-
https://stackoverflow.com/questions/12000591/open-file-with-a-running-process
this contains the right answer with the 50 bounty accepted in the bottom you create one of those object passers and...
-
just search on google "C# To VB.net converater" and all of them work differently some screw up.. others don't ... just use which one works best and do it slowly and you'll convert the whole code to...
-
if you want to give the non-recursive version that would be cool i dont care how the code looks like haha i wouldn't look it more then one time since you wasted your time writing it the least you...
-
Many thanks for your commitment and support!!!!!! finally could close the book on this question once and for all
Hey passel I haven't been able to access a computer for 2 days but ya thanks for...
-
what a life :eek: don't worry about this too much do whatever you want thanks for trying to help me out. you should definitely get some sleep if i was moving I would stay of computers for a while...
-
Wow thanks again so much passel, your method doesn't stack overflow and indeed runs in under 1 second.. but the sorted results are like pre-sorted and need to be sorted again somehow, I made a image...
-
it scans 200,000 iterations (2 seconds) just to swap 1 row i believe even though that row gets swapped many times it still only does 1 row at a time if it did like all the rows at once then next loop...
-
something like this
Dim dictionary As New Dictionary(Of String, String)
Dim lines() As String = IO.File.ReadAllLines("C:\phonenumbers.txt")
For Each contact As String In lines
Dim...
-
Probably because COUNT(*) will return 0.. in a row so you get a row with the value 0.. which means it has a row so the function will think it has rows so its always true.
To fix this.. you need to...
-
Here is a video explaining how to use resource files in VB.NET and it deals with sounds as well!
https://www.youtube.com/watch?v=nxjN7Ow3NFI
Resource files editor look like this...
-
Imports System.Threading
Public Class Form1
dim Counter as Long = 0
Private Sub Button1_Click(sender As Object, e As EventArgs) Handles Button1.Click
if Counter >=...
-
Ya if i convert it to newlines it might add another 400 kb to the 40GB file. extra (200kb of lines * 2 bytes per new line terminator 0xOD 0x0A).
I have no doubt that the msdos sort will work on...
-
haha thats funny im guessing that sort.exe program is coded very efficiently in x86 assembly or something either way this way is not bad if it can sort it in under hour :P i'll probably go this way...
-
thx si the geek im starting to get a picture but i dont know how its different from my no memory method of always calling GetRotation ..
also the data which is rotated gets removed from front and...
-
Hey si_geek how can i sort this rotation though it obviously requires all the rotated data stored which would take 40,000,000,000 bytes.
0,1,1
1,1,0
1,0,1
as you can see the rotations are
...
-
how would I only use 400,000 bytes? i don't quite get it, 200,000 * 200,000 = 40,000,000,000 i don't get it do you create indexes of the data some how so it get re-used or something can u explain...
-
thanks passel ya thats about what im trying to do exactly.. i simplificated the problem with 5 bytes but its much more heavy
at the moment it takes about a hour to do a full 200,000 element scan...
-
0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1 ... continues up to 200,000 0's or 1's
each rotation is take a number from the front and add it to the back until you get the original result hence 200,000...
-
My real example is 200,000 bytes * 200,000 rototations of the bytes. and the values are only 1's and 0's
-
Don't know if this is the right way to do it.. but I solved it, it seems... not tested on more different datasets but it looks alright
Public Function SortLexicoGraphicallyArrayMappedFile(ByRef...
|
Click Here to Expand Forum to Full Width
|