Sponsored Content
Top Forums Programming Using boost in program created by g++ Post 302749179 by kristinu on Thursday 27th of December 2012 05:57:46 PM
Old 12-27-2012
Can you give me some examples on how to do what you are saying?

---------- Post updated at 05:34 PM ---------- Previous update was at 05:28 PM ----------

I have done like this

Code:
C++ = g++
OPT = -traditional -Wno-non-template-friend -Wno-deprecated -O3 -DNDEBUG
IDIR = -Ilibrary
dir_raytrac = ./programs/raytrac
raytrac : $(dir_raytrac)/raytrac.cc $(dir_raytrac)/raytrac_doc.hh library
    $(C++) $(OPT) $(IDIR) $(dir_raytrac)/raytrac.cc \
    -I./library/boost_1_52_0 -L./library/boost_1_52_0/libs -o raytrac
    -mv raytrac ../bin

dirlib = ./library
library : $(dirlib)/common.hh    \
        $(dirlib)/clorfncs.hh    \
        $(dirlib)/vect2.hh       \
        $(dirlib)/vector.hh      \
        $(dirlib)/matrix.hh      \
        $(dirlib)/dynbaseobj.hh  \
        $(dirlib)/list.hh        \
        $(dirlib)/stack.hh       \
        $(dirlib)/tree.hh        \
        $(dirlib)/string.hh      \
        $(dirlib)/layer.hh       \
        $(dirlib)/linlay.hh     \
        $(dirlib)/velmod.hh

---------- Post updated at 05:57 PM ---------- Previous update was at 05:34 PM ----------

Ok , I think I got you.
 

7 More Discussions You Might Find Interesting

1. Linux

How do I boost the Linux performace

Hi All, I installed Linux recently on my PC and finding it difficult to boost its performance. It takes hell lot of time to open Mozilla, text pad , & even the booting process is too slow, many a times I got to manually power off to shutdown the computer. I will be glad if you could help me... (18 Replies)
Discussion started by: jayfriend
18 Replies

2. Solaris

Sun Studio 10 + Boost 1.36

Is it possible to build Boost 1.35 using Sun Studio 10? I can build Boost 1.35 using Sun Studio 11 successful. However, i'm unable to build it using Sun Studio 10 using the exact method. I really apprecaite if any expert can help on this. Thanks, (2 Replies)
Discussion started by: shingpui
2 Replies

3. Solaris

boost thread not accessible to boost::move error

Hi All I am working unders Sun Solaris and I am not "/opt/boost/boost/thread/detail/thread.hpp", line 344: Error: boost::thread::thread(boost::thread&) is not accessible from boost::move(boost::detail::thread_move_t<boost::thread>). Do you know if there are other solutions other than... (2 Replies)
Discussion started by: manustone
2 Replies

4. Programming

Boost C++ ASIO Networking

Hi, Based on the following example in the Boost C++ website: www. boost.org/doc/libs/1_47_0/doc/html/boost_asio/example/echo/async_tcp_echo_server.cpp]doc/html/boost_asio/example/echo/async_tcp_echo_server.cpp I tried to create a similar TCP server that waits to accept a client connection... (0 Replies)
Discussion started by: tanlccc
0 Replies

5. Solaris

how to install boost 1_49_0 in solaris

hi guys, i downloaded boost1_49_0 tar.gz... then unzip and untar... how to install boost 1_49_0 in solaris plz help me (1 Reply)
Discussion started by: coolboys
1 Replies

6. UNIX for Dummies Questions & Answers

How do I declare boost?

Hello all, I am trying to "make" a database system, VDB (Veritas Data Base), and when I run "make" I receive the following error: VDBException.h:19: error: expected `)' before '*' token VDBException.h:20: error: expected `)' before '*' token VDBException.h:43: error: expected `)' before '*'... (4 Replies)
Discussion started by: Tyler_92
4 Replies

7. Programming

Boost.Test and CMake

Hi, I just started using CMake and the Boost Libraries. In this progress I encountered some problems. One of these problems is combining Boost unit tests with cmake. I don't know how to set the whole project up. I tried to set up a simple test project. This contains a main.cpp a comp.cpp and the... (0 Replies)
Discussion started by: ElCoyote
0 Replies
bup-margin(1)						      General Commands Manual						     bup-margin(1)

NAME
bup-margin - figure out your deduplication safety margin SYNOPSIS
bup margin [options...] DESCRIPTION
bup margin iterates through all objects in your bup repository, calculating the largest number of prefix bits shared between any two entries. This number, n, identifies the longest subset of SHA-1 you could use and still encounter a collision between your object ids. For example, one system that was tested had a collection of 11 million objects (70 GB), and bup margin returned 45. That means a 46-bit hash would be sufficient to avoid all collisions among that set of objects; each object in that repository could be uniquely identified by its first 46 bits. The number of bits needed seems to increase by about 1 or 2 for every doubling of the number of objects. Since SHA-1 hashes have 160 bits, that leaves 115 bits of margin. Of course, because SHA-1 hashes are essentially random, it's theoretically possible to use many more bits with far fewer objects. If you're paranoid about the possibility of SHA-1 collisions, you can monitor your repository by running bup margin occasionally to see if you're getting dangerously close to 160 bits. OPTIONS
--predict Guess the offset into each index file where a particular object will appear, and report the maximum deviation of the correct answer from the guess. This is potentially useful for tuning an interpolation search algorithm. --ignore-midx don't use .midx files, use only .idx files. This is only really useful when used with --predict. EXAMPLE
$ bup margin Reading indexes: 100.00% (1612581/1612581), done. 40 40 matching prefix bits 1.94 bits per doubling 120 bits (61.86 doublings) remaining 4.19338e+18 times larger is possible Everyone on earth could have 625878182 data sets like yours, all in one repository, and we would expect 1 object collision. $ bup margin --predict PackIdxList: using 1 index. Reading indexes: 100.00% (1612581/1612581), done. 915 of 1612581 (0.057%) SEE ALSO
bup-midx(1), bup-save(1) BUP
Part of the bup(1) suite. AUTHORS
Avery Pennarun <apenwarr@gmail.com>. Bup unknown- bup-margin(1)
All times are GMT -4. The time now is 08:30 PM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy