473,803 Members | 3,899 Online
Bytes | Software Development & Data Engineering Community
+ Post

Home Posts Topics Members FAQ

Arrays of Variable Sizes

For a school assignment I need to write a class to work with the
following code. The IntArray b(-3, 6) basically means that I need to
produce an array of integer values that has an index going from -3 to
6. I'm completely lost on how I should create that array. Any shoves
in the right direction would be appreciated.

void test2()
{
system("cls");
cout << "2. Array declared with two integers: IntArray b(-3, 6);" <<
endl << endl;
csis << "2. Array declared with two integers: IntArray b(-3, 6);" <<
endl << endl;
IntArray b(-3, 6);
for(int i = b.low(); i <= b.high(); i++)
b[i] = i * 10;
b.setName('b');
cout << b << endl;
csis << b << endl;
wait();
}
Jul 19 '05 #1
11 2321
- Steve - wrote:
For a school assignment I need to write a class to work with the
following code. The IntArray b(-3, 6) basically means that I need to
produce an array of integer values that has an index going from -3 to
6. I'm completely lost on how I should create that array. Any shoves
in the right direction would be appreciated.

void test2()
{
system("cls");
cout << "2. Array declared with two integers: IntArray b(-3, 6);" <<
endl << endl;
csis << "2. Array declared with two integers: IntArray b(-3, 6);" <<
endl << endl;
IntArray b(-3, 6);
for(int i = b.low(); i <= b.high(); i++)
b[i] = i * 10;
b.setName('b');
cout << b << endl;
csis << b << endl;
wait();
}


your IntArray class needs to overload operator [] ... ?

Try creating a class and post the results ....

Jul 19 '05 #2
On 25 Jul 2003 19:56:06 -0700, se****@foundati on.sdsu.edu (- Steve -) wrote:
For a school assignment I need to write a class to work with the
following code. The IntArray b(-3, 6) basically means that I need to
produce an array of integer values that has an index going from -3 to
6. I'm completely lost on how I should create that array. Any shoves
in the right direction would be appreciated.
(0)
A std::vector be a good idea for representing the storage.
Wrap that in a class.
void test2()
{
system("cls");
(1)
Not a good idea. Only works on a system with cls command.
Cannot be redirected to a file.

cout << "2. Array declared with two integers: IntArray b(-3, 6);" <<
endl << endl;
csis << "2. Array declared with two integers: IntArray b(-3, 6);" <<
(2)
What's "csis"?
Presumably some log file.
Why not just redirect standard output?

(3)
Duplicated literal text, use a named constant.

endl << endl;
IntArray b(-3, 6);
(4)
This tells you that you need a constructor with two arguments.

for(int i = b.low(); i <= b.high(); i++)
(5)
This tells you that you need accessor methods called "low" and
"high".

b[i] = i * 10;
(6)
This tells you that you need an operator[]. See TCPPPL for an
example. For example.

b.setName('b');
(7)
This tells you that you need a modifier method called "setName".

cout << b << endl;
(8)
This tells you that you need something that makes it possible
to use an IntArray as an argument to an output stream. It
could be a custom operator<<. It could be an operator const char*.

csis << b << endl;
wait();
(9)
Assuming "wait" waits for user input that is ABSOLUTELY NOT a good
idea because it means you cannot automate the testing.
}


Jul 19 '05 #3
> A std::vector be a good idea for representing the storage.
Wrap that in a class.
Isn't that a bit of overkill? From what i understand, the arrays created
don't have to be variable themselves. Just the index which created them.

