I need to know how to get the solution mentioned below to work. The
solution is from gbayles Jan 29 2001, 12:50 pm, link is provided below: http://groups.google.com/group/comp....c43260a5310?hl
Another way is to create a one dimensional array and handle the indexing yourself (index = row * row_size + col). This is readily implemented in template classes that can create dynamically allocated multi-dimensional arrays of any element type and number of dimensions.
What would be the syntax for created a template that allowed a
one dimensional dynamic array, to be addressed using the conventional
syntax for accessing a two dimensional array? I am thinking that this
must be some sort of operator[] overloading.
Thanks,
Peter Olcott 60 10140
Peter Olcott wrote: I need to know how to get the solution mentioned below to work. The solution is from gbayles Jan 29 2001, 12:50 pm, link is provided below:
http://groups.google.com/group/comp....c43260a5310?hl
Another way is to create a one dimensional array and handle the indexing yourself (index = row * row_size + col). This is readily implemented in template classes that can create dynamically allocated multi-dimensional arrays of any element type and number of dimensions.
What would be the syntax for created a template that allowed a one dimensional dynamic array, to be addressed using the conventional syntax for accessing a two dimensional array? I am thinking that this must be some sort of operator[] overloading. http://groups.google.com/group/comp....4f1d9bd?hl=en&
I knew I answered this once before - I think there is an FAQ as well..
Here is the example code from that posting.
#include <vector>
template <typename w_elem_type>
class matrix
{
public:
typedef int t_Size;
t_Size m_columns;
t_Size m_rows;
std::vector<w_e lem_type> m_data;
matrix( t_Size i_columns = 0, t_Size i_rows = 0 )
: m_columns( i_columns ),
m_rows( i_rows ),
m_data( i_columns * i_rows )
{
}
w_elem_type * operator[]( t_Size i_index )
{
return & ( m_data[ i_index * m_rows ] );
}
template <typename w_Type, int w_columns, int w_rows>
matrix( const w_Type (&i_array)[w_columns][w_rows] )
: m_columns( w_columns ),
m_rows( w_rows ),
m_data( & (i_array[0][0]), & (i_array[w_columns-1][w_rows]) )
{
}
};
#include <iostream>
double array[3][4] = {
{ 1.0, 2.0, 3.3, 4.4 },
{ 1.0, 2.0, 3.3, 4.4 },
{ 1.0, 2.0, 3.3, 4.5 },
};
int main()
{
matrix<float> mat1( 3, 4 );
matrix<float> mat2;
matrix<float> mat3( array );
mat2 = mat3;
std::cout << mat2[2][3] << "\n";
}
That looks like an excellent solution. I need absolutely top performance.
You mentioned :
some extensive matrix libraries you could use
and ones that are very efficient if the dimensions
are known.
Could you provide me a link or other reference to these?
Thanks again for your top notch assistance.
"Gianni Mariani" <gi*******@mari ani.ws> wrote in message
news:q4******** *************** *******@speakea sy.net... Peter Olcott wrote: I need to know how to get the solution mentioned below to work. The solution is from gbayles Jan 29 2001, 12:50 pm, link is provided below:
http://groups.google.com/group/comp....c43260a5310?hl
Another way is to create a one dimensional array and handle the indexing yourself (index = row * row_size + col). This is readily implemente d in template classes that can create dynamically allocated multi-dimensional arrays of any element type and number of dimensions .
What would be the syntax for created a template that allowed a one dimensional dynamic array, to be addressed using the conventional syntax for accessing a two dimensional array? I am thinking that this must be some sort of operator[] overloading.
http://groups.google.com/group/comp....4f1d9bd?hl=en&
I knew I answered this once before - I think there is an FAQ as well..
Here is the example code from that posting.
#include <vector>
template <typename w_elem_type> class matrix { public: typedef int t_Size;
t_Size m_columns; t_Size m_rows;
std::vector<w_e lem_type> m_data;
matrix( t_Size i_columns = 0, t_Size i_rows = 0 ) : m_columns( i_columns ), m_rows( i_rows ), m_data( i_columns * i_rows ) { }
w_elem_type * operator[]( t_Size i_index ) { return & ( m_data[ i_index * m_rows ] ); }
template <typename w_Type, int w_columns, int w_rows> matrix( const w_Type (&i_array)[w_columns][w_rows] ) : m_columns( w_columns ), m_rows( w_rows ), m_data( & (i_array[0][0]), & (i_array[w_columns-1][w_rows]) ) { }
};
#include <iostream>
double array[3][4] = { { 1.0, 2.0, 3.3, 4.4 }, { 1.0, 2.0, 3.3, 4.4 }, { 1.0, 2.0, 3.3, 4.5 },
};
int main() { matrix<float> mat1( 3, 4 ); matrix<float> mat2; matrix<float> mat3( array );
mat2 = mat3;
std::cout << mat2[2][3] << "\n";
}
Oh yeah, I only need very fast addressing of the elements
of the Matrix. I will likely be moving up or down matrix rows
about five times as often as moving across matrix columns.
"Gianni Mariani" <gi*******@mari ani.ws> wrote in message
news:q4******** *************** *******@speakea sy.net... Peter Olcott wrote: I need to know how to get the solution mentioned below to work. The solution is from gbayles Jan 29 2001, 12:50 pm, link is provided below:
http://groups.google.com/group/comp....c43260a5310?hl
Another way is to create a one dimensional array and handle the indexing yourself (index = row * row_size + col). This is readily implemente d in template classes that can create dynamically allocated multi-dimensional arrays of any element type and number of dimensions .
What would be the syntax for created a template that allowed a one dimensional dynamic array, to be addressed using the conventional syntax for accessing a two dimensional array? I am thinking that this must be some sort of operator[] overloading.
http://groups.google.com/group/comp....4f1d9bd?hl=en&
I knew I answered this once before - I think there is an FAQ as well..
Here is the example code from that posting.
#include <vector>
template <typename w_elem_type> class matrix { public: typedef int t_Size;
t_Size m_columns; t_Size m_rows;
std::vector<w_e lem_type> m_data;
matrix( t_Size i_columns = 0, t_Size i_rows = 0 ) : m_columns( i_columns ), m_rows( i_rows ), m_data( i_columns * i_rows ) { }
w_elem_type * operator[]( t_Size i_index ) { return & ( m_data[ i_index * m_rows ] ); }
template <typename w_Type, int w_columns, int w_rows> matrix( const w_Type (&i_array)[w_columns][w_rows] ) : m_columns( w_columns ), m_rows( w_rows ), m_data( & (i_array[0][0]), & (i_array[w_columns-1][w_rows]) ) { }
};
#include <iostream>
double array[3][4] = { { 1.0, 2.0, 3.3, 4.4 }, { 1.0, 2.0, 3.3, 4.4 }, { 1.0, 2.0, 3.3, 4.5 },
};
int main() { matrix<float> mat1( 3, 4 ); matrix<float> mat2; matrix<float> mat3( array );
mat2 = mat3;
std::cout << mat2[2][3] << "\n";
}
Peter Olcott wrote: That looks like an excellent solution. I need absolutely top performance. You mentioned :
some extensive matrix libraries you could use and ones that are very efficient if the dimensions are known.
Could you provide me a link or other reference to these?
Google "C++ matrix" gives a plethora of answers. Quite a while ago I
looked at some of these but I didn't get involved with the project so I
can't give you any real feedback.
What I mean by "dimensions are known" is "known at compile time". If
they are known at compile time, you don't need to perform dynamic memory
allocation and you can enable some usual compiler optimizations (like
loop unrolling).
For somthing like a 3D graphics library, this would be ideal since it
predominantly uses a 4x4 matrices (Homogeneous Coordinates) and 1x4
vectors and so much of the code can be unrolled and the compiler has a
much better chance of optimizing it.
See below, the matrix example now with the row and column sizes known.
template <typename w_elem_type, unsigned w_rows, unsigned w_columns>
class matrix
{
public:
typedef w_elem_type value_type;
static const unsigned m_columns = w_columns;
static const unsigned m_rows = w_rows;
value_type m_data[ m_rows ][ m_columns ];
typedef w_elem_type row_value_type[ m_columns ];
matrix()
: m_data()
{
}
row_value_type & operator[]( unsigned i_index )
{
return m_data[ i_index ];
}
template <typename w_elem_intype>
matrix(
const w_elem_intype (&i_array)[m_rows][m_columns]
)
{
copy_matrix( i_array );
}
template <typename w_elem_intype>
matrix(
const matrix<w_elem_i ntype, m_rows, m_columns > & i_array
)
{
copy_matrix( i_array.m_data );
}
template <typename w_elem_intype>
matrix & operator=(
const w_elem_intype (&i_array)[m_rows][m_columns]
)
{
copy_matrix( i_array );
return * this;
}
template <typename w_elem_intype>
matrix & operator=(
const matrix<w_elem_i ntype, m_rows, m_columns > & i_array
)
{
copy_matrix( i_array.m_data );
return * this;
}
private:
template <typename w_elem_intype>
void copy_matrix( w_elem_intype (&i_array)[m_rows][m_columns] )
{
w_elem_type * l_elem = & m_data[ 0 ][ 0 ];
w_elem_intype * l_from = & i_array[ 0 ][ 0 ];
for ( unsigned l_i = 0; l_i < m_columns * m_rows; ++ l_i )
{
l_elem[ l_i ] = l_from[ l_i ];
}
}
};
#include <iostream>
double array[3][4] = {
{ 1.0, 2.0, 3.3, 4.4 },
{ 1.0, 2.0, 3.3, 4.4 },
{ 1.0, 2.0, 3.3, 4.5 },
};
int main()
{
matrix<float, 3, 4> mat1;
matrix<float, 3, 4> mat2;
matrix<float, 3, 4> mat3( array );
mat2 = mat3;
matrix<double, 3, 4> mat2d = mat2;
mat2d = mat3;
std::cout << mat2[2][3] << "\n";
}
I tested the performance of the code below and it took 150 ms,
as opposed to 4.5 ms for a conventional two dimensional array.
I am going to work on making a faster version tonight. I am
guessing that it might have to have a kludge interface:
void SetData(int ROW, int COL, UINT Data);
UINT GetData(int ROW, int COL);
"Gianni Mariani" <gi*******@mari ani.ws> wrote in message
news:q4******** *************** *******@speakea sy.net... Peter Olcott wrote: I need to know how to get the solution mentioned below to work. The solution is from gbayles Jan 29 2001, 12:50 pm, link is provided below:
http://groups.google.com/group/comp....c43260a5310?hl
Another way is to create a one dimensional array and handle the indexing yourself (index = row * row_size + col). This is readily implemente d in template classes that can create dynamically allocated multi-dimensional arrays of any element type and number of dimensions .
What would be the syntax for created a template that allowed a one dimensional dynamic array, to be addressed using the conventional syntax for accessing a two dimensional array? I am thinking that this must be some sort of operator[] overloading.
http://groups.google.com/group/comp....4f1d9bd?hl=en&
I knew I answered this once before - I think there is an FAQ as well..
Here is the example code from that posting.
#include <vector>
template <typename w_elem_type> class matrix { public: typedef int t_Size;
t_Size m_columns; t_Size m_rows;
std::vector<w_e lem_type> m_data;
matrix( t_Size i_columns = 0, t_Size i_rows = 0 ) : m_columns( i_columns ), m_rows( i_rows ), m_data( i_columns * i_rows ) { }
w_elem_type * operator[]( t_Size i_index ) { return & ( m_data[ i_index * m_rows ] ); }
template <typename w_Type, int w_columns, int w_rows> matrix( const w_Type (&i_array)[w_columns][w_rows] ) : m_columns( w_columns ), m_rows( w_rows ), m_data( & (i_array[0][0]), & (i_array[w_columns-1][w_rows]) ) { }
};
#include <iostream>
double array[3][4] = { { 1.0, 2.0, 3.3, 4.4 }, { 1.0, 2.0, 3.3, 4.4 }, { 1.0, 2.0, 3.3, 4.5 },
};
int main() { matrix<float> mat1( 3, 4 ); matrix<float> mat2; matrix<float> mat3( array );
mat2 = mat3;
std::cout << mat2[2][3] << "\n";
}
#define UINT unsigned int
const int Width = 3000;
const int Height = 2000;
UINT Array01[Width][Height];
ArrayType2D Array02;
UINT Array03[Width][Height];
class ArrayType2D {
private:
UINT* Array;
int last_row;
public:
ArrayType2D(){ Array = new UINT [Width * Height]; };
~ArrayType2D(){ delete [] Array; };
UINT operator[](int N){ return Array[N]; };
void SetRow(int ROW) { last_row = ROW * Width; };
UINT GetPixel(int ROW, int COL){ return Array[(ROW * Width) + COL]; }
UINT GetPixel(int COL){ return Array[last_row + COL]; }
void SetPixel(int COL, UINT DATA){ Array[last_row + COL] = DATA; }
void SetPixel(int ROW, int COL, UINT DATA){ Array[(ROW * Width) + COL] = DATA; }
};
void Test04(int HEIGHT, int WIDTH) {
for (int ROW = 0; ROW < HEIGHT; ROW++) {
Array02.SetRow( ROW);
for (int COL = 0; COL < WIDTH; COL++)
Array03[ROW][COL] = Array02.GetPixe l(COL);
}
}
The above code accesses a dynamic two-dimensional array
about fifteen percent faster than a conventional two-dimensional
array is accessed, if the data is to be accessed in the order
specified, moving through all the columns in a row, and then
moving to the next row. If the data is to accessed in a different
order such as moving through all the rows, and then moving to
the next column, the above code would need to be adapted.
Also one must make sure that the data is stored in the single
dimension array in the order corresponding to this different
access order.
Now if I could only have the following function
UINT GetPixel(int ROW, int COL){ return Array[(ROW * Width) + COL]; }
work with conventional Array02[ROW][COL] syntax, and find a way
to make it at least as fast as conventional array access (right now it is only
57% as fast), then I would be happier.
"Gianni Mariani" <gi*******@mari ani.ws> wrote in message news:q4******** *************** *******@speakea sy.net... Peter Olcott wrote: I need to know how to get the solution mentioned below to work. The solution is from gbayles Jan 29 2001, 12:50 pm, link is provided below:
http://groups.google.com/group/comp....c43260a5310?hl
Another way is to create a one dimensional array and handle the indexing yourself (index = row * row_size + col). This is readily implemente d in template classes that can create dynamically allocated multi-dimensional arrays of any element type and number of dimensions .
What would be the syntax for created a template that allowed a one dimensional dynamic array, to be addressed using the conventional syntax for accessing a two dimensional array? I am thinking that this must be some sort of operator[] overloading.
http://groups.google.com/group/comp....4f1d9bd?hl=en&
I knew I answered this once before - I think there is an FAQ as well..
Here is the example code from that posting.
#include <vector>
template <typename w_elem_type> class matrix { public: typedef int t_Size;
t_Size m_columns; t_Size m_rows;
std::vector<w_e lem_type> m_data;
matrix( t_Size i_columns = 0, t_Size i_rows = 0 ) : m_columns( i_columns ), m_rows( i_rows ), m_data( i_columns * i_rows ) { }
w_elem_type * operator[]( t_Size i_index ) { return & ( m_data[ i_index * m_rows ] ); }
template <typename w_Type, int w_columns, int w_rows> matrix( const w_Type (&i_array)[w_columns][w_rows] ) : m_columns( w_columns ), m_rows( w_rows ), m_data( & (i_array[0][0]), & (i_array[w_columns-1][w_rows]) ) { }
};
#include <iostream>
double array[3][4] = { { 1.0, 2.0, 3.3, 4.4 }, { 1.0, 2.0, 3.3, 4.4 }, { 1.0, 2.0, 3.3, 4.5 },
};
int main() { matrix<float> mat1( 3, 4 ); matrix<float> mat2; matrix<float> mat3( array );
mat2 = mat3;
std::cout << mat2[2][3] << "\n";
}
Peter Olcott wrote: #define UINT unsigned int
Use a typedef here - avoid macros where possible
typedef unsigned int UINT; const int Width = 3000; const int Height = 2000;
these could be template parameters.
UINT Array01[Width][Height]; ArrayType2D Array02; UINT Array03[Width][Height];
class ArrayType2D { private: UINT* Array; int last_row; public:
// oops - using the default copy constructor - will cause
// delete [] Array to be called multiple times (and leak)
// if the array is ever copied. (same goes for assignment
// operator.)
ArrayType2D(){ Array = new UINT [Width * Height]; }; ~ArrayType2D(){ delete [] Array; }; UINT operator[](int N){ return Array[N]; }; void SetRow(int ROW) { last_row = ROW * Width; }; UINT GetPixel(int ROW, int COL){ return Array[(ROW * Width) + COL]; } UINT GetPixel(int COL){ return Array[last_row + COL]; } void SetPixel(int COL, UINT DATA){ Array[last_row + COL] = DATA; } void SetPixel(int ROW, int COL, UINT DATA){ Array[(ROW * Width) + COL] = DATA; } };
void Test04(int HEIGHT, int WIDTH) { for (int ROW = 0; ROW < HEIGHT; ROW++) { Array02.SetRow( ROW); for (int COL = 0; COL < WIDTH; COL++) Array03[ROW][COL] = Array02.GetPixe l(COL); } }
The above code accesses a dynamic two-dimensional array about fifteen percent faster than a conventional two-dimensional array is accessed, if the data is to be accessed in the order specified, moving through all the columns in a row, and then moving to the next row. If the data is to accessed in a different order such as moving through all the rows, and then moving to the next column, the above code would need to be adapted. Also one must make sure that the data is stored in the single dimension array in the order corresponding to this different access order.
Now if I could only have the following function UINT GetPixel(int ROW, int COL){ return Array[(ROW * Width) + COL]; } work with conventional Array02[ROW][COL] syntax, and find a way to make it at least as fast as conventional array access (right now it is only 57% as fast), then I would be happier.
Did you check out the last example I posted ? Since you know the size
of your array at compile time, you can use somthing like that. On a
good optimizing compiler, this one would be just about as fast at copies
as you can get.
Is the Test04 function the only test you want ?
SetRow buys you very little in terms of performance (as implemented).
"Gianni Mariani" <gi*******@mari ani.ws> wrote in message news:Oc******** ************@sp eakeasy.net... Peter Olcott wrote: #define UINT unsigned int Use a typedef here - avoid macros where possible typedef unsigned int UINT; const int Width = 3000; const int Height = 2000; these could be template parameters.
UINT Array01[Width][Height]; ArrayType2D Array02; UINT Array03[Width][Height];
class ArrayType2D { private: UINT* Array; int last_row; public:
// oops - using the default copy constructor - will cause // delete [] Array to be called multiple times (and leak) // if the array is ever copied. (same goes for assignment // operator.)
ArrayType2D(){ Array = new UINT [Width * Height]; }; ~ArrayType2D(){ delete [] Array; }; UINT operator[](int N){ return Array[N]; }; void SetRow(int ROW) { last_row = ROW * Width; }; UINT GetPixel(int ROW, int COL){ return Array[(ROW * Width) + COL]; } UINT GetPixel(int COL){ return Array[last_row + COL]; } void SetPixel(int COL, UINT DATA){ Array[last_row + COL] = DATA; } void SetPixel(int ROW, int COL, UINT DATA){ Array[(ROW * Width) + COL] = DATA; } };
void Test04(int HEIGHT, int WIDTH) { for (int ROW = 0; ROW < HEIGHT; ROW++) { Array02.SetRow( ROW); for (int COL = 0; COL < WIDTH; COL++) Array03[ROW][COL] = Array02.GetPixe l(COL); } }
The above code accesses a dynamic two-dimensional array about fifteen percent faster than a conventional two-dimensional array is accessed, if the data is to be accessed in the order specified, moving through all the columns in a row, and then moving to the next row. If the data is to accessed in a different order such as moving through all the rows, and then moving to the next column, the above code would need to be adapted. Also one must make sure that the data is stored in the single dimension array in the order corresponding to this different access order.
Now if I could only have the following function UINT GetPixel(int ROW, int COL){ return Array[(ROW * Width) + COL]; } work with conventional Array02[ROW][COL] syntax, and find a way to make it at least as fast as conventional array access (right now it is only 57% as fast), then I would be happier.
Did you check out the last example I posted ? Since you know the size of your array at compile time, you can use somthing like that. On a
I know it at run time, not compile time. I will take your other
suggestion (above) and repost an updated copy. The current
version seems to work just as fast as the build-in matrix, and
only lacks conventional double operator[] syntax~~~~>Data[row][col]
the next poster posted material that I will study on this. Thanks for all
your help.
good optimizing compiler, this one would be just about as fast at copies as you can get.
Is the Test04 function the only test you want ?
SetRow buys you very little in terms of performance (as implemented). This thread has been closed and replies have been disabled. Please start a new discussion. Similar topics |
by: SimonC |
last post by:
I'm looking to do something similar to a feature found on
Ticketmaster.com, where you select your seats at a venue, and then you
have two minutes in which to take or leave them.
QUESTION 1a. Inside (or just after) the same query that searches for
available seats, I need to SIMULTANEOUSLY mark those seats as "on
hold".
I've only read about, but not yet used MySQL transactions, and wonder
if this simultaneous "search-and-hold"...
|
by: John Grenier |
last post by:
Hi,
I have to determine the "standing" (WIN - TIE - LOSS) from
confrontations between two teams on a contest. The table matchResults
has fields cont_id, team_id and contest_result (int).
TABLE matchResults
cont_id team_id contest_result
1 1 3
1 2 5
|
by: Willem |
last post by:
Hi,
I have a newbie question: is it possible to make a search form in asp that
searches in two different databases (access)?
Willem
|
by: Hank1234 |
last post by:
Can I use one Data Adapter and one Command Builder to update amny tables?
Currently in my data adapter I query two tables and fill them into two tables
in a data set. When I make a change to a record in the second table and call
the update method of the data adapter the command builders update command
text is for the first table. Can the command builder handle two tables?
Code example:
Dim oCOnn As New SqlConnection("Data Source=.;" &...
|
by: Matt K. |
last post by:
Hi there,
I have a form in an Access project that contains a subform which
displays the results of a query of the style "select * from
where = #a certain date#". In the main part of the form
the user can change the date, which will force a requery in the
subform to bring up records from the date selected.
My question is this... The query in the subform is a very simple one,
with only three fields being returned. In the interest of...
| |
by: Prabhudhas Peter |
last post by:
I have two object instances of a same class...
and i assigned values in both object instances (or the values can be taken
from databse and assigned to the members of the objects)...
Now i want to compare these two objects so that it will return true if both
object's members have the same value...
it is good if u can give me a single function or simple code snippet..
Thank U
--
Peter...
|
by: clintonG |
last post by:
I applied aspnet_regsql to SQL2K which was working fine throughout Beta 2
development. After installing Visual Studio and SQL Express RTM my
application has blown up. Logging in to the application became
realllllllllllly slow. Content in LoginView Role Groups was not displaying
even after a user in a role had logged in.
It was taking about 15 seconds or so for the login control to display when
the login link was selected on the homepage....
|
by: Steven |
last post by:
Hello,
I have a question about strcmp(). I have four words, who need to be
compared if it were two strings. I tried adding the comparison values
like '(strcmp(w1, w2) + strcmp(w3, w4))', where w1 and w2 make up the
first string and, w3 and w4 make up the second string. I do not want
to allocate memory, then put the words together to create a string
only to facilitate strcmp() comparison.
My question; Does anyone know how to get the...
|
by: dhable |
last post by:
I just started working with Python and ran into an annoyance. Is there
a way to avoid having to use the "from xxx import yyy" syntax from
files in the same directory? I'm sure it's been asked a million times,
but I can't seem to find the answer.
For example, I have two classes stored in separate files as such.
File: one.py
========
class One:
|
by: marktang |
last post by:
ONU (Optical Network Unit) is one of the key components for providing high-speed Internet services. Its primary function is to act as an endpoint device located at the user's premises. However, people are often confused as to whether an ONU can Work As a Router. In this blog post, we’ll explore What is ONU, What Is Router, ONU & Router’s main usage, and What is the difference between ONU and Router. Let’s take a closer look !
Part I. Meaning of...
|
by: Hystou |
last post by:
Most computers default to English, but sometimes we require a different language, especially when relocating. Forgot to request a specific language before your computer shipped? No problem! You can effortlessly switch the default language on Windows 10 without reinstalling. I'll walk you through it.
First, let's disable language synchronization. With a Microsoft account, language settings sync across devices. To prevent any complications,...
| |
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...
|
by: Hystou |
last post by:
Overview:
Windows 11 and 10 have less user interface control over operating system update behaviour than previous versions of Windows. In Windows 11 and 10, there is no way to turn off the Windows Update option using the Control Panel or Settings app; it automatically checks for updates and installs any it finds, whether you like it or not. For most users, this new feature is actually very convenient. If you want to control the update process,...
|
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...
|
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...
|
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();...
|
by: adsilva |
last post by:
A Windows Forms form does not have the event Unload, like VB6. What one acts like?
| |
by: muto222 |
last post by:
How can i add a mobile payment intergratation into php mysql website.
| |