Search:

I want to try versatile Criterion testing library. We have three files test.c and add.c and add.h . Compile with:


clang -lcriterion -Wall -Wextra -pedantic -std=c11 test.c add.c -o add

First...

I found this from stackoverflow:



int bioskey(void)
{
//struct timeval tv = { 0L, 0L };
fd_set fds;
FD_ZERO(&fds);
FD_SET(0, &fds);

Hi,

I have faced the following code, can you help me to write a standard version of it:



struct timeval tv;

int bioskey() {
fd_set readfds;

It seems to me you have wrongly hard-coded this:


void my_quicksort(int arr[]){
int low = 0;
int high = 8;

[...]

You may read my Sudoku solver too.

That part could be written as :



for (int m = 0; m < ann->hidden; ++m) {
int windex = m + (ann->hidden_layers ? (ann->hidden * (ann->hidden_layers - 1)) : 0);
w[m+1]...

Hi,

I want to quantize genann library from double/float network type to int16_t . Still I have not got the right output , see this code :

In genann.h


typedef int16_t genann_t;
#define...

This compilation passes and gives no error:


gcc -Wall -Wextra -pedantic example_train.c -lfann -fopenmp -static -lm
gcc -Wall -Wextra -pedantic example_run.c -lfixedfann -fopenmp -static -lm

Experimenting on this , I changed the file "fixedfann.h" to :


typedef int16_t fann_type;//int fann_type;

I have two demonstrating source files:

example_train.c

Hi,

I want to use Fast Artificial Neural Network Library (fann). This is a performance critical work. I want to use:


typedef int16_t fann_type;

In a header file.

Also I want to...

Hi,

I want to profile a multi source project via gprof. I was able to do it but there are issues here:

The number of calls is not shown in output. Like:


% cumulative self ...

At times , I use "KDbg" which is a GUI for GDB.

Explaining the search problem more , these are some states that are just repeated:



======
si is 0 , dist is 0.0 step is 0
0 : 5,2,1,-,-,-,-,-,-,-,
1 : 3,2,0,-,-,-,-,-,-,-,
2 :...

This all_passed function is not used. Here is my new version :



bool all_passed(int *const path)
{

int i;
if(path[0] != 0)
return false;

Here is how I compile this code:


gcc -g -Wall -Wextra -pedantic -Werror -std=c11 try40.c `simple2d --libs` -lm -o try40.out

Here it is:



// Originally from:
// https://github.com/DubiousCactus/GeneticAlgorithm


#include <assert.h>
#include <math.h>

I prefer to post the whole code. As a small program to show the problem is difficult to produce. If you look at the output on terminal , you may spot the problem.

Hi,

I have a traveling sales person (TSP) attempt code. That is based on some one else's code. The algorithm is based on "graph theory" and graphics library is "simple2d". The current problem is...

OK , I got the permit. I may intend to sell the resulting code online. Should I ask questions about code here on the forum or not ? Because that way the code would be accessible to many people ,...

The original code is on GitHub without any license.

Hi,

I have developed an unlicensed code base from some one else. It is about a famous problem in "math/computer science". The original algorithm is now a different one. Graphics library is...

Thanks this works in case of error. In case of only warning(s) , try40.out is executed anyway. Maybe turn warnings into errors ? Other solution ?

Hi,

I have a shell file with this content:



clear


gcc -g -Wall -Wextra -pedantic -std=c11 try40.c -lm -o try40.out

On this laptop without optimization flags for compiler , for last code I get total 47.25 sec comparing to total 50.52 sec for original quicksort ​in post #1.

I borrowed some code from quadsort. Now here is a new version of custom quicksort:



#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <stdbool.h>
#include <stdint.h>