Завершение большого переименования
This commit is contained in:
parent
120e651517
commit
3805354611
31 changed files with 1213 additions and 1255 deletions
|
@ -10,9 +10,9 @@
|
|||
#endif // _WINDOWS_
|
||||
|
||||
typedef struct {
|
||||
versor_fp32_t versor1, versor2, result;
|
||||
bgc_versor_fp32_t versor1, versor2, result;
|
||||
//matrix3x3_fp32_t matrix;
|
||||
vector3_fp32_t vector1, vector2;
|
||||
bgc_vector3_fp32_t vector1, vector2;
|
||||
} structure_fp32_t;
|
||||
|
||||
structure_fp32_t* allocate_structures(const unsigned int amount)
|
||||
|
@ -31,7 +31,7 @@ structure_fp32_t* make_structures(const unsigned int amount)
|
|||
const float multiplier = 2.0f / RAND_MAX;
|
||||
|
||||
for (unsigned int i = 0; i < amount; i++) {
|
||||
versor_set_values_fp32(
|
||||
bgc_versor_set_values_fp32(
|
||||
rand() * multiplier - 1.0f,
|
||||
rand() * multiplier - 1.0f,
|
||||
rand() * multiplier - 1.0f,
|
||||
|
@ -39,7 +39,7 @@ structure_fp32_t* make_structures(const unsigned int amount)
|
|||
&list[i].versor1
|
||||
);
|
||||
|
||||
versor_set_values_fp32(
|
||||
bgc_versor_set_values_fp32(
|
||||
rand() * multiplier - 1.0f,
|
||||
rand() * multiplier - 1.0f,
|
||||
rand() * multiplier - 1.0f,
|
||||
|
@ -47,49 +47,49 @@ structure_fp32_t* make_structures(const unsigned int amount)
|
|||
&list[i].versor2
|
||||
);
|
||||
|
||||
versor_reset_fp32(&list[i].result);
|
||||
bgc_versor_reset_fp32(&list[i].result);
|
||||
|
||||
//matrix3x3_set_to_identity_fp32(&list[i].matrix);
|
||||
|
||||
vector3_set_values_fp32(
|
||||
bgc_vector3_set_values_fp32(
|
||||
rand() * multiplier - 1.0f,
|
||||
rand() * multiplier - 1.0f,
|
||||
rand() * multiplier - 1.0f,
|
||||
&list[i].vector1
|
||||
);
|
||||
|
||||
vector3_reset_fp32(&list[i].vector2);
|
||||
bgc_vector3_reset_fp32(&list[i].vector2);
|
||||
}
|
||||
|
||||
return list;
|
||||
}
|
||||
|
||||
void print_versor_fp32(const versor_fp32_t* versor)
|
||||
void print_versor_fp32(const bgc_versor_fp32_t* versor)
|
||||
{
|
||||
printf("Versor (%f, %f, %f, %f)\n", versor->s0, versor->x1, versor->x2, versor->x3);
|
||||
}
|
||||
|
||||
void print_versor_fp64(const versor_fp64_t* versor)
|
||||
void print_versor_fp64(const bgc_versor_fp64_t* versor)
|
||||
{
|
||||
printf("Versor (%lf, %lf, %lf, %lf)\n", versor->s0, versor->x1, versor->x2, versor->x3);
|
||||
}
|
||||
|
||||
void print_vector_fp32(const vector3_fp32_t* vector)
|
||||
void print_vector_fp32(const bgc_vector3_fp32_t* vector)
|
||||
{
|
||||
printf("(%f, %f, %f) / %f\n", vector->x1, vector->x2, vector->x3, vector3_get_modulus_fp32(vector));
|
||||
printf("(%f, %f, %f) / %f\n", vector->x1, vector->x2, vector->x3, bgc_vector3_get_modulus_fp32(vector));
|
||||
}
|
||||
|
||||
void print_vector_fp64(const vector3_fp64_t* vector)
|
||||
void print_vector_fp64(const bgc_vector3_fp64_t* vector)
|
||||
{
|
||||
printf("(%lf, %lf, %lf) / %lf\n", vector->x1, vector->x2, vector->x3, vector3_get_modulus_fp64(vector));
|
||||
printf("(%lf, %lf, %lf) / %lf\n", vector->x1, vector->x2, vector->x3, bgc_vector3_get_modulus_fp64(vector));
|
||||
}
|
||||
|
||||
void item_work(structure_fp32_t* item)
|
||||
{
|
||||
for (int j = 0; j < 1000; j++) {
|
||||
versor_combine_fp32(&item->versor1, &item->versor2, &item->result);
|
||||
versor_turn_vector_fp32(&item->result, &item->vector1, &item->vector2);
|
||||
}
|
||||
//for (int j = 0; j < 1000; j++) {
|
||||
bgc_versor_combine_fp32(&item->versor1, &item->versor2, &item->result);
|
||||
bgc_versor_turn_vector_fp32(&item->result, &item->vector1, &item->vector2);
|
||||
//}
|
||||
}
|
||||
|
||||
int main()
|
||||
|
@ -125,8 +125,8 @@ int main()
|
|||
//for (int j = 0; j < 1000; j++) {
|
||||
item_work(list + i);
|
||||
//structure_fp32_t* item = list + i;
|
||||
//versor_combine_fp32(&item->versor1, &item->versor2, &item->result);
|
||||
//versor_turn_vector_fp32(&item->result, &item->vector1, &item->vector2);
|
||||
//bgc_versor_combine_fp32(&item->versor1, &item->versor2, &item->result);
|
||||
//bgc_versor_turn_vector_fp32(&item->result, &item->vector1, &item->vector2);
|
||||
//}
|
||||
}
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue