-
Posts
531 -
Joined
-
Last visited
-
Days Won
28
Content Type
Profiles
Forums
Events
Everything posted by epos4u
-
Hi Sherzod, using UnimFileUpload then display the image in UnimImage, selecting image from phone, camera rotation is not always correct to display exif to see what the rotation is, so can be rotated in code in UnimImage thanks,
-
any way we can read the exif from uploaded image to see what the rotation is thanks
-
have you got a sample and i will try it out and find out why
-
Barcode/ QRCODE (ANDROID and IOS) for UNIGUI TOUCH
epos4u replied to SISBLU Software's topic in Components and Code Samples
will you share the code for others to learn, as its posted in Code Samples -
your DBisam is password protected. open the database connection in the servermodule with password and not in mainmodule
-
Barcode/ QRCODE (ANDROID and IOS) for UNIGUI TOUCH
epos4u replied to SISBLU Software's topic in Components and Code Samples
i mean the code not the video lol -
Barcode/ QRCODE (ANDROID and IOS) for UNIGUI TOUCH
epos4u replied to SISBLU Software's topic in Components and Code Samples
nice, have you got example to see -
Thank you
-
animation uniGUI DOES ANIMATIONS
epos4u replied to Fred Montier's topic in Components and Code Samples
thanks you fredmontier -
Simply amazing my brother
-
Eid Mubarak UniGui Family
-
the attachment is still there, please correct your email log in, as you might not be able to download !!
-
Thank you
-
Please wait, Farshad will be uploading soon, should be up within the hour
-
thanks, but need to hard code it using BST with code
-
Hi UniGui family, any one with experience of BST search, can you help an old man with this, want to do this in UniGui and then have a chart to display result. thank you T1. Run empirical studies to compute the average length of a path to a random node in a BST (Binary Search Tree) built by insertion of N random keys into an initially empty tree, for N from 100 to 10,000. Do 1,000 trials for each tree size; (a) For a given tree size N,build a BST by insertion of N random keys; e.g., randomly shuffle numbers of 0 to N − 1 and insert them into an (initially empty) BST. (b) Randomly pick a node in the BST; e.g., randomly pick a number between 0 and N − 1. (c) Compute the length of a path to the node, i.e., the number of compare’s carried out while searching the node in the BST. (d) Repeat Step 1b and 1c for 1,000 trials and get the average number of compare’s. Plot the results with the horizontal axis representing treesize N and the vertical axis representing(average) number of compare’s; The plotting can be done using any external software such as spreadsheets. T2. Run similar empirical studies to compute the average number of compare's in Binary Search with an (sorted) array. Note that this has nothing to do with inserting sorted data into a BST. Plot the results. T3. Compare those plots from T1and T2; e.g., overlay the plots together. Discuss whether one could draw a conclusion that the search with BST is more efficient than Binary Search with an (sorted) array or the other way around, etc.
-
hi, its for a course i am doing just in java only lol, not allowed to use delphi or unigui
-
it seems like your running a pirated version!!!!
-
loginform All about a Login Form with a Background video
epos4u replied to Fred Montier's topic in Components and Code Samples
Thank you for quick reply fredmontier -
loginform All about a Login Form with a Background video
epos4u replied to Fred Montier's topic in Components and Code Samples
fredmontier thank you, tried this with mobile log form, how do i put the unimHTMLFrame in the background, it covers my panel and buttons -
Amazing work zemorango simply awesome