Nanomsg
Nanomsg is a modern messaging library that is the successor to ZeroMQ, written in C by Martin Sustrik and colleagues. The nanomsg library is licensed under MIT/X11 license. "nanomsg" is a trademark of 250bpm s.r.o.
Requirements
- Nanomsg 1.1.4
Installing nanomsg:
make deps
Installation
[dependencies]
nanomsg = "0.7.2"
Simply import the crate to use it:
use nanomsg;
Creating a Socket
The basis of Nanomsg is a Socket. Each socket can be of a certain type. The type of a socket defines it's behaviour and limitations (such as only being able to send and not receive).
use nanomsg::{Socket, Protocol, Error};
/// Creating a new `Pull` socket type. Pull sockets can only receive messages
/// from a `Push` socket type.
fn create_socket() -> Result<(), Error> {
let mut socket = Socket::new(Protocol::Pull)?;
Ok(())
}
Now, each socket that is created can be bound to multiple endpoints. Each binding can return an error, so we'll take advantage of the ? (try) operator.
use nanomsg::{Socket, Protocol, Error};
/// Creating a new `Pull` socket type. Pull sockets can only receive messages
/// from a `Push` socket type.
fn create_socket() -> Result<(), Error> {
let mut socket = Socket::new(Protocol::Pull)?;
// Create a new endpoint bound to the following protocol string. This returns
// a new `Endpoint` that lives at-most the lifetime of the original socket.
let mut endpoint = socket.bind("ipc:///tmp/pipeline.ipc")?;
Ok(())
}
The socket is ready to be used now!
Because this is a Pull socket, we'll implement reading any messages we receive.
// ... After the endpoint we created, we'll start reading some data.
let mut msg = String::new();
loop {
socket.read_to_string(&mut msg)?;
println!("We got a message: {}", &*msg);
msg.clear();
}
// ...
That's awesome! But... we have no packets being sent to the socket, so we'll read nothing. To fix this, let's implement the accompanying pair Push socket.
use nanomsg::{Socket, Protocol, Error};
fn pusher() -> Result<(), Error> {
let mut socket = Socket::new(Protocol::Push)?;
let mut endpoint = socket.connect("ipc:///tmp/pipeline.ipc")?;
socket.write(b"message in a bottle");
endpoint.shutdown();
Ok(())
}
Contributors
(In arbitrary order):
- Daniel Fagnan (@TheHydroImpulse)
- Jason E. Aten (@glycerine)
- David C. Bishop (@dcbishop)
- Dennis Lawler (@evenodder)
- Zachary Tong (@polyfractal)
- Dan Burkert (@danburkert)
- Benoît Labaere (@blabaere)
- Kevin Butler (@Ryman)
- Andrew (@GGist)
- Chip Collier (@photex)
- Zeke Foppa (@bfops)
- Philippe Delrieu (@musitdev)
- Daniel Kozlowski (@dkhenry)
- Vinzent Steinberg (@vks)
- Paul Woolcock (@pwoolcoc)
- Gabriel Martinez (@mystal)
- wdv4758h (@wdv4758h)
- Alexander Morozov (@alexandermorozov)
- Jan S (@jan-schreib)
- Thayne McCombs (@tmccombs)
- Anders Bennehag (@PureW)
- Peter Parkanyi (@rsdy)
- Jacek (@forgerpl)
- Gal Schlezinger (@Schniz)
- Gilad Naaman (@Gilnaa)
License
The MIT License (MIT)
- Copyright (c) 2013-2014 Jason E. Aten, Ph.D. @glycerine
- Copyright (c) 2014 Daniel Fagnan @thehydroimpulse
- Copyright (c) 2015-2018 Benoît Labaere @blabaere
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
134 Dec 11, 2022
98 Dec 12, 2022
170 Dec 19, 2022
273 Dec 28, 2022
18 Oct 31, 2022
34 Nov 10, 2022
20 Dec 8, 2022
11 Nov 8, 2022
104 Nov 28, 2022
30 Dec 29, 2022
337 Dec 14, 2022
401 Dec 28, 2022
2 Mar 28, 2022
3 Sep 25, 2022
2 Sep 14, 2022
12 Dec 4, 2022
5 Jan 8, 2023
7 Feb 20, 2023
20 Apr 3, 2023