{"id":333802,"date":"2022-05-30T15:00:42","date_gmt":"2022-05-30T15:00:42","guid":{"rendered":"http:\/\/savepearlharbor.com\/?p=333802"},"modified":"-0001-11-30T00:00:00","modified_gmt":"-0001-11-29T21:00:00","slug":"","status":"publish","type":"post","link":"https:\/\/savepearlharbor.com\/?p=333802","title":{"rendered":"\u0420\u0435\u0430\u043b\u0438\u0437\u0430\u0446\u0438\u044f \u043e\u0447\u0435\u0440\u0435\u0434\u0438 \u043d\u0430 C<\/span>"},"content":{"rendered":"
<\/div>\n
\n
\n
\n
\n

\u041f\u0440\u0438\u0432\u0435\u0442, \u0441\u0435\u0433\u043e\u0434\u043d\u044f \u044f \u043f\u043e\u043a\u0430\u0436\u0443 \u043a\u0430\u043a \u0441\u0434\u0435\u043b\u0430\u0442\u044c \u043e\u0447\u0435\u0440\u0435\u0434\u044c \u043d\u0430 C. \u041a\u043e \u043c\u043d\u0435 \u043f\u0440\u0438\u0448\u043b\u0430 \u0438\u0434\u0435\u044f \u0441\u0434\u0435\u043b\u0430\u0442\u044c \u0437\u0430\u0446\u0438\u043a\u043b\u0435\u043d\u043d\u0443\u044e \u0440\u0430\u0431\u043e\u0442\u0443 \u0432 \u043e\u0447\u0435\u0440\u0435\u0434\u0438. \u0422\u043e \u0435\u0441\u0442\u044c \u0434\u043e\u0431\u0430\u0432\u043b\u044f\u044e\u0442\u0441\u044f \u0434\u0430\u043d\u043d\u044b\u0435 \u043e\u0442 \u043a\u043e\u043d\u0446\u0430 \u0432 \u043d\u0430\u0447\u0430\u043b\u043e \u0438 \u0435\u0441\u043b\u0438 \u0443\u043a\u0430\u0437\u0430\u0442\u0435\u043b\u044c \u0434\u043e\u0448\u0435\u043b \u0434\u043e \u043d\u0430\u0447\u0430\u043b\u0430, \u0442\u043e \u043d\u0430\u0447\u0438\u043d\u0430\u0442\u044c \u0434\u043e\u0431\u0430\u0432\u043b\u044f\u0442\u044c \u0441 \u043a\u043e\u043d\u0446\u0430. \u0421\u0442\u0430\u0442\u044c\u044f \u043c\u0430\u043b\u0435\u043d\u044c\u043a\u0430\u044f, \u043d\u043e \u043c\u043e\u0436\u0435\u0442 \u043a\u043e\u043c\u0443 \u0431\u0443\u0434\u0435\u0442 \u043f\u043e\u043b\u0435\u0437\u043d\u043e. \u041a\u0441\u0442\u0430\u0442\u0438, \u044f \u0440\u0435\u0448\u0438\u043b \u043f\u043e\u0441\u043c\u043e\u0442\u0440\u0435\u0442\u044c \u043a\u0430\u043a \u0443 \u0434\u0440\u0443\u0433\u0438\u0445 \u0441\u0434\u0435\u043b\u0430\u043d\u043e \u0438 \u0440\u0435\u0448\u0438\u043b, \u0447\u0442\u043e \u043c\u043e\u0439 \u043f\u0440\u0438\u043c\u0435\u0440 \u0442\u043e\u0436\u0435 \u043d\u0435 \u043f\u043e\u043c\u0435\u0448\u0430\u0435\u0442.<\/p>\n

\u0421\u0430\u043c\u0430 \u043e\u0447\u0435\u0440\u0435\u0434\u044c \u0441\u043e\u0441\u0442\u043e\u0438\u0442 \u0438\u0437 \u0442\u0430\u043a\u043e\u0439 \u0441\u0442\u0440\u0443\u043a\u0442\u0443\u0440\u044b.<\/p>\n

struct queue {         uint8_t *data;  \/\/ \u0443\u043a\u0430\u0437\u0430\u0442\u0435\u043b\u044c \u043d\u0430 \u0434\u0430\u043d\u043d\u044b\u0435         int low;        \/\/ \u0443\u043a\u0430\u0437\u0430\u0442\u0435\u043b\u044c \u043d\u0430 \u043d\u0438\u0436\u043d\u044e\u044e \u0433\u0440\u0430\u043d\u0438\u0446\u0443         int high;       \/\/ \u0443\u043a\u0430\u0437\u0430\u0442\u0435\u043b\u044c \u043d\u0430 \u0432\u0435\u0440\u0445\u043d\u044e\u044e \u0433\u0440\u0430\u043d\u0438\u0446\u0443         int count;      \/\/ \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u044d\u043b\u0435\u043c\u0435\u043d\u0442\u043e\u0432 \u0432 \u043e\u0447\u0435\u0440\u0435\u0434\u0438         int max;        \/\/ \u043c\u0430\u043a\u0441\u0438\u043c\u0430\u043b\u044c\u043d\u043e\u0435 \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u044d\u043b\u0435\u043c\u0435\u043d\u0442\u043e\u0432 };<\/code><\/pre>\n
\u0418\u043d\u0438\u0446\u0438\u0430\u043b\u0438\u0437\u0438\u0440\u0443\u0435\u043c \u043e\u0447\u0435\u0440\u0435\u0434\u044c.<\/p>\n
struct queue *init (size_t size) {         struct queue * q = calloc (1, sizeof (struct queue));         q->data = calloc (size, sizeof (uint8_t));         q->low = q->high = size - 1;         q->max = size;          return q; }<\/code><\/pre>\n
\u0414\u043e\u0431\u0430\u0432\u043b\u044f\u0435\u043c \u0432 \u043e\u0447\u0435\u0440\u0435\u0434\u044c.<\/p>\n
void queue_add (struct queue *q, uint8_t a) {          if (q->count == q->max) {                 fprintf (stderr, \"not enough queue size\\n\");                 return;         }          q->data[q->low--] = a;         q->count++;          if (q->low < 0) {                 q->low = q->max - 1;         }  }<\/code><\/pre>\n
\u0423\u0434\u0430\u043b\u044f\u0435\u043c \u0438\u0437 \u043e\u0447\u0435\u0440\u0435\u0434\u0438.<\/p>\n
uint8_t queue_get (struct queue *q) {         uint8_t a = q->data[q->high--];         q->count--;          if (q->high < 0) {                 q->high = q->max - 1;         }          return a; } <\/code><\/pre>\n
\u0410\u043b\u0433\u043e\u0440\u0438\u0442\u043c \u0434\u043e \u0442\u043e\u0433\u043e \u043f\u0440\u043e\u0441\u0442\u043e\u0439, \u0447\u0442\u043e \u0438\u0437 \u043d\u0435\u0433\u043e \u043c\u043e\u0436\u043d\u043e \u0441\u0434\u0435\u043b\u0430\u0442\u044c \u043e\u0447\u0435\u0440\u0435\u0434\u044c \u0441 \u043f\u0440\u0438\u043e\u0440\u0438\u0442\u0435\u0442\u043e\u043c, \u043f\u043e\u0434\u043f\u0440\u0430\u0432\u0438\u0432 \u0441\u0442\u0440\u0443\u043a\u0442\u0443\u0440\u0443 \u0438 \u0444\u0443\u043d\u043a\u0446\u0438\u0438. \u041f\u0440\u0438\u0432\u0435\u0434\u0443 \u0441\u0440\u0430\u0437\u0443 \u0432\u0435\u0441\u044c \u043a\u043e\u0434 \u043e\u0447\u0435\u0440\u0435\u0434\u0438 \u0441 \u043f\u0440\u0438\u043e\u0440\u0438\u0442\u0435\u0442\u043e\u043c \u0438 \u043f\u0440\u043e\u0432\u0435\u0440\u043a\u043e\u0439 \u0440\u0435\u0437\u0443\u043b\u044c\u0442\u0430\u0442\u0430.<\/p>\n
\u041d\u0435 \u0437\u043d\u0430\u044e \u043a\u0430\u043a \u043c\u043d\u0435 \u043f\u0440\u0438\u0445\u043e\u0434\u044f\u0442 \u0442\u0430\u043a\u0438\u0435 \u0438\u0434\u0435\u0438 \u0438 \u044f \u043d\u0435 \u043f\u043e\u043c\u043d\u044e \u043a\u0430\u043a \u0434\u0440\u0443\u0433\u0438\u0435 \u0440\u0435\u0430\u043b\u0438\u0437\u0443\u044e\u0442 \u043e\u0447\u0435\u0440\u0435\u0434\u044c \u0441 \u043f\u0440\u0438\u043e\u0440\u0438\u0442\u0435\u0442\u043e\u043c, \u043d\u043e \u043c\u043e\u044f \u0440\u0435\u0430\u043b\u0438\u0437\u0430\u0446\u0438\u044f \u0431\u0443\u0434\u0435\u0442 \u0442\u0430\u043a\u0430\u044f.  <\/p>\n
\u041e\u0441\u0442\u0430\u0432\u043b\u044f\u044e \u0437\u0434\u0435\u0441\u044c \u043a\u043e\u0434 \u0434\u043b\u044f \u0432\u0430\u0441 \u0438 \u0434\u043b\u044f \u0441\u0435\u0431\u044f.<\/p>\n
#include <stdio.h> #include <stdlib.h> #include <stdint.h>  struct queue { uint8_t **data; int *low; int *high; int *count; int *max; int max_prio; };  struct queue *init (size_t size, int size_prio) { struct queue * q = calloc (1, sizeof (struct queue)); q->max_prio = size_prio;  q->data = calloc (size_prio, sizeof (void *)); q->low = calloc (size, sizeof (int)); q->high = calloc (size, sizeof (int)); q->max = calloc (size, sizeof (int)); q->count = calloc (size, sizeof (int));  for (int i = 0; i < size_prio; i++) { q->data[i] = calloc (size, sizeof (uint8_t)); q->low[i] = q->high[i] = size - 1; q->max[i] = size; }  return q; }  void queue_add (struct queue *q, uint8_t a, int prio) {  if (q->count[prio] == q->max[prio]) { fprintf (stderr, \"not enough queue size\\n\"); return; }  q->data[prio][q->low[prio]--] = a; q->count[prio]++;  if (q->low[prio] < 0) { q->low[prio] = q->max[prio] - 1; }  }  uint8_t queue_get (struct queue *q) { uint8_t a = 0; int found = 0; for (int i = 0; i < q->max_prio; i++) { if (q->count[i] > 0) { found = 1; a = q->data[i][q->high[i]--]; q->count[i]--;  if (q->high[i] < 0) { q->high[i] = q->max[i] - 1; }  return a; } }  if (found == 0) { printf (\"queue is empty\\n\"); }  return a; }  int main (int argc, char **argv) { struct queue *q = init (10, 4);  queue_add (q, 2, 3); queue_add (q, 10, 1); queue_add (q, 15, 1); queue_add (q, 20, 0);  for (int i = 0; i < 4; i++) { printf (\"%d: %d\\n\", i, queue_get (q)); } }<\/code><\/pre>\n<\/p>\n<\/div>\n<\/div>\n<\/div>\n
<\/div>\n<\/div>\n
  
 \u0441\u0441\u044b\u043b\u043a\u0430 \u043d\u0430 \u043e\u0440\u0438\u0433\u0438\u043d\u0430\u043b \u0441\u0442\u0430\u0442\u044c\u0438  https:\/\/habr.com\/ru\/post\/668580\/<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"
<\/div>\n
\n
\n
\n
\n
\u041f\u0440\u0438\u0432\u0435\u0442, \u0441\u0435\u0433\u043e\u0434\u043d\u044f \u044f \u043f\u043e\u043a\u0430\u0436\u0443 \u043a\u0430\u043a \u0441\u0434\u0435\u043b\u0430\u0442\u044c \u043e\u0447\u0435\u0440\u0435\u0434\u044c \u043d\u0430 C. \u041a\u043e \u043c\u043d\u0435 \u043f\u0440\u0438\u0448\u043b\u0430 \u0438\u0434\u0435\u044f \u0441\u0434\u0435\u043b\u0430\u0442\u044c \u0437\u0430\u0446\u0438\u043a\u043b\u0435\u043d\u043d\u0443\u044e \u0440\u0430\u0431\u043e\u0442\u0443 \u0432 \u043e\u0447\u0435\u0440\u0435\u0434\u0438. \u0422\u043e \u0435\u0441\u0442\u044c \u0434\u043e\u0431\u0430\u0432\u043b\u044f\u044e\u0442\u0441\u044f \u0434\u0430\u043d\u043d\u044b\u0435 \u043e\u0442 \u043a\u043e\u043d\u0446\u0430 \u0432 \u043d\u0430\u0447\u0430\u043b\u043e \u0438 \u0435\u0441\u043b\u0438 \u0443\u043a\u0430\u0437\u0430\u0442\u0435\u043b\u044c \u0434\u043e\u0448\u0435\u043b \u0434\u043e \u043d\u0430\u0447\u0430\u043b\u0430, \u0442\u043e \u043d\u0430\u0447\u0438\u043d\u0430\u0442\u044c \u0434\u043e\u0431\u0430\u0432\u043b\u044f\u0442\u044c \u0441 \u043a\u043e\u043d\u0446\u0430. \u0421\u0442\u0430\u0442\u044c\u044f \u043c\u0430\u043b\u0435\u043d\u044c\u043a\u0430\u044f, \u043d\u043e \u043c\u043e\u0436\u0435\u0442 \u043a\u043e\u043c\u0443 \u0431\u0443\u0434\u0435\u0442 \u043f\u043e\u043b\u0435\u0437\u043d\u043e. \u041a\u0441\u0442\u0430\u0442\u0438, \u044f \u0440\u0435\u0448\u0438\u043b \u043f\u043e\u0441\u043c\u043e\u0442\u0440\u0435\u0442\u044c \u043a\u0430\u043a \u0443 \u0434\u0440\u0443\u0433\u0438\u0445 \u0441\u0434\u0435\u043b\u0430\u043d\u043e \u0438 \u0440\u0435\u0448\u0438\u043b, \u0447\u0442\u043e \u043c\u043e\u0439 \u043f\u0440\u0438\u043c\u0435\u0440 \u0442\u043e\u0436\u0435 \u043d\u0435 \u043f\u043e\u043c\u0435\u0448\u0430\u0435\u0442.<\/p>\n
\u0421\u0430\u043c\u0430 \u043e\u0447\u0435\u0440\u0435\u0434\u044c \u0441\u043e\u0441\u0442\u043e\u0438\u0442 \u0438\u0437 \u0442\u0430\u043a\u043e\u0439 \u0441\u0442\u0440\u0443\u043a\u0442\u0443\u0440\u044b.<\/p>\n
struct queue {         uint8_t *data;  \/\/ \u0443\u043a\u0430\u0437\u0430\u0442\u0435\u043b\u044c \u043d\u0430 \u0434\u0430\u043d\u043d\u044b\u0435         int low;        \/\/ \u0443\u043a\u0430\u0437\u0430\u0442\u0435\u043b\u044c \u043d\u0430 \u043d\u0438\u0436\u043d\u044e\u044e \u0433\u0440\u0430\u043d\u0438\u0446\u0443         int high;       \/\/ \u0443\u043a\u0430\u0437\u0430\u0442\u0435\u043b\u044c \u043d\u0430 \u0432\u0435\u0440\u0445\u043d\u044e\u044e \u0433\u0440\u0430\u043d\u0438\u0446\u0443         int count;      \/\/ \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u044d\u043b\u0435\u043c\u0435\u043d\u0442\u043e\u0432 \u0432 \u043e\u0447\u0435\u0440\u0435\u0434\u0438         int max;        \/\/ \u043c\u0430\u043a\u0441\u0438\u043c\u0430\u043b\u044c\u043d\u043e\u0435 \u043a\u043e\u043b\u0438\u0447\u0435\u0441\u0442\u0432\u043e \u044d\u043b\u0435\u043c\u0435\u043d\u0442\u043e\u0432 };<\/code><\/pre>\n
\u0418\u043d\u0438\u0446\u0438\u0430\u043b\u0438\u0437\u0438\u0440\u0443\u0435\u043c \u043e\u0447\u0435\u0440\u0435\u0434\u044c.<\/p>\n
struct queue *init (size_t size) {         struct queue * q = calloc (1, sizeof (struct queue));         q->data = calloc (size, sizeof (uint8_t));         q->low = q->high = size - 1;         q->max = size;          return q; }<\/code><\/pre>\n
\u0414\u043e\u0431\u0430\u0432\u043b\u044f\u0435\u043c \u0432 \u043e\u0447\u0435\u0440\u0435\u0434\u044c.<\/p>\n
void queue_add (struct queue *q, uint8_t a) {          if (q->count == q->max) {                 fprintf (stderr, \"not enough queue size\\n\");                 return;         }          q->data[q->low--] = a;         q->count++;          if (q->low < 0) {                 q->low = q->max - 1;         }  }<\/code><\/pre>\n
\u0423\u0434\u0430\u043b\u044f\u0435\u043c \u0438\u0437 \u043e\u0447\u0435\u0440\u0435\u0434\u0438.<\/p>\n
uint8_t queue_get (struct queue *q) {         uint8_t a = q->data[q->high--];         q->count--;          if (q->high < 0) {                 q->high = q->max - 1;         }          return a; } <\/code><\/pre>\n
\u0410\u043b\u0433\u043e\u0440\u0438\u0442\u043c \u0434\u043e \u0442\u043e\u0433\u043e \u043f\u0440\u043e\u0441\u0442\u043e\u0439, \u0447\u0442\u043e \u0438\u0437 \u043d\u0435\u0433\u043e \u043c\u043e\u0436\u043d\u043e \u0441\u0434\u0435\u043b\u0430\u0442\u044c \u043e\u0447\u0435\u0440\u0435\u0434\u044c \u0441 \u043f\u0440\u0438\u043e\u0440\u0438\u0442\u0435\u0442\u043e\u043c, \u043f\u043e\u0434\u043f\u0440\u0430\u0432\u0438\u0432 \u0441\u0442\u0440\u0443\u043a\u0442\u0443\u0440\u0443 \u0438 \u0444\u0443\u043d\u043a\u0446\u0438\u0438. \u041f\u0440\u0438\u0432\u0435\u0434\u0443 \u0441\u0440\u0430\u0437\u0443 \u0432\u0435\u0441\u044c \u043a\u043e\u0434 \u043e\u0447\u0435\u0440\u0435\u0434\u0438 \u0441 \u043f\u0440\u0438\u043e\u0440\u0438\u0442\u0435\u0442\u043e\u043c \u0438 \u043f\u0440\u043e\u0432\u0435\u0440\u043a\u043e\u0439 \u0440\u0435\u0437\u0443\u043b\u044c\u0442\u0430\u0442\u0430.<\/p>\n
\u041d\u0435 \u0437\u043d\u0430\u044e \u043a\u0430\u043a \u043c\u043d\u0435 \u043f\u0440\u0438\u0445\u043e\u0434\u044f\u0442 \u0442\u0430\u043a\u0438\u0435 \u0438\u0434\u0435\u0438 \u0438 \u044f \u043d\u0435 \u043f\u043e\u043c\u043d\u044e \u043a\u0430\u043a \u0434\u0440\u0443\u0433\u0438\u0435 \u0440\u0435\u0430\u043b\u0438\u0437\u0443\u044e\u0442 \u043e\u0447\u0435\u0440\u0435\u0434\u044c \u0441 \u043f\u0440\u0438\u043e\u0440\u0438\u0442\u0435\u0442\u043e\u043c, \u043d\u043e \u043c\u043e\u044f \u0440\u0435\u0430\u043b\u0438\u0437\u0430\u0446\u0438\u044f \u0431\u0443\u0434\u0435\u0442 \u0442\u0430\u043a\u0430\u044f.  <\/p>\n
\u041e\u0441\u0442\u0430\u0432\u043b\u044f\u044e \u0437\u0434\u0435\u0441\u044c \u043a\u043e\u0434 \u0434\u043b\u044f \u0432\u0430\u0441 \u0438 \u0434\u043b\u044f \u0441\u0435\u0431\u044f.<\/p>\n
#include <stdio.h> #include <stdlib.h> #include <stdint.h>  struct queue { uint8_t **data; int *low; int *high; int *count; int *max; int max_prio; };  struct queue *init (size_t size, int size_prio) { struct queue * q = calloc (1, sizeof (struct queue)); q->max_prio = size_prio;  q->data = calloc (size_prio, sizeof (void *)); q->low = calloc (size, sizeof (int)); q->high = calloc (size, sizeof (int)); q->max = calloc (size, sizeof (int)); q->count = calloc (size, sizeof (int));  for (int i = 0; i < size_prio; i++) { q->data[i] = calloc (size, sizeof (uint8_t)); q->low[i] = q->high[i] = size - 1; q->max[i] = size; }  return q; }  void queue_add (struct queue *q, uint8_t a, int prio) {  if (q->count[prio] == q->max[prio]) { fprintf (stderr, \"not enough queue size\\n\"); return; }  q->data[prio][q->low[prio]--] = a; q->count[prio]++;  if (q->low[prio] < 0) { q->low[prio] = q->max[prio] - 1; }  }  uint8_t queue_get (struct queue *q) { uint8_t a = 0; int found = 0; for (int i = 0; i < q->max_prio; i++) { if (q->count[i] > 0) { found = 1; a = q->data[i][q->high[i]--]; q->count[i]--;  if (q->high[i] < 0) { q->high[i] = q->max[i] - 1; }  return a; } }  if (found == 0) { printf (\"queue is empty\\n\"); }  return a; }  int main (int argc, char **argv) { struct queue *q = init (10, 4);  queue_add (q, 2, 3); queue_add (q, 10, 1); queue_add (q, 15, 1); queue_add (q, 20, 0);  for (int i = 0; i < 4; i++) { printf (\"%d: %d\\n\", i, queue_get (q)); } }<\/code><\/pre>\n<\/p>\n<\/div>\n<\/div>\n<\/div>\n
<\/div>\n<\/div>\n
  
 \u0441\u0441\u044b\u043b\u043a\u0430 \u043d\u0430 \u043e\u0440\u0438\u0433\u0438\u043d\u0430\u043b \u0441\u0442\u0430\u0442\u044c\u0438  https:\/\/habr.com\/ru\/post\/668580\/<\/a>
<\/br><\/br><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[],"tags":[],"class_list":["post-333802","post","type-post","status-publish","format-standard","hentry"],"_links":{"self":[{"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=\/wp\/v2\/posts\/333802","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=333802"}],"version-history":[{"count":0,"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=\/wp\/v2\/posts\/333802\/revisions"}],"wp:attachment":[{"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=333802"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=333802"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/savepearlharbor.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=333802"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}