c - 关闭 for 循环后结构中的值发生变化

标签 c for-loop struct

简短版本:为什么 (compounds+k)->spectra->peaks for之后更改循环迭代(大约 2500 个化合物中的 4 个)?

长版本:我有一个函数可以检查我的所有数据(在结构色谱图中(chrom))并添加type == 1的数据。直接到一个新的结构( compounds ), type == 2 的色谱图检查剩余数据中是否存在高度相似的色谱图,并将其求和/平均到 compounds 的 1 个条目中。当我最初使用当时拥有的数据集编写该程序时,该程序运行良好,但使用最近的数据时,我遇到了一个错误,其中跟踪频谱中有多少个“值”的整数在包含 for loop 之后以某种方式重置为 0结束。我希望在阅读我的代码后会更清楚一些(特别注意最后的 2 个打印件,它们演示了该问题)。

chromatogram*
spectral_matcher(chromatogram* chrom, arguments* args) {
   int i, j, k = 0, l, m, size, counter = 0;
   float low_mass, high_mass, low_time, high_time;
   chromatogram* compounds;
   compounds = calloc(MAX_SPECTRA,sizeof(chromatogram));
   for (i = 0; i < chrom->hits-1; i++) {
       if ( (chrom+i)->type == 1) {
           /* Adding the MS1 spectrum to output set */
           chrom_copy(chrom, compounds, i, k);
           k++;
       } else if ((chrom+i)->used != 1 && (chrom+i)->type == 2) {
           /* Adding the MSn spectrum to output set */
           chrom_copy(chrom, compounds, i, k);
           /* Acquiring search paramenters */
           low_mass = (chrom+i)->precursor - args->mass_tolerance;
           high_mass = (chrom+i)->precursor + args->mass_tolerance;
           low_time = (chrom+i)->time - args->time_tolerance;
           high_time = (chrom+i)->time + args->time_tolerance;
           /* Performing search for matching spectra */
           for (j = i+1; j < chrom->hits; j++) {
               if ( (chrom+j)->type == 2 && (chrom+j)->precursor > low_mass && (chrom+j)->precursor < high_mass && (chrom+j)->time > low_time && (chrom+j)->time < high_time && (chrom+i)->spectra->peaks > 10 && (chrom+j)->spectra->peaks > 10 && (chrom+j)->used != 1) {
                   /* the KS test can only be performed if the previous if statement was true */
                   if (pdf_ks((chrom+i)->pdf,(chrom+j)->pdf, 1.0) == 1) {
                       if (args->verbose == 1) {
                           printf("Matching spectrum %i with %i into %i\n",i, j, k);
                       }
                       // De magicks - Photo Finish
                       counter++;
                       l = (compounds+k)->spectra->peaks;
                       size = (compounds+k)->spectra->peaks + (chrom+j)->spectra->peaks;
                       (compounds+k)->spectra->peaks = size;
                       m = 0;
                       /* `l` is at the end of original spectra, append values starting from `l` */
                       for (; l < size; l++) {
                           ((compounds+k)->spectra+l)->mz_value = ((chrom+j)->spectra+m)->mz_value;
                           ((compounds+k)->spectra+l)->int_value = ((chrom+j)->spectra+m)->int_value;
                           m++;
                       }
                       // set the 'matched' spectrum to NULL so there will be no duplicates
                       (chrom+j)->used = 1;
                   }
               }
           }
           k++;
       }
       /* k was incremented in either the if or else if so doing -1 here */
       printf("%i: values [ %i ] contains a value set [ %f - %f ]\n", k-1, (compounds+k-1)->spectra->peaks, ((compounds+k-1)->spectra+5000)->mz_value,((compounds+k-1)->spectra+5000)->int_value);
   }
   printf("BREAKPOINT\n");
   printf("%i spectra summed\n",counter);
   compounds->hits = k;
   for (i = 0; i < compounds->hits; i++) {
       printf("%i: values [ %i ] contains a value set [ %f - %f ]\n", i, (compounds+i)->spectra->peaks, ((compounds+i)->spectra+5000)->mz_value,((compounds+i)->spectra+5000)->int_value);
   }
   exit(0);
   return(compounds);
}

我知道 4 种化合物会产生我之前解释过的奇怪行为,因此以下是输出中的匹配行:

736: values [ 16481 ] contains a value set [ 765.000000 - 0.000000 ]
847: values [ 16481 ] contains a value set [ 765.000000 - 5843.000000 ]
1810: values [ 16481 ] contains a value set [ 765.000000 - 0.000000 ]
2212: values [ 16481 ] contains a value set [ 765.000000 - 0.000000 ]
BREAKPOINT
736: values [ 0 ] contains a value set [ 765.000000 - 905.625000 ]
847: values [ 0 ] contains a value set [ 765.000000 - 905.625000 ]
1810: values [ 0 ] contains a value set [ 765.000000 - 905.625000 ]
2212: values [ 0 ] contains a value set [ 765.000000 - 905.625000 ]

数组中的值甚至似乎会根据此结果而改变。

然而,4 个特殊值周围的值仍然正确:

735: values [ 44801 ] contains a value set [ 556.250000 - 0.000000 ]
736: values [ 16481 ] contains a value set [ 765.000000 - 0.000000 ]
737: values [ 131848 ] contains a value set [ 765.000000 - 0.000000 ]
BREAKPOINT
735: values [ 44801 ] contains a value set [ 556.250000 - 0.000000 ]
736: values [ 0 ] contains a value set [ 765.000000 - 905.625000 ]
737: values [ 131848 ] contains a value set [ 765.000000 - 0.000000 ]

如果有人对接下来要检查的内容有任何点击或提示,我将不胜感激。

-- 5 月 16 日 (4:20) --

我尝试通过在特定的 i 处手动中断 for 循环来查看数据变化的位置。添加 if (i == 806) { break; } 的值到代码。这产生了:

736: values [ 16481 ] contains a value set [ 765.000000 - 0.000000 ]
BREAKPOINT
736: values [ 0 ] contains a value set [ 765.000000 - 905.625000 ]

-- 5 月 17 日 --

我还检查了 i 和 k 计数器是否做了一些奇怪的事情,但它们看起来完全正常(在 for 循环内):

I: 803  K: 734
I: 804  K: 735
I: 805  K: 736 /* The iteration which shows wrong data AFTER the for loop closes */
I: 806  K: 737
I: 807  K: 738
I: 808  K: 739

最佳答案

看看这个:

chromatogram* compounds;
compounds = calloc(MAX_SPECTRA,sizeof(compound));

您可能指的是sizeof(chromatogram)吗?或者化合物*化合物

关于c - 关闭 for 循环后结构中的值发生变化,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/16586342/

相关文章:

C - 对结构指针数组进行排序比直接对结构进行排序 (qsort)

c++ - std::shared_ptr 不适用于范围

java - 使用 for 循环的方法不会打乱我的数组元素或重写所有元素

c - 从未定义的结构

python - 如何在 pyspark 中按字母顺序对嵌套结构的列进行排序?

c - newNode 内存泄漏/分段故障

c++ - 使用 SSE 或 SSE3 在 ushort 数组中添加 uchar 值

c - 2dstrings 和 strncmp

c - 从C语言的命令窗口读取文件

c# - Unity C# - for 循环 : go from one object to the next one (movement) - gets stuck on first object