{"id":73065,"date":"2020-03-06T20:42:13","date_gmt":"2020-03-06T17:42:13","guid":{"rendered":"https:\/\/prohoster.info\/blog\/administrirovanie\/rabbitmq-chast-3-razbiraemsya-s-queues-i-bindings"},"modified":"2020-03-06T20:42:13","modified_gmt":"2020-03-06T17:42:13","slug":"rabbitmq-chast-3-razbiraemsya-s-queues-i-bindings","status":"publish","type":"post","link":"https:\/\/prohoster.info\/pt\/blog\/administrirovanie\/rabbitmq-chast-3-razbiraemsya-s-queues-i-bindings","title":{"rendered":"RabbitMQ. Parte 3. Entendendo as Queues e Bindings","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"<p><code>Fila<\/code> (fila) \u2014 uma estrutura de dados em disco ou na mem\u00f3ria que armazena refer\u00eancias a mensagens e fornece suas c\u00f3pias. <code>consumidores<\/code> (a consumidores). <code>Fila<\/code> representa <noindex><a rel=\"nofollow\" href=\"http:\/\/erlang.org\/doc\/reference_manual\/processes.html\">processo Erlang<\/a><\/noindex> com estado (onde as pr\u00f3prias mensagens podem ser armazenadas em cache). Mil filas podem ocupar cerca de 80 Mb.<\/p>\n<p><\/p>\n<p><code>Binding<\/code> (vincula\u00e7\u00e3o) \u2014 uma regra que informa ao intercambiador em qual fila as mensagens devem ser direcionadas.<\/p>\n<p><noindex><a rel=\"nofollow\" name=\"habracut\"><\/a><\/noindex><\/p>\n<h3 id=\"oglavlenie\">\u00cdndice<\/h3>\n<p><\/p>\n<ul>\n<li><noindex><a rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/post\/488654\/\">RabbitMQ. Parte 1. Introdu\u00e7\u00e3o. Erlang, AMQP e RPC<\/a><\/noindex><\/li>\n<li><noindex><a rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/post\/489086\/\">RabbitMQ. Parte 2. Entendendo os Exchanges<\/a><\/noindex><\/li>\n<li><noindex><a rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/post\/490960\/\">RabbitMQ. Parte 3. Entendendo as Queues e Bindings<\/a><\/noindex><\/li>\n<li>RabbitMQ. Parte 4. Entendendo o que s\u00e3o mensagens e frames<\/li>\n<li>RabbitMQ. Parte 5. Desempenho da publica\u00e7\u00e3o e consumo de mensagens<\/li>\n<li>RabbitMQ. Parte 6. Vis\u00e3o geral dos m\u00f3dulos Federation e Shovel<\/li>\n<li>RabbitMQ. Parte 7. Detalhes sobre Connection e Channel<\/li>\n<li>RabbitMQ. Parte 8. RabbitMQ no .NET<\/li>\n<li>RabbitMQ. Parte 9. Monitoramento<\/li>\n<\/ul>\n<p><\/p>\n<h4 id=\"vremennye-ocheredi\"><em>Filas tempor\u00e1rias<\/em><\/h4>\n<p><\/p>\n<p>Se a cria\u00e7\u00e3o da fila ocorre com o par\u00e2metro definido <code>autoDelete<\/code>, essa fila adquire a capacidade <strong>de se autodeletar<\/strong>. Essas filas geralmente s\u00e3o criadas no momento da conex\u00e3o do primeiro cliente e exclu\u00eddas quando todos os clientes se desconectam. <\/p>\n<p><\/p>\n<p>Se a cria\u00e7\u00e3o da fila ocorre com o par\u00e2metro definido <code>exclusivo<\/code>, ent\u00e3o essa fila <strong>permite que apenas um consumidor se conecte<\/strong> e se exclui se o canal for fechado. Enquanto o canal n\u00e3o for fechado, o cliente pode desconectar\/conectar, mas somente dentro da mesma conex\u00e3o. Se o par\u00e2metro <code>exclusivo<\/code> estiver definido, o par\u00e2metro <code>autoDelete<\/code> n\u00e3o ter\u00e1 efeito algum.<\/p>\n<p><\/p>\n<p>Caracter\u00edsticas:<\/p>\n<p><\/p>\n<ul>\n<li>com desconex\u00f5es breves, perderemos mensagens que ainda n\u00e3o chegaram ao consumidor<\/li>\n<li>podemos observar o fen\u00f4meno <code>binding churn<\/code>. O fen\u00f4meno ocorre quando o n\u00famero de opera\u00e7\u00f5es de cria\u00e7\u00e3o\/exclus\u00e3o de filas e v\u00ednculos atinge valores muito altos. No modo cluster, esse fluxo de opera\u00e7\u00f5es se espalhar\u00e1 por todos os n\u00f3s e criar\u00e1 uma grande carga. Esse processo pode ser otimizado controlando o n\u00famero de assinaturas.<\/li>\n<\/ul>\n<p><\/p>\n<h4 id=\"postoyannye-ocheredi\"><em>Filas permanentes<\/em><\/h4>\n<p><\/p>\n<p>Se a cria\u00e7\u00e3o da fila ocorre com o par\u00e2metro definido <code>dur\u00e1vel<\/code>, ent\u00e3o essa fila <strong>mant\u00eam seu estado<\/strong> e se recuperam ap\u00f3s a reinicializa\u00e7\u00e3o do servidor\/intermedi\u00e1rio. Essa fila existir\u00e1 at\u00e9 que o comando <code>Queue.Delete<\/code>. <\/p>\n<p><\/p>\n<h4 id=\"highly-available-ocheredi\"><em>Filas Altamente Dispon\u00edveis<\/em><\/h4>\n<p><\/p>\n<p>Filas HA requerem um ambiente de cluster RabbitMQ. No modo cluster, todas as informa\u00e7\u00f5es sobre intercambiadores, filas, v\u00ednculos e consumidores ser\u00e3o copiadas para todos os n\u00f3s.<\/p>\n<p><\/p>\n<p>Quando uma mensagem \u00e9 publicada em uma fila HA, ela \u00e9 armazenada em cada n\u00f3 relacionado \u00e0 fila HA. Depois que a mensagem \u00e9 consumida em um dos n\u00f3s, todas as c\u00f3pias dessa mensagem ser\u00e3o exclu\u00eddas em outros n\u00f3s. <\/p>\n<p><\/p>\n<p>As filas HA podem se espalhar por todos os n\u00f3s em um determinado cluster ou apenas em n\u00f3s individuais. <\/p>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"RabbitMQ. Parte 3. Entendendo as Queues e Bindings\" src=\"\/wp-content\/uploads\/2020\/03\/46d560ab33e686ddf9adb0b18b4bb0b0.jpeg\" style=\"display:block;margin: 0 auto;\" \/><\/p>\n<p><\/p>\n<p>Caracter\u00edsticas:<\/p>\n<p><\/p>\n<ul>\n<li>O uso de filas HA leva a penaliza\u00e7\u00f5es em desempenho. Ao colocar uma mensagem em uma fila HA ou ao consumir uma mensagem de uma fila HA, o RabbitMQ deve coordenar entre todos os n\u00f3s (2-3 n\u00f3s geralmente s\u00e3o suficientes)<\/li>\n<\/ul>\n<p><\/p>\n<h4 id=\"sozdanie-ocheredi\"><em>Cria\u00e7\u00e3o de fila<\/em><\/h4>\n<p><\/p>\n<p>A cria\u00e7\u00e3o da fila \u00e9 feita atrav\u00e9s de um processo s\u00edncrono <code>RPC<\/code> ao servidor. A solicita\u00e7\u00e3o \u00e9 feita pelo m\u00e9todo <code>Queue.Declare<\/code>, invocando com os par\u00e2metros:<\/p>\n<p><\/p>\n<ul>\n<li>nome da fila<\/li>\n<li>outros par\u00e2metros<\/li>\n<\/ul>\n<p><\/p>\n<p>Exemplo de cria\u00e7\u00e3o de uma fila usando <noindex><a rel=\"nofollow\" href=\"https:\/\/www.rabbitmq.com\/dotnet.html\">RabbitMQ.Client<\/a><\/noindex>:<\/p>\n<p><\/p>\n<pre><code class=\"cs\">\/\/ ...\nchannel.QueueDeclare(\n    queue: &quot;my_queue&quot;,\n    durable: false,\n    exclusive: false,\n    autoDelete: false,\n    arguments: null\n);\n\/\/ ...<\/code><\/pre>\n<p><\/p>\n<ul>\n<li><code>fila<\/code> \u2014 nome da fila que queremos criar. O nome deve ser \u00fanico e n\u00e3o pode coincidir com o nome do sistema da fila<\/li>\n<li><code>dur\u00e1vel<\/code> \u2014 se true, a fila ser\u00e1 <strong>manter seu estado<\/strong> e ser\u00e1 restaurada ap\u00f3s a reinicializa\u00e7\u00e3o do servidor\/broker<\/li>\n<li><code>exclusivo<\/code> \u2014 se true, a fila permitir\u00e1 a conex\u00e3o apenas de um consumidor<\/li>\n<li><code>autoDelete<\/code> \u2014 se true, a fila adquirir\u00e1 a capacidade <strong>de se autodeletar<\/strong><\/li>\n<li><code>arguments<\/code> \u2014 argumentos opcionais. Vamos explorar mais adiante.<\/li>\n<\/ul>\n<p><\/p>\n<h5 id=\"arguments\"><em>arguments<\/em><\/h5>\n<p><\/p>\n<ul>\n<li><code>x-message-ttl<\/code>(<code>x-message-time-to-live<\/code>) \u2014 permite definir o tempo de vida da mensagem em milissegundos. Se a cria\u00e7\u00e3o da fila ocorre com um valor de argumento definido <code>x-message-ttl<\/code>, ent\u00e3o tal fila ir\u00e1 <strong>excluir automaticamente mensagens que tenham expirado<\/strong>. A configura\u00e7\u00e3o do valor do argumento <code>x-message-ttl<\/code> define a idade m\u00e1xima para todas as mensagens nesta fila. Criar tal fila <strong>ajuda a evitar a recep\u00e7\u00e3o de informa\u00e7\u00f5es desatualizadas<\/strong>. Isso pode ser usado em sistemas em tempo real. Se uma fila tem uma troca para mensagens rejeitadas e um valor de argumento \u00e9 definido <code>x-message-ttl<\/code>, ent\u00e3o mensagens rejeitadas nesta fila <strong>come\u00e7ar\u00e3o a ter um tempo de vida<\/strong>.<\/li>\n<li><code>x-expires<\/code> \u2014 define um valor em milissegundos ap\u00f3s o qual a fila ser\u00e1 removida. A fila pode expirar apenas se n\u00e3o tiver assinantes. Se houver assinantes conectados \u00e0 fila, ela s\u00f3 poder\u00e1 ser removida automaticamente quando todos os assinantes chamarem <code>Basic.Cancel<\/code> ou se desconectarem. O tempo de vida da fila s\u00f3 pode terminar se n\u00e3o houver solicita\u00e7\u00e3o para <code>Basic.Get<\/code>. Caso contr\u00e1rio, o valor atual da configura\u00e7\u00e3o de tempo de vida \u00e9 redefinido, e a fila n\u00e3o ser\u00e1 mais removida automaticamente. Tamb\u00e9m <strong>n\u00e3o h\u00e1 garantias sobre qu\u00e3o r\u00e1pido ocorre a remo\u00e7\u00e3o da fila ap\u00f3s o t\u00e9rmino do seu tempo de vida<\/strong>.<\/li>\n<li><code>x-max-length<\/code> \u2014 define o n\u00famero m\u00e1ximo de mensagens na fila. Se o n\u00famero de mensagens na fila come\u00e7ar a exceder o valor m\u00e1ximo, as mensagens mais antigas come\u00e7ar\u00e3o a ser removidas<\/li>\n<\/ul>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"RabbitMQ. Parte 3. Entendendo as Queues e Bindings\" src=\"\/wp-content\/uploads\/2020\/03\/738f23dcfdd173a66be619032b46c5cc.jpeg\" style=\"display:block;margin: 0 auto;\" \/><\/p>\n<p><\/p>\n<ul>\n<li><code>x-max-length-bytes<\/code> \u2014 define o tamanho total m\u00e1ximo permitido da carga \u00fatil das mensagens na fila. Se o valor estabelecido for ultrapassado (ocorreu um estouro na fila durante a publica\u00e7\u00e3o de uma mensagem), as mensagens mais antigas come\u00e7ar\u00e3o a ser removidas<\/li>\n<li><code>x-overflow<\/code> \u2014 este argumento \u00e9 utilizado para configurar o comportamento em caso de estouro da fila. Dois valores est\u00e3o dispon\u00edveis: <code>drop-head<\/code> (valor padr\u00e3o) e <code>reject-publish<\/code>. Se voc\u00ea escolher <code>drop-head<\/code>, as mensagens mais antigas ser\u00e3o removidas. Se escolher <code>reject-publish<\/code>, a aceita\u00e7\u00e3o de mensagens ser\u00e1 suspensa<\/li>\n<li><code>x-dead-letter-exchange<\/code> \u2014 define o exchange para onde as mensagens rejeitadas, que n\u00e3o foram colocadas de volta na fila, s\u00e3o direcionadas<\/li>\n<li><code>x-dead-letter-routing-key<\/code> \u2014 define uma chave de roteamento opcional para as mensagens rejeitadas<\/li>\n<li><code>x-max-priority<\/code> \u2014 permite a ordena\u00e7\u00e3o por prioridades na fila com um valor m\u00e1ximo de prioridade de 255 (RabbitMQ vers\u00f5es 3.5.0 e superior). O n\u00famero indica a prioridade m\u00e1xima que a fila suportar\u00e1. Se o argumento n\u00e3o for definido, a fila n\u00e3o suportar\u00e1 a prioridade das mensagens<\/li>\n<li><code>x-queue-mode<\/code> \u2014 permite colocar a fila em <strong>modo pregui\u00e7oso<\/strong>. Nesse modo, o m\u00e1ximo de mensagens ser\u00e1 armazenado no disco. O uso da mem\u00f3ria RAM ser\u00e1 m\u00ednimo. Se n\u00e3o estiver definido, a fila armazenar\u00e1 mensagens na mem\u00f3ria para entregar mensagens o mais r\u00e1pido poss\u00edvel<\/li>\n<li><code>x-queue-master-locator<\/code> \u2014 se tivermos um cluster, pode-se definir a fila mestre<\/li>\n<li><code>x-ha-policy<\/code> \u2014 utilizado na cria\u00e7\u00e3o de filas HA e define como a mensagem ser\u00e1 distribu\u00edda pelos n\u00f3s. Se o valor for definido como <code>all<\/code>, a mensagem ser\u00e1 mantida em todos os n\u00f3s. Se o valor for definido como <code>nodes<\/code>, a mensagem ser\u00e1 mantida em n\u00f3s espec\u00edficos do cluster<\/li>\n<li><code>x-ha-nodes<\/code> \u2014 define os n\u00f3s aos quais uma determinada fila se referir\u00e1 <code>HA<\/code><\/li>\n<\/ul>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"RabbitMQ. Parte 3. Entendendo as Queues e Bindings\" src=\"\/wp-content\/uploads\/2020\/03\/a8f660b6c0a43626e4025cf7769a4425.jpeg\" style=\"display:block;margin: 0 auto;\" \/><\/p>\n<p><\/p>\n<p>Se a cria\u00e7\u00e3o da fila <strong>talvez<\/strong>, o servidor enviar\u00e1 ao cliente uma resposta s\u00edncrona <code>RPC<\/code> uma resposta <code>Queue.DeclareOk<\/code>. Se a cria\u00e7\u00e3o da fila <strong>\u00e9 imposs\u00edvel<\/strong> (ocorreu um erro na solicita\u00e7\u00e3o <code>Queue.Declare<\/code>), ent\u00e3o <strong>o canal ser\u00e1 fechado<\/strong> for feita pelo servidor usando o comando <code>Channel.Close<\/code> e o cliente receber\u00e1 uma exce\u00e7\u00e3o <noindex><a rel=\"nofollow\" href=\"https:\/\/www.rabbitmq.com\/releases\/rabbitmq-dotnet-client\/v3.6.10\/rabbitmq-dotnet-client-3.6.10-client-htmldoc\/html\/type-RabbitMQ.Client.Exceptions.OperationInterruptedException.html\">OperationInterruptedException<\/a><\/noindex>, que conter\u00e1 o c\u00f3digo de erro e sua descri\u00e7\u00e3o. <\/p>\n<p><\/p>\n<p><strong>Uma nova chamada<\/strong> <code>Queue.Declare<\/code> <strong>com os mesmos par\u00e2metros<\/strong> retornar\u00e1 informa\u00e7\u00f5es \u00fateis sobre esta fila. Por exemplo, o n\u00famero total de mensagens aguardando nesta fila e o n\u00famero total de consumidores que assinaram ela. <\/p>\n<p><\/p>\n<p>Chamada <code>Queue.Declare<\/code> com as credenciais de um usu\u00e1rio que n\u00e3o tem as permiss\u00f5es necess\u00e1rias <strong>fechar\u00e1 o canal<\/strong> com o comando <code>Channel.Close<\/code> e o cliente receber\u00e1 uma exce\u00e7\u00e3o <noindex><a rel=\"nofollow\" href=\"https:\/\/www.rabbitmq.com\/releases\/rabbitmq-dotnet-client\/v3.6.10\/rabbitmq-dotnet-client-3.6.10-client-htmldoc\/html\/type-RabbitMQ.Client.Exceptions.OperationInterruptedException.html\">OperationInterruptedException<\/a><\/noindex>, que conter\u00e1 o c\u00f3digo de erro <noindex><a rel=\"nofollow\" href=\"https:\/\/developer.mozilla.org\/ru\/docs\/Web\/HTTP\/Status\/403\">403<\/a><\/noindex> e sua descri\u00e7\u00e3o.<\/p>\n<p><\/p>\n<p>Depois que a fila estiver ociosa por &gt;= 10 segundos, ela <strong>entra em modo de espera<\/strong>, chamando o GC na fila, o que resulta em uma redu\u00e7\u00e3o significativa da mem\u00f3ria necess\u00e1ria para essa fila.<\/p>\n<p><\/p>\n<h4 id=\"sozdanie-queue-cherez-graficheskiy-interfeys\"><em>Cria\u00e7\u00e3o de Queue atrav\u00e9s da interface gr\u00e1fica<\/em><\/h4>\n<p><\/p>\n<p>Acesse o painel do administrador <code>RabbitMQ<\/code> como usu\u00e1rio <code>guest<\/code> (username: <code>guest<\/code> e password: <code>guest<\/code>). Observe que o usu\u00e1rio <code>guest<\/code> pode se conectar apenas a partir do host local. Agora vamos para a aba <code>Filas<\/code> e clique em <code>Adicionar uma nova fila<\/code>. Preencha as propriedades:<\/p>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"RabbitMQ. Parte 3. Entendendo as Queues e Bindings\" src=\"\/wp-content\/uploads\/2020\/03\/ea77a406ad16f0871c7197e96a66818f.jpeg\" style=\"display:block;margin: 0 auto;\" \/><\/p>\n<p><\/p>\n<p>Assim que inserirmos todos os dados necess\u00e1rios e clicarmos em <code>Adicionar filas<\/code>, a fila aparecer\u00e1 na lista geral.<\/p>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"RabbitMQ. Parte 3. Entendendo as Queues e Bindings\" src=\"\/wp-content\/uploads\/2020\/03\/8342e044a0d6c0a035a2c9f646035cad.jpeg\" style=\"display:block;margin: 0 auto;\" \/><\/p>\n<p><\/p>\n<p>Um clique no nome da fila mostrar\u00e1 suas informa\u00e7\u00f5es detalhadas. Aqui, voc\u00ea pode configurar a liga\u00e7\u00e3o entre a troca e a fila, ver a lista <code>consumidores<\/code>, publicar\/pegar mensagens, excluir a fila e ver as estat\u00edsticas.<\/p>\n<p><\/p>\n<h4 id=\"sozdanie-binding\"><em>Cria\u00e7\u00e3o de Binding<\/em><\/h4>\n<p><\/p>\n<p>A cria\u00e7\u00e3o de uma liga\u00e7\u00e3o ocorre atrav\u00e9s de um <code>RPC<\/code> ao servidor. A solicita\u00e7\u00e3o \u00e9 feita pelo m\u00e9todo <code>Queue.Bind<\/code>, invocando com os par\u00e2metros:<\/p>\n<p><\/p>\n<ul>\n<li>nome da fila<\/li>\n<li>nome do ponto de troca<\/li>\n<li>outros par\u00e2metros<\/li>\n<\/ul>\n<p><\/p>\n<p>Exemplo de cria\u00e7\u00e3o de liga\u00e7\u00e3o usando <noindex><a rel=\"nofollow\" href=\"https:\/\/www.rabbitmq.com\/dotnet.html\">RabbitMQ.Client<\/a><\/noindex>:<\/p>\n<p><\/p>\n<pre><code class=\"cs\">\/\/...\nchannel.QueueBind(\n    queue: queueName,\n    exchange: &quot;my_exchange&quot;,\n    routingKey: &quot;my_key&quot;,\n    arguments: null\n);\n\/\/...<\/code><\/pre>\n<p><\/p>\n<ul>\n<li><code>fila<\/code> \u2014 nome da fila<\/li>\n<li><code>exchange<\/code> \u2014 nome do corretor<\/li>\n<li><code>routingKey<\/code> \u2014 chave de roteamento<\/li>\n<li><code>arguments<\/code> \u2014 argumentos opcionais<\/li>\n<\/ul>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"RabbitMQ. Parte 3. Entendendo as Queues e Bindings\" src=\"\/wp-content\/uploads\/2020\/03\/9123186c94a822309b679f26c2e511ea.jpeg\" style=\"display:block;margin: 0 auto;\" \/><\/p>\n<p><\/p>\n<p>Se a cria\u00e7\u00e3o da liga\u00e7\u00e3o <strong>talvez<\/strong>, o servidor enviar\u00e1 ao cliente uma resposta s\u00edncrona <code>RPC<\/code> uma resposta <code>Queue.BindOk<\/code>.<\/p>\n<p><\/p>\n<h4 id=\"sozdanie-binding-cherez-graficheskiy-interfeys\"><em>Cria\u00e7\u00e3o de Binding atrav\u00e9s da interface gr\u00e1fica<\/em><\/h4>\n<p><\/p>\n<p>Acesse o painel do administrador <code>RabbitMQ<\/code> como usu\u00e1rio <code>guest<\/code> (username: <code>guest<\/code> e password: <code>guest<\/code>). Observe que o usu\u00e1rio <code>guest<\/code> pode se conectar apenas a partir do host local. Agora vamos para a aba <code>Filas<\/code> e clicamos na fila <code>my_queue<\/code>. Preenchemos os campos da se\u00e7\u00e3o <code>binds<\/code>:<\/p>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"RabbitMQ. Parte 3. Entendendo as Queues e Bindings\" src=\"\/wp-content\/uploads\/2020\/03\/7db6b42a4f29a1860aabe54ade0b6833.jpeg\" style=\"display:block;margin: 0 auto;\" \/><\/p>\n<p><\/p>\n<p>Assim que inserirmos todos os dados necess\u00e1rios e clicarmos em <code>Bind<\/code>, a liga\u00e7\u00e3o aparecer\u00e1 na lista geral:<\/p>\n<p><\/p>\n<p><img decoding=\"async\" alt=\"RabbitMQ. Parte 3. Entendendo as Queues e Bindings\" src=\"\/wp-content\/uploads\/2020\/03\/499eda8e8cb061e6feb75c471eb64b92.jpeg\" style=\"display:block;margin: 0 auto;\" \/><\/p>\n<p><\/p>\n<h3 id=\"code\">C\u00f3digo<\/h3>\n<p><\/p>\n<p>Nesta se\u00e7\u00e3o, descreveremos a fila e a liga\u00e7\u00e3o usando c\u00f3digo C#, como se precis\u00e1ssemos desenvolver uma biblioteca. Isso pode ser \u00fatil para compreens\u00e3o.<\/p>\n<p><\/p>\n<pre><code class=\"cs\">public interface IQueue\n    {        \n        string Name { get; }\n\n        \/\/ &lt;summary&gt;\n        \/\/     Se definido como true, a fila ser\u00e1 dur\u00e1vel.\n        \/\/     Ela ser\u00e1 armazenada no disco e poder\u00e1\n        \/\/     sobreviver a uma reinicializa\u00e7\u00e3o do servidor\/corretor.\n        \/\/     Se o valor for false, a fila \u00e9 tempor\u00e1ria e ser\u00e1 exclu\u00edda,\n        \/\/     quando o servidor\/corretor for reiniciado\n        \/\/ &lt;\/summary&gt;\n        bool IsDurable { get; }\n\n        \/\/ &lt;summary&gt;\n        \/\/     Se o valor for true,\n        \/\/     essa fila permitir\u00e1 conectar-se\n        \/\/     apenas a um consumidor\n        \/\/ &lt;\/summary&gt;\n        bool IsExclusive { get; }\n\n        \/\/ &lt;summary&gt;\n        \/\/     Exclus\u00e3o autom\u00e1tica.\n        \/\/     A fila ser\u00e1 exclu\u00edda quando todos os clientes se desconectarem.\n        \/\/ &lt;\/summary&gt;\n        bool IsAutoDelete { get; }\n\n        \/\/ &lt;summary&gt;\n        \/\/     Argumentos opcionais\n        \/\/ &lt;\/summary&gt;\n        IDictionary&lt;string, object&gt; Arguments { get; }\n    }<\/code><\/pre>\n<p><\/p>\n<pre><code class=\"cs\">public class Queue : IQueue\n    {\n        public Queue(\n             string name, \n             bool isDurable = true, \n             bool isExclusive = false, \n             bool isAutoDelete = false, \n             IDictionary arguments = null)\n        {\n            Name = name ??\n                throw new ArgumentNullException(name, $\"{name} n\u00e3o pode ser nulo\");\n\n            IsDurable = isDurable;\n            IsExclusive = isExclusive;\n            IsAutoDelete = isAutoDelete;\n            Arguments = arguments ?? new Dictionary();\n        }\n\n        public string Name { get; }\n        public bool IsDurable { get; }\n        public bool IsExclusive { get; }\n        public bool IsAutoDelete { get; }\n        public IDictionary Arguments { get; }\n    }<\/code><\/pre>\n<p><\/p>\n<pre><code class=\"cs\">public static class QueueMode\n    {       \n        public const string Default = \"default\";\n        \/\/ <summary>\n        \/\/     Modo pregui\u00e7oso. O modo pregui\u00e7oso far\u00e1 com que o m\u00e1ximo poss\u00edvel de mensagens seja salvo\n        \/\/     no disco, a fim de reduzir\n        \/\/     o uso de mem\u00f3ria\n        \/\/ <\/summary>\n        public const string Lazy = \"lazy\";\n    }<\/code><\/pre>\n<p><\/p>\n<pre><code class=\"cs\">interface p\u00fablica IBinding\n    {\n        \/\/ &lt;summary&gt;\n        \/\/     O interc\u00e2mbio que ser\u00e1 vinculado \u00e0 liga\u00e7\u00e3o\n        \/\/ &lt;\/summary&gt;\n        IExchange Exchange { get; }\n\n        \/\/ &lt;summary&gt;\n        \/\/     Chave de roteamento\n        \/\/ &lt;\/summary&gt;\n        string RoutingKey { get; }\n\n        \/\/ &lt;summary&gt;\n        \/\/     Argumentos opcionais\n        \/\/ &lt;\/summary&gt;\n        IDictionary Arguments { get; }\n    }<\/code><\/pre>\n<p><\/p>\n<pre><code class=\"cs\">class p\u00fablica Binding : IBinding\n    {\n        public Binding(\n             IExchange exchange, \n             string routingKey, \n             IDictionary arguments)\n        {\n            Exchange = exchange;\n            RoutingKey = routingKey;\n            Arguments = arguments;\n        }\n\n        public IExchange Exchange { get; }\n        public string RoutingKey { get; }\n        public IDictionary Arguments { get; }\n    }<\/code><\/pre>\n<p>Fonte: <a content=\"nofollow\" rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/post\/490960\/\">habr.com<\/a> <\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"<p>Queue (\u043e\u0447\u0435\u0440\u0435\u0434\u044c) \u2014 \u0441\u0442\u0440\u0443\u043a\u0442\u0443\u0440\u0430 \u0434\u0430\u043d\u043d\u044b\u0445 \u043d\u0430 \u0434\u0438\u0441\u043a\u0435 \u0438\u043b\u0438 \u0432 \u043e\u043f\u0435\u0440\u0430\u0442\u0438\u0432\u043d\u043e\u0439 \u043f\u0430\u043c\u044f\u0442\u0438, \u043a\u043e\u0442\u043e\u0440\u0430\u044f \u0445\u0440\u0430\u043d\u0438\u0442 \u0441\u0441\u044b\u043b\u043a\u0438 \u043d\u0430 \u0441\u043e\u043e\u0431\u0449\u0435\u043d\u0438\u044f \u0438 \u043e\u0442\u0434\u0430\u0435\u0442 \u0438\u0445 \u043a\u043e\u043f\u0438\u0438 consumers (\u043f\u043e\u0442\u0440\u0435\u0431\u0438\u0442\u0435\u043b\u044f\u043c). Queue \u043f\u0440\u0435\u0434\u0441\u0442\u0430\u0432\u043b\u044f\u0435\u0442 \u0441\u043e\u0431\u043e\u0439 Erlang-\u043f\u0440\u043e\u0446\u0435\u0441\u0441 \u0441 \u0441\u043e\u0441\u0442\u043e\u044f\u043d\u0438\u0435\u043c (\u0433\u0434\u0435 \u043c\u043e\u0433\u0443\u0442 \u043a\u044d\u0448\u0438\u0440\u043e\u0432\u0430\u0442\u044c\u0441\u044f \u0438 \u0441\u0430\u043c\u0438 \u0441\u043e\u043e\u0431\u0449\u0435\u043d\u0438\u044f). 1 \u0442\u044b\u0441\u044f\u0447\u0430 \u043e\u0447\u0435\u0440\u0435\u0434\u0435\u0439 \u043c\u043e\u0436\u0435\u0442 \u0437\u0430\u043d\u0438\u043c\u0430\u0442\u044c \u043f\u043e\u0440\u044f\u0434\u043a\u0430 80Mb. Binding (\u043f\u0440\u0438\u0432\u044f\u0437\u043a\u0430) \u2014 \u043f\u0440\u0430\u0432\u0438\u043b\u043e, \u043a\u043e\u0442\u043e\u0440\u043e\u0435 \u0441\u043e\u043e\u0431\u0449\u0430\u0435\u0442 \u043e\u0431\u043c\u0435\u043d\u043d\u0438\u043a\u0443 \u0432 \u043a\u0430\u043a\u0443\u044e \u0438\u0437 \u043e\u0447\u0435\u0440\u0435\u0434\u0435\u0439 \u0434\u043e\u043b\u0436\u043d\u044b \u043f\u043e\u043f\u0430\u0434\u0430\u0442\u044c \u0441\u043e\u043e\u0431\u0449\u0435\u043d\u0438\u044f. [&hellip;]<\/p>\n","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"author":1,"featured_media":73066,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[688],"tags":[],"class_list":["post-73065","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-administrirovanie"],"aioseo_notices":[],"aioseo_head":"\n\t\t<!-- All in One SEO 5.0.3 - aioseo.com -->\n\t<meta name=\"description\" content=\"Queue (\u043e\u0447\u0435\u0440\u0435\u0434\u044c) \u2014 \u0441\u0442\u0440\u0443\u043a\u0442\u0443\u0440\u0430 \u0434\u0430\u043d\u043d\u044b\u0445 \u043d\u0430 \u0434\u0438\u0441\u043a\u0435 \u0438\u043b\u0438 \u0432 \u043e\u043f\u0435\u0440\u0430\u0442\u0438\u0432\u043d\u043e\u0439 \u043f\u0430\u043c\u044f\u0442\u0438, \u043a\u043e\u0442\u043e\u0440\u0430\u044f \u0445\u0440\u0430\u043d\u0438\u0442 \u0441\u0441\u044b\u043b\u043a\u0438 \u043d\u0430 \u0441\u043e\u043e\u0431\u0449\u0435\u043d\u0438\u044f \u0438 \u043e\u0442\u0434\u0430\u0435\u0442 \u0438\u0445 \u043a\u043e\u043f\u0438\u0438 consumers (\u043f\u043e\u0442\u0440\u0435\u0431\u0438\u0442\u0435\u043b\u044f\u043c).\" \/>\n\t<meta name=\"robots\" content=\"max-image-preview:large\" \/>\n\t<meta name=\"author\" content=\"Yuri Gagarin\"\/>\n\t<link rel=\"canonical\" href=\"https:\/\/prohoster.info\/pt\/blog\/administrirovanie\/rabbitmq-chast-3-razbiraemsya-s-queues-i-bindings\" \/>\n\t\t<meta name=\"generator\" content=\"All in One SEO (AIOSEO) 5.0.3\" \/>\n\t\t<meta property=\"og:locale\" content=\"pt_PT\" \/>\n\t\t<meta property=\"og:site_name\" content=\"ProHoster | \u041a\u0443\u043f\u0438\u0442\u044c \u043d\u0430\u0434\u0435\u0436\u043d\u044b\u0439 \u0445\u043e\u0441\u0442\u0438\u043d\u0433 \u0434\u043b\u044f \u0441\u0430\u0439\u0442\u043e\u0432 \u0441 \u0437\u0430\u0449\u0438\u0442\u043e\u0439 \u043e\u0442 DDoS, VPS VDS \u0441\u0435\u0440\u0432\u0435\u0440\u044b\" \/>\n\t\t<meta property=\"og:type\" content=\"article\" \/>\n\t\t<meta property=\"og:title\" content=\"\ud83e\udd47RabbitMQ. \u0427\u0430\u0441\u0442\u044c 3. \u0420\u0430\u0437\u0431\u0438\u0440\u0430\u0435\u043c\u0441\u044f \u0441 Queues \u0438 Bindings | ProHoster\" \/>\n\t\t<meta property=\"og:description\" content=\"Queue (\u043e\u0447\u0435\u0440\u0435\u0434\u044c) \u2014 \u0441\u0442\u0440\u0443\u043a\u0442\u0443\u0440\u0430 \u0434\u0430\u043d\u043d\u044b\u0445 \u043d\u0430 \u0434\u0438\u0441\u043a\u0435 \u0438\u043b\u0438 \u0432 \u043e\u043f\u0435\u0440\u0430\u0442\u0438\u0432\u043d\u043e\u0439 \u043f\u0430\u043c\u044f\u0442\u0438, \u043a\u043e\u0442\u043e\u0440\u0430\u044f \u0445\u0440\u0430\u043d\u0438\u0442 \u0441\u0441\u044b\u043b\u043a\u0438 \u043d\u0430 \u0441\u043e\u043e\u0431\u0449\u0435\u043d\u0438\u044f \u0438 \u043e\u0442\u0434\u0430\u0435\u0442 \u0438\u0445 \u043a\u043e\u043f\u0438\u0438 consumers (\u043f\u043e\u0442\u0440\u0435\u0431\u0438\u0442\u0435\u043b\u044f\u043c).\" \/>\n\t\t<meta property=\"og:url\" content=\"https:\/\/prohoster.info\/pt\/blog\/administrirovanie\/rabbitmq-chast-3-razbiraemsya-s-queues-i-bindings\" \/>\n\t\t<meta property=\"og:image\" content=\"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg\" \/>\n\t\t<meta property=\"og:image:secure_url\" content=\"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg\" \/>\n\t\t<meta property=\"og:image:width\" content=\"350\" \/>\n\t\t<meta property=\"og:image:height\" content=\"350\" \/>\n\t\t<meta property=\"article:published_time\" content=\"2020-03-06T17:42:13+00:00\" \/>\n\t\t<meta property=\"article:modified_time\" content=\"2020-03-06T17:42:13+00:00\" \/>\n\t\t<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/prohoster\" \/>\n\t\t<meta property=\"article:author\" content=\"https:\/\/www.facebook.com\/prohoster\" \/>\n\t\t<!-- All in One SEO -->\n\n","aioseo_head_json":{"title":"\ud83e\udd47RabbitMQ. Parte 3. Explorando Queues e Bindings | ProHoster","description":"A Queue (fila) \u00e9 uma estrutura de dados em disco ou na mem\u00f3ria que armazena refer\u00eancias a mensagens e fornece c\u00f3pias para os consumers (consumidores).","canonical_url":"https:\/\/prohoster.info\/pt\/blog\/administrirovanie\/rabbitmq-chast-3-razbiraemsya-s-queues-i-bindings","robots":"max-image-preview:large","keywords":"","webmasterTools":{"miscellaneous":""},"schema":null,"og:locale":"pt_PT","og:site_name":"ProHoster | \u041a\u0443\u043f\u0438\u0442\u044c \u043d\u0430\u0434\u0435\u0436\u043d\u044b\u0439 \u0445\u043e\u0441\u0442\u0438\u043d\u0433 \u0434\u043b\u044f \u0441\u0430\u0439\u0442\u043e\u0432 \u0441 \u0437\u0430\u0449\u0438\u0442\u043e\u0439 \u043e\u0442 DDoS, VPS VDS \u0441\u0435\u0440\u0432\u0435\u0440\u044b","og:type":"article","og:title":"\ud83e\udd47RabbitMQ. \u0427\u0430\u0441\u0442\u044c 3. \u0420\u0430\u0437\u0431\u0438\u0440\u0430\u0435\u043c\u0441\u044f \u0441 Queues \u0438 Bindings | ProHoster","og:description":"Queue (\u043e\u0447\u0435\u0440\u0435\u0434\u044c) \u2014 \u0441\u0442\u0440\u0443\u043a\u0442\u0443\u0440\u0430 \u0434\u0430\u043d\u043d\u044b\u0445 \u043d\u0430 \u0434\u0438\u0441\u043a\u0435 \u0438\u043b\u0438 \u0432 \u043e\u043f\u0435\u0440\u0430\u0442\u0438\u0432\u043d\u043e\u0439 \u043f\u0430\u043c\u044f\u0442\u0438, \u043a\u043e\u0442\u043e\u0440\u0430\u044f \u0445\u0440\u0430\u043d\u0438\u0442 \u0441\u0441\u044b\u043b\u043a\u0438 \u043d\u0430 \u0441\u043e\u043e\u0431\u0449\u0435\u043d\u0438\u044f \u0438 \u043e\u0442\u0434\u0430\u0435\u0442 \u0438\u0445 \u043a\u043e\u043f\u0438\u0438 consumers (\u043f\u043e\u0442\u0440\u0435\u0431\u0438\u0442\u0435\u043b\u044f\u043c).","og:url":"https:\/\/prohoster.info\/pt\/blog\/administrirovanie\/rabbitmq-chast-3-razbiraemsya-s-queues-i-bindings","og:image":"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg","og:image:secure_url":"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg","og:image:width":350,"og:image:height":350,"article:published_time":"2020-03-06T17:42:13+00:00","article:modified_time":"2020-03-06T17:42:13+00:00","article:publisher":"https:\/\/www.facebook.com\/prohoster","article:author":"https:\/\/www.facebook.com\/prohoster"},"aioseo_meta_data":{"post_id":"73065","title":null,"description":null,"keywords":null,"keyphrases":null,"primary_term":null,"canonical_url":null,"og_title":null,"og_description":null,"og_object_type":"default","og_image_type":"default","og_image_url":null,"og_image_width":null,"og_image_height":null,"og_image_custom_url":null,"og_image_custom_fields":null,"og_video":null,"og_custom_url":null,"og_article_section":null,"og_article_tags":null,"twitter_use_og":false,"twitter_card":"default","twitter_image_type":"default","twitter_image_url":null,"twitter_image_custom_url":null,"twitter_image_custom_fields":null,"twitter_title":null,"twitter_description":null,"schema":{"blockGraphs":[],"customGraphs":[],"default":{"data":{"Article":[],"Course":[],"Dataset":[],"FAQPage":[],"Movie":[],"Person":[],"Product":[],"ProductReview":[],"Car":[],"Recipe":[],"Service":[],"SoftwareApplication":[],"WebPage":[]},"graphName":"","isEnabled":true},"graphs":[]},"schema_type":null,"schema_type_options":null,"pillar_content":false,"robots_default":true,"robots_noindex":false,"robots_noarchive":false,"robots_nosnippet":false,"robots_nofollow":false,"robots_noimageindex":false,"robots_noodp":false,"robots_notranslate":false,"robots_max_snippet":null,"robots_max_videopreview":null,"robots_max_imagepreview":"large","priority":null,"frequency":null,"local_seo":null,"seo_analyzer_scan_date":null,"breadcrumb_settings":null,"limit_modified_date":false,"reviewed_by":null,"ai":null,"created":"2021-02-28 18:41:06","updated":"2022-09-30 05:07:23","focus_keyword":null,"additional_keywords":null,"truseo_locale":null},"gt_translate_keys":[{"key":"link","format":"url"}],"_links":{"self":[{"href":"https:\/\/prohoster.info\/pt\/wp-json\/wp\/v2\/posts\/73065","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prohoster.info\/pt\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prohoster.info\/pt\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prohoster.info\/pt\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/prohoster.info\/pt\/wp-json\/wp\/v2\/comments?post=73065"}],"version-history":[{"count":0,"href":"https:\/\/prohoster.info\/pt\/wp-json\/wp\/v2\/posts\/73065\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/prohoster.info\/pt\/wp-json\/wp\/v2\/media\/73066"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/pt\/wp-json\/wp\/v2\/media?parent=73065"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/pt\/wp-json\/wp\/v2\/categories?post=73065"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/pt\/wp-json\/wp\/v2\/tags?post=73065"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}