getting error while building the same on linux "no match for operator"

This is a discussion on getting error while building the same on linux "no match for operator" within the C++ Programming forums, part of the General Programming Boards category; below is the snippet of code: same is compiling over AIX and windows, but I need to compile the same ...

  1. #1
    Registered User
    Join Date
    Mar 2009
    Posts
    40

    getting error while building the same on linux "no match for operator"

    below is the snippet of code:
    same is compiling over AIX and windows, but I need to compile the same on linux and deliver it today but getting errors.
    I highlighted the error statement

    Code:
    #ifndef _POLY_ITERATOR_
    #define _POLY_ITERATOR_
     
    #include <iterator>
    #ifndef HPUX11
    using namespace std;
    #endif //HPUX11
     
    #include <iterator>
    #ifndef LIN
    using namespace std;
    #endif //HPUX11
     
    template<class C, typename T>
    class poly_iterator 
    #if _MSC_VER>=1300 // VC7
        : public iterator_traits<typename C::iterator>
    #endif
    {
    private:
        // typedef poly_iterator<C,T> _Self;
     
    protected:
        typedef typename C::iterator I;
        //!< regular iterator of the underlying container
        I i; 
        //! mimic inheritage from the regular iterator
        //! because we cannot simply derive from it since
        // some iterators are regular pointers
    public:
        operator I&() 
        {
            return (I&)i;
        }
        //!<needed to use poly_iterator in algorithms transparently
     
    public:
        poly_iterator<C,T>() {};
        poly_iterator<C,T>(const I& p):i(p) {};
        //!< construction form const_poly_iterator
     
        T& operator*() {return (T&)*i;}
        T* operator->() {return (T*)&*i;}
     
    public: // compatibility with I iterator
        poly_iterator<C,T>& operator++() {++i; return *this;}
        poly_iterator<C,T>& operator--() {--i; return *this;}
     
        poly_iterator<C,T> operator+(const Int count)
        {
            I temp = i; 
            temp += count;
            return poly_iterator<C,T>(temp);
        }
     
        poly_iterator<C,T> operator-(const Int count)
        {
            I temp = i; 
            temp -= count;
            return poly_iterator<C,T>(temp);
        }
     
        poly_iterator<C,T>& operator++(Int) 
        {
            i++; 
            return *this;
        }
     
        poly_iterator<C,T>& operator--(Int)
        {
            i--;
            return *this;
        }
     
        bool operator<(const poly_iterator<C,T>& other) const
        {
            return i < other.i;
        }
     
        bool operator<(const I& other) const
        {
            return i < other;
        }
     
        bool operator<=(const poly_iterator<C,T>& other) const
        {
            return i <= other.i;
        }
     
        bool operator<=(const I& other) const
        {
            return i <= other;
        }
     
        bool operator>(const poly_iterator<C,T>& other) const
        {
            return i > other.i;
        }
     
        bool operator>(const I& other) const
        {
            return i > other;
        }
     
        bool operator>=(const poly_iterator<C,T>& other) const
        {
            return i >= other.i;
        }
     
        bool operator>=(const I& other) const
        {
            return i >= other;
        }
     
        bool operator==(const I& other) const 
        { 
            return i==other;
        }
     
        bool operator!=(const I& other) const 
        {
            return i!=other;
        }
     
        bool operator==(const poly_iterator<C,T>& other) const 
        {
            return i==other.i;
        }
     
        bool operator!=(const poly_iterator<C,T>& other) const 
        {
            return i!=other.i;
        }
     
    }; 
     
    #endif // _POLY_ITERATOR_
     
    #endif
    error:

    LiteRouteStop*>, _Tp = AbstractRouteStop*]‚
    /apps/lcom/Engines/2009Env/Consolidator/include/LiteRoute.hpp:688: instantiated from here
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h:204: error: no match for ‚operator-‚ in ‚__last - __first‚
    /apps/lcom/Engines/2009Env/Consolidator/include/Utility.hpp:259: note: candidates are: poly_iterator<C, T> poly_iterator<C, T>:perator-(Int) [with C = std::vector<AbstractRouteStop*, std::allocator<AbstractRouteStop*> >, T = LiteRouteStop*]

    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_bvector.h:182: note: ptrdiff_t std:perator-(const std::_Bit_iterator_base&, const std::_Bit_iterator_base&)
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h:225: error: no match for ‚operator-‚ in ‚__last - __first‚
    /apps/lcom/Engines/2009Env/Consolidator/include/Utility.hpp:259: note: candidates are: poly_iterator<C, T> poly_iterator<C, T>:perator-(Int) [with C = std::vector<AbstractRouteStop*, std::allocator<AbstractRouteStop*> >, T = LiteRouteStop*]
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_bvector.h:182: note: ptrdiff_t std:perator-(const std::_Bit_iterator_base&, const std::_Bit_iterator_base&)
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h: In function ‚_RandomAccessIterator std::__find(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, std::random_access_iterator_tag) [with _RandomAccessIterator = poly_iterator<std::vector<AbstractRouteStop*, std::allocator<AbstractRouteStop*> >, LiteRouteStop*>, _Tp = LiteRouteStop*]‚:
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h:316: instantiated from ‚_InputIterator std::find(_InputIterator, _InputIterator, const _Tp&) [with _InputIterator = poly_iterator<std::vector<AbstractRouteStop*, std::allocator<AbstractRouteStop*> >, LiteRouteStop*>, _Tp = LiteRouteStop*]‚
    /apps/lcom/Engines/2009Env/Consolidator/include/LiteRoute.hpp:692: instantiated from here
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h:204: error: no match for ‚operator-‚ in ‚__last - __first‚
    /apps/lcom/Engines/2009Env/Consolidator/include/Utility.hpp:259: note: candidates are: poly_iterator<C, T> poly_iterator<C, T>:perator-(Int) [with C = std::vector<AbstractRouteStop*, std::allocator<AbstractRouteStop*> >, T = LiteRouteStop*]
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_bvector.h:182: note: ptrdiff_t std:perator-(const std::_Bit_iterator_base&, const std::_Bit_iterator_base&)
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h:225: error: no match for ‚operator-‚ in ‚__last - __first‚
    /apps/lcom/Engines/2009Env/Consolidator/include/Utility.hpp:259: note: candidates are: poly_iterator<C, T> poly_iterator<C, T>:perator-(Int) [with C = std::vector<AbstractRouteStop*, std::allocator<AbstractRouteStop*> >, T = LiteRouteStop*]
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_bvector.h:182: note: ptrdiff_t std:perator-(const std::_Bit_iterator_base&, const std::_Bit_iterator_base&)
    /apps/lcom/Engines/2009Env/Consolidator/include/Order.hpp: At global scope:
    /apps/lcom/Engines/2009Env/Consolidator/include/Order.hpp:761: warning: inline function ‚virtual Lfloat Order::_GetSizeValueForConsCode(std::string)‚ used but never defined
    make[2]: *** [libConsCore.a(LiteEngine.o)] Error 1

    Thanks in Advance.
    Please help!!
    Vaibhav

  2. #2
    Guest Sebastiani's Avatar
    Join Date
    Aug 2001
    Location
    Waterloo, Texas
    Posts
    5,705
    Maybe because 'Int' is undefined (eg: should be 'int')?
    Code:
    #include <cmath>
    #include <complex>
    bool flip(bool value)
    {
           return std::pow
        (
            std::complex<float>(std::exp(1.0)), 
            std::complex<float>(0, 1) * std::complex<float>(std::atan(1.0)*(1 << (value + 2)))
        ).real() < 0;
    }

  3. #3
    Registered User
    Join Date
    Mar 2009
    Posts
    40
    that Int is user defined... i.e. internally defined as 'int'

    typedef int Int;

    inline LiteRouteStopListIterator LiteRoute::_PositionStop(LiteRouteStop* stop)
    {
    LiteRouteStopListIterator stopIterator =
    /*line 688*/ find(GetRouteStopListBegin(), GetRouteStopListEnd(), (AbstractRouteStop*)stop);
    while (stopIterator != GetRouteStopListEnd()
    && !stop->IsSameAsStop(*(*(stopIterator))))
    {
    stopIterator = find(++stopIterator, GetRouteStopListEnd(), stop);
    }
    return stopIterator;
    }

    typedef typename C::iterator I;
    Last edited by vaibhavs17; 03-25-2009 at 07:21 AM.

  4. #4
    The larch
    Join Date
    May 2006
    Posts
    3,573
    Your iterator supports Iterator - int, but not Iterator - Iterator (to get the distance).
    I might be wrong.

    Thank you, anon. You sure know how to recognize different types of trees from quite a long way away.
    Quoted more than 1000 times (I hope).

  5. #5
    Guest Sebastiani's Avatar
    Join Date
    Aug 2001
    Location
    Waterloo, Texas
    Posts
    5,705
    Strange - it could it be that 'find' is trying to subtract two poly_iterators (ie: to calculate the distance between them?). Stl containers do that with pointers (ie: arrays), of course, but never classes (it would internally call 'std::distance'). Try defining this just to see if it compiles:

    Code:
        Int operator-(poly_iterator<C,T> const& rhs)
        {
          /*
                 Just to see if it compiles...
          */
        }
    At any rate, that would mean you have somehow confused the STL (possibly because of the 'public iterator_traits<typename C::iterator>' derivation. Can you post a full example that we can compile?
    Code:
    #include <cmath>
    #include <complex>
    bool flip(bool value)
    {
           return std::pow
        (
            std::complex<float>(std::exp(1.0)), 
            std::complex<float>(0, 1) * std::complex<float>(std::atan(1.0)*(1 << (value + 2)))
        ).real() < 0;
    }

  6. #6
    The larch
    Join Date
    May 2006
    Posts
    3,573
    Strange - it could it be that 'find' is trying to subtract two poly_iterators (ie: to calculate the distance between them?). Stl containers do that with pointers (ie: arrays), of course, but never classes (it would internally call 'std::distance').
    And what do you think std::distance will call internally (with random access iterators)?

    No idea why find would need the distance, though...
    I might be wrong.

    Thank you, anon. You sure know how to recognize different types of trees from quite a long way away.
    Quoted more than 1000 times (I hope).

  7. #7
    Registered User
    Join Date
    Mar 2009
    Posts
    40
    Sabestini,

    Its a big source code, anyway I have tried your option also regarding change of argument data type to poly iterator kindof but still facing error but of different type..

    i tried this:
    poly_iterator<C,T> operator-(const poly_iterator<C,T>& other)
    {
    I temp =i;
    poly_iterator<C,T> temp =(temp -(other.i));
    return temp;
    }

    LiteEngine.cpp:3517: warning: converting to ‚Int‚ from ‚Lfloat‚
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h: In function ‚_RandomAccessIterator std::__find(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, std::random_access_iterator_tag) [with _RandomAccessIterator = poly_iterator<std::vector<AbstractRouteStop*, std::allocator<AbstractRouteStop*> >, LiteRouteStop*>, _Tp = AbstractRouteStop*]‚:
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h:316: instantiated from ‚_InputIterator std::find(_InputIterator, _InputIterator, const _Tp&) [with _InputIterator = poly_iterator<std::vector<AbstractRouteStop*, std::allocator<AbstractRouteStop*> >, LiteRouteStop*>, _Tp = AbstractRouteStop*]‚
    /apps/lcom/Engines/2009Env/Consolidator/include/LiteRoute.hpp:688: instantiated from here
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h:204: error: no match for ‚operator>>‚ in ‚__last.poly_iterator<C, T>:perator- [with C = std::vector<AbstractRouteStop*, std::allocator<AbstractRouteStop*> >, T = LiteRouteStop*](((const poly_iterator<std::vector<AbstractRouteStop*, std::allocator<AbstractRouteStop*> >, LiteRouteStop*>&)((const poly_iterator<std::vector<AbstractRouteStop*, std::allocator<AbstractRouteStop*> >, LiteRouteStop*>*)(& __first)))) >> 2‚
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h:225: error: switch quantity not an integer
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h: In function ‚_RandomAccessIterator std::__find(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, std::random_access_iterator_tag) [with _RandomAccessIterator = poly_iterator<std::vector<AbstractRouteStop*, std::allocator<AbstractRouteStop*> >, LiteRouteStop*>, _Tp = LiteRouteStop*]‚:
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h:316: instantiated from ‚_InputIterator std::find(_InputIterator, _InputIterator, const _Tp&) [with _InputIterator = poly_iterator<std::vector<AbstractRouteStop*, std::allocator<AbstractRouteStop*> >, LiteRouteStop*>, _Tp = LiteRouteStop*]‚
    /apps/lcom/Engines/2009Env/Consolidator/include/LiteRoute.hpp:692: instantiated from here
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h:204: error: no match for ‚operator>>‚ in ‚__last.poly_iterator<C, T>:perator- [with C = std::vector<AbstractRouteStop*, std::allocator<AbstractRouteStop*> >, T = LiteRouteStop*](((const poly_iterator<std::vector<AbstractRouteStop*, std::allocator<AbstractRouteStop*> >, LiteRouteStop*>&)((const poly_iterator<std::vector<AbstractRouteStop*, std::allocator<AbstractRouteStop*> >, LiteRouteStop*>*)(& __first)))) >> 2‚
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h:225: error: switch quantity not an integer
    /apps/lcom/Engines/2009Env/Consolidator/include/Order.hpp: At global scope:
    /apps/lcom/Engines/2009Env/Consolidator/include/Order.hpp:761: warning: inline function ‚virtual Lfloat Order::_GetSizeValueForConsCode(std::string)‚ used but never defined
    make[2]: *** [libConsCore.a(LiteEngine.o)] Error 1

  8. #8
    The larch
    Join Date
    May 2006
    Posts
    3,573
    It ain't that hard to produce a sample program that calls std::find with poly_iterators:

    Code:
    int main()
    {
        std::vector<int> v(10);
        v[4] = 42;
        poly_iterator<std::vector<int>, int> first(v.begin()), last(v.end()), it;
        it = std::find(first, last, 42);
        if (it != last) {
            std::cout << *it << '\n';
        }
    }
    There are a couple of problems:

    Code:
    class poly_iterator 
    #if _MSC_VER>=1300 // VC7
        : public iterator_traits<typename C::iterator>
    #endif
    The typedefs that you get by inheriting from iterator_traits are required from an iterator when they are to be used with STL algorithms. It's not just some VC7 thing.

    And then, operator- should return the distance of two iterators: that's an integral type:

    Code:
        typename I::difference_type operator-(const poly_iterator<C,T>& other)
        {
            //I temp =i;
            //poly_iterator<C,T> temp =(temp -(other.i));
            //return temp;
            return i - other.i;
        }
    The implementation of std::find apparently is doing some loop unrolling for random access iterators and needs the distance for that.

    And one convenience thing:

    Code:
    poly_iterator<std::vector<int>, int> first(v.begin()), last(v.end()), it;
    What is the point of repeating the int as if this argument could ever be anything but the containers value type?

    Instead you could remove the second template argument (BTW inside the templated class declaration you can refer to the class without keeping saying <C, T>), and perhaps as a quick fix throw in a typedef:

    Code:
    template<class C>
    class poly_iterator : public iterator_traits<typename C::iterator>
    {
    private:
        // typedef poly_iterator<C,T> _Self;
    
    protected:
        typedef typename C::iterator I;
        typedef typename I::value_type T;
    (Eventually, the template argument could be the Iterator type, so that this adapter would also work for plain pointers.)
    Last edited by anon; 03-26-2009 at 05:57 AM.
    I might be wrong.

    Thank you, anon. You sure know how to recognize different types of trees from quite a long way away.
    Quoted more than 1000 times (I hope).

  9. #9
    Registered User
    Join Date
    Mar 2009
    Posts
    40

    iterator find is not working on linux but same is working on windows Please help!

    I have created a sample program, I am able build on windows but linux but on linux getting below error

    TEST.HPP
    Code:
    #include<iostream>
    #include <iterator>
    #include <vector>
    typedef int Int;
    
    
    using namespace std;
    
    
    template<class C, typename T>
    
    class poly_iterator : public iterator_traits<typename C::iterator>
    {
    private:
    	// typedef poly_iterator<C,T> _Self;
    
    protected:
    	typedef typename C::iterator I;
    	//!< regular iterator of the underlying container
    	I i; 
    	//! mimic inheritage from the regular iterator
    	//! because we cannot simply derive from it since
    	//            some iterators are regular pointers
    public:
    	operator I&() 
    	{
    		return (I&)i;
    	}
    	//!<needed to use poly_iterator in algorithms transparently
    
    public:
    	poly_iterator<C,T>() {};
    	poly_iterator<C,T>(const I& p):i(p) {};
    	//!< construction form const_poly_iterator
    
    	T& operator*() {return (T&)*i;}
    	T* operator->() {return (T*)&*i;}
    
    public: // compatibility with I iterator
    	poly_iterator<C,T>& operator++() {++i; return *this;}
    	poly_iterator<C,T>& operator--() {--i; return *this;}
    
    	poly_iterator<C,T> operator+(const Int count)
    	{
    		I temp = i; 
    		temp += count;
    		return poly_iterator<C,T>(temp);
    	}
    
    	poly_iterator<C,T> operator-(const Int count)
    	{
    		I temp = i; 
    		temp -= count;
    		return poly_iterator<C,T>(temp);
    	}
    
    	poly_iterator<C,T>& operator++(Int) 
    	{
    		i++; 
    		return *this;
    	}
    
    	poly_iterator<C,T>& operator--(Int)
    	{
    		i--;
    		return *this;
    	}
    
    	bool operator<(const poly_iterator<C,T>& other) const
    	{
    		return i < other.i;
    	}
    
    	bool operator<(const I& other) const
    	{
    		return i < other;
    	}
    
    	bool operator<=(const poly_iterator<C,T>& other) const
    	{
    		return i <= other.i;
    	}
    
    	bool operator<=(const I& other) const
    	{
    		return i <= other;
    	}
    
    	bool operator>(const poly_iterator<C,T>& other) const
    	{
    		return i > other.i;
    	}
    
    	bool operator>(const I& other) const
    	{
    		return i > other;
    	}
    
    	bool operator>=(const poly_iterator<C,T>& other) const
    	{
    		return i >= other.i;
    	}
    
    	bool operator>=(const I& other) const
    	{
    		return i >= other;
    	}
    
    	bool operator==(const I& other) const 
    	{   
    		return i==other;
    	}
    
    	bool operator!=(const I& other) const 
    	{
    		return i!=other;
    	}
    
    	bool operator==(const poly_iterator<C,T>& other) const 
    	{
    		return i==other.i;
    	}
    
    	bool operator!=(const poly_iterator<C,T>& other) const 
    	{
    		return i!=other.i;
    	}
    
    }; 
    
    TEST.CPP
    
    
    //#include "stdafx.h"
    // iterator_traits.cpp
    // compile with: /EHsc
    #include <iostream>
    #include <iterator>
    #include <vector>
    #include <list>
    #include <algorithm>
    
    using namespace std;
    
    #include "test.hpp"
    
    
    int main()
    {
        vector<int> v(10);
        v[4] = 42;
        poly_iterator<vector<int>, int> it;
    	poly_iterator<vector<int>, int> first(v.begin());
    	poly_iterator<vector<int>, int> last(v.end());
    	
    	it = find(first, last, 42);
        if (it != last) {
            cout << *it << '\n';
        }
    
    	return 0;
    }
    error:

    epuser@VOPTENG01 ~/Consolidator/vaibhav $> g++ test.cpp -o test.exe
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h: In function ‚_RandomAccessIterator std::__find(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, std::random_access_iterator_tag) [with _RandomAccessIterator = poly_iterator<std::vector<int, std::allocator<int> >, int>, _Tp = int]‚:
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h:316: instantiated from ‚_InputIterator std::find(_InputIterator, _InputIterator, const _Tp&) [with _InputIterator = poly_iterator<std::vector<int, std::allocator<int> >, int>, _Tp = int]‚
    test.cpp:20: instantiated from here
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h:204: error: no match for ‚operator-‚ in ‚__last - __first‚
    test.hpp:50: note: candidates are: poly_iterator<C, T> poly_iterator<C, T>:perator-(Int) [with C = std::vector<int, std::allocator<int> >, T = int]
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_bvector.h:182: note: ptrdiff_t std:perator-(const std::_Bit_iterator_base&, const std::_Bit_iterator_base&)
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h:316: instantiated from ‚_InputIterator std::find(_InputIterator, _InputIterator, const _Tp&) [with _InputIterator = poly_iterator<std::vector<int, std::allocator<int> >, int>, _Tp = int]‚
    test.cpp:20: instantiated from here
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_algo.h:225: error: no match for ‚operator-‚ in ‚__last - __first‚
    test.hpp:50: note: candidates are: poly_iterator<C, T> poly_iterator<C, T>:perator-(Int) [with C = std::vector<int, std::allocator<int> >, T = int]
    /usr/lib/gcc/i386-redhat-linux/4.1.2/../../../../include/c++/4.1.2/bits/stl_bvector.h:182: note: ptrdiff_t std:perator-(const std::_Bit_iterator_base&, const std::_Bit_iterator_base&)

  10. #10
    Guest Sebastiani's Avatar
    Join Date
    Aug 2001
    Location
    Waterloo, Texas
    Posts
    5,705
    Your question has already been answered. Hint: reread anon's post...
    Code:
    #include <cmath>
    #include <complex>
    bool flip(bool value)
    {
           return std::pow
        (
            std::complex<float>(std::exp(1.0)), 
            std::complex<float>(0, 1) * std::complex<float>(std::atan(1.0)*(1 << (value + 2)))
        ).real() < 0;
    }

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Why Linux, for the average user?
    By Hunter2 in forum A Brief History of Cprogramming.com
    Replies: 32
    Last Post: 07-07-2006, 02:36 PM
  2. Dabbling with Linux.
    By Hunter2 in forum Tech Board
    Replies: 21
    Last Post: 04-21-2005, 04:17 PM
  3. installing linux for the first time
    By Micko in forum Tech Board
    Replies: 9
    Last Post: 12-06-2004, 04:15 AM
  4. Linux Linux why Linux??
    By afreedboy in forum Tech Board
    Replies: 146
    Last Post: 01-21-2004, 05:27 PM

Tags for this Thread


1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21