Could you just create a class, that has a int start, and and int end, an int
a[end-start] and then a function, getInt(arrayInd ex) which would presumably
be between the start and end (i'm sure you could also do checks for this).

so then you would go

MyClass m = myClass(-3, 6);
m.getInt(-1)

"Alf P. Steinbach" <al***@start.no > wrote in message
news:3f******** ********@News.C IS.DFN.DE... On 25 Jul 2003 19:56:06 -0700, se****@foundati on.sdsu.edu (- Steve -) wrote:
For a school assignment I need to write a class to work with the
following code. The IntArray b(-3, 6) basically means that I need to
produce an array of integer values that has an index going from -3 to
6. I'm completely lost on how I should create that array. Any shoves
in the right direction would be appreciated.
(0)



void test2()
{
system("cls");


(1)
Not a good idea. Only works on a system with cls command.
Cannot be redirected to a file.

cout << "2. Array declared with two integers: IntArray b(-3, 6);" <<
endl << endl;
csis << "2. Array declared with two integers: IntArray b(-3, 6);" <<


(2)
What's "csis"?
Presumably some log file.
Why not just redirect standard output?

(3)
Duplicated literal text, use a named constant.

endl << endl;
IntArray b(-3, 6);


(4)
This tells you that you need a constructor with two arguments.

for(int i = b.low(); i <= b.high(); i++)


(5)
This tells you that you need accessor methods called "low" and
"high".

b[i] = i * 10;


(6)
This tells you that you need an operator[]. See TCPPPL for an
example. For example.

b.setName('b');


(7)
This tells you that you need a modifier method called "setName".

cout << b << endl;


(8)
This tells you that you need something that makes it possible
to use an IntArray as an argument to an output stream. It
could be a custom operator<<. It could be an operator const char*.

csis << b << endl;
wait();


(9)
Assuming "wait" waits for user input that is ABSOLUTELY NOT a good
idea because it means you cannot automate the testing.
}

Jul 19 '05 #4
> > MyClass m = myClass(-3, 6);
m.getInt(-1)
That wouldn't satisfy the OP's requirements.


Yes, after reading the testing thing, i realise that this is wrong :(
The requirements would inspire me to learn how to do operator overloading.
Up until now... i just cant be bothered.
No. An array's size is a compile-time constant. A std::vector member is
just right for this; the alternative is explicitly memory-managing a
dynamic array. And vector will check your subscripts for you if you ask
it nicely.


i mean more like int* array = new int[end-start]

I got the impression that if it's a high school assignment. They wouldn't
need to jump right into vectors quite yet. Maybe i'm wrong though..

I guess i'm a fan of doing things your own way, doing as much stuff for
yourself instead of using someone elses stuff. the vector would do a fine
job of it, i just dont like thinking of all the extra resources and space
that they might use :) but on computers these days.. who cares right?
Jul 19 '05 #5

"- Steve -" <se****@foundat ion.sdsu.edu> wrote in message
news:cb******** *************** ***@posting.goo gle.com...
For a school assignment I need to write a class to work with the
following code. The IntArray b(-3, 6) basically means that I need to
produce an array of integer values that has an index going from -3 to
6. I'm completely lost on how I should create that array. Any shoves
in the right direction would be appreciated.

void test2()
{
system("cls");
cout << "2. Array declared with two integers: IntArray b(-3, 6);" <<
endl << endl;
csis << "2. Array declared with two integers: IntArray b(-3, 6);" <<
endl << endl;
IntArray b(-3, 6);
for(int i = b.low(); i <= b.high(); i++)
b[i] = i * 10;
b.setName('b');
cout << b << endl;
csis << b << endl;
wait();
}


The difficulty in answering this question is that you've given no clue as to
your level of ability. Do you know how to create a class for instance?

If yes then have a go and post the resulting code, it doesn't matter if bits
are missing, it doesn't even matter if it doesn't compile. When we see how
good (or bad!) your coding is we'll be able to give appropriate advice.

If you don't know how to write a class then you've got a lot of catching up
to do.

john
Jul 19 '05 #6
"Clive" <cl***@clive.cl ive> wrote in message
news:3f******** *************** @freenews.iinet .net.au...
MyClass m = myClass(-3, 6);
m.getInt(-1)
That wouldn't satisfy the OP's requirements.


Yes, after reading the testing thing, i realise that this is wrong :(
The requirements would inspire me to learn how to do operator overloading.
Up until now... i just cant be bothered.
No. An array's size is a compile-time constant. A std::vector member is
just right for this; the alternative is explicitly memory-managing a
dynamic array. And vector will check your subscripts for you if you ask
it nicely.


i mean more like int* array = new int[end-start]

I got the impression that if it's a high school assignment. They wouldn't
need to jump right into vectors quite yet. Maybe i'm wrong though..


If you look at it another way it might actually make sense to learn simple
things like std::vector first and learn the low level stuff (which needed to
implement a vector class) later.
I guess i'm a fan of doing things your own way, doing as much stuff for
yourself instead of using someone elses stuff.
That is a great approach if the goal is to expand your knowledge and to get
a better insight how things work. On the other hand there is much to be said
for not reinventing the wheel every time and using the tools you have
already at your disposal. Spending some time in getting familiar with the
standard library is an investment that will pay itself back in no time. For
serious projects your approach is hardly practial; writing everything from
scratch takes a lot of time and for most projects time is a rather scarce
and expensive commodity.
the vector would do a fine
job of it, i just dont like thinking of all the extra resources and space
that they might use :) but on computers these days.. who cares right?


The amount of extra space required when using std::vector compared to your
own homebuild equivalent may very well be close to zero. Optimization based
on presumptions is a bad thing and more importantly a waste of time. Get the
code right and as clear as possible first (the standard library can help a
lot here), if and only if the perfomance/memory usage is not acceptable,
find the bottleneck(s) and optimize the relevant parts of your code.
--
Peter van Merkerk
peter.van.merke rk(at)dse.nl
Jul 19 '05 #7
Okay here's my class I'm working on right now, plus all the info I
think is needed to see what I'm trying to do. Basically I need the
following three lines of code to run

IntArray a(10);
for(int i=a.low();i<=a. high();i++)
a[i]=i*10;

I'm trying to overload the [] operator. The function ARRAYSTRUCT
IntArray::opera tor[] (int forLocation) is where things are starting to
fall apart I believe.

//My Class and such

typedef struct { //Array structure
int location;
int value;
} ARRAYSTRUCT;

class IntArray
{
private:
int arrayLow, arrayHigh; //low & high index of array
char name; //name of object
ARRAYSTRUCT *array; //pointer to beggining of array

public:
IntArray(int); //Constructor for arrays starting at 0
// IntArray(int, int); //Constructor for arrays not starting at 0

ARRAYSTRUCT IntArray::opera tor[](int); //Overload [] - Pass location,
assign value

int low() {return arrayLow;} //Returns lowest index of array
int high() {return arrayHigh;} //Returns highest index of array

void setName(char myName) {name=myName;} //Sets name of object
};

IntArray::IntAr ray(int size)
{
arrayLow=0; //array starts at 0
arrayHigh=size-1; //highest index of array based on given size

array=new ARRAYSTRUCT[size]; //create array memory locations

for(int i=arrayLow;i<=a rrayHigh;i++)
{
array->location=i; //Sets index of array
array->value=NULL; //Sets value of array to NULL
}
}

ARRAYSTRUCT IntArray::opera tor[] (int forLocation)
{
ARRAYSTRUCT *myLocation=arr ay;

for(int i=0;i<(arrayLow +forLocation);i ++) //get myLocation to
correct spot
myLocation++;

return *myLocation;
}

"John Harrison" <jo************ *@hotmail.com> wrote in message news:<bf******* *****@ID-196037.news.uni-berlin.de>...
"- Steve -" <se****@foundat ion.sdsu.edu> wrote in message
news:cb******** *************** ***@posting.goo gle.com...
For a school assignment I need to write a class to work with the
following code. The IntArray b(-3, 6) basically means that I need to
produce an array of integer values that has an index going from -3 to
6. I'm completely lost on how I should create that array. Any shoves
in the right direction would be appreciated.

void test2()
{
system("cls");
cout << "2. Array declared with two integers: IntArray b(-3, 6);" <<
endl << endl;
csis << "2. Array declared with two integers: IntArray b(-3, 6);" <<
endl << endl;
IntArray b(-3, 6);
for(int i = b.low(); i <= b.high(); i++)
b[i] = i * 10;
b.setName('b');
cout << b << endl;
csis << b << endl;
wait();
}


The difficulty in answering this question is that you've given no clue as to
your level of ability. Do you know how to create a class for instance?

If yes then have a go and post the resulting code, it doesn't matter if bits
are missing, it doesn't even matter if it doesn't compile. When we see how
good (or bad!) your coding is we'll be able to give appropriate advice.

If you don't know how to write a class then you've got a lot of catching up
to do.

john

Jul 19 '05 #8
Okay Scratch all that, I've made some major progress. Take a look at this.

class IntArray
{
private:
int arrayLow, arrayHigh; //low & high index of array
char name; //name of object
int *array; //pointer to beggining of array

public:
IntArray(); //Constructor - create array index 0-9
IntArray(int); //Constructor for arrays starting at 0
IntArray(int, int); //Constructor for arrays not starting at 0
IntArray(IntArr ay*); //Constructor for making copy of another IntArray object

~IntArray(); //Default Deconstructor

int& IntArray::opera tor[](int); //Overload [] for Assigning Values

int low() {return arrayLow;} //Returns lowest index of array
int high() {return arrayHigh;} //Returns highest index of array

void setName(char myName) {name=myName;} //Sets name of object
};

#include "intarray.h "

IntArray::IntAr ray()
{
arrayLow=0;
arrayHigh=9;

array=new int[arrayHigh-arrayLow];
}

IntArray::IntAr ray(int size)
{
arrayLow=0; //array starts at 0
arrayHigh=size-1; //highest index of array based on given size

array=new int[size]; //create array memory locations
}

IntArray::IntAr ray(int low, int high)
{
arrayLow=low; //start of array index
arrayHigh=high; //end of array index

if(arrayLow==ar rayHigh)
array=new int[1]; //if high and low are equal create an array 1 unit long
else
array=new int[arrayHigh-arrayLow]; //create array memory locations
}

IntArray::IntAr ray(IntArray* copyThis)
{
arrayLow=copyTh is->low();
arrayHigh=copyT his->high();

if(arrayLow==ar rayHigh)
array=new int[1]; //if high and low are equal create an array 1 unit long
else
array=new int[arrayHigh-arrayLow]; //create array memory locations

for(int i=arrayLow;i<=a rrayHigh;i++)
array[i]=copyThis->array[i];
}

IntArray::~IntA rray()
{
//for(int i=arrayLow;i<=a rrayHigh;i++)
// delete [] array[i];
//delete [] array;
}

int& IntArray::opera tor[] (int forLocation)
{
return array[arrayLow+forLoc ation];
}

Also some quick requirments:

IntArray a(10), w(10); // Ten elements, indexed 0 to 9
IntArray b(-3, 6); // Ten elements, indexed -3 to 6
IntArray c(6, 8); // Three elements, indexed 6 to 8
IntArray d(5, 5); // Single element array, indexed at 5
IntArray z; // Ten elements, indexed 0 to 9

se****@foundati on.sdsu.edu (- Steve -) wrote in message news:<cb******* *************** ***@posting.goo gle.com>...
Okay here's my class I'm working on right now, plus all the info I
think is needed to see what I'm trying to do. Basically I need the
following three lines of code to run

IntArray a(10);
for(int i=a.low();i<=a. high();i++)
a[i]=i*10;

I'm trying to overload the [] operator. The function ARRAYSTRUCT
IntArray::opera tor[] (int forLocation) is where things are starting to
fall apart I believe.

//My Class and such

typedef struct { //Array structure
int location;
int value;
} ARRAYSTRUCT;

class IntArray
{
private:
int arrayLow, arrayHigh; //low & high index of array
char name; //name of object
ARRAYSTRUCT *array; //pointer to beggining of array

public:
IntArray(int); //Constructor for arrays starting at 0
// IntArray(int, int); //Constructor for arrays not starting at 0

ARRAYSTRUCT IntArray::opera tor[](int); //Overload [] - Pass location,
assign value

int low() {return arrayLow;} //Returns lowest index of array
int high() {return arrayHigh;} //Returns highest index of array

void setName(char myName) {name=myName;} //Sets name of object
};

IntArray::IntAr ray(int size)
{
arrayLow=0; //array starts at 0
arrayHigh=size-1; //highest index of array based on given size

array=new ARRAYSTRUCT[size]; //create array memory locations

for(int i=arrayLow;i<=a rrayHigh;i++)
{
array->location=i; //Sets index of array
array->value=NULL; //Sets value of array to NULL
}
}

ARRAYSTRUCT IntArray::opera tor[] (int forLocation)
{
ARRAYSTRUCT *myLocation=arr ay;

for(int i=0;i<(arrayLow +forLocation);i ++) //get myLocation to
correct spot
myLocation++;

return *myLocation;
}

"John Harrison" <jo************ *@hotmail.com> wrote in message news:<bf******* *****@ID-196037.news.uni-berlin.de>...
"- Steve -" <se****@foundat ion.sdsu.edu> wrote in message
news:cb******** *************** ***@posting.goo gle.com...
For a school assignment I need to write a class to work with the
following code. The IntArray b(-3, 6) basically means that I need to
produce an array of integer values that has an index going from -3 to
6. I'm completely lost on how I should create that array. Any shoves
in the right direction would be appreciated.

void test2()
{
system("cls");
cout << "2. Array declared with two integers: IntArray b(-3, 6);" <<
endl << endl;
csis << "2. Array declared with two integers: IntArray b(-3, 6);" <<
endl << endl;
IntArray b(-3, 6);
for(int i = b.low(); i <= b.high(); i++)
b[i] = i * 10;
b.setName('b');
cout << b << endl;
csis << b << endl;
wait();
}


The difficulty in answering this question is that you've given no clue as to
your level of ability. Do you know how to create a class for instance?

If yes then have a go and post the resulting code, it doesn't matter if bits
are missing, it doesn't even matter if it doesn't compile. When we see how
good (or bad!) your coding is we'll be able to give appropriate advice.

If you don't know how to write a class then you've got a lot of catching up
to do.

john

Jul 19 '05 #9
On 26 Jul 2003 18:18:12 -0700, se****@foundati on.sdsu.edu (- Steve -) wrote:
Okay Scratch all that, I've made some major progress. Take a look at this.
Progress, very good.
class IntArray
{
private:
int arrayLow, arrayHigh; //low & high index of array
char name; //name of object
int *array; //pointer to beggining of array

public:
IntArray(); //Constructor - create array index 0-9
IntArray(int); //Constructor for arrays starting at 0
IntArray(int, int); //Constructor for arrays not starting at 0
IntArray(IntArr ay*); //Constructor for making copy of another IntArray object
The copy constructor has a standard signature,
IntArray( IntArray const& another )
which allows you to write e.g.
IntArray a;
IntArray b = a; // Copy constructor invoked.
When you define a copy constructor you should -- usually -- also
define an assignment operator,
IntArray& operator=( IntArray const& rhs )
which allows you to write
b = a;
Generally when one form of copying is needed the other one is also
needed.

~IntArray(); //Default Deconstructor

int& IntArray::opera tor[](int); //Overload [] for Assigning Values

int low() {return arrayLow;} //Returns lowest index of array
int high() {return arrayHigh;} //Returns highest index of array

void setName(char myName) {name=myName;} //Sets name of object
};

#include "intarray.h "

IntArray::IntA rray()
{
arrayLow=0;
arrayHigh=9;

array=new int[arrayHigh-arrayLow];
}
Is it meaningful to have a default constructor?

If you choose to have an assignment operator (see above comments),
then a default constructor can make practical sense.

But is it then meaningful to have it create anything other than
a _zero size_ array? I see further down that you list that as
a requirement. If it is a requirement then it seems to be a
requirement (analysis/design-level) bug, to be reported.
IntArray::IntA rray(int size)
{
arrayLow=0; //array starts at 0
arrayHigh=size-1; //highest index of array based on given size

array=new int[size]; //create array memory locations
}
The 'name' member is not initialized.

Tip: look up constructor initializer lists.

IntArray::IntA rray(int low, int high)
{
arrayLow=low; //start of array index
arrayHigh=high; //end of array index

if(arrayLow==ar rayHigh)
array=new int[1]; //if high and low are equal create an array 1 unit long
else
array=new int[arrayHigh-arrayLow]; //create array memory locations
}
Here is an additional bug. When bug-free all cases except
arrayHigh<array Low-1 should be treated the same. Assuming the
requirements you list further down.


IntArray::IntA rray(IntArray* copyThis)
{
arrayLow=copyTh is->low();
arrayHigh=copyT his->high();

if(arrayLow==ar rayHigh)
array=new int[1]; //if high and low are equal create an array 1 unit long
else
array=new int[arrayHigh-arrayLow]; //create array memory locations
Now here's that bug again.
for(int i=arrayLow;i<=a rrayHigh;i++)
array[i]=copyThis->array[i];
}
Just a stylistic hint. For various reasons old-timers prefer
to write "++i" instead of "i++". One reason is that this _can_
be more efficient, another is that when you have a general
iterator instead of an integer or pointer the iterator may only
support the prefix form, so that form is more general.


IntArray::~Int Array()
{
//for(int i=arrayLow;i<=a rrayHigh;i++)
// delete [] array[i];
//delete [] array;
}
I assume this is work in progress.
int& IntArray::opera tor[] (int forLocation)
{
return array[arrayLow+forLoc ation];
}
Works, but isn't the point of having specified bounds to also
have bounds-checking?
Also some quick requirments:

IntArray a(10), w(10); // Ten elements, indexed 0 to 9
IntArray b(-3, 6); // Ten elements, indexed -3 to 6
IntArray c(6, 8); // Three elements, indexed 6 to 8
IntArray d(5, 5); // Single element array, indexed at 5
IntArray z; // Ten elements, indexed 0 to 9


Possibly the last one should be reported as impractical, and in general,
when a requirement introduces arbitrariness it's probably a screw-up.

Okay, that's my comments.

Great work, keep that up!

Jul 19 '05 #10

This thread has been closed and replies have been disabled. Please start a new discussion.

Similar topics

5
2556
by: Cant Think Today | last post by:
I have multi-dimesional arrays that can be specifed by the user, e.g 1,2,3,4,5 1,2,3,4,5,6,7,8,9,10 1,2,3,4,5,6 I think a bit of code that will iterate over these arrays to print out the element indices for each unique element in the N-dimensional array. E.g. for the above
12
1993
by: Samee Zahur | last post by:
Back in the days of old C, only numeric literals could be used as dimensions for statically allocated arrays - the size had to be resolved to a constant at/before compile time. Now I'm beginning to suspect(!) that this is no longer the case either with C or with C++ :( Can anyone upgrade me with the present state/version of rules? (for C++) Exactly, by how many years am I back-dated ???
79
3438
by: Me | last post by:
Just a question/observation out of frustration. I read in depth the book by Peter Van Der Linden entitled "Expert C Programming" (Deep C Secrets). In particular the chapters entitled: 4: The Shocking Truth: C Arrays and Pointers Are NOT the Same! 9: More about Arrays 10: More about Pointers What blows me out of the water is the fact that 'every' programmer
9
1635
by: Merrill & Michele | last post by:
What follows is an adaptation of the second program in K&R §5.10. The changes are to elucidate (validate) the difference (sameness) of char * and char**. I cannot for the life of me understand why the output looks the way it does, in particular, with all the symmetry in arguments, why one sees apple but not argv. This program was designed to run from a command line with one argument (two if you count the prog name). The .c file...
11
4475
by: truckaxle | last post by:
I am trying to pass a slice from a larger 2-dimensional array to a function that will work on a smaller region of the array space. The code below is a distillation of what I am trying to accomplish. // - - - - - - - - begin code - - - - - - - typedef int sm_t; typedef int bg_t; sm_t sm; bg_t bg;
39
19655
by: Martin Jørgensen | last post by:
Hi, I'm relatively new with C-programming and even though I've read about pointers and arrays many times, it's a topic that is a little confusing to me - at least at this moment: ---- 1) What's the difference between these 3 statements: (i) memcpy(&b, &KoefD, n); // this works somewhere in my code
11
1957
by: Sunny | last post by:
#include <iostream> int main() { int len; std::cin >len; int Arr; int *p = new int; Arr=5; std::cout << &len << " " << &Arr << " " << p << std::endl;
7
4516
by: daniel | last post by:
Hello , I always had the feeling that is better to have char arrays with the size equal to a power of two. For example: char a_str; // feels ok char b_str; //feels not ok.
4
5863
by: Edward Jensen | last post by:
Hi, I have the following static arrays of different size in a class: in header: static double w2, x2; static double w3, x3; static double w4, x4; in GaussLegendre.cpp:
0
10546
Oralloy
by: Oralloy | last post by:
Hello folks, I am unable to find appropriate documentation on the type promotion of bit-fields when using the generalised comparison operator "<=>". The problem is that using the GNU compilers, it seems that the internal comparison operator "<=>" tries to promote arguments from unsigned to signed. This is as boiled down as I can make it. Here is my compilation command: g++-12 -std=c++20 -Wnarrowing bit_field.cpp Here is the code in...
0
10068
tracyyun
by: tracyyun | last post by:
Dear forum friends, With the development of smart home technology, a variety of wireless communication protocols have appeared on the market, such as Zigbee, Z-Wave, Wi-Fi, Bluetooth, etc. Each protocol has its own unique characteristics and advantages, but as a user who is planning to build a smart home system, I am a bit confused by the choice of these technologies. I'm particularly interested in Zigbee because I've heard it does some...
0
9121
agi2029
by: agi2029 | last post by:
Let's talk about the concept of autonomous AI software engineers and no-code agents. These AIs are designed to manage the entire lifecycle of a software development project—planning, coding, testing, and deployment—without human intervention. Imagine an AI that can take a project description, break it down, write the code, debug it, and then launch it, all on its own.... Now, this would greatly impact the work of software developers. The idea...
1
7603
isladogs
by: isladogs | last post by:
The next Access Europe User Group meeting will be on Wednesday 1 May 2024 starting at 18:00 UK time (6PM UTC+1) and finishing by 19:30 (7.30PM). In this session, we are pleased to welcome a new presenter, Adolph Dupré who will be discussing some powerful techniques for using class modules. He will explain when you may want to use classes instead of User Defined Types (UDT). For example, to manage the data in unbound forms. Adolph will...
0
6841
by: conductexam | last post by:
I have .net C# application in which I am extracting data from word file and save it in database particularly. To store word all data as it is I am converting the whole word file firstly in HTML and then checking html paragraph one by one. At the time of converting from word file to html my equations which are in the word document file was convert into image. Globals.ThisAddIn.Application.ActiveDocument.Select();...
0
5627
by: adsilva | last post by:
A Windows Forms form does not have the event Unload, like VB6. What one acts like?
1
4275
by: 6302768590 | last post by:
Hai team i want code for transfer the data from one system to another through IP address by using C# our system has to for every 5mins then we have to update the data what the data is updated we have to send another system
2
3796
muto222
by: muto222 | last post by:
How can i add a mobile payment intergratation into php mysql website.
3
2970
bsmnconsultancy
by: bsmnconsultancy | last post by:
In today's digital era, a well-designed website is crucial for businesses looking to succeed. Whether you're a small business owner or a large corporation in Toronto, having a strong online presence can significantly impact your brand's success. BSMN Consultancy, a leader in Website Development in Toronto offers valuable insights into creating effective websites that not only look great but also perform exceptionally well. In this comprehensive...

By using Bytes.com and it's services, you agree to our Privacy Policy and Terms of Use.

To disable or enable advertisements and analytics tracking please visit the manage ads & tracking page